Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (5)
- Computer Sciences (4)
- Applied Mathematics (3)
- Other Mathematics (3)
- Astrophysics and Astronomy (2)
-
- Biomedical Engineering and Bioengineering (2)
- Dynamical Systems (2)
- Geometry and Topology (2)
- Life Sciences (2)
- Mechanical Engineering (2)
- Numerical Analysis and Scientific Computing (2)
- Ordinary Differential Equations and Applied Dynamics (2)
- Stars, Interstellar Medium and the Galaxy (2)
- Aerospace Engineering (1)
- Astrodynamics (1)
- Civil and Environmental Engineering (1)
- Computer Engineering (1)
- Forest Sciences (1)
- Geological Engineering (1)
- Kinesiology (1)
- Non-linear Dynamics (1)
- Numerical Analysis and Computation (1)
- Other Applied Mathematics (1)
- Other Computer Engineering (1)
- Physical Processes (1)
- Programming Languages and Compilers (1)
- Theory and Algorithms (1)
- Publication Year
- Publication
- Publication Type
Articles 61 - 66 of 66
Full-Text Articles in Mathematics
Excess Versions Of The Minkowski And Hölder Inequalities, Iosif Pinelis
Excess Versions Of The Minkowski And Hölder Inequalities, Iosif Pinelis
Michigan Tech Publications, Part 1
Certain excess versions of the Minkowski and Hölder inequalities are given.
Computing Minimum Rainbow And Strong Rainbow Colorings Of Block Graphs, Melissa Karanen, Juho Lauri
Computing Minimum Rainbow And Strong Rainbow Colorings Of Block Graphs, Melissa Karanen, Juho Lauri
Michigan Tech Publications, Part 1
A path in an edge-colored graph G is rainbow if no two edges of it are colored the same. The graph G is rainbow-connected if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertices, the graph G is strongly rainbow-connected. The minimum number of colors needed to make G rainbow-connected is known as the rainbow connection number of G, and is denoted by src(G). Similarly, the minimum number of colors needed to make G strongly rainbow-connected is known as the strong rainbow connection number of G, and …
Property Analysis Of Exfoliated Graphite Nanoplatelets Modified Asphalt Model Using Molecular Dynamics (Md) Method, Hui Yao, Qingli Dai, Zhanping You, Andreas Bick, Min Wang, Shuaicheng Guo
Property Analysis Of Exfoliated Graphite Nanoplatelets Modified Asphalt Model Using Molecular Dynamics (Md) Method, Hui Yao, Qingli Dai, Zhanping You, Andreas Bick, Min Wang, Shuaicheng Guo
Michigan Tech Publications, Part 1
This Molecular Dynamics (MD) simulation paper presents a physical property comparison study between exfoliated graphite nanoplatelets (xGNP) modified and control asphalt models, including density, glass transition temperature, viscosity and thermal conductivity. The three-component control asphalt model consists of asphaltenes, aromatics, and saturates based on previous references. The xGNP asphalt model was built by incorporating an xGNP and control asphalt model and controlling mass ratios to represent the laboratory prepared samples. The Amber Cornell Extension Force Field (ACEFF) was used with assigned molecular electro-static potential (ESP) charge from NWChem analysis. After optimization and ensemble relaxation, the properties of the control and …
Orientable ℤ < Inf> N -Distance Magic Labeling Of The Cartesian Product Of Many Cycles, Bryan Freyberg, Melissa S. Keranen
Orientable ℤ < Inf> N -Distance Magic Labeling Of The Cartesian Product Of Many Cycles, Bryan Freyberg, Melissa S. Keranen
Michigan Tech Publications, Part 1
The following generalization of distance magic graphs was introduced in [2]. A directed ℤn- distance magic labeling of an oriented graph G = (V,A) of order n is a bijection ℓ: V → ℤn with the property that there is a μ ∈ ℤn (called the magic constant) such that If for a graph G there exists an orientation G such that there is a directed ℤn-distance magic labeling ℓ for G, we say that G is orientable ℤn-distance magic and the directed ℤn-distance magic labeling ℓ we call an orientable ℤn-distance magic labeling. In this paper, we find orientable …
An Optimal Three-Way Stable And Monotonic Spectrum Of Bounds On Quantiles: A Spectrum Of Coherent Measures Of Financial Risk And Economic Inequality, Iosif Pinelis
Michigan Tech Publications, Part 1
A spectrum of upper bounds (Qα(X ; p) αε[0,∞] on the (largest) (1-p)-quantile Q(X;p) of an arbitrary random variable X is introduced and shown to be stable and monotonic in α, p, and X , with Q0(X ;p) = Q(X;p). If p is small enough and the distribution of X is regular enough, then Qα(X ; p) is rather close to Q(X ; p). Moreover, these quantile bounds are coherent measures of risk. Furthermore, Qα(X ; p) is the optimal value in a certain minimization problem, the minimizers in which are described …
Variational Models Of Network Formation And Ion Transport: Applications To Perfluorosulfonate Ionomer Membranes, Nir Gavish, Jaylan Jones, Zhengfu Xu, Andrew Christlieb, Keith Promislow
Variational Models Of Network Formation And Ion Transport: Applications To Perfluorosulfonate Ionomer Membranes, Nir Gavish, Jaylan Jones, Zhengfu Xu, Andrew Christlieb, Keith Promislow
Michigan Tech Publications, Part 1
We present the functionalized Cahn-Hilliard (FCH) energy, a continuum characterization of interfacial energy whose minimizers describe the network morphology of solvated functionalized polymer membranes. With a small set of parameters the FCH characterizes bilayer, pore-like, and micelle network structures. The gradient flows derived from the FCH describe the interactions between these structures, including the merging and pinch-off of endcaps and formation of junctions central to the generation of network morphologies. We couple the FCH gradient flow to a model of ionic transport which incorporates entropic effects to localize counter-ions, yielding a flow which dissipates a total free energy, and an …