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 151 - 180 of 2384
Full-Text Articles in Computer Sciences
To Which Interdisciplinary Research Collaborations Should We Pay More Attention?, Miroslav Svitek, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong
To Which Interdisciplinary Research Collaborations Should We Pay More Attention?, Miroslav Svitek, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong
Departmental Technical Reports (CS)
Interdisciplinary research is very important in modern science. However, such a research is not easy, it often needs support and help. Resources that can be used for such a support are limited, so we need to decide which of many possible collaborations we should support. In this paper, we provide a natural simple model of collaboration effectiveness. Based on this model, we conclude that we should support collaborations for which the vector product of the participants' knowledge vectors attains the largest values.
Why Decisions Based On The Results Of Worst-Case, Most Realistic, And Best-Case Scenarios Work Well?, Miroslav Svitek, Olga Kosheleva, Vladik Kreinovich, Chon Van Le
Why Decisions Based On The Results Of Worst-Case, Most Realistic, And Best-Case Scenarios Work Well?, Miroslav Svitek, Olga Kosheleva, Vladik Kreinovich, Chon Van Le
Departmental Technical Reports (CS)
Often, to make an appropriate decision, people try three scenarios: the worst case, the most realistic case, and the best case. This three-scenarios approach often leads to reasonable decisions. A natural question is: why worst case and best case? These extreme cases mean that all numerous independent random factors work in the same direction: either are all stacked for or are all stacked against. Such stacking of random factors is highly improbable. So, at first glance, it would be more beneficial to use more realistic scenarios than the worst case and the best case. However, empirically, decisions based on the …
Why Green Wavelength Is Closer To Blue Than To Red And How It Is Related To Computations: Information-Based Explanation, Victor L. Timchenko, Yury P. Kondratenko, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong
Why Green Wavelength Is Closer To Blue Than To Red And How It Is Related To Computations: Information-Based Explanation, Victor L. Timchenko, Yury P. Kondratenko, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong
Departmental Technical Reports (CS)
In our previous papers, we analyzed the idea of using light signals of three basic color -- red, green, and blue -- to speed up computations, in particular fuzzy-related computations. A natural question is: why red, green, and blue? Why not select some other colors: e.g., from the wavelength viewpoint, green is much closer to blue than to green, so why not select colors whose distribution is more even? In this paper, we show that if we consider this problem from the information viewpoint, then the corresponding equal-information criterion indeed implies that the intermediate wavelength should be closer to the …
Training Neural Networks On Interval Data: Unexpected Results And Their Explanation, Edwin Tomy George, Vladik Kreinovich, Christoph Lauter, Martine Ceberio, Luc Jaulin
Training Neural Networks On Interval Data: Unexpected Results And Their Explanation, Edwin Tomy George, Vladik Kreinovich, Christoph Lauter, Martine Ceberio, Luc Jaulin
Departmental Technical Reports (CS)
In many practically useful numerical computations, training-and-then-using a neural network turned out to be a much faster alternative than running the original computations. When we applied a similar idea to take into account interval uncertainty, we encountered two unexpected results: (1) that while for numerical computations, it is usually better to represent an interval by its midpoint and half-width, for neural networks, it is more efficient to represent an interval by its endpoints, and (2) that while usually, it is better to train a neural network on the whole data processing algorithm, in our problems, it turned out to be …
A Staged Approach Using Machine Learning And Uncertainty Quantification To Predict The Risk Of Hip Fracture, Anjum Shaik, Kristoffer A. Larsen, Nancy E. Lane, Chen Zhao, Kuan Jui Su, Joyce H. Keyak, Qing Tian, Qiuying Sha, Hui Shen, Hong Wen Deng, Weihua Zhou
A Staged Approach Using Machine Learning And Uncertainty Quantification To Predict The Risk Of Hip Fracture, Anjum Shaik, Kristoffer A. Larsen, Nancy E. Lane, Chen Zhao, Kuan Jui Su, Joyce H. Keyak, Qing Tian, Qiuying Sha, Hui Shen, Hong Wen Deng, Weihua Zhou
Michigan Tech Publications
Hip fractures present a significant healthcare challenge, especially within aging populations, where they are often caused by falls. These fractures lead to substantial morbidity and mortality, emphasizing the need for timely surgical intervention. Despite advancements in medical care, hip fractures impose a significant burden on individuals and healthcare systems. This paper focuses on the prediction of hip fracture risk in older and middle-aged adults, where falls and compromised bone quality are predominant factors. The study cohort included 547 patients, with 94 experiencing hip fracture. To assess the risk of hip fracture, clinical variables and clinical variables combined with hip DXA …
What If The Resulting Interval Is Too Wide: From A Heuristic Fuzzy-Technique Idea To A Mathematically Justified Approach, Marc Fina, Vladik Kreinovich
What If The Resulting Interval Is Too Wide: From A Heuristic Fuzzy-Technique Idea To A Mathematically Justified Approach, Marc Fina, Vladik Kreinovich
Departmental Technical Reports (CS)
In engineering designs, we usually need to make sure that the values of some characteristics y do not exceed a certain threshold y0 – e.g., that the stress at each location does not exceed a certain critical value. Usually, we know how each of these characteristics y depends on the design parameters x1, . . . ,xn, i.e., we know the function y= f (x1, . . . ,xn). However, it is not enough to use the nominal values of the design parameters in our analysis, since the actual values are, in general, somewhat different from the nominal values. Often, …
Shapley Value Under Interval Uncertainty And Partial Information, Kittawit Autchariyapanikul, Olga Kosheleva, Vladik Kreinovich
Shapley Value Under Interval Uncertainty And Partial Information, Kittawit Autchariyapanikul, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In the 1950s, the future Nobelist Lloyd Shapley solved the problem of how to fairly divide the common gain. Namely, he showed that some reasonable requirements determine a unique division -- which is now known as the Shapley value. The main limitation of Shapley's solution is that it assumes that for each subgroup of the original group of participants, we know exactly how much this group could gain if it acted by itself, without involving others. In practice, we rarely know these exact values. At best, we know the bounds on each such value -- i.e., in other words, an …
Sociomathematical Norms And Automated Proof Checking In Mathematical Education: Reflections And Experiences, Merlin Carl
Sociomathematical Norms And Automated Proof Checking In Mathematical Education: Reflections And Experiences, Merlin Carl
Journal of Humanistic Mathematics
According to a widely held view, mathematical proofs are essentially (indications of) formal derivations, and thus in principle mechanically checkable (this view is defended, for example, by Azzouni [3]). This should in particular hold for the kind of simple proof exercises typically given to students of mathematics learning to write proofs. If that is so, then automated proof checking should be an attractive option for math education at the undergraduate level. An opposing view would be that mathematical proofs are social objects and that what constitutes a mathematical proof can thus not be separated from the social context in which …
Parallel Multigrid In Time For Chaotic Dynamical Systems, David Alan Vargas
Parallel Multigrid In Time For Chaotic Dynamical Systems, David Alan Vargas
Mathematics & Statistics ETDs
Despite the fact that Parallel-in-Time (PinT) methods are predicted to become necessary to fully utilize next-generation exa- and zettascale machines, there are currently no known practical methods which scale well with the length of the time-domain for chaotic problems, due to exponential dependence of the condition number on the fastest chaotic timescale. I present modifications to the coarse-grid equations along with a novel rediscretization approach which together greatly improve convergence of the multigrid reduction in time (MGRIT) algorithm and allow the first known PinT speedup for a chaotic PDE. The novel Local Shadowing Relaxation (LSR) is presented as an alternative …
If Subsequent Results Are Too Easy To Obtain, The Proof Most Probably Has Errors: Explanation Of The Empirical Observation, Olga Kosheleva, Vladik Kreinovich
If Subsequent Results Are Too Easy To Obtain, The Proof Most Probably Has Errors: Explanation Of The Empirical Observation, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
Many modern mathematical proofs are very complex, checking them is difficult; as a result, errors sneak into published proofs, even into proofs published in highly reputable journals. Sometimes, the errors are repairable, but sometimes, it turns out that the supposedly proven result is actually wrong. When the error is not noticed for some time, the published result is used to prove many other results -- and when the error is eventually found, all these new results are invalidated. This happened several times. Since it is not realistic to more thoroughly check all the proofs, and we want to minimize the …
Why Angles Between Galactic Center Filaments And Galactic Plane Follow A Bimodal Distribution: A Symmetry-Based Explanation, Julio C. Urenda, Vladik Kreinovich
Why Angles Between Galactic Center Filaments And Galactic Plane Follow A Bimodal Distribution: A Symmetry-Based Explanation, Julio C. Urenda, Vladik Kreinovich
Departmental Technical Reports (CS)
Recent observations have shown that the angles between the Galaxy Center filaments and the Galactic plane follow a bimodal distribution: a large number of filaments are approximately orthogonal to the Galactic plane, a large number of filaments are approximately parallel to the Galactic plane, and much fewer filaments have other orientations. In this paper, we show this bimodal distribution can be explained by natural geometric symmetries.
Why Seismicity In Ireland Is Low: A Possible Geometric Explanation, Julio C. Urenda, Aaron Velasco, Vladik Kreinovich
Why Seismicity In Ireland Is Low: A Possible Geometric Explanation, Julio C. Urenda, Aaron Velasco, Vladik Kreinovich
Departmental Technical Reports (CS)
For each geographic location, its seismicity level is usually determined by how close this location is to the boundaries of tectonic plates. However, there is one notable exception: while Ireland and Britain are at approximately the same distance from such boundaries, the seismicity level in Ireland is much lower than in Britain. A recent paper provided a partial explanation for this phenomenon: namely, it turns out that the lithosphere under Ireland is unusually thick, and this can potentially lead to lower seismicity. However, the current explanation of the relation between the lithosphere thickness and seismicity level strongly depends on the …
Is Alaska Negative-Tax Arrangement Fair? Almost: Mathematical Analysis, Chon Van Le, Vladik Kreinovich
Is Alaska Negative-Tax Arrangement Fair? Almost: Mathematical Analysis, Chon Van Le, Vladik Kreinovich
Departmental Technical Reports (CS)
In the State of Alaska there is no state income tax. Instead, there is a negative tex: every year every resident gets some money from the state. At present, every resident -- from the poorest to the richest -- gets the exact same amount of money: in 2024, it is expected to be around $1500. A natural question is: Is this fair? Maybe poor people should get more since their needs are greater? Maybe the rich people should get proportionally more, since fairness means equal added happiness for all, and for rich people, extra $1500 is barely noticeable? There have …
For 2 X N Cases, Proportional Fitting Problem Reduces To A Single Equation, Olga Kosheleva, Vladik Kreinovich
For 2 X N Cases, Proportional Fitting Problem Reduces To A Single Equation, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practical situations, for each of two classifications, we know the probabilities that a randomly selected object belong to different categories. For example, we know what proportion of people are below 20 years old, what proportion is between 20 and 30, etc., and we also know what proportion of people earns less than 10K, between 10K and 20K, etc. In such situations, we are often interested in proportion of people who are classified by two classifications into two given categories. For example, we are interested in the proportion of people whose age is between 20 and 30 and whose …
Stochastic Dominance: Cases Of Interval And P-Box Uncertainty, Kittawit Autchariyapanikul, Olga Kosheleva, Vladik Kreinovich
Stochastic Dominance: Cases Of Interval And P-Box Uncertainty, Kittawit Autchariyapanikul, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
Traditional decision theory recommendation about making a decision assume that we know both the probabilities of different outcomes of each possible decision, and we know the utility function -- that describes the decision maker's preferences. Sometimes, we can make a recommendation even when we only have partial information about utility. Such cases are known as cases of stochastic dominance. In other cases, in addition to not knowing the utility function, we also only have partial information about the probabilities of different outcomes. For example, we may only known bounds on the outcomes (case of interval uncertainty) or bounds on the …
A Portable Numerical Library For The Calculation Of Multi-Dimensional Integrals, Ioannis Sakiotis
A Portable Numerical Library For The Calculation Of Multi-Dimensional Integrals, Ioannis Sakiotis
Computer Science Theses & Dissertations
Multi-dimensional numerical integration is a prevalent task in physics and other scientific fields, e.g., in the simulation of particle-beam dynamics and Bayesian parameter estimation. Scientific computing applications that simulate complex phenomena may require the solution to numerous multi-variate integrals. However, functions that have features such as sharp peaks or oscillations in high dimensional spaces, can result in an exorbitant number of computations. For many cases, convergence to accurate results in a reasonable amount of time is infeasible with existing numerical libraries. One approach towards making multi-dimensional integration viable is to parallelize existing algorithms. No commonly available algorithms or libraries exist …
Enhancing Tumor Classification Through Machine Learning Algorithms For Breast Cancer Diagnosis, Lawrence Agbota, Edmund F. Agyemang, Priscilla Kissi-Appiah, Lateef Moshood, Akua Osei- Nkwantabisa, Vincent Agbenyeavu, Abraham Nsiah, Augustina Adjei
Enhancing Tumor Classification Through Machine Learning Algorithms For Breast Cancer Diagnosis, Lawrence Agbota, Edmund F. Agyemang, Priscilla Kissi-Appiah, Lateef Moshood, Akua Osei- Nkwantabisa, Vincent Agbenyeavu, Abraham Nsiah, Augustina Adjei
School of Mathematical & Statistical Sciences Faculty Publications
In cancer diagnosis, machine learning helps improve cancer detection by providing doctors with a second perspective and allowing for faster and more accurate determination and decisions. Numerous studies have used both classic machine learning approaches and deep learning to address cancer classification. In this study, we examine the efficacy of five commonly used machine learning algorithms; both traditional and deep learning models namely, Logistic Regression, Support Vector Machines (SVM), Random Forest (RF), Decision Tree and Deep Neural Networks (DNN). We analyze their ability to properly classify tumors as Benign or Malignant using the Wisconsin breast cancer dataset (WBCD). Random Forest …
Mixed Uncertainty Analysis On Pumping By Peristaltic Hearts Using Dempster-Shafer Theory, Yanyan He, Nicholas A. Battista, Lindsay D. Waldrop
Mixed Uncertainty Analysis On Pumping By Peristaltic Hearts Using Dempster-Shafer Theory, Yanyan He, Nicholas A. Battista, Lindsay D. Waldrop
Biology, Chemistry, and Environmental Sciences Faculty Articles and Research
In this paper, we introduce the numerical strategy for mixed uncertainty propagation based on probability and Dempster–Shafer theories, and apply it to the computational model of peristalsis in a heart-pumping system. Specifically, the stochastic uncertainty in the system is represented with random variables while epistemic uncertainty is represented using non-probabilistic uncertain variables with belief functions. The mixed uncertainty is propagated through the system, resulting in the uncertainty in the chosen quantities of interest (QoI, such as flow volume, cost of transport and work). With the introduced numerical method, the uncertainty in the statistics of QoIs will be represented using belief …
How To Propagate Uncertainty Via Ai Algorithms, Olga Kosheleva, Vladik Kreinovich
How To Propagate Uncertainty Via Ai Algorithms, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
Any data processing starts with measurement results. Measurement results are never absolutely accurate. Because of this measurement uncertainty, the results of processing measurement results are, in general, somewhat different from what we would have obtained if we knew the exact values of the measured quantities. To make a decision based on the result of data processing, we need to know how accurate is this result, i.e., we need to propagate the measurement uncertainty through the data processing algorithm. There are many techniques for uncertainty propagation. Usually, they involve applying the same data processing algorithm several times to appropriately modified data. …
For Discrete-Time Linear Dynamical Systems Under Interval Uncertainty, Predicting Two Moments Ahead Is Np-Hard, Luc Jaulin, Olga Kosheleva, Vladik Kreinovich
For Discrete-Time Linear Dynamical Systems Under Interval Uncertainty, Predicting Two Moments Ahead Is Np-Hard, Luc Jaulin, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In the first approximation, when changes are small, most real-world systems are described by linear dynamical equations. If we know the initial state of the system, and we know its dynamics, then we can, in principle, predict the system's state many moments ahead. In practice, however, we usually know both the initial state and the coefficients of the system's dynamics with some uncertainty. Frequently, we encounter interval uncertainty, when for each parameter, we only know its range, but we have no information about the probability of different values from this range. In such situations, we want to know the range …
How To Make Ai More Reliable, Olga Kosheleva, Vladik Kreinovich
How To Make Ai More Reliable, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
One of the reasons why the results of the current AI methods (especially deep-learning-based methods) are not absolutely reliable is that, in contrast to more traditional data processing techniques which are based on solid mathematical and statistical foundations, modern AI techniques use a lot of semi-heuristic methods. These methods have been, in many cases, empirically successful, but the absence of solid justification makes us less certain that these methods will work in other cases as well. To make AI more reliable, it is therefore necessary to provide mathematical foundations for the current semi-heuristic techniques. In this paper, we show that …
What To Do If An Inflexible Tolerance Problem Has No Solutions: Probabilistic Justification Of Piegat's Semi-Heuristic Idea, Olga Kosheleva, Vladik Kreinovich
What To Do If An Inflexible Tolerance Problem Has No Solutions: Probabilistic Justification Of Piegat's Semi-Heuristic Idea, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practical situations, it is desirable to select the control parameters x1, ..., xn in such a way that the resulting quantities y1, ..., ym of the system lie within desired ranges. In such situations, we usually know the general formulas describing the dependence of yi on xj, but the coefficients of these formulas are usually only known with interval uncertainty. In such a situation, we want to find the tuples for which all yi's are in the desired intervals for all possible tuples of coefficients. But what if no such parameters are possible? Since we cannot guarantee the …
Why Magenta Is Not A Real Color, And How It Is Related To Fuzzy Control And Quantum Computing, Victor L. Timchenko, Yuriy P. Kondratenko, Olga Kosheleva, Vladik Kreinovich
Why Magenta Is Not A Real Color, And How It Is Related To Fuzzy Control And Quantum Computing, Victor L. Timchenko, Yuriy P. Kondratenko, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
It is well known that every color can be represented as a combination of three basic colors: red, green, and blue. In particular, we can get several colors by combining two of the basic colors. Interestingly, while a combination of two neighboring colors leads to a color that corresponds to a certain frequency, the combination of two non-neighboring colors -- red and blue -- leads to magenta, a color that does not correspond to any frequency. In this paper, we provide a simple explanation for this phenomenon, and we also show that a similar phenomenon happens in two other areas …
Why Fully Consistent Quantum Field Theories Require That The Space-Time Be At Least 10-Dimensional: A Commonsense Field-Based Explanation, Olga Kosheleva, Vladik Kreinovich
Why Fully Consistent Quantum Field Theories Require That The Space-Time Be At Least 10-Dimensional: A Commonsense Field-Based Explanation, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
It is known that quantum field theories that describe fields in our usual 4-dimensional space-times are not fully consistent: they predict meaningless infinite values for some physical quantities. There are some known tricks to avoid such infinities, but it is definitely desirable to have a fully consistent theory, a theory that would produce correct results without having to use additional tricks. It turns out that the only way to have such a theory is to consider space-times of higher dimensions, the smallest of which is 10. There are complex mathematical reasons for why 10 is the smallest such dimension. However, …
Towards A More Subtle (And Hopefully More Adequate) Fuzzy "And"-Operation: Normalization-Invariant Multi-Input Aggregation Operators, Yusuf Güven, Vladik Kreinovich
Towards A More Subtle (And Hopefully More Adequate) Fuzzy "And"-Operation: Normalization-Invariant Multi-Input Aggregation Operators, Yusuf Güven, Vladik Kreinovich
Departmental Technical Reports (CS)
Many reasonable conditions have been formulated for a fuzzy "and"-operation: idempotency, commutativity, associativity, etc. It is known that the only "and"-operation that satisfies all these conditions is minimum, but minimum is not the most adequate description of expert's "and", and it often does not lead to the best control or the best decision. Many other more adequate "and"-operations (t-norms) have been proposed and effectively used, but they do not satisfy the natural idempotency condition. In this paper, we show that a small relaxation of the usual description of "and"-operations leads to the possibility of non-minimum idempotent operations. We also show …
Why Empirical Membership Functions Are Well-Approximated By Piecewise Quadratic Functions: Theoretical Explanation For Empirical Formulas Of Novak's Fuzzy Natural Logic, Olga Kosheleva, Vladik Kreinovich
Why Empirical Membership Functions Are Well-Approximated By Piecewise Quadratic Functions: Theoretical Explanation For Empirical Formulas Of Novak's Fuzzy Natural Logic, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
Empirical analysis shows that membership functions describing expert opinions have a shape that is well described by a smooth combination of two quadratic segments. In this paper, we provide a theoretical explanation for this empirical phenomenon.
Why Is Grade Distribution Often Bimodal? Why Individualized Teaching Adds Two Sigmas To The Average Grade? And How Are These Facts Related?, Christian Servin, Olga Kosheleva, Vladik Kreinovich
Why Is Grade Distribution Often Bimodal? Why Individualized Teaching Adds Two Sigmas To The Average Grade? And How Are These Facts Related?, Christian Servin, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
To make education more effective, to better use emerging technologies in education, we need to better understand the education process, to gain insights on this process. How can we check whether a new idea is indeed a useful insight? A natural criterion is that the new idea should explain some previously-difficult-to-explain empirical phenomenon. Since one of the main advantages of emerging educational technologies -- such as AI -- is the possibility of individualized education, a natural phenomenon to explain is the fact -- discovered by Benjamin Bloom -- that individualization adds two sigmas to the average grade. In this paper, …
Topics In The Study Of The Pragmatic Functions Of Phonetic Reduction In Dialog, Nigel G. Ward, Carlos A. Ortega
Topics In The Study Of The Pragmatic Functions Of Phonetic Reduction In Dialog, Nigel G. Ward, Carlos A. Ortega
Departmental Technical Reports (CS)
Reduced articulatory precision is common in speech, but for dialog its acoustic properties and pragmatic functions have been little studied. We here try to remedy this gap. This technical report contains content that was omitted from the journal article (Ward et. al, submitted). Specifically, we here report 1) lessons learned about annotating for perceived reduction, 2) the finding that, unlike in read speech, the correlates of reduction in dialog include high pitch, wide pitch range, and intensity, and 3) a baseline model for predicting reduction in dialog, using simple acoustic/prosodic features, that achieves correlations with human perceptions of 0.24 for …
How To Make A Neural Network Learn From A Small Number Of Examples -- And Learn Fast: An Idea, Chitta Baral, Vladik Kreinovich
How To Make A Neural Network Learn From A Small Number Of Examples -- And Learn Fast: An Idea, Chitta Baral, Vladik Kreinovich
Departmental Technical Reports (CS)
Current deep learning techniques have led to spectacular results, but they still have limitations. One of them is that, in contrast to humans who can learn from a few examples and learn fast, modern deep learning techniques require a large amount of data to learn, and they take a long time to train. In this paper, we show that neural networks do have a potential to learn from a small number of examples -- and learn fast. We speculate that the corresponding idea may already be implicitly implemented in Large Language Models -- which may partially explain their (somewhat mysterious) …
Murmurations And Root Numbers, Alexey Pozdnyakov
Murmurations And Root Numbers, Alexey Pozdnyakov
University Scholar Projects
We report on a machine learning investigation of large datasets of elliptic curves and L-functions. This leads to the discovery of murmurations, an unexpected correlation between the root numbers and Dirichlet coefficients of L-functions. We provide a formal definition of murmurations, describe the connection with 1-level density, and provide three examples for which the murmuration phenomenon has been rigorously proven. Using our understanding of murmurations, we then build new machine learning models in search of a polynomial time algorithm for predicting root numbers. Based on our models and several heuristic arguments, we conclude that it is unlikely for …