Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Taylor University (469)
- University of Texas at El Paso (468)
- Marquette University (319)
- Smith College (64)
- Old Dominion University (62)
-
- University of Richmond (57)
- Chapman University (53)
- Claremont Colleges (49)
- Southwestern Oklahoma State University (36)
- University of New Mexico (35)
- Missouri University of Science and Technology (34)
- Portland State University (33)
- Macalester College (27)
- City University of New York (CUNY) (26)
- Butler University (24)
- Rose-Hulman Institute of Technology (22)
- Prairie View A&M University (21)
- Longwood University (20)
- Otterbein University (18)
- Association of Arab Universities (16)
- Ministry of Higher and Secondary Specialized Education of the Republic of Uzbekistan (15)
- Ursinus College (14)
- Western Kentucky University (14)
- Georgia Southern University (13)
- University of Nevada, Las Vegas (13)
- College of the Holy Cross (12)
- Loyola University Chicago (12)
- Utah State University (12)
- California Polytechnic State University, San Luis Obispo (11)
- College of Saint Benedict and Saint John's University (11)
- Keyword
-
- Technical Reports (356)
- UTEP Computer Science Department (356)
- Mathematics (38)
- Machine learning (35)
- Algorithms (24)
-
- Machine Learning (22)
- Graph theory (21)
- Characterizations (19)
- Computer Science (19)
- Data mining (19)
- Cryptography (17)
- Optimization (16)
- Information Theory (15)
- Reconstructability Analysis (15)
- Artificial intelligence (14)
- Fuzzy logic (14)
- Probabilistic graphical modeling (14)
- Coalgebra (13)
- Computer science (13)
- Multivariate analysis discrete multivariate modeling (13)
- Statistics (13)
- Combinatorics (12)
- Interval uncertainty (12)
- Simulation (12)
- Neural networks (11)
- Classification (10)
- Graph Theory (10)
- Artificial Intelligence (9)
- Characterization (9)
- Deep learning (9)
- Publication Year
- Publication
-
- Departmental Technical Reports (CS) (447)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (316)
- Computer Science: Faculty Publications (63)
- Engineering Faculty Articles and Research (46)
- Honors Theses (45)
-
- Oklahoma Research Day Abstracts (36)
- ACMS Conference Proceedings 2005 (34)
- ACMS Conference Proceedings 2013 (30)
- ACMS Conference Proceedings 2003 (27)
- Branch Mathematics and Statistics Faculty and Staff Publications (27)
- Mathematics, Statistics, and Computer Science Honors Projects (27)
- ACMS Conference Proceedings 2011 (26)
- ACMS Conference Proceedings 2019 (26)
- ACMS Conference Proceedings 1999 (25)
- ACMS Conference Proceedings 2009 (25)
- Complex Systems Faculty Publications and Presentations (24)
- ACMS Conference Proceedings 2007 (23)
- ACMS Conference Proceedings 2015 (23)
- ACMS Conference Proceedings 2017 (22)
- ACMS Journal 2004 (22)
- Scholarship and Professional Work - LAS (22)
- ACMS Conference Proceedings 1997 (21)
- Applications and Applied Mathematics: An International Journal (AAM) (21)
- Computer Science Technical Reports (21)
- ACMS Conference Proceedings 1981 (19)
- All HMC Faculty Publications and Research (19)
- Theses and Dissertations (19)
- Mathematical Sciences Technical Reports (MSTR) (18)
- Mathematics & Statistics Faculty Publications (18)
- ACMS Conference Proceedings 1977 (17)
- Publication Type
- File Type
Articles 1681 - 1710 of 2396
Full-Text Articles in Mathematics
Star Unfolding Convex Polyhedra Via Quasigeodesic Loops, Jin-Ichi Itoh, Joseph O'Rourke, Costin Vîlcu
Star Unfolding Convex Polyhedra Via Quasigeodesic Loops, Jin-Ichi Itoh, Joseph O'Rourke, Costin Vîlcu
Computer Science: Faculty Publications
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ℘ to a simple (nonoverlapping) planar polygon: cut along one shortest path from each vertex of ℘ toQ, and cut all but one segment of Q.
The Teaching Of Equation Solving: Approaches In Standards-Based And Traditional Curricula In The United States, Jinfa Cai, Bikai Nie, John Moyer
The Teaching Of Equation Solving: Approaches In Standards-Based And Traditional Curricula In The United States, Jinfa Cai, Bikai Nie, John Moyer
Mathematics, Statistics and Computer Science Faculty Research and Publications
This paper discusses the approaches to teaching linear equation solving that are embedded in a Standards-based mathematics curriculum (Connected Mathematics Program or CMP) and in a traditional mathematics curriculum (Glencoe Mathematics) in the United States. Overall, the CMP curriculum takes a functional approach to teaching equation solving, while Glencoe Mathematics takes a structural approach. The functional approach emphasizes the important ideas of change and variation in situations and contexts. It also emphasizes the representation of relationships between variables. The structural approach, on the other hand, requires students to work abstractly with symbols and follow procedures in a systematic way. …
Convergence Of The Sinc Method Applied To Volterra Integral Equations, M. Zarebnia, J. Rashidinia
Convergence Of The Sinc Method Applied To Volterra Integral Equations, M. Zarebnia, J. Rashidinia
Applications and Applied Mathematics: An International Journal (AAM)
A collocation procedure is developed for the linear and nonlinear Volterra integral equations, using the globally defined Sinc and auxiliary basis functions. We analytically show the exponential convergence of the Sinc collocation method for approximate solution of Volterra integral equations. Numerical examples are included to confirm applicability and justify rapid convergence of our method.
The Yao Graph Y6 Is A Spanner, Joseph O'Rourke
The Yao Graph Y6 Is A Spanner, Joseph O'Rourke
Computer Science: Faculty Publications
We prove that Y6 is a spanner. Y6 is the Yao graph on a set of planar points, which has an edge from each point x to a closest point y within each of the six angular cones of 60◦ surrounding x .
Time Series Models For Computing Activation In Fmri, Daniel W. Adrian, Ranjan Maitra, Daniel B. Rowe
Time Series Models For Computing Activation In Fmri, Daniel W. Adrian, Ranjan Maitra, Daniel B. Rowe
Mathematics, Statistics and Computer Science Faculty Research and Publications
No abstract provided.
Pre-Service Middle School Teachers’ Knowledge Of Algebraic Thinking, Marta Magiera, John Moyer, Leigh A. Van Den Kieboom
Pre-Service Middle School Teachers’ Knowledge Of Algebraic Thinking, Marta Magiera, John Moyer, Leigh A. Van Den Kieboom
Mathematics, Statistics and Computer Science Faculty Research and Publications
In this study we examined the relationship between 18 pre-service middle school teachers’ own ability to use algebraic thinking to solve problems and their ability to recognize and interpret the algebraic thinking of middle school students. We assessed the pre-service teachers’ own algebraic thinking by examining their solutions and explanations to multiple algebra-based tasks posed during a semester-long mathematics content course. We assessed their ability to recognize and interpret the algebraic thinking of students in two ways. The first was by analyzing the preservice teachers’ ability to interpret students’ written solutions to open-ended algebra-based tasks. The second was by analyzing …
Pre-Service Teachers’ Knowledge Of Algebraic Thinking And The Characteristics Of The Questions Posed For Students, Leigh A. Van Den Kieboom, Marta Magiera, John Moyer
Pre-Service Teachers’ Knowledge Of Algebraic Thinking And The Characteristics Of The Questions Posed For Students, Leigh A. Van Den Kieboom, Marta Magiera, John Moyer
Mathematics, Statistics and Computer Science Faculty Research and Publications
In this study, we explored the relationship between the strength of pre-service teachers’ algebraic thinking and the characteristics of the questions they posed during cognitive interviews that focused on probing the algebraic thinking of middle school students. We developed a performance rubric to evaluate the strength of pre-service teachers’ algebraic thinking across 130 algebra-based tasks. We used an existing coding scheme found in the literature to analyze the characteristics of the questions pre-service teachers posed during clinical interviews. We found that pre-service teachers with higher algebraic thinking abilities were able to pose probing questions that uncovered student thinking through the …
M-Refinable Extensions Of Real Valued Functions, John Meuser, Tian-Xiao He, Faculty Advisor
M-Refinable Extensions Of Real Valued Functions, John Meuser, Tian-Xiao He, Faculty Advisor
John Wesley Powell Student Research Conference
No abstract provided.
Detecting Malicious Javascript, Matthew F. Der
Detecting Malicious Javascript, Matthew F. Der
Honors Theses
The increased use of the World Wide Web and JavaScript as a scripting language for Web pages have made JavaScript a popular attack vector for infecting users' machines with malware. Additionally, attackers often obfuscate their code to avoid detection, which heightens the challenge and complexity of automated defense systems. We present two analyses of malicious scripts and suggest how they could be extended into intrusion detection systems. For our analyses we use a sample of deobfuscated malicious and benign scripts collected from actual Web sites. First, using our malicious sample, we perform a manual analysis of attack signatures, identifying four …
Volume 03, Cheryl Peck, Charles Hoever, Longwood Theater Department, Brittany Anderson, J. Ervin Sheldon, Richard Hayden, Yuri Calustro, Candice Fleming, Rebecca Franklin, Ashley Yocum, Danielle M. Jagoda, Cristina M. Valdivieso, Jameka Jones, Amy Ellis, Ashley Maser, Erikk Shupp, Jamie Yurasits, Joshua Davis, Alexander Leonhart, Kenny Wolfe, Sally Meadows, J. Haley, Amy Jackson, Morgan Howard, Adrienne Heinbaugh, Melissa Dorton, Ciarra Stalker
Volume 03, Cheryl Peck, Charles Hoever, Longwood Theater Department, Brittany Anderson, J. Ervin Sheldon, Richard Hayden, Yuri Calustro, Candice Fleming, Rebecca Franklin, Ashley Yocum, Danielle M. Jagoda, Cristina M. Valdivieso, Jameka Jones, Amy Ellis, Ashley Maser, Erikk Shupp, Jamie Yurasits, Joshua Davis, Alexander Leonhart, Kenny Wolfe, Sally Meadows, J. Haley, Amy Jackson, Morgan Howard, Adrienne Heinbaugh, Melissa Dorton, Ciarra Stalker
Incite: The Journal of Undergraduate Scholarship
Introduction from Dean Dr. Charles Ross
Little Shop of Horrors by Longwood Theater Department
Who Has the Hottest Hotsauce in Farmville: A Quantitative Comparison of Sauces from Local Restaurants by Cheryl Peck and Charles Hoever
Precipitation Effects on the Growth of White Oaks and Virginia Pines on the Mt. Vernon Plantation by Brittany Anderson
Design and Synthesis of Novel Ion Binding Molecules for Self-Assembly and Sensing Applications by J. Ervin Sheldon
A Statistical Analysis of Algorithms for Playing SameGame by Richard Hayden
Intersecting Cylinders at Arbitrary Angles by Yuri Calustro
Putting a Foot in the Revolving Door: Strategies for Reducing …
Importance Sampling For Dispersion-Managed Solitons, Elaine T. Spiller, Gino Biondini
Importance Sampling For Dispersion-Managed Solitons, Elaine T. Spiller, Gino Biondini
Mathematics, Statistics and Computer Science Faculty Research and Publications
The dispersion-managed nonlinear Schrödinger (DMNLS) equation governs the long-term dynamics of systems which are subject to large and rapid dispersion variations. We present a method to study large, noise-induced amplitude and phase perturbations of dispersion-managed solitons. The method is based on the use of importance sampling to bias Monte Carlo simulations toward regions of state space where rare events of interest—large phase or amplitude variations—are most likely to occur. Implementing the method thus involves solving two separate problems: finding the most likely noise realizations that produce a small change in the soliton parameters, and finding the most likely way that …
Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ
Master's Theses
View John Huân Vũ's thesis presentation at http://youtu.be/y3bzNmkTr-c.
In 2001, the ACM and IEEE Computing Curriculum stated that it was necessary to address "the need to develop implementation models that are international in scope and could be practiced in universities around the world." With increasing connectivity through the internet, the move towards a global economy and growing use of technology places software internationalization as a more important concern for developers. However, there has been a "clear shortage in terms of numbers of trained persons applying for entry-level positions" in this area. Eric Brechner, Director of Microsoft Development Training, suggested …
Highway Hull Revisited, Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop
Highway Hull Revisited, Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop
Computer Science: Faculty Publications
A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distance between a pair of points is the minimum time required to move from one point to the other, with optional use of H. The highway hull H(S,H) of a point set S is the minimal set containing S as well as the shortest paths between all pairs of points in H(S,H), using the highway time distance. We provide a Θ(nlogn) worst-case …
Quantification Of Artistic Style Through Sparse Coding Analysis In The Drawings Of Pieter Bruegel The Elder, James M. Hughes, Daniel J. Graham, Daniel N. Rockmore
Quantification Of Artistic Style Through Sparse Coding Analysis In The Drawings Of Pieter Bruegel The Elder, James M. Hughes, Daniel J. Graham, Daniel N. Rockmore
Dartmouth Scholarship
Recently, statistical techniques have been used to assist art historians in the analysis of works of art. We present a novel technique for the quantification of artistic style that utilizes a sparse coding model. Originally developed in vision research, sparse coding models can be trained to represent any image space by maximizing the kurtosis of a representation of an arbitrarily selected image from that space. We apply such an analysis to successfully distinguish a set of authentic drawings by Pieter Bruegel the Elder from another set of well-known Bruegel imitations. We show that our approach, which involves a direct comparison …
Analysis Of The Consistency Of A Mixed Integer Programming-Based Multi-Category Constrained Discriminant Model, J. Paul Brooks, Eva K. Lee
Analysis Of The Consistency Of A Mixed Integer Programming-Based Multi-Category Constrained Discriminant Model, J. Paul Brooks, Eva K. Lee
Statistical Sciences and Operations Research Publications
Classification is concerned with the development of rules for the allocation of observations to groups, and is a fundamental problem in machine learning. Much of previous work on classification models investigates two-group discrimination. Multi-category classification is less-often considered due to the tendency of generalizations of two-group models to produce misclassification rates that are higher than desirable. Indeed, producing “good” two-group classification rules is a challenging task for some applications, and producing good multi-category rules is generally more difficult. Additionally, even when the “optimal” classification rule is known, inter-group misclassification rates may be higher than tolerable for a given classification model. …
The Topology Of Incidence Pseudographs, Thomas R. James, Reinhard Klette
The Topology Of Incidence Pseudographs, Thomas R. James, Reinhard Klette
Mathematics Faculty Scholarship
Incidence pseudographs model a (re°exive and symmetric) inci- dence relation between sets of various dimensions, contained in a count- able family. Work by Klaus Voss in 1993 suggested that this general discrete model allows to introduce a topology, and some authors have done some studies into this direction in the past (also using alternative discrete models such as, for example, abstract complexes or orders on sets of cells). This paper provides a comprehensive overview about the topology of incidence pseudographs. This topology has various appli- cations, such as in modeling basic data in 2D or 3D digital picture analysis, or …
A Vision For Acms, James Bradley
A Vision For Acms, James Bradley
ACMS Journal 2010-2011
This paper presents a vision for the mission of the ACMS. It considers some plausible connections between mathematics and theology as well as some big questions that Christian mathematicians might fruitfully explore. It examines the current cultural norms of the mathematics guild, why these are problematic for Christians, and some possible ways the ACMS might respond.
Local Versus Global Search In Channel Graphs, A.H. Hunter, Nicholas Pippenger
Local Versus Global Search In Channel Graphs, A.H. Hunter, Nicholas Pippenger
All HMC Faculty Publications and Research
Previous studies of search in channel graphs has assumed that the search is global; that is, that the status of any link can be probed by the search algorithm at any time. We consider for the first time local search, for which only links to which an idle path from the source has already been established may be probed. We show that some well known channel graphs may require exponentially more probes, on the average, when search must be local than when it may be global.
Morphing Of Triangular Meshes In Shape Space, Stefanie Wuhrer, Prosenjit Bose, Chang Shu, Joseph O'Rourke, Alan Brunton
Morphing Of Triangular Meshes In Shape Space, Stefanie Wuhrer, Prosenjit Bose, Chang Shu, Joseph O'Rourke, Alan Brunton
Computer Science: Faculty Publications
We present a novel approach to morph between two isometric poses of the same non-rigid object given as triangular meshes. We model the morphs as linear interpolations in a suitable shape space S. For triangulated 3D polygons, we prove that interpolating linearly in this shape space corresponds to the most isometric morph in R3 . We then extend this shape space to arbitrary triangulations in 3D using a heuristic approach and show the practical use of the approach using experiments. Furthermore, we discuss a modified shape space that is useful for isometric skeleton morphing. All of the newly presented …
Digraphs With Isomorphic Underlying And Domination Graphs: 4-Cycles And Pairs Of Paths, Kim A. S. Factor, Larry J. Langley
Digraphs With Isomorphic Underlying And Domination Graphs: 4-Cycles And Pairs Of Paths, Kim A. S. Factor, Larry J. Langley
Mathematics, Statistics and Computer Science Faculty Research and Publications
A domination graph of a digraph D, dom(D), is created using the vertex set of D, V(D). There is an edge uv in dom(D) whenever (u, z) or (v, z) is in the arc set of D, A(D), for every other vertex z ε V(D). For only some digraphs D has the structure of dom(D) been characterized. Examples of this are tournaments and regular digraphs. The authors have characterizations for the structure of digraphs D for …
A Mobile Intelligent Interruption Management System, Sina Zulkernain, Praveen Madiraju, Sheikh Iqbal Ahamed, Karl Stamm
A Mobile Intelligent Interruption Management System, Sina Zulkernain, Praveen Madiraju, Sheikh Iqbal Ahamed, Karl Stamm
Mathematics, Statistics and Computer Science Faculty Research and Publications
Mobile phones have become the most hated device that people cannot live without. For its primary usage as a communication device, it has surpassed any other medium. But it comes with a high price, interruption, anywhere anytime. These unwanted interruptions cause loss of productivity and also mostly not beneficial to the immediate task at hand, and moving them few minutes into the future can increase productivity. Considering receivers unavailability, it is possible to manage cell phone disruptions using advanced features like sensing capability, ubiquitous computing and context aware systems. This paper proposes the architecture of a system named Mobile Intelligent …
Local Out-Tournaments With Upset Tournament Strong Components I: Full And Equal {0,1}-Matrix Ranks, Kim A. S. Factor, Rebecca M. Kohler, Jason M. Derby
Local Out-Tournaments With Upset Tournament Strong Components I: Full And Equal {0,1}-Matrix Ranks, Kim A. S. Factor, Rebecca M. Kohler, Jason M. Derby
Mathematics, Statistics and Computer Science Faculty Research and Publications
A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use local out-tournaments, whose strong components are upset tournaments, to explore the corresponding ranks of the adjacency matrices. Of specific interest is the out-tournament whose adjacency matrix has boolean, nonnegative integer, term, and real rank all equal to the number of vertices, n. Corresponding results for biclique covers and partitions of the digraph are provided.
Digraphs With Isomorphic Underlying And Domination Graphs: Pairs Of Paths, Kim A. S. Factor, Larry J. Langley
Digraphs With Isomorphic Underlying And Domination Graphs: Pairs Of Paths, Kim A. S. Factor, Larry J. Langley
Mathematics, Statistics and Computer Science Faculty Research and Publications
A domination graph of a digraph D, dom (D), is created using thc vertex set of D and edge uv ϵ E (dom (D)) whenever (u, z) ϵ A (D) or (v, z) ϵ A (D) for any other vertex z ϵ A (D). Here, we consider directed graphs whose underlying graphs are isomorphic to their domination graphs. Specifically, digraphs are completely characterized where UGc (D) is the union of two disjoint paths.
Lower Semimodular Inverse Semigroups, Ii, Peter R. Jones, Kyeong Hee Cheong
Lower Semimodular Inverse Semigroups, Ii, Peter R. Jones, Kyeong Hee Cheong
Mathematics, Statistics and Computer Science Faculty Research and Publications
The authors’ description of the inverse semigroups S for which the lattice ℒℱ(S) of full inverse subsemigroups is lower semimodular is used to describe those for which (a) the lattice ℒ(S) of all inverse subsemigroups or (b) the lattice �o(S) of convex inverse subsemigroups has that property. In each case, we show that this occurs if and only if the entire lattice is a subdirect product of ℒℱ(S) with ℒ(E S ), or �o(E S ), respectively, where E S is the semilattice of idempotents of …
Not Every Co-Existential Map Is Confluent, Paul Bankston
Not Every Co-Existential Map Is Confluent, Paul Bankston
Mathematics, Statistics and Computer Science Faculty Research and Publications
A continuous surjection between compacta is co-existential if it is the second of two maps whose composition is a standard ultracopower projection. Co-existential maps are always weakly confluent, and are even monotone when the range space is locally connected; so it is a natural question to ask whether they are always confluent. Here we give a negative answer. This is an interesting question, mainly because of the fact that most theorems about confluent maps have parallel versions for co-existential maps---notably, both kinds of maps preserve hereditary indecomposability. Where the known parallels break down is in the question of chainability. It …
Automation Process For Morphometric Analysis Of Volumetric Ct Data From Pulmonary Vasculature In Rats, Rahul Shingrani, Gary S. Krenz, Robert Molthen
Automation Process For Morphometric Analysis Of Volumetric Ct Data From Pulmonary Vasculature In Rats, Rahul Shingrani, Gary S. Krenz, Robert Molthen
Mathematics, Statistics and Computer Science Faculty Research and Publications
With advances in medical imaging scanners, it has become commonplace to generate large multidimensional datasets. These datasets require tools for a rapid, thorough analysis. To address this need, we have developed an automated algorithm for morphometric analysis incorporating A Visualization Workshop computational and image processing libraries for three-dimensional segmentation, vascular tree generation and structural hierarchical ordering with a two-stage numeric optimization procedure for estimating vessel diameters. We combine this new technique with our mathematical models of pulmonary vascular morphology to quantify structural and functional attributes of lung arterial trees. Our physiological studies require repeated measurements of vascular structure to determine …
Developing Preservice Teachers’ Mathematical And Pedagogical Knowledge Using An Integrated Approach, Marta Magiera, Leigh A. Van Den Kieboom
Developing Preservice Teachers’ Mathematical And Pedagogical Knowledge Using An Integrated Approach, Marta Magiera, Leigh A. Van Den Kieboom
Mathematics, Statistics and Computer Science Faculty Research and Publications
This paper describes how an integrated mathematics content and early field-experience course provides opportunities for preservice elementary teachers to develop understanding of mathematics and mathematics teaching. Engaging preservice teachers in solving and discussing mathematical tasks and providing opportunities to implement these tasks with elementary students creates an authentic context for the future teachers to reflect on their own understanding of mathematics, mathematics teaching, and students’ mathematical thinking. Essential elements of the cycle of events in the integrated model of instruction are discussed: preservice students’ acquisition of mathematical concepts in the context of selected tasks in the content course; subsequent posing …
Cnareporter: A Computational Tool For The Generation Of Clinical Reports Of Genomic Alterations, Yuri Kotliarov, Serdar Bozdag, Hangjiong Cheng, Stefan Wuchty, Jean-Claude Zenklusen, Howard A. Fine
Cnareporter: A Computational Tool For The Generation Of Clinical Reports Of Genomic Alterations, Yuri Kotliarov, Serdar Bozdag, Hangjiong Cheng, Stefan Wuchty, Jean-Claude Zenklusen, Howard A. Fine
Mathematics, Statistics and Computer Science Faculty Research and Publications
Background: Genomic copy number alterations are widely associated with a broad range of human tumors and offer the potential to be used as a diagnostic tool. Especially in the emerging era of personalized medicine medical informatics tools that allow the fast visualization and analysis of genomic alterations of a patient's genomic profile for diagnostic and potential treatment purposes increasingly gain importance. Results: We developed CNAReporter, a software tool that allows users to visualize SNP-specific data obtained from Affymetrix arrays and generate PDF-reports as output. We combined standard algorithms for the analysis of chromosomal alterations, utilizing the widely applied GenePattern framework. …
Character Degrees Of Normally Monomial Maximal Class 5-Groups, Michael Slattery
Character Degrees Of Normally Monomial Maximal Class 5-Groups, Michael Slattery
Mathematics, Statistics and Computer Science Faculty Research and Publications
This paper will impose limits on the possible sets of irreducible character degrees of a normally monomial 5-group of maximal class.
Gliomapredict: A Clinically Useful Tool For Assigning Glioma Patients To Specific Molecular Subtypes, Aiguo Li, Serdar Bozdag, Yuri Kotliarov, Howard A. Fine
Gliomapredict: A Clinically Useful Tool For Assigning Glioma Patients To Specific Molecular Subtypes, Aiguo Li, Serdar Bozdag, Yuri Kotliarov, Howard A. Fine
Mathematics, Statistics and Computer Science Faculty Research and Publications
Background: Advances in generating genome-wide gene expression data have accelerated the development of molecular-based tumor classification systems. Tools that allow the translation of such molecular classification schemas from research into clinical applications are still missing in the emerging era of personalized medicine.
Results: We developed GliomaPredict as a computational tool that allows the fast and reliable classification of glioma patients into one of six previously published stratified subtypes based on sets of extensively validated classifiers derived from hundreds of glioma transcriptomic profiles. Our tool utilizes a principle component analysis (PCA)-based approach to generate a visual representation of the analyses, quantifies …