Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
Crash Risk-Based Prioritization Of Basic Safety Message In Dsrc, Seungmo Kim, Byung Jun Kim
Crash Risk-Based Prioritization Of Basic Safety Message In Dsrc, Seungmo Kim, Byung Jun Kim
Michigan Tech Publications
Dedicated short-range communications (DSRC) is one of the key technologies enabling safety-critical applications for intelligent transportation system (ITS). Considering the significance of such safety-of-life applications, it is of utmost importance to guarantee reliable delivery of basic safety messages (BSMs). However, in accordance with a V2X network being inherently dynamic in key aspects such as vehicle density and velocity, the networking behavior of a DSRC system is usually highly complicated to analyze. In addition, the United States Federal Communications Commission (US FCC) recently proposed the so-called “5.9 GHz band innovation”, which includes a plan to reduce bandwidth for DSRC to 10 …
Article The Singular Value Expansion For Arbitrary Bounded Linear Operators, Daniel K. Crane, Mark S. Gockenbach
Article The Singular Value Expansion For Arbitrary Bounded Linear Operators, Daniel K. Crane, Mark S. Gockenbach
Michigan Tech Publications
The singular value decomposition (SVD) is a basic tool for analyzing matrices. Regarding a general matrix as defining a linear operator and choosing appropriate orthonormal bases for the domain and co-domain allows the operator to be represented as multiplication by a diagonal matrix. It is well known that the SVD extends naturally to a compact linear operator mapping one Hilbert space to another; the resulting representation is known as the singular value expansion (SVE). It is less well known that a general bounded linear operator defined on Hilbert spaces also has a singular value expansion. This SVE allows a simple …
Perfect 2-Colorings Of The Grassmann Graph Of Planes, Stefaan Dewinter, Klaus Metsch
Perfect 2-Colorings Of The Grassmann Graph Of Planes, Stefaan Dewinter, Klaus Metsch
Michigan Tech Publications
We construct an infinite family of intriguing sets, or equivalently perfect 2-colorings, that are not tight in the Grassmann graph of planes of PG(n, q), n ≥ 5 odd, and show that the members of the family are the smallest possible examples if n ≥ 9 or q ≥ 25.
Testing Gene-Environment Interactions For Rare And/Or Common Variants In Sequencing Association Studies., Zihan Zhao, Jianjun Zhang, Qiuying Sha, Han Hao
Testing Gene-Environment Interactions For Rare And/Or Common Variants In Sequencing Association Studies., Zihan Zhao, Jianjun Zhang, Qiuying Sha, Han Hao
Michigan Tech Publications
The risk of many complex diseases is determined by a complex interplay of genetic and environmental factors. Advanced next generation sequencing technology makes identification of gene-environment (GE) interactions for both common and rare variants possible. However, most existing methods focus on testing the main effects of common and/or rare genetic variants. There are limited methods developed to test the effects of GE interactions for rare variants only or rare and common variants simultaneously. In this study, we develop novel approaches to test the effects of GE interactions of rare and/or common risk, and/or protective variants in sequencing association studies. We …
Uniformly Resolvable Decompositions Of Kv In 1-Factors And 4-Stars, Melissa S. Keranen, Donald L. Kreher, Salvatore Milici, Antoinette Tripodi
Uniformly Resolvable Decompositions Of Kv In 1-Factors And 4-Stars, Melissa S. Keranen, Donald L. Kreher, Salvatore Milici, Antoinette Tripodi
Michigan Tech Publications
If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. A uniformly resolvable {X, Y }-decomposition of the complete graph Kv is an edge decomposition of Kv into exactly r X-factors and s Y -factors. In this article we determine necessary and sufficient conditions for when the complete graph Kv has a uniformly resolvable decompositions into 1-factors and K1,4-factors.