Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Taylor University (469)
- University of Texas at El Paso (465)
- Marquette University (320)
- Smith College (64)
- Old Dominion University (60)
-
- 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)
- Prairie View A&M University (21)
- Longwood University (20)
- Rose-Hulman Institute of Technology (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)
- 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)
- College of the Holy Cross (11)
- Keyword
-
- Technical Reports (356)
- UTEP Computer Science Department (356)
- Mathematics (38)
- Machine learning (33)
- Algorithms (24)
-
- Graph theory (21)
- Machine Learning (21)
- Characterizations (19)
- Computer Science (19)
- Data mining (19)
- Cryptography (17)
- Optimization (16)
- Information Theory (15)
- Reconstructability Analysis (15)
- Fuzzy logic (14)
- Probabilistic graphical modeling (14)
- Artificial intelligence (13)
- 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 (317)
- 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)
- Mathematics & Statistics Faculty Publications (18)
- ACMS Conference Proceedings 1977 (17)
- ACMS Conference Proceedings 1989 (17)
- Publication Type
- File Type
Articles 1441 - 1470 of 2384
Full-Text Articles in Computer Sciences
Mind The Gaps, Paul Bankston
Mind The Gaps, Paul Bankston
Mathematics, Statistics and Computer Science Faculty Research and Publications
No abstract provided.
Rattus Model Utilizing Selective Pulmonary Ischemia Induces Bronchiolitis Obliterans Organizing Pneumonia, John C. Densmore, Paul M. Jeziorczak, Anne V. Clough, Kirkwood A. Pritchard Jr, Breana Cummens, Meetha Medhora, Arjun Rao, Elizabeth R. Jacobs
Rattus Model Utilizing Selective Pulmonary Ischemia Induces Bronchiolitis Obliterans Organizing Pneumonia, John C. Densmore, Paul M. Jeziorczak, Anne V. Clough, Kirkwood A. Pritchard Jr, Breana Cummens, Meetha Medhora, Arjun Rao, Elizabeth R. Jacobs
Mathematics, Statistics and Computer Science Faculty Research and Publications
Bronchiolitis obliterans organizing pneumonia (BOOP), a morbid condition when associated with lung transplant and chronic lung disease, is believed to be a complication of ischemia. Our goal was to develop a simple and reliable model of lung ischemia in the Sprague-Dawley rat that would produce BOOP. Unilateral ischemia without airway occlusion was produced by an occlusive slipknot placed around the left main pulmonary artery. Studies were performed 7 days later. Relative pulmonary and systemic flow to each lung was measured by injection of technetium Tc 99m macroaggregated albumin. Histological sections were examined for structure and necrosis and scored for BOOP. …
A Graph-Theoretical Approach To The Selection Of The Minimum Tiling Path From A Physical Map, Serdar Bozdag
A Graph-Theoretical Approach To The Selection Of The Minimum Tiling Path From A Physical Map, Serdar Bozdag
Mathematics, Statistics and Computer Science Faculty Research and Publications
The problem of computing the minimum tiling path (MTP) from a set of clones arranged in a physical map is a cornerstone of hierarchical (clone-by-clone) genome sequencing projects. We formulate this problem in a graph theoretical framework, and then solve by a combination of minimum hitting set and minimum spanning tree algorithms. The tool implementing this strategy, called FMTP, shows improved performance compared to the widely used software FPC. When we execute FMTP and FPC on the same physical map, the MTP produced by FMTP covers a higher portion of the genome, and uses a smaller number of clones. For …
Use Of Grothendieck Inequality In Interval Computations: Quadratic Terms Are Estimated Accurately Modulo A Constant Factor, Olga Kosheleva, Vladik Kreinovich
Use Of Grothendieck Inequality In Interval Computations: Quadratic Terms Are Estimated Accurately Modulo A Constant Factor, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
One of the main problems of interval computations is to compute the range of a given function f over given intervals. For a linear function, we can feasibly estimate its range, but for quadratic (and for more complex) functions, the problem of computing the exact range is NP-hard. So, if we limit ourselves to feasible algorithms, we have to compute enclosures instead of the actual ranges. It is known that asymptotically the smallest possible excess width of these enclosures is O(Δ2), where Δ is the largest half-width of the input intervals. This asymptotics is attained for the Mean …
Checking Monotonicity Is Np-Hard Even For Cubic Polynomials, Andrzej Pownuk, Luc Longpre, Vladik Kreinovich
Checking Monotonicity Is Np-Hard Even For Cubic Polynomials, Andrzej Pownuk, Luc Longpre, Vladik Kreinovich
Departmental Technical Reports (CS)
One of the main problems of interval computations is to compute the range of a given function over given intervals. In general, this problem is computationally intractable (NP-hard) -- that is why we usually compute an enclosure and not the exact range. However, there are cases when it is possible to feasibly compute the exact range; one of these cases is when the function is monotonic with respect to each of its variables. The monotonicity assumption holds when the derivatives at a midpoint are different from 0 and the intervals are sufficiently narrow; because of this, monotonicity-based estimates are often …
Why Complex-Valued Fuzzy? Why Complex Values In General? A Computational Explanation, Olga Kosheleva, Vladik Kreinovich, Thavatchai Ngamsantivong
Why Complex-Valued Fuzzy? Why Complex Values In General? A Computational Explanation, Olga Kosheleva, Vladik Kreinovich, Thavatchai Ngamsantivong
Departmental Technical Reports (CS)
In the traditional fuzzy logic, as truth values, we take all real numbers from the interval [0,1]. In some situations, this set is not fully adequate for describing expert uncertainty, so a more general set is needed. From the mathematical viewpoint, a natural extension of real numbers is the set of complex numbers. Complex-valued fuzzy sets have indeed been successfully used in applications of fuzzy techniques. This practical success leaves us with a puzzling question: why complex-valued degree of belief, degrees which do not seem to have a direct intuitive meaning, have been so successful? In this paper, we use …
3e: Energy-Efficient Elastic Scheduling For Independent Tasks In Heterogeneous Computing Systems, Xiaomin Zhu, Rong Ge, Jinguang Sun, Chuan He
3e: Energy-Efficient Elastic Scheduling For Independent Tasks In Heterogeneous Computing Systems, Xiaomin Zhu, Rong Ge, Jinguang Sun, Chuan He
Mathematics, Statistics and Computer Science Faculty Research and Publications
Reducing energy consumption is a major design constraint for modern heterogeneous computing systems to minimize electricity cost, improve system reliability and protect environment. Conventional energy-efficient scheduling strategies developed on these systems do not sufficiently exploit the system elasticity and adaptability for maximum energy savings, and do not simultaneously take account of user expected finish time. In this paper, we develop a novel scheduling strategy named energy-efficient elastic (3E) scheduling for aperiodic, independent and non-real-time tasks with user expected finish times on DVFS-enabled heterogeneous computing systems. The 3E strategy adjusts processors’ supply voltages and frequencies according to the system workload, and …
The Performance Of Mlem For Dynamic Imaging From Simulated Few-View, Multi-Pinhole Spect, Dan Ma, Paul Arthur Wolf, Anne V. Clough, Taly Gilat Schmidt
The Performance Of Mlem For Dynamic Imaging From Simulated Few-View, Multi-Pinhole Spect, Dan Ma, Paul Arthur Wolf, Anne V. Clough, Taly Gilat Schmidt
Mathematics, Statistics and Computer Science Faculty Research and Publications
Stationary small-animal SPECT systems are being developed for rapid dynamic imaging from limited angular views. This work quantified, through simulations, the performance of Maximum Likelihood Expectation Maximization (MLEM) for reconstructing a time-activity curve (TAC) with uptake duration of a few seconds from a stationary, three-camera multi-pinhole SPECT system. The study also quantified the benefits of a heuristic method of initializing the reconstruction with a prior image reconstructed from a conventional number of views, for example from data acquired during the late-study portion of the dynamic TAC. We refer to MLEM reconstruction initialized by a prior-image initial guess (IG) as MLEM …
04. Botany, University Of Central Oklahoma
04. Botany, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
02. Animal Science, University Of Central Oklahoma
02. Animal Science, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
09. Environmental Science, University Of Central Oklahoma
09. Environmental Science, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
07. Criminal Justice, University Of Central Oklahoma
07. Criminal Justice, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
11. Genetics, University Of Central Oklahoma
11. Genetics, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
08. Engineering, University Of Central Oklahoma
08. Engineering, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
13. Mathematics, University Of Central Oklahoma
13. Mathematics, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
14. Optometry, University Of Central Oklahoma
14. Optometry, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
16. Physics, University Of Central Oklahoma
16. Physics, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
17. Psychology, University Of Central Oklahoma
17. Psychology, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
19. Zoology, University Of Central Oklahoma
19. Zoology, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
06. Computer Science, University Of Central Oklahoma
06. Computer Science, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
03. Biology, University Of Central Oklahoma
03. Biology, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
05. Chemistry, University Of Central Oklahoma
05. Chemistry, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
10. Forensic Science, University Of Central Oklahoma
10. Forensic Science, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
12. Kinesiology, University Of Central Oklahoma
12. Kinesiology, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
15. Pharmacy, University Of Central Oklahoma
15. Pharmacy, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
18. Statistics, University Of Central Oklahoma
18. Statistics, University Of Central Oklahoma
Oklahoma Research Day Abstracts
No abstract provided.
Bayesian Approach For Inconsistent Information, M. Stein, Michael Beer, Vladik Kreinovich
Bayesian Approach For Inconsistent Information, M. Stein, Michael Beer, Vladik Kreinovich
Departmental Technical Reports (CS)
In engineering situations, we usually have a large amount of prior knowledge that needs to be taken into account when processing data. Traditionally, the Bayesian approach is used to process data in the presence of prior knowledge. Sometimes, when we apply the traditional Bayesian techniques to engineering data, we get inconsistencies between the data and prior knowledge. These inconsistencies are usually caused by the fact that in the traditional approach, we assume that we know the {\it exact} sample values, that the prior distribution is {\it exactly} known, etc. In reality, the data is imprecise due to measurement errors, the …
Number Of Information And Its Relation To The Cosmological Constant Resulting From Landauer’S Principle, Ioannis Gkigkitzis, Ioannis Haranas, Samantha Kirk
Number Of Information And Its Relation To The Cosmological Constant Resulting From Landauer’S Principle, Ioannis Gkigkitzis, Ioannis Haranas, Samantha Kirk
Physics and Computer Science Faculty Publications
Using a recent published formula for the number of information N that results from Landauer’s principle we obtain an expression for the cosmological constant Λ . Next, assuming the universe as a system of mass M satisfying Landauer’s principle and eliminating its mass M from the given expression for the number of information, we obtain a new expression that agrees with the one derived by Lloyd. Furthermore, we modify the generalized entropy relation and three equivalent entropy expressions are obtained. Finally, in two different universes the time rate of change of the entropy is calculated. In a flat universe the …
A Gentle Introduction To Pythontex, Andrew Mertz, William Slough
A Gentle Introduction To Pythontex, Andrew Mertz, William Slough
Faculty Research and Creative Activity
No abstract provided.
School Choice As A One-Sided Matching Problem: Cardinal Utilities And Optimization, Sinan Aksoy, Alexander Adam Azzam, Chaya Coppersmith, Julie Glass, Gizem Karaali, Xueying Zhao, Xinjing Zhu
School Choice As A One-Sided Matching Problem: Cardinal Utilities And Optimization, Sinan Aksoy, Alexander Adam Azzam, Chaya Coppersmith, Julie Glass, Gizem Karaali, Xueying Zhao, Xinjing Zhu
Pomona Faculty Publications and Research
The school choice problem concerns the design and implementation of matching mechanisms that produce school assignments for students within a given public school district. Previously considered criteria for evaluating proposed mechanisms such as stability, strategyproofness and Pareto efficiency do not always translate into desirable student assignments. In this note, we explore a class of one-sided, cardinal utility maximizing matching mechanisms focused exclusively on student preferences. We adapt a well-known combinatorial optimization technique (the Hungarian algorithm) as the kernel of this class of matching mechanisms. We find that, while such mechanisms can be adapted to meet desirable criteria not met by …