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 121 - 150 of 2384
Full-Text Articles in Computer Sciences
Analyzing Political Sentiment On Micro-Blogging Data: A Lexicon And Machine Learning Approach To The 2024 U.S. Presidential Election, Ava Grey
CMC Senior Theses
This paper explores the trends in sentiment towards U.S. presidential candidates Kamala Harris and Donald Trump through micro-blogging social media text during the five months leading up to the election. Two datasets of varying sizes and origins were used to contextualize and validate analysis findings. The analyses include both a lexicon-based approach and a machine learning predictive method. Common sentiment analysis techniques like term frequency, term frequency inverse, various lexicons, and n-grams were utilized during the lexicon approach. During the modeling, a random forest was utilized in addition to the methods used during the lexicon approach. Results showed that overall …
Enhancing The Accuracy Of Image Classification For Degenerative Brain Diseases With Cnn Ensemble Models Using Mel-Spectrograms, Sang-Ha Sung, Michael Pokojovy, Do-Young Kang, Woo-Yong Bae, Yeon-Jae Hong, Sangjin Kim
Enhancing The Accuracy Of Image Classification For Degenerative Brain Diseases With Cnn Ensemble Models Using Mel-Spectrograms, Sang-Ha Sung, Michael Pokojovy, Do-Young Kang, Woo-Yong Bae, Yeon-Jae Hong, Sangjin Kim
Mathematics & Statistics Faculty Publications
Alzheimer’s disease (AD) and Parkinson’s disease (PD) are prevalent neurodegenerative disorders among the elderly, leading to cognitive decline and motor impairments. As the population ages, the prevalence of these neurodegenerative disorders is increasing, providing motivation for active research in this area. However, most studies are conducted using brain imaging, with relatively few studies utilizing voice data. Using voice data offers advantages in accessibility compared to brain imaging analysis. This study introduces a novel ensemble-based classification model that utilizes Mel spectrograms and Convolutional Neural Networks (CNNs) to distinguish between healthy individuals (NM), AD, and PD patients. A total of 700 voice …
Bytes, Banter, And The Bible: An Interdisciplinary Account Of Objective Meaning, Cameron Bonin
Bytes, Banter, And The Bible: An Interdisciplinary Account Of Objective Meaning, Cameron Bonin
Senior Honors Theses
The claim that the Bible has objective meaning is contested in a postmodern world. This claim can be more persuasively defended when it is addressed by insights from multiple disciplines. In particular, the field of computer science is apt to illuminate the concept of meaning through its reflection on the nature of languages and its concern with the accurate transmission of information. By synthesizing insights from the field of computer science, such as that of Claude Shannon, with Nicholas Wolterstorff’s use of speech-act theory, the concept of meaning can be understood more clearly. Consequently, this synthesis assists in answering questions …
Estimating The Gender Wage Gap: A Comparative Analysis Of Different Estimators, Xinran Zhang
Estimating The Gender Wage Gap: A Comparative Analysis Of Different Estimators, Xinran Zhang
Mathematics, Statistics, and Computer Science Honors Projects
The gender wage gap between males and females has been well studied by labor economists. We take a multi-prong approach to evaluate three estimators —a regression-imputation estimator, a weighting estimator, and a doubly robust estimator—in estimating the gender wage gap. Using the Panel Study of Income Dynamics, we conduct an empirical study of the estimators’ performances. In a simulation study, we evaluate the properties of estimators and study whether bootstrapping is an appropriate measure of the uncertainty of each estimator. The findings show that while the estimators provide different results, the doubly robust estimator provides reliable and consistent results under …
A Bibliographic And Topic Modeling Analysis Of The P-Adic Theory Literature Using Latent Dirichlet Allocation, Humberto Llinás, Ismael Gutiérrez, Anselmo Torresblanca, Javier De La Hoz, Brian Llinás
A Bibliographic And Topic Modeling Analysis Of The P-Adic Theory Literature Using Latent Dirichlet Allocation, Humberto Llinás, Ismael Gutiérrez, Anselmo Torresblanca, Javier De La Hoz, Brian Llinás
Computer Science Faculty Publications
P-adic analysis, introduced by Kurt Hensel in the early 20th century, has developed into a fundamental area of mathematical research with broad applications in number theory, algebraic geometry, and mathematical physics. This study aims to examine the thematic evolution and scholarly impact of p-adic research through a comprehensive topic modeling and bibliometric analysis. Using classical bibliometric techniques (e.g., performance analysis, co-authorship, and co-citation networks) combined with Latent Dirichlet Allocation (LDA), we analyzed 7388 peer-reviewed documents published between 1965 and 2024. The computational workflow was conducted using R (version 4.4.1) and VOSviewer (version 1.6.20), which enabled the identification of 20 distinct …
Studies On Convexity Of Dnf Formulae, Josue A. Ruiz
Studies On Convexity Of Dnf Formulae, Josue A. Ruiz
Electronic Theses & Dissertations (2024 - present)
In this dissertation, we investigate the problem of determining whether a Boolean formula given in disjunctive normal form (DNF) is convex. Although Boolean formulas have various applications, our research focuses on the practical application for rule-based access control policies, where policies are often expressed as a set of Boolean rules. Understanding the structural properties of such formulas is crucial for determining whether a policy can be efficiently represented within a specific access control model.
The main contribution of this research is the conception and analysis of convexity derived from the “gap problem.” In this context, convexity is characterized by the …
Securing Secrets: Exploring The Aes Encryption And Key Security Capabilities Of Chatgpt, Kayla Taylor
Securing Secrets: Exploring The Aes Encryption And Key Security Capabilities Of Chatgpt, Kayla Taylor
Student Works
The development and increasing accessibility of generative artificial intelligence (AI) tools and large language models (LLMs) have allowed cryptographers to explore a variety of cryptanalysis problems in dynamic and interactive ways. Prompt engineering, the process by which input text is tested and refined to elicit a desired response from LLMs, is a nascent area of research that remains largely unexplored in many contexts, including cryptography. This study will explore the potential applications and limitations of prompt engineering in the context of Advanced Encryption Standard (AES) encryption and key security with OpenAI’s ChatGPT (GPT-4o) through two main objectives: First, given a …
Calculation And Statistical Analysis Of Wins Above Replacement, Joshua Taylor
Calculation And Statistical Analysis Of Wins Above Replacement, Joshua Taylor
Departmental Honors & Graduate Capstone Projects
The Wins Above Replacement (WAR) statistic in Major League Baseball is a prominent metric used to estimate player value by quantifying all aspects of play in terms of wins added to a baseball team. We will use R to calculate WAR for all players from 1871 to 2012 and use data from those years to construct multivariate predictive models to attempt to estimate WAR for players from 2013 to 2024. We find strong correlations between predicted and actual WAR values for most models, with the exception of the polynomial predictive model for non-qualified pitchers.
Applications Of Neural Networks In Parkinson’S Disease Diagnosis, Saladin Minhaaj
Applications Of Neural Networks In Parkinson’S Disease Diagnosis, Saladin Minhaaj
Theses
Parkinson's disease (PD) is a complex and debilitating neurodegenerative disorder that affects millions of people worldwide. Early and accurate diagnosis is crucial for effective treatment and management of PD. This thesis explores the application of neural networks in PD diagnosis, leveraging their ability to learn patterns from large datasets and make accurate predictions.
Thesis provides an overview of PD, including its symptoms, diagnosis, and current challenges in diagnosis. We then delve into the fundamentals of neural networks, including supervised learning, mathematical interpretations, and parametric models. This research focuses on the development of neural network models that can accurately diagnose PD …
Why Linear Faults Have Fewer Earthquakes: A Geometric Explanation, Julio C. Urenda, Aaron Velasco, Olga Kosheleva, Vladik Kreinovich
Why Linear Faults Have Fewer Earthquakes: A Geometric Explanation, Julio C. Urenda, Aaron Velasco, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
Earthquakes usually occur in the vicinity of fault lines. Until recently, geophysical analysis implied that the fault shape should not strongly affect the frequency of its earthquakes. However, recent statistical analysis has shown that faults whose shape is close to linear experience much fewer earthquakes than faults of more complex shape. Based on this empirical fact, researchers have adjusted the corresponding geophysical models, so the updated models do explain this newly discovered phenomenon. The experience of geophysics shows that the updated model will probably need to be updated again when new data appears. It is therefore desirable to come up …
Fair Economic Division: How To Modify Shapley Value To Take Into Account That Different People Have Different Productivity, Christian Servin, Vladik Kreinovich
Fair Economic Division: How To Modify Shapley Value To Take Into Account That Different People Have Different Productivity, Christian Servin, Vladik Kreinovich
Departmental Technical Reports (CS)
Purpose: When several participants, working together, gained some amount of money, what is the fair way to distribute this amount between them? This is the problem that the future Nobelist Lloyd Shapley was working on when he proposed what is now called the Shapley value -- a division uniquely determined by natural fairness assumptions. However, this solutions is not universal: it assumes that all participants are equal -- in particular, that they have equal productivity. In practice, people have different productivity levels, and these productivity levels can differ a lot: e.g., some software engineers are several times more productive than …
How Shapley Value And Its Generalizations Can Help In The Analysis Of Complex Engineering Systems And What Next, Niklas Winnewisser, Michael Beer, Olga Kosheleva, Vladik Kreinovich
How Shapley Value And Its Generalizations Can Help In The Analysis Of Complex Engineering Systems And What Next, Niklas Winnewisser, Michael Beer, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
For a complex engineering system -- such as a city's street network -- it is important to predict how its functionality is decreased when some of these components break down, and, if repairs are needed and repairs budget is limited, which subset of the set of components should be repaired first to maximize the resulting functionality. For systems with a large number of components, the number of possible subsets is astronomical, we cannot try to simulate all these subsets. So, the natural idea is to approximate the actual dependence of functionality on the subset by a simple expression -- linear …
What Is Optimal Granularity When Estimating Reliability Of A Complex Engineering Systems, Niklas Winnewisser, Michael Beer, Olga Kosheleva, Vladik Kreinovich
What Is Optimal Granularity When Estimating Reliability Of A Complex Engineering Systems, Niklas Winnewisser, Michael Beer, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
For complex engineering systems, the usual way to estimate their reliability is to run simulations. If the resulting estimate does not satisfy the desired reliability level, we must replace some components with more reliable and again run simulations. This can take several iterations, so the required computation time often becomes unrealistically long. It is known that it is possible to speed up computations if components belong to a few types, and components of each type are identical. So, a natural idea to deal with the general case is to use the general granularity idea, i.e., to group components with similar …
Is Energy Local? Counterintuitive Non-Locality Of Energy In General Relativity Can Be Naturally Explained On The Newtonian Level, Olga Kosheleva, Vladik Kreinovich
Is Energy Local? Counterintuitive Non-Locality Of Energy In General Relativity Can Be Naturally Explained On The Newtonian Level, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
From the physics viewpoint, energy is the ability to perform work. To estimate how much work we can perform, physicists developed several formalisms. For example, for the fields, once we know the Lagrangian, we can find the energy density and, by integrating it, estimate the overall energy of the field. Usually, this adequately describe how much work this field can perform. However, there is an exception -- gravitational field in General Relativity. The known formalism to compute its energy density leads to 0 -- and by integrating this 0, we get a counterintuitive conclusion that the overall energy of the …
Logarithmic Number System Is Optimal For Ai Computations: Theoretical Explanation Of Empirical Success, Olga Kosheleva, Vladik Kreinovich, Christoph Lauter, Kristalys Ruiz-Rohena
Logarithmic Number System Is Optimal For Ai Computations: Theoretical Explanation Of Empirical Success, Olga Kosheleva, Vladik Kreinovich, Christoph Lauter, Kristalys Ruiz-Rohena
Departmental Technical Reports (CS)
Everyone knows the success story of machine-learning AI. However, the current AI tools are not perfect. We know how to make them better: every time we increase the amount of computations by the order of magnitude, we get a drastic improvement in the performance of the resulting machine learning tools. Training modern AI system requires a tremendous amount of computations -- that already take a lot of time. So, to increase the number of computations, we need to make each computation step faster. One way to do that is to use low-precision arithmetic operations, e.g., with 1 byte per real …
Algotric: Symmetric And Asymmetric Encryption Algorithms For Cryptography – A Comparative Analysis In Ai Era, Naresh Kshetri, Mir Mehedi Rahman, Md Masud Rana, Omar Faruq Osama, James Hutson
Algotric: Symmetric And Asymmetric Encryption Algorithms For Cryptography – A Comparative Analysis In Ai Era, Naresh Kshetri, Mir Mehedi Rahman, Md Masud Rana, Omar Faruq Osama, James Hutson
Faculty Scholarship
The increasing integration of artificial intelligence (AI) within cybersecurity has necessitated stronger encryption methods to ensure data security. This paper presents a comparative analysis of symmetric (SE) and asymmetric encryption (AE) algorithms, focusing on their role in securing sensitive information in AI-driven environments. Through an in-depth study of various encryption algorithms such as AES, RSA, and others, this research evaluates the efficiency, complexity, and security of these algorithms within modern cybersecurity frameworks. Utilizing both qualitative and quantitative analysis, this research explores the historical evolution of encryption algorithms and their growing relevance in AI applications. The comparison of SE and AE …
Computational Representation, Analysis And Verification Of Requirements In Engineering Design And Systems Engineering, Chandan Kumar Sahu
Computational Representation, Analysis And Verification Of Requirements In Engineering Design And Systems Engineering, Chandan Kumar Sahu
All Dissertations
Systems are developed to satisfy a set of requirements derived from stakeholders’ needs, defining the problem space for which the system is created as a feasible solution. The system design process begins with eliciting these requirements and concludes with validating whether the created system meets them. Requirements engineering (RE) encompasses elicitation, representation, analysis, documentation, verification, and validation. However, challenges in RE, such as imprecision in natural language (NL), proprietary restrictions, and a lack of standardized quality metrics, hinder the creation of well-formed and comprehensive requirements. These challenges complicate formalization and analysis of requirements.
This dissertation addresses these challenges by proposing …
Decoding Neural Networks: An Information-Theoretic Guide To Interpretability, Error Analysis And Efficiency, Mackenzie J. Meni
Decoding Neural Networks: An Information-Theoretic Guide To Interpretability, Error Analysis And Efficiency, Mackenzie J. Meni
Theses and Dissertations
This dissertation addresses critical challenges in neural network design by leveraging entropy-based techniques to improve model efficiency, interpretability, and bias reduction. Focusing on the unique demands of computer vision applications, particularly object detection and classification for real-time systems, this work introduces a series of innovative methods centered on information theory. At the core of these methods is the Probabilistic Explanations of Entropic Knowledge (PEEK) framework, a tool developed to analyze and visualize entropy distributions across feature maps. PEEK offers insights into information flow within neural networks, making it possible to pinpoint layers that contribute meaningfully to decision-making or identify those …
A Dynamical Systems Approach For Modeling Malware Propagating Through A Network And Potential Solutions Towards Mitigating Spread, James Johnson
A Dynamical Systems Approach For Modeling Malware Propagating Through A Network And Potential Solutions Towards Mitigating Spread, James Johnson
Cybersecurity Undergraduate Research Showcase
Many people draw close parallels between malware propagating through a network and an epidemic spreading through a population. Epidemics are often modeled by a Susceptible-Infected-Recovered (SIR) model, in which a similar system of equations can model the spread of a virus through a computer network, and can be simplified when making assumptions about the network itself and its fixed number of nodes and edges. In this instance, malware propagating in a network also should reflect the network it is propagating through, in which the dynamical system will factor in the nodes of the network and their properties. The system itself …
Telu Activation Function For Fast And Stable Deep Learning, Alfredo Fernandez
Telu Activation Function For Fast And Stable Deep Learning, Alfredo Fernandez
USF Tampa Graduate Theses and Dissertations
We propose the Hyperbolic Tangent Exponential Linear Unit (TeLU), a neural network hidden activation function defined as $TeLU(x)=x \cdot tanh(e^x)$. TeLU’s design is grounded in the core principles of key activation functions, achieving strong convergence by closely approximating the identity function in its active region while effectively mitigating the vanishing gradient problem in its saturating region. Its simple formulation enhances computational efficiency, leading to improvements in scalability and convergence speed. Unlike many modern activation functions, TeLU seamlessly combines the simplicity and effectiveness of ReLU with the smoothness and analytic properties essential for learning stability in deep neural networks. TeLU’s ability …
On The Work Of Cartan And Münzner On Isoparametric Hypersurfaces, Thomas E. Cecil, Patrick J. Ryan
On The Work Of Cartan And Münzner On Isoparametric Hypersurfaces, Thomas E. Cecil, Patrick J. Ryan
Mathematics and Computer Science Department Faculty Scholarship
A hypersurface Mn in a real space form Rn+1, Sn+1, or Hn+1 is isoparametric if it has constant principal curvatures. This paper is a survey of the fundamental work of Cartan and Münzner on the theory of isoparametric hypersurfaces in real space forms, in particular, spheres. This work is contained in four papers of Cartan [3]–[6] published during the period 1938–1940, and two papers of Münzner [47]–[48] that were published in preprint form in the early 1970’s, and as journal articles in 1980–1981. These papers of Cartan and Münzner have been the …
Why Geological Angular Unconformity Is Usually Horizontal: A Geometric Explanation, Julio C. Urenda, Aaron Velasco, Olga Kosheleva, Vladik Kreinovich
Why Geological Angular Unconformity Is Usually Horizontal: A Geometric Explanation, Julio C. Urenda, Aaron Velasco, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In several locations, geologists have observed the presence of two differently oriented rock masses, one horizonal (or almost horizontal) and the other somewhat inclined; this phenomenon is known as angular unconformity. Based on the detailed analysis of geophysical processes, geologists conclude that usually, horizontal rock masses are much newer. This is known as the law of original horizontality. From the fundamental viewpoint, it is desirable to take into account that geophysics is a developing science, its models get modified and adjusted as time progresses. It is therefore desirable to come up with an explanation of this phenomenon that would be …
Discrete Time Series Forecasting Of Hive Weight, In-Hive Temperature, And Hive Entrance Traffic In Non-Invasive Monitoring Of Managed Honey Bee Colonies: Part I, Vladimir A. Kulyukin, Daniel Coster, Aleksey V. Kulyukin, William Meikle, Milagra Weiss
Discrete Time Series Forecasting Of Hive Weight, In-Hive Temperature, And Hive Entrance Traffic In Non-Invasive Monitoring Of Managed Honey Bee Colonies: Part I, Vladimir A. Kulyukin, Daniel Coster, Aleksey V. Kulyukin, William Meikle, Milagra Weiss
Computer Science Faculty and Staff Publications
From June to October, 2022, we recorded the weight, the internal temperature, and the hive entrance video traffic of ten managed honey bee (Apis mellifera) colonies at a research apiary of the Carl Hayden Bee Research Center in Tucson, AZ, USA. The weight and temperature were recorded every five minutes around the clock. The 30 s videos were recorded every five minutes daily from 7:00 to 20:55. We curated the collected data into a dataset of 758,703 records (208,760–weight; 322,570–temperature; 155,373–video). A principal objective of Part I of our investigation was to use the curated dataset to investigate …
Two Is Enough, But Three (Or More) Is Better: In Ai And Beyond, Olga Kosheleva, Vladik Kreinovich, Victor L. Timchenko, Yury P. Kondratenko
Two Is Enough, But Three (Or More) Is Better: In Ai And Beyond, Olga Kosheleva, Vladik Kreinovich, Victor L. Timchenko, Yury P. Kondratenko
Departmental Technical Reports (CS)
At present, the most successful AI technique is deep learning -- the use of neural networks that consist of multiple layers. Interestingly, it is well known that neural networks with two data processing layers are sufficient -- in the sense that they can approximate any function with any given accuracy. Because of this, until reasonably recently, researchers and practitioners used such networks. However, recently it turned out, somewhat unexpectedly, that using three or more data processing layers -- i.e., using what is called deep learning -- makes the neural networks much more efficient. In this paper, on numerous examples from …
Some Studies On Mathematical Morphology In Remotely Sensed Data Analysis, Geetika Barman
Some Studies On Mathematical Morphology In Remotely Sensed Data Analysis, Geetika Barman
Doctoral Theses
The application of Mathematical Morphology (MM) techniques has proven to be beneficial in the extraction of shapebased and texture-based features during remote sensing image analysis. The characteristics of these techniques, such as nonlinear adaptability and comprehensive lattice structure, make them useful for contextual spatial feature analysis. Despite the advancements, there are still persistent challenges, including the curse of dimensionality, maintaining spatial correlation, and the adaptability of morphological operators in higher dimensions. The focus of this thesis is to explore the potential of MM-based methods to analyse spatial features in addressing these challenges, specifically in the context of spatialcontextual feature analysis …
Coarse-Gridded Simulation Of The Nonlinear Schrödinger Equation With Machine Learning, Benjamin F. Akers, Kristina O. F. Williams
Coarse-Gridded Simulation Of The Nonlinear Schrödinger Equation With Machine Learning, Benjamin F. Akers, Kristina O. F. Williams
Faculty Publications
A numerical method for evolving the nonlinear Schrödinger equation on a coarse spatial grid is developed. This trains a neural network to generate the optimal stencil weights to discretize the second derivative of solutions to the nonlinear Schrödinger equation. The neural network is embedded in a symmetric matrix to control the scheme’s eigenvalues, ensuring stability. The machine-learned method can outperform both its parent finite difference method and a Fourier spectral method. The trained scheme has the same asymptotic operation cost as its parent finite difference method after training. Unlike traditional methods, the performance depends on how close the initial data …
A Full Description Of All Commutative Associative Polynomial Operations On Probabilities, Miroslav Svitek, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong
A Full Description Of All Commutative Associative Polynomial Operations On Probabilities, Miroslav Svitek, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong
Departmental Technical Reports (CS)
When two events are independent, the probability that both events occur is equal to the product p1 * p2 of the probabilities of each of these events. The probability that at least one of these events will occur is equal to p1 + p2 − p1 * p2. In both cases, we have a commutative associative polynomial operation. A natural question is: how can we describe all possible operations of this type? These operations are described in this paper.
Why Kolmolgorov-Arnold Networks (Kan) Work So Well: A Qualitative Explanation, Hung T. Nguyen, Vladik Kreinovich, Olga Kosheleva
Why Kolmolgorov-Arnold Networks (Kan) Work So Well: A Qualitative Explanation, Hung T. Nguyen, Vladik Kreinovich, Olga Kosheleva
Departmental Technical Reports (CS)
In the usual deep neural network, weights are adjusted during training, but the activation function remains the same. Lately, it was experimentally shown that if, instead of using the same activation function always, we train the activation functions as well, we get a much better results -- i.e., for the networks with the same number of parameters, we get a much better accuracy. Such networks are called Kolmogorov-Arnold networks. In this paper, we provide a general explanation of why these new networks work so well.
How To Check Continuity Based On Approximate Measurement Results, Inese Bula, Vladik Kreinovich
How To Check Continuity Based On Approximate Measurement Results, Inese Bula, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practical situations, a reasonable conjecture is that, e.g., the dependence of some quantity on the spatial location is continuous, with an appropriate bounds on the difference between the values at nearby points. If we knew the exact values of the corresponding quantity, checking this conjecture would be very straightforward. In reality, however, measurement results are only approximations to the actual values. In this paper, we show how to check continuity based on the approximate measurement results.
Three Applications Of Geometric Reasoning: Why Metastasis Is Mostly Caused By Elongated Cancer Cells? How Body Shape Affects Curiosity? Why Ring Fractures In Ice?, Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich
Three Applications Of Geometric Reasoning: Why Metastasis Is Mostly Caused By Elongated Cancer Cells? How Body Shape Affects Curiosity? Why Ring Fractures In Ice?, Julio C. Urenda, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In this paper, we describe three applications of geometric reasoning to important practical problems ranging from micro- to macro-level. Specifically, we use geometric reasoning to explain why metastasis is mostly caused by elongated cancer cell, why curiosity in fish is strongly correlated with body shape, and why ring-shaped fractures appear in Antarctica.