Oakland University Kresge Library Logo
Search 
  •   DSpace Home
  • Faculty Scholarship
  • Mathematics and Statistics Faculty Scholarship
  • Search
  •   DSpace Home
  • Faculty Scholarship
  • Mathematics and Statistics Faculty Scholarship
  • Search
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

OUR at Oakland

OU Libraries

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Discover

AuthorShaska, Tony (3)Hidalgo, Ruben (1)Joyner, David (1)Kruk, Serge (1)McDonald, Gary C. (1)Nierman, Ryan (1)Quispe, Saul (1)Shaska, Bedri (1)Shi, Peter (1)SubjectAdditive model (1)Bayesian inference (1)Education (1)Fatality analysis reporting system (1)Mathematics (1)Optimization (1)Probability of a correct selection (1)Superelliptic curves (1)Tukey one-degree-of-freedom test for additivity (1)WinBugs (1)... View MoreDate Issued
2016 (5)

Resources

OUR@Oakland FAQsScholarly Communication at OUResearch Data Support at OU

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 1-5 of 5

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

Self-inversive polynomials, curves, and codes 

Shaska, Tony; Joyner, David (American Mathematical Society, 2016-03-05)
We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes
Thumbnail

Combinatorial Algorithm for Quadratic Programs with Laplacian Structure 

Kruk, Serge; Nierman, Ryan; Shi, Peter (Utilitas Mathematica, 2016)
An algorithm is presented that uses a mostly combinatorial approach to solve a family of convex quadratic programs over box constraints. It is proved that for convex programs with the required structure, the ...
Thumbnail

On generalized superelliptic Riemann surfaces 

Hidalgo, Ruben; Quispe, Saul; Shaska, Tony (eprint arXiv:1609.09576, 2016-11-01)
A closed Riemann surface X, of genus g ≥ 2, is called a generalized superelliptic curve of level n ≥ 2 if it admits an order n conformal automorphism τ so that X/hτihas genus zero and τ is central in Aut(X); the cyclic ...
Thumbnail

Mësimdhënia e matematikës nëpërmjet problemeve klasike 

Shaska, Tony; Shaska, Bedri (Albanian J. Math., 2016-12-03)
In this paper we discuss how teaching of mathematics for middle school and high school students can be improved dramatically when motivation of concepts and ideas is done through the classical problems and the history of ...
Thumbnail

Applications of Subset Selection Procedures and Bayesian Ranking Methods in Analysis of Traffic Fatality Data 

McDonald, Gary C. (WIREs Computational Statistics, 2016-11)
Nonparametric and parametric subset selection procedures are used in the analysis of state motor vehicle traffic fatality rates (MVTFRs), for the years 1994 through 2012, to identify subsets of states that contain the ...

DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
 

 


DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback