Results 51 to 60 of about 7,497,325 (135)
Understanding solar cycle variability
, 2017 The level of solar magnetic activity, as exemplified by the number of sunspots and by energetic events in the corona, varies on a wide range of time scales. Most prominent is the 11-year solar cycle, which is significantly modulated on longer time scales.
Cameron, Robert, Schüssler, Manfred
core +1 more source
Maxima of the Q-index: forbidden 4-cycle and 5-cycle [PDF]
, 2013 This paper gives tight upper bounds on the largest eigenvalue q(G) of the signless Laplacian of graphs with no 4-cycle and no 5-cycle. If n is odd, let F_{n} be the friendship graph of order n; if n is even, let F_{n} be F_{n-1} with an edge hanged to ...
de Freitas, Maria Aguieiras A. +2 more
core
Measuring the Welfare Costs of Inflation in a Life-cycle Model [PDF]
In macroeconomics, life-cycle models are typically used to address exclusively life-cycle issues. This paper shows that modeling the life-cycle may be important when addressing public policy issues, in this case the welfare costs of inflation.
Paul Gomme
core
, 2015 Baade-Wesselink-type (BW) techniques enable geometric distance measurements of Cepheid variable stars in the Galaxy and the Magellanic clouds. The leading uncertainties involved concern projection factors required to translate observed radial velocities (
Anderson, R. I. +10 more
core +2 more sources
Transportation Life Cycle Assessment Synthesis: Life Cycle Assessment Learning Module Series [PDF]
, 2015 The Life Cycle Assessment Learning Module Series is a set of narrated, self-advancing slideshows on various topics related to environmental life cycle assessment (LCA).
Haselbach, Liv, Langfitt, Quinn
core
Algorithm for identification of piecewise smooth hybrid systems; application to eukaryotic ...
Ovidiu Radulescu +2 more
core
Packing Coloring of Some Undirected and Oriented Coronae Graphs
Discussiones Mathematicae Graph Theory, 2017 The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater than i in
Laïche Daouya +2 more
doaj +1 more source
Does the current minimum validate (or invalidate) cycle prediction methods? [PDF]
, 2010 This deep, extended solar minimum and the slow start to Cycle 24 strongly suggest that Cycle 24 will be a small cycle. A wide array of solar cycle prediction techniques have been applied to predicting the amplitude of Cycle 24 with widely different ...
Hathaway, David H.
core +2 more sources
, 2020 We generalize Rost's theory of cycle modules using Milnor-Witt K-theory instead of the classical Milnor K-theory. We obtain a (quadratic) setting to study general cycle complexes and their (co)homology groups.
Feld, Niels
core +2 more sources
On Vertices Enforcing a Hamiltonian Cycle
Discussiones Mathematicae Graph Theory, 2013 A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian.
Fabrici Igor +2 more
doaj +1 more source