Journal articles: 'Maximum average degree'

1

Kopreski, Michael, and Gexin Yu. "Maximum average degree and relaxed coloring." Discrete Mathematics 340, no. 10 (October 2017): 2528–30. http://dx.doi.org/10.1016/j.disc.2017.06.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dankelmann, P., and F. J. Osaye. "Average eccentricity, minimum degree and maximum degree in graphs." Journal of Combinatorial Optimization 40, no. 3 (June 26, 2020): 697–712. http://dx.doi.org/10.1007/s10878-020-00616-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Fiedorowicz, Anna. "Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree." Discussiones Mathematicae Graph Theory 33, no. 1 (2013): 91. http://dx.doi.org/10.7151/dmgt.1665.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bonamy, Marthe, Benjamin Lévêque, and Alexandre Pinlou. "Graphs with maximum degreeΔ≥17and maximum average degree less than3are list2-distance(Δ+2)-colorable." Discrete Mathematics 317 (February 2014): 19–32. http://dx.doi.org/10.1016/j.disc.2013.10.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Miao, Lianying, Jibin Qu, and Qingbo Sun. "On the average degree of critical graphs with maximum degree six." Discrete Mathematics 311, no. 21 (November 2011): 2574–76. http://dx.doi.org/10.1016/j.disc.2011.06.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Havet, Frédéric, and Jean-Sébastien Sereni. "Improper choosability of graphs and maximum average degree." Journal of Graph Theory 52, no. 3 (2006): 181–99. http://dx.doi.org/10.1002/jgt.20155.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Feghali, Carl. "Reconfiguring colorings of graphs with bounded maximum average degree." Journal of Combinatorial Theory, Series B 147 (March 2021): 133–38. http://dx.doi.org/10.1016/j.jctb.2020.11.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bonamy, Marthe, Hervé Hocquard, Samia Kerdjoudj, and André Raspaud. "Incidence coloring of graphs with high maximum average degree." Discrete Applied Mathematics 227 (August 2017): 29–43. http://dx.doi.org/10.1016/j.dam.2017.04.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Liang, Yu-Chang, Tsai-Lien Wong, and Xuding Zhu. "Graphs with maximum average degree less than114are(1,3)-choosable." Discrete Mathematics 341, no. 10 (October 2018): 2661–71. http://dx.doi.org/10.1016/j.disc.2018.06.036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Przybyło, Jakub, André Raspaud, and Mariusz Woźniak. "On weight choosabilities of graphs with bounded maximum average degree." Discrete Applied Mathematics 217 (January 2017): 663–72. http://dx.doi.org/10.1016/j.dam.2016.09.037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Tang, Yunfang, and Xuding Zhu. "Total weight choosability of graphs with bounded maximum average degree." Discrete Mathematics 340, no. 8 (August 2017): 2033–42. http://dx.doi.org/10.1016/j.disc.2016.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Liang, Yu-Chang, Yunfang Tang, Tsai-Lien Wong, and Xuding Zhu. "Total list weighting of graphs with bounded maximum average degree." Discrete Mathematics 341, no. 10 (October 2018): 2672–75. http://dx.doi.org/10.1016/j.disc.2018.06.039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Puleo, Gregory J. "Tuza’s Conjecture for graphs with maximum average degree less than 7." European Journal of Combinatorics 49 (October 2015): 134–52. http://dx.doi.org/10.1016/j.ejc.2015.03.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Zhu, Junlei, and Yuehua Bu. "List r-dynamic coloring of graphs with small maximum average degree." Discrete Applied Mathematics 258 (April 2019): 254–63. http://dx.doi.org/10.1016/j.dam.2018.11.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Kim, Seog-Jin, and Boram Park. "List 3-dynamic coloring of graphs with small maximum average degree." Discrete Mathematics 341, no. 5 (May 2018): 1406–18. http://dx.doi.org/10.1016/j.disc.2017.09.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Dong, Aijun, and Xin Zhang. "Equitable coloring and equitable choosability of graphs with small maximum average degree." Discussiones Mathematicae Graph Theory 38, no. 3 (2018): 829. http://dx.doi.org/10.7151/dmgt.2049.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Montassier, Mickaël, and André Raspaud. "(d,1)-total labeling of graphs with a given maximum average degree." Journal of Graph Theory 51, no. 2 (2005): 93–109. http://dx.doi.org/10.1002/jgt.20124.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Dong, Ai Jun, and Guang Hui Wang. "Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree." Acta Mathematica Sinica, English Series 30, no. 4 (March 15, 2014): 703–9. http://dx.doi.org/10.1007/s10114-014-2454-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Dong, Aijun, Guanghui Wang, and Jianghua Zhang. "Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree." Discrete Applied Mathematics 166 (March 2014): 84–90. http://dx.doi.org/10.1016/j.dam.2013.10.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Cohen, Nathann, and Frédéric Havet. "Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree." Graphs and Combinatorics 27, no. 6 (January 5, 2011): 831–49. http://dx.doi.org/10.1007/s00373-010-1009-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Wang, Weifan, and Yiqiao Wang. "Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree." Journal of Combinatorial Optimization 19, no. 4 (July 31, 2008): 471–85. http://dx.doi.org/10.1007/s10878-008-9178-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Gao, Yuping, Guanghui Wang, and Jianliang Wu. "Neighbor Sum Distinguishing Edge Colorings of Graphs with Small Maximum Average Degree." Bulletin of the Malaysian Mathematical Sciences Society 39, S1 (August 6, 2015): 247–56. http://dx.doi.org/10.1007/s40840-015-0207-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Borodin, O. V., A. V. Kostochka, J. Nešetřil, A. Raspaud, and E. Sopena. "On the maximum average degree and the oriented chromatic number of a graph." Discrete Mathematics 206, no. 1-3 (August 1999): 77–89. http://dx.doi.org/10.1016/s0012-365x(98)00393-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Hocquard, H., and J. Przybyło. "On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree." Graphs and Combinatorics 33, no. 6 (June 13, 2017): 1459–71. http://dx.doi.org/10.1007/s00373-017-1822-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Kim, Seog-Jin, and Boram Park. "Coloring the square of graphs whose maximum average degree is less than 4." Discrete Mathematics 339, no. 4 (April 2016): 1251–60. http://dx.doi.org/10.1016/j.disc.2015.11.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

HUANG, YU-PEI, and CHIH-WEN WENG. "SPECTRAL RADIUS AND AVERAGE 2-DEGREE SEQUENCE OF A GRAPH." Discrete Mathematics, Algorithms and Applications 06, no. 02 (March 19, 2014): 1450029. http://dx.doi.org/10.1142/s1793830914500293.

Full text

Abstract:

In a simple connected graph, the average 2-degree of a vertex is the average degree of its neighbors. With the average 2-degree sequence and the maximum degree ratio of adjacent vertices, we present a sharp upper bound of the spectral radius of the adjacency matrix of a graph, which improves a result in [Y. H. Chen, R. Y. Pan and X. D. Zhang, Two sharp upper bounds for the signless Laplacian spectral radius of graphs, Discrete Math. Algorithms Appl.3(2) (2011) 185–191].

APA, Harvard, Vancouver, ISO, and other styles

27

Raspaud, André, and Nicolas Roussel. "Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract." Electronic Notes in Discrete Mathematics 28 (March 2007): 507–14. http://dx.doi.org/10.1016/j.endm.2007.01.078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Jumnongnit, Patcharapan, and Kittikorn Nakprasit. "Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers." International Journal of Mathematics and Mathematical Sciences 2017 (2017): 1–4. http://dx.doi.org/10.1155/2017/5897049.

Full text

Abstract:

Let G be a graph and ϕ:V(G)∪E(G)→{1,2,3,…,k} be a k-total coloring. Let w(v) denote the sum of color on a vertex v and colors assigned to edges incident to v. If w(u)≠w(v) whenever uv∈E(G), then ϕ is called a neighbor sum distinguishing total coloring. The smallest integer k such that G has a neighbor sum distinguishing k-total coloring is denoted by tndi∑ (G). In 2014, Dong and Wang obtained the results about tndi∑ (G) depending on the value of maximum average degree. A k-assignment L of G is a list assignment L of integers to vertices and edges with L(v)=k for each vertex v and L(e)=k for each edge e. A total-L-coloring is a total coloring ϕ of G such that ϕ(v)∈L(v) whenever v∈V(G) and ϕ(e)∈L(e) whenever e∈E(G). We state that G has a neighbor sum distinguishing total-L-coloring if G has a total-L-coloring such that w(u)≠w(v) for all uv∈E(G). The smallest integer k such that G has a neighbor sum distinguishing total-L-coloring for every k-assignment L is denoted by Ch∑ ′′(G). In this paper, we strengthen results by Dong and Wang by giving analogous results for Ch∑ ′′(G).

APA, Harvard, Vancouver, ISO, and other styles

29

Onus, Melih, and Andréa W. Richa. "Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design." Computer Networks 94 (January 2016): 307–17. http://dx.doi.org/10.1016/j.comnet.2015.10.023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Hocquard, H., and J. Przybyło. "On the total neighbour sum distinguishing index of graphs with bounded maximum average degree." Journal of Combinatorial Optimization 39, no. 2 (November 20, 2019): 412–24. http://dx.doi.org/10.1007/s10878-019-00480-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Hendrey, Kevin, and David R. Wood. "Defective and clustered choosability of sparse graphs." Combinatorics, Probability and Computing 28, no. 5 (April 12, 2019): 791–810. http://dx.doi.org/10.1017/s0963548319000063.

Full text

Abstract:

AbstractAn (improper) graph colouring hasdefect dif each monochromatic subgraph has maximum degree at mostd, and hasclustering cif each monochromatic component has at mostcvertices. This paper studies defective and clustered list-colourings for graphs with given maximum average degree. We prove that every graph with maximum average degree less than (2d+2)/(d+2)kisk-choosable with defectd. This improves upon a similar result by Havet and Sereni (J. Graph Theory, 2006). For clustered choosability of graphs with maximum average degreem, no (1-ɛ)mbound on the number of colours was previously known. The above result withd=1 solves this problem. It implies that every graph with maximum average degreemis$\lfloor{\frac{3}{4}m+1}\rfloor$-choosable with clustering 2. This extends a result of Kopreski and Yu (Discrete Math., 2017) to the setting of choosability. We then prove two results about clustered choosability that explore the trade-off between the number of colours and the clustering. In particular, we prove that every graph with maximum average degreemis$\lfloor{\frac{7}{10}m+1}\rfloor$-choosable with clustering 9, and is$\lfloor{\frac{2}{3}m+1}\rfloor$-choosable with clusteringO(m). As an example, the later result implies that every biplanar graph is 8-choosable with bounded clustering. This is the best known result for the clustered version of the earth–moon problem. The results extend to the setting where we only consider the maximum average degree of subgraphs with at least some number of vertices. Several applications are presented.

APA, Harvard, Vancouver, ISO, and other styles

32

Alibekov, A. K., and G. A. Аlibekov. "MODELS FOR DETERMINING MAXIMUM DEGREE FILLING CHANNELS OF CIRCULAR SECTION SHAPE." Herald of Dagestan State Technical University. Technical Sciences 46, no. 2 (August 28, 2019): 28–36. http://dx.doi.org/10.21822/2073-6185-2019-46-2-28-36.

Full text

Abstract:

Objectives The task was to obtain a model for determining the maximum possible degree of filling the circular section channels in the earthen channel based on the condition of ensuring the stability of slopes and the minimum volume of excavation during their construction, as well as finding the optimum degree of filling fortified channels of a closed profile corresponding to maximum throughput.Method In work analytical methods of differential calculus and the solution of implicit equations are used.Result The experience of domestic and foreign researchers was taken into account to solve the set tasks, select research methods and criteria for optimizing channel parameters. Two cases of circular-shaped channels are considered: 1) in the earth channel, 2) reinforced with a closed transverse profile. For the case of a hydraulically most advantageous circular channel in the earthchannel channel, equating the first derivative of the equation of a circle with the reciprocal of the allowable embedding coefficient of the slopes obtained an analytical solution for determining the maximum degree of filling from the slope stability condition, which was not dependent on hydraulic flow elements. In the case of non-cohesive soils that form the channel, the circular channel can be filled to a depth not exceeding 20 percent of the channel radius. At the same time, the average flow rate should remain in the range from non-venting to non-blurring. In order to be able to determine the flow rate, analytical expressions are given for finding hydraulic flow elements in a circular channel. When determining the volume of excavation for the construction of the channel, the excess of the channel edge above the maximum water level in the channel was taken into account. For the case of a fortified channel of a closed transverse profile, by taking the derivatives from the Chezy formula, we obtained the optimal values of flow rate and average velocity.Conclusion A fortified closed circular profile channel has a maximum capacity with a relative degree of filling of 0.938, and the maximum average velocity of a fluid in a pressureless channel is achieved with a degree of filling of 0.815. To determine the maximum permissible relative degree of filling in the case of a circular section channel in the earthen channel, analytical dependences were obtained, before using which, according to the reference literature, it is necessary to take the value of the slope coefficient for this type of channel bed soil.

APA, Harvard, Vancouver, ISO, and other styles

33

Qiu, Bao Jian, Ji Hui Wang, and Yan Liu. "Neighbor sum distinguishing colorings of graphs with maximum average degree less than $$\tfrac{{37}} {{12}}$$3712." Acta Mathematica Sinica, English Series 34, no. 2 (June 25, 2017): 265–74. http://dx.doi.org/10.1007/s10114-017-6491-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Chashkin, Aleksandr V. "On the average-case complexity of underdetermined functions." Discrete Mathematics and Applications 28, no. 4 (August 28, 2018): 201–21. http://dx.doi.org/10.1515/dma-2018-0019.

Full text

Abstract:

Abstract The average-case complexity of computation of underdetermined functions by straight-line programs with conditional stop over the basis of all at most two-place Boolean functions is considered. Correct order estimates of the average-case complexity of functions with maximum average-case complexity among all underdetermined functions are derived depending on the degree of their determinacy, the size of their domain, and the size of their support.

APA, Harvard, Vancouver, ISO, and other styles

35

Mihalcea, Andreea. "Preliminary analysis of the afforestation role in the maximum runoff in Valea Rece Catchment." Present Environment and Sustainable Development 11, no. 1 (June 1, 2017): 173–82. http://dx.doi.org/10.1515/pesd-2017-0016.

Full text

Abstract:

Abstract The aim of this article is to demonstrate the afforestation role in maximum surface runoff. In this way, it was made a comparison of simulated flows in the current conditions of afforestation and the simulated flows in conditions of applying both afforestation and deforestation scenarios in Valea Rece catchment. Through HEC-HMS 4.1 hydrologic modeling software, using the method of unit hydrograph SCS Curve Number, were simulated flow of the river Valea Rece closing section of the basin, where precipitation amounts of 30,50,80,120 mm fallen in intervals of 1.3 to 6 hours on a soil with varying degrees of moisture: dry soil, average soil moisture and high humidity. This was done for the current degree of afforestation basin, for the results from a possible afforestation that would increase the afforestation degree to 80%, and for a possible deforestation that would lead to a degree of afforestation 15 %.

APA, Harvard, Vancouver, ISO, and other styles

36

Yang, Yujun, and Douglas J. Klein. "A Note on the Kirchhoff and Additive Degree-Kirchhoff Indices of Graphs." Zeitschrift für Naturforschung A 70, no. 6 (June 1, 2015): 459–63. http://dx.doi.org/10.1515/zna-2014-0274.

Full text

Abstract:

AbstractTwo resistance-distance-based graph invariants, namely, the Kirchhoff index and the additive degree-Kirchhoff index, are studied. A relation between them is established, with inequalities for the additive degree-Kirchhoff index arising via the Kirchhoff index along with minimum, maximum, and average degrees. Bounds for the Kirchhoff and additive degree-Kirchhoff indices are also determined, and extremal graphs are characterised. In addition, an upper bound for the additive degree-Kirchhoff index is established to improve a previously known result.

APA, Harvard, Vancouver, ISO, and other styles

37

Marley, Robert J., and Rob R. Wehrman. "Grip Strength as a Function of Forearm Rotation and Elbow Posture." Proceedings of the Human Factors Society Annual Meeting 36, no. 10 (October 1992): 791–95. http://dx.doi.org/10.1177/154193129203601033.

Full text

Abstract:

An investigation was performed to assess the effect of forearm rotation (pronation and supination) and elbow orientation upon maximum grip strength of 10 male and 10 female subjects. Seven positions of forearm rotation which ranged from 90 degrees pronation to 90 degrees supination in both the 90 degree elbow flexion (arm adducted, forearm horizontal) and 0 degree flexion (shoulder flexed, whole-arm extended forward and horizontal) postures were examined. Thus a total combination of 14 postures were documented. Results indicate that maximum grip strength decreased significantly with forearm pronation, relative to the “neutral” forearm posture (p = 0.086). Other rotation postures did not yield significantly different grip strength from the neutral, but there was a clear decreasing trend in grip strength with forearm rotation away from neutral, particularly in pronation. The 0 degree elbow flexion showed the highest average grip strength values compared to 90 degree elbow flexion postures. Also, in the 90 degree elbow flexion posture, grip strength tended to increase with some supination from neutral rotation. It is recommended that for repetitive grasping activities, the arm and forearm postures should be considered in evaluating maximum grip strength. A regression model is presented to estimate maximum grip strength as a function of forearm rotation and elbow posture.

APA, Harvard, Vancouver, ISO, and other styles

38

HARWOOD, AARON, and HONG SHEN. "A NEW FAMILY OF EXTREMAL INTERCONNECTION NETWORKS." Journal of Interconnection Networks 02, no. 04 (December 2001): 421–44. http://dx.doi.org/10.1142/s0219265901000476.

Full text

Abstract:

We extensively discuss a new interconnection network topology, denoted by ϒ(n,r). Firstly, the ϒ(n,2) network is shown to provide average cost 3 log 2 n while providing superior fault tolerance characteristics. It is defined over any natural number of nodes n using 2n-3 edges for an average degree of 4 and has diameter no greater than k=⌈ log 2n⌉ with average diameter as small as [Formula: see text]. The network is planar and has cyclomatic number n-2. For n=2t the unbounded maximum degree is 2 log 2 n-1 believed indicative of generally a maximum unbounded degree O( log 2n). The bisection width ranges from 3 when n=2t to t+1 when n=2t+1. Secondly, we provide the ϒ*(n,r) network of bounded degree 2r. For n=rt the ϒ*(n,r) network has asymptotically better average cost than the general deBruijn(r,t) network while also maintaining planarity and cyclomatic property of ϒ(n,2). The ϒ family exhibits unique extremal properties of both theoretical interest and practical importance.

APA, Harvard, Vancouver, ISO, and other styles

39

Saif, Khaled, Chin Long Lee, Trevor Yeow, and Gregory A. MacRae. "Seismic Ratchetting of Single-Degree-of-Freedom Steel Bridge Columns." Key Engineering Materials 763 (February 2018): 295–300. http://dx.doi.org/10.4028/www.scientific.net/kem.763.295.

Full text

Abstract:

Nonlinear time history analyses of SDOF bridge columns with elasto-plastic flexural behaviour which are subject to eccentric gravity loading are conducted to quantify the effect of ratchetting. Peak and residual displacements were used as indicators of the degree of ratchetting. The effects of member axial loads and design force reduction factors were also investigated. It was shown that displacement demands increased with increasing eccentric moment. For eccentric moment of 30% of the yield moment, the average maximum and residual displacements increase by 4.2 and 3.8 times the maximum displacement, respectively, which the engineers calculate using static methods without considering ratchetting effect. Design curves for estimating the displacement demands for different eccentric moments are also developed. The current NZ1170.5 (2016) provisions were found to be inadequate in estimating the maximum displacement for steel structures, and hence, new provisions for steel structures should be presented.

APA, Harvard, Vancouver, ISO, and other styles

40

De Santis, Emilio, Fabrizio Grandoni, and Alessandro Panconesi. "Low degree connectivity of ad-hoc networks via percolation." Advances in Applied Probability 42, no. 02 (June 2010): 559–76. http://dx.doi.org/10.1017/s0001867800004195.

Full text

Abstract:

Consider the following classical problem in ad-hoc networks. Suppose that n devices are distributed uniformly at random in a given region. Each device is allowed to choose its own transmission radius, and two devices can communicate if and only if they are within the transmission radius of each other. The aim is to (quickly) establish a connected network of low average and maximum degree. In this paper we present the first efficient distributed protocols that, in poly-logarithmically many rounds and with high probability, set up a connected network with O(1) average degree and O(log n) maximum degree. Our algorithms are based on the following result, which is a nontrivial consequence of classical percolation theory. Suppose that each device sets up its transmission radius in order to reach the K closest devices. There exists a universal constant K (independent of n) such that, with high probability, there will be a unique giant component (i.e. a connected component of size Θ(n)). Furthermore, all remaining components will be of size O(log2 n). This leads to an efficient distributed probabilistic test for membership in the giant component, which can be used in a second phase to achieve full connectivity.

APA, Harvard, Vancouver, ISO, and other styles

41

De Santis, Emilio, Fabrizio Grandoni, and Alessandro Panconesi. "Low degree connectivity of ad-hoc networks via percolation." Advances in Applied Probability 42, no. 2 (June 2010): 559–76. http://dx.doi.org/10.1239/aap/1275055242.

Full text

Abstract:

Consider the following classical problem in ad-hoc networks. Suppose that n devices are distributed uniformly at random in a given region. Each device is allowed to choose its own transmission radius, and two devices can communicate if and only if they are within the transmission radius of each other. The aim is to (quickly) establish a connected network of low average and maximum degree. In this paper we present the first efficient distributed protocols that, in poly-logarithmically many rounds and with high probability, set up a connected network with O(1) average degree and O(log n) maximum degree. Our algorithms are based on the following result, which is a nontrivial consequence of classical percolation theory. Suppose that each device sets up its transmission radius in order to reach the K closest devices. There exists a universal constant K (independent of n) such that, with high probability, there will be a unique giant component (i.e. a connected component of size Θ(n)). Furthermore, all remaining components will be of size O(log2n). This leads to an efficient distributed probabilistic test for membership in the giant component, which can be used in a second phase to achieve full connectivity.

APA, Harvard, Vancouver, ISO, and other styles

42

Baikov, Konstantin, and Vladimir Doronkin. "Towards on the conservation of rare species Iris glaucescens (Iridaceae) in Novosibirsk oblast: ecoinformative multimodal analysis of the area." BIO Web of Conferences 24 (2020): 00007. http://dx.doi.org/10.1051/bioconf/20202400007.

Full text

Abstract:

Multimodal ecoinformation analysis as an modern computative approach to geospatial investigation of biodiversity structure is performed on maximum entropy method for local populations of Iris glaucescens -rare species of vascular plants that is included in Red Book of Novosibirsk Oblast. The most informative environmental variables were ranged and examined in detail. According to obtained results, trio of the most important variables in the scale of 1/12 arc-degree (5.0 arc-minutes) global model, includes: 1) maximum average diurnal tempreature of surface air in the warmest period of an year (bio5) – 32.7%, annual mean temperature of surface air (bio1) – 11.2%, and maximum average diurnal tempreature of surface air in July (tmax7) – 9.0%. Three of the most important variables in the scale of 1/60 arc-degree (1.0 arc-minutes) regional model (Zone_18) are: maximum average diurnal tempreature of surface air in the warmest period of a year (bio5) -35.7%, maximum average diurnal tempreature of surface air in Juny (tmax6) – 23.1%, minimum average diurnal tempreature of surface air in October (tmin10) – 7,7%. Therefore, climatic variables that influense on the amount of heat in the warmest period of a year, may be taken into account as factors, limiting population size of I. glaucescens.

APA, Harvard, Vancouver, ISO, and other styles

43

Shelton, Trevor J., Stephen M. Howell, and Maury L. Hull. "A Total Knee Arthroplasty Is Stiffer When the Intraoperative Tibial Force Is Greater than the Native Knee." Journal of Knee Surgery 32, no. 10 (November 9, 2018): 1008–14. http://dx.doi.org/10.1055/s-0038-1675421.

Full text

Abstract:

AbstractWe hypothesized that a total knee arthroplasty (TKA) with an intraoperative tibial force greater than the tibial force of the native knee has signs of stiffness as measured by loss of extension and flexion, and anterior translation of the tibia. Intraoperative forces in the medial and lateral tibial compartments were measured during passive motion in 71 patients treated with calipered kinematically aligned TKA. Maximum extension, flexion, and the anterior–posterior position of the tibia with respect to the distal femur at 90 degrees of flexion were measured. Measurements were repeated after exchanging to a 2 mm thicker insert. The sum of the average of the medial and lateral compartment forces at 0, 45, and 90 degrees of flexion represented the tibial force through a 90-degree motion arc. For the implanted insert, the tibial force averaged 28 ± 17 lb, which is comparable to the 20 ± 7 lb reported for the native knee. At 6 months, patients reported an average 40 point Oxford Knee and 15 point Western Ontario and McMaster Universities Osteoarthritis (WOMAC) score. For the 2 mm thicker insert, the tibial force averaged 50 ± 28 lb. A 30 lb tibial force greater than native generated a 3-degree loss of extension, a 3-degree loss of flexion, and 3-mm anterior translation of the tibia. Because a TKA with a tibial force greater than native has signs of stiffness, a strategy for lowering this risk is to match the tibial force of the native knee when balancing a TKA as this restored high function.

APA, Harvard, Vancouver, ISO, and other styles

44

Caswell, Edward P., and Ivan J. Thomason. "A model of egg production by Heterodera schachtii (Nematoda: Heteroderidae)." Canadian Journal of Zoology 69, no. 8 (August 1, 1991): 2085–88. http://dx.doi.org/10.1139/z91-290.

Full text

Abstract:

Egg production by the sugarbeet cyst nematode, Heterodera schachtii, infecting sugarbeet, Beta vulgaris, was assessed at temperatures of 13, 18, 24, and 30 °C in constant-temperature tanks. The minimum-threshold temperature for degree-day accumulation relative to egg production was identified as 8 °C. The relationship between cumulative degree-days (DD) (base 8 °C) and egg production was examined. Egg production began between 160 and 270 DD after hatch and reached a maximum between 390 and 480 DD. Observed egg production (Y) across all temperatures was described as a logistic function of degree-days: Y = 202/(1 + 23726 e−0.034 DD) (r2 = 0.84; P < 0.05). The model depicts initiation of egg production at 140 DD, a maximum average egg production of 202 eggs per female reached at approximately 410 DD, and a maximum rate of egg production of 1.7 eggs/DD reached at approximately 290 DD. The accuracy of the model was limited because observed cumulative egg production was confounded by egg hatch. Accordingly, the cumulative egg production data were adjusted for egg hatch. The adjusted cumulative egg production (Y) was described as a logistic function of cumulative degree-days: Y = 420/(1 + 3319 e−0.023 DD) (r2 = 0.98; P < 0.05). The function depicts egg production initiated at approximately 120 DD. Average maximum egg production is 420 eggs per female occurring at approximately 680 DD, with a maximum egg-production rate of 2.4 eggs/DD occurring at approximately 350 DD.

APA, Harvard, Vancouver, ISO, and other styles

45

Lee, Seung Kyu, Truong An Dang, and Van Tuan Le. "Investigation of Shear Stress Distribution in a 90 Degree Channel Bend." International Journal of Applied Mechanics and Engineering 24, no. 1 (February 1, 2019): 213–20. http://dx.doi.org/10.2478/ijame-2019-0014.

Full text

Abstract:

Abstract Shear stress is a key parameter that plays an important role in sediment transport mechanisms; therefore, understanding shear stress distribution in rivers, and especially in river bends, is necessary to predict erosion, deposition mechanisms and lateral channel migration. The aim of this study is to analyze the shear stress distribution near a river bed at 90-degree channel bend using a depth-average method based on experimental measurement data. Bed shear stress distribution is calculated using the depth-averaged method based on velocity components data has been collected from a 3D-ADV device (three-dimensional acoustic doppler velocity) at different locations of a meandering channel. Laboratory experiments have been made at the hydraulic laboratory of the RCRFIDF (Research Center for River Flow Impingement and Debris Flow), Gangneung-Wonju National University, South Korea to provide data for simulating the incipient motion of the riverbed materials and then predicting the river morphological changes in the curved rivers. The calculated results show that the maximum value of shear stress distribution near the riverbed in the different cross sections of the surveyed channel occurs in a 70-degree cross section and occurs near the outer bank. From the beginning of a 40-degree curved channel section, the maximum value of the shear stress occurs near the outer bank at the end of the channel.

APA, Harvard, Vancouver, ISO, and other styles

46

Andersen, Dale T., Christopher P. McKay, and Victor Lagun. "Climate Conditions at Perennially Ice-Covered Lake Untersee, East Antarctica." Journal of Applied Meteorology and Climatology 54, no. 7 (July 2015): 1393–412. http://dx.doi.org/10.1175/jamc-d-14-0251.1.

Full text

Abstract:

AbstractIn November 2008 an automated meteorological station was established at Lake Untersee in East Antarctica, producing a 5-yr data record of meteorological conditions at the lake. This dataset includes five austral summer seasons composed of December, January, and February (DJF). The average solar flux at Lake Untersee for the four years with complete solar flux data is 99.2 ± 0.6 W m−2. The mean annual temperature at Lake Untersee was determined to be −10.6° ± 0.6°C. The annual degree-days above freezing for the five years were 9.7, 37.7, 22.4, 7.0, and 48.8, respectively, with summer (DJF) accounting for virtually all of this. For these five summers the average DJF temperatures were −3.5°, −1.9°, −2.2°, −2.6°, and −2.5°C. The maximum (minimum) temperatures were +5.3°, +7.6°, +5.7°, +4.4°, and +9.0°C (−13.8°, −12.8°, −12.9°, −13.5°, and −12.1°C). The average of the wind speed recorded was 5.4 m s−1, the maximum was 35.7 m s−1, and the average daily maximum was 15 m s−1. The wind speed was higher in the winter, averaging 6.4 m s−1. Summer winds averaged 4.7 m s−1. The dominant wind direction for strong winds is from the south for all seasons, with a secondary source of strong winds in the summer from the east-northeast. Relative humidity averages 37%; however, high values will occur with an average period of ~10 days, providing a strong indicator of the quasi-periodic passage of storms across the site. Low summer temperatures and high wind speeds create conditions at the surface of the lake ice resulting in sublimation rather than melting as the main mass-loss process.

APA, Harvard, Vancouver, ISO, and other styles

47

Arnold, Michael A., Tim D. Davis, and David W. Reed. "A Survey of Horticulture and Plant Science Graduate Programs and Faculty Salaries at North American Universities." HortTechnology 16, no. 1 (January 2006): 146–52. http://dx.doi.org/10.21273/horttech.16.1.0146.

Full text

Abstract:

A group of 53 institutions of higher education in the United States and Canada offering degrees in horticulture, or closely related plant science degrees, was surveyed to determine various characteristics associated with the degree programs offered, demographics of students and faculty, and selected procedures and practices associated with administration of these graduate programs. Total response rate was 94%, yielding 85% usable completed surveys. Very few programs (0-3 per degree type) were offered via distance education and on average only 4.1% to 4.5% of resident instruction program students participated in distance education courses. Domestic students averaged 64% to 75% of enrollment. Students were 69% to 73% white. Asian students were the predominant minority group at 12% to 16% of enrollment, followed by African Americans (3% to 8%) and Hispanics (1% to 4%). Most institutions provided out-of-state tuition waivers (75%), and often in-state-tuition waivers (61%), to those students on assistantships or fellowships. Typical commitments to students were 3 years for a PhD and 2 years for a master's degree program. Research assistantships were the dominant form of assistance at all institutions (38% to 53% of students), while teaching assistantships contributed significant secondary funding (7% to 13%). With the exception of mean maximum fellowships, mean maximum assistantships ($11,499-$13,999) at non-1862 Morrill Act universities (NMAU) averaged near the mean minimums ($13,042-$14,566) for the corresponding assistantship types at 1862 Morrill Act universities (MAU). Requirements for teaching experience ranged from 41% of PhD programs to 18% of non-thesis master's degree programs. Typical departments contained 29 faculty members, of which 44% were full professors, 27% associate professors, 19% assistant professors, 6% junior or senior lecturers, and 3% were in other classifications. Traditional 12-month appointments (65.9% of faculty) were predominant at MAU. With the exception of junior lecturer positions, mean salaries at MAU averaged $9125, $6869, $8325, and $28,505 more for professor, associate professor, assistant professor, and senior lecturer, respectively, than at NMAU. This study provides useful information for departments undergoing external review or revision of graduate programs.

APA, Harvard, Vancouver, ISO, and other styles

48

Haskevych, Oksana. "Pasmove Pobuzhzhia agricultural landscape soil heterogeneity." Visnyk of the Lviv University. Series Geography 53 (December 18, 2019): 97–103. http://dx.doi.org/10.30970/vgg.2019.53.10659.

Full text

Abstract:

Pasmove Pobuzhzhia belongs to the territories of long agricultural development. Plowing of the slope lands, combined with favourable natural factors, leads to the development of processes of water erosion and the formation of soils ranges of various degrees of erosion, which increases soil heterogeneity. The article analyzes the manifestation of the soil heterogeneity at the level of elemental soil ranges (ESR) of dark gray podzolized soils. The consequence of erosion processes is the isolation of soil ranges of various degrees of erosion. To describe soil ranges, the article gives their area, distribution coefficients of range boundaries, degree of their differentiation by size (DDS), and also analyzes the nature of adjacency with the ranges of other soils. Comparison of the size of the ranges of dark gray podzolized soils of varying degree of erosion confirms the decrease in their average areas from the non-eroded (65.7 hectares) to heavily eroded soils (6.1 hectares). At the same time, the differentiation of soils by size decreases, i.e., the degree of deviation of the maximum and minimum areas from the mean values is the highest for the non-eroded soils (DDS = 1.2). The average coefficient of the dismemberment of the range limits does not depend on the degree of erosion and is 2.2. It has been found out that the maximum values achieved by the dismemberment coefficient are higher for the ranges of non-eroded soil (5.5) and decrease with increase of erosion degree. This indicates that the formed ranges of eroded soils are usually of small and simple unbranched forms (round, oval, elongated along the slope). It has been established that the ranges of non-eroded soils have a large number of adjacent ESRs, the proportion of adjacent soils that differ on the type and subtype levels are higher. The neighbouring ranges of medium and heavily eroded soils differ in the degree of erosion or belong to the microcatenas of drainage lines and arroyos. Key words: Pasmove Pobuzhzhia, structure of soil cover, elemental soil ranges, dark gray podzolized soils, water erosion.

APA, Harvard, Vancouver, ISO, and other styles

49

WU, JIAN-JUN, HUI-JUN SUN, ZI-YOU GAO, and SHU-BIN LI. "EFFECTS OF ROUTE GUIDANCE SYSTEMS ON SMALL-WORLD NETWORKS." International Journal of Modern Physics C 18, no. 08 (August 2007): 1243–50. http://dx.doi.org/10.1142/s0129183107011285.

Full text

Abstract:

The route guidance systems (RGS) are efficient in alleviating traffic congestion and reducing transit time of transportation networks. This paper studies the effects of RGS on performance of variably weighted small-world networks. The properties of the average shortest path length, the maximum degree, and the largest betweenness, as important indices for characterizing the network structure in complex networks, are simulated. Results show that there is an optimal guided rate of RGS to minimize the total system cost and the average shortest path length, and proper RGS can reduce the load of the node with maximum degree or largest betweenness. In addition, we found that the load distribution of nodes guided by RGS decay as the power laws which is very important for us to understand and control traffic congestion feasible.

APA, Harvard, Vancouver, ISO, and other styles

50

Margaryan, Varduhi, and Elena Fedotova. "On the issue of fluctuations in the extreme maximum runoff under the conditions of the expected climate change in the Marmarik river basin." E3S Web of Conferences 149 (2020): 03010. http://dx.doi.org/10.1051/e3sconf/202014903010.

Full text

Abstract:

The paper analyzes the peculiarities of formation of the absolute maximum runoff of the Marmarik river evaluates the patterns of multi-year fluctuations of maximum runoff rates in different river sites and gives a forecast of the maximum runoff in the context of global climate change. Absolute values of the maximum river runoff for different scenarios of climate change are estimated. The actual observational data of Armhydromet for maximum runoff rate, the air temperature and precipitation were used as the source material. As a result of the study, it turned out that there is only a tendency to decrease in the values of maximum runoff. It turned out that for all scenarios and cases in the Marmarik river basin, a different degree of changes in the maximum flow is observed. Moreover, the largest decrease in the maximum runoff of the Marmarik river basin is expected under the conditions of an increase in the average air temperature of the spring season by 2,7—3,9 degrees Celsius and a decrease in the amount of spring atmospheric precipitation by 2,4—2,6 %.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Maximum average degree'

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