Computer Engineering Commons^™

On Dyadic Parity Check Codes And Their Generalizations, Meraiah Martinez

Department of Mathematics: Dissertations, Theses, and Student Research

In order to communicate information over a noisy channel, error-correcting codes can be used to ensure that small errors don’t prevent the transmission of a message. One family of codes that has been found to have good properties is low-density parity check (LDPC) codes. These are represented by sparse bipartite graphs and have low complexity graph-based decoding algorithms. Various graphical properties, such as the girth and stopping sets, influence when these algorithms might fail. Additionally, codes based on algebraically structured parity check matrices are desirable in applications due to their compact representations, practical implementation advantages, and tractable decoder performance analysis. …

Completeness Of Nominal Props, Samuel Balco, Alexander Kurz

Engineering Faculty Articles and Research

We introduce nominal string diagrams as string diagrams internal in the category of nominal sets. This leads us to define nominal PROPs and nominal monoidal theories. We show that the categories of ordinary PROPs and nominal PROPs are equivalent. This equivalence is then extended to symmetric monoidal theories and nominal monoidal theories, which allows us to transfer completeness results between ordinary and nominal calculi for string diagrams.

Finding Approximate Pythagorean Triples (And Applications To Lego Robot Building), Ronald I. Greenberg, Matthew Fahrenbacher, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This assignment combines programming and data analysis to determine good combinations of side lengths that approximately satisfy the Pythagorean Theorem for right triangles. This can be a standalone exercise using a wide variety of programming languages, but the results are useful for determining good ways to assemble LEGO pieces in robot construction, so the exercise can serve to integrate three different units of the Exploring Computer Science high school curriculum: "Programming", "Computing and Data Analysis", and "Robotics". Sample assignment handouts are provided for both Scratch and Java programmers. Ideas for several variants of the assignment are also provided.

Modernization Of Scienttific Mathematics Formula In Technology, Iwasan D. Kejawa Ed.D, Prof. Iwasan D. Kejawa Ed.D

Department of Mathematics: Faculty Publications

Abstract
Is it true that we solve problem using techniques in form of formula? Mathematical formulas can be derived through thinking of a problem or situation. Research has shown that we can create formulas by applying theoretical, technical, and applied knowledge. The knowledge derives from brainstorming and actual experience can be represented by formulas. It is intended that this research article is geared by an audience of average knowledge level of solving mathematics and scientific intricacies. This work details an introductory level of simple, at times complex problems in a mathematical epidermis and computability and solvability in a Computer Science. …

Lecture 08: Partial Eigen Decomposition Of Large Symmetric Matrices Via Thick-Restart Lanczos With Explicit External Deflation And Its Communication-Avoiding Variant, Zhaojun Bai

Mathematical Sciences Spring Lecture Series

There are continual and compelling needs for computing many eigenpairs of very large Hermitian matrix in physical simulations and data analysis. Though the Lanczos method is effective for computing a few eigenvalues, it can be expensive for computing a large number of eigenvalues. To improve the performance of the Lanczos method, in this talk, we will present a combination of explicit external deflation (EED) with an s-step variant of thick-restart Lanczos (s-step TRLan). The s-step Lanczos method can achieve an order of s reduction in data movement while the EED enables to compute eigenpairs in batches along with a number …

Lecture 11: The Road To Exascale And Legacy Software For Dense Linear Algebra, Jack Dongarra

Mathematical Sciences Spring Lecture Series

In this talk, we will look at the current state of high performance computing and look at the next stage of extreme computing. With extreme computing, there will be fundamental changes in the character of floating point arithmetic and data movement. In this talk, we will look at how extreme-scale computing has caused algorithm and software developers to change their way of thinking on implementing and program-specific applications.

Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman

Mathematical Sciences Spring Lecture Series

Opening remarks for the 46th Annual Mathematical Sciences Spring Lecture Series at the University of Arkansas, Fayetteville.

Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang

Mathematical Sciences Spring Lecture Series

Algebraic multigrid (AMG) is a popular iterative solver and preconditioner for large sparse linear systems. When designed well, it is algorithmically scalable, enabling it to solve increasingly larger systems efficiently. While it consists of various highly parallel building blocks, the original method also consisted of various highly sequential components. A large amount of research has been performed over several decades to design new components that perform well on high performance computers. As a matter of fact, AMG has shown to scale well to more than a million processes. However, with single-core speeds plateauing, future increases in computing performance need to …

Lecture 01: Scalable Solvers: Universals And Innovations, David Keyes

Mathematical Sciences Spring Lecture Series

As simulation and analytics enter the exascale era, numerical algorithms, particularly implicit solvers that couple vast numbers of degrees of freedom, must span a widening gap between ambitious applications and austere architectures to support them. We present fifteen universals for researchers in scalable solvers: imperatives from computer architecture that scalable solvers must respect, strategies towards achieving them that are currently well established, and additional strategies currently being developed for an effective and efficient exascale software ecosystem. We consider recent generalizations of what it means to “solve” a computational problem, which suggest that we have often been “oversolving” them at the …

A Novel Framework Using Neutrosophy For Integrated Speech And Text Sentiment Analysis, Florentin Smarandache, Kritika Mishra, Ilanthenral Kandasamy, Vasantha Kandasamy W.B.

Branch Mathematics and Statistics Faculty and Staff Publications

With increasing data on the Internet, it is becoming difficult to analyze every bit and make sure it can be used efficiently for all the businesses. One useful technique using Natural Language Processing (NLP) is sentiment analysis. Various algorithms can be used to classify textual data based on various scales ranging from just positive-negative, positive-neutral-negative to a wide spectrum of emotions. While a lot of work has been done on text, only a lesser amount of research has been done on audio datasets. An audio file contains more features that can be extracted from its amplitude and frequency than a …

Intelligent Algorithm For Trapezoidal Interval Valued Neutrosophic Network Analysis, Florentin Smarandache, Said Broumi, Deivanayagampillai Nagarajan, Malayalan Lathamaheswari, Mohamed Talea, Assia Bakali

Branch Mathematics and Statistics Faculty and Staff Publications

The shortest path problem has been one of the most fundamental practical problems in network analysis. One of the good algorithms is Bellman-Ford, which has been applied in network, for the last some years. Due to complexity in the decision-making process, the decision makers face complications to express their view and judgment with an exact number for single valued membership degrees under neutrosophic environment. Though the interval number is a special situation of the neutrosophic, it did not solve the shortest path problems in an absolute manner. Hence, in this work, the authors have introduced the score function and accuracy …

Using Robotics And Engineering Design Inquiries To Optimize Learning For Middle Level Teachers: A Case Study, Iman Chafik Chahine, Norman Robinson Iii, Kimbeni Mansion

Publications & Research

This exploratory case study reports findings on 20 middle-level science and mathematics teachers’ perceptions of the effectiveness of a one-year project in which teachers engaged in using robotics and engineering design inquiries in their classrooms. Principled by Bandura’s Social Learning Theory (SLT) and using mixed methods approaches, the study measured teachers' efficacy through the Mathematics Teaching Efficacy Belief Instrument (MTEBI) and observation logs before and after the program. The results of this study showed statistically significant differences between PRE MTEBI and POST MTEBI scores. Furthermore, five themes emerged that illuminated potential affordances and constraints that teachers perceive as opportunities and …

(Φ, Ψ)-Weak Contractions In Neutrosophic Cone Metric Spaces Via Fixed Point Theorems, Florentin Smarandache, Wadei F. Al-Omeri

Branch Mathematics and Statistics Faculty and Staff Publications

In this manuscript, we obtain common fixed point theorems in the neutrosophic cone metric space. Also, notion of (Φ, Ψ)-weak contraction is defined in the neutrosophic cone metric space by using the idea of altering distance function. Finally, we review many examples of cone metric spaces to verify some properties.

A Direct Data-Cluster Analysis Method Based On Neutrosophic Set Implication, Florentin Smarandache, Sudan Jha, Gyanendra Prasad Joshi, Lewis Nkenyereya, Dae Wan Kim

Branch Mathematics and Statistics Faculty and Staff Publications

Raw data are classified using clustering techniques in a reasonable manner to create disjoint clusters. A lot of clustering algorithms based on specific parameters have been proposed to access a high volume of datasets. This paper focuses on cluster analysis based on neutrosophic set implication, i.e., a k-means algorithm with a threshold-based clustering technique. This algorithm addresses the shortcomings of the k-means clustering algorithm by overcoming the limitations of the threshold-based clustering algorithm. To evaluate the validity of the proposed method, several validity measures and validity indices are applied to the Iris dataset (from the University of California, Irvine, Machine …

Exercises Integrating High School Mathematics With Robot Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This paper presents progress in developing exercises for high school students incorporating level-appropriate mathematics into robotics activities. We assume mathematical foundations ranging from algebra to precalculus, whereas most prior work on integrating mathematics into robotics uses only very elementary mathematical reasoning or, at the other extreme, is comprised of technical papers or books using calculus and other advanced mathematics. The exercises suggested are relevant to any differerential-drive robot, which is an appropriate model for many different varieties of educational robots. They guide students towards comparing a variety of natural navigational strategies making use of typical movement primitives. The exercises align …

Mathematics And Programming Exercises For Educational Robot Navigation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper points students towards ideas they can use towards developing a convenient library for robot navigation, with examples based on Botball primitives, and points educators towards mathematics and programming exercises they can suggest to students, especially advanced high school students.

Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows how students can be guided to integrate elementary mathematical analyses with motion planning for typical educational robots. Rather than using calculus as in comprehensive works on motion planning, we show students can achieve interesting results using just simple linear regression tools and trigonometric analyses. Experiments with one robotics platform show that use of these tools can lead to passable navigation through dead reckoning even if students have limited experience with use of sensors, programming, and mathematics.

Improvement Of The Material’S Mechanical Characteristics Using Intelligent Real Time Control Interfaces In Hfc Hardening Process, Florentin Smarandache, Luige Vladareanu, Mihaiela Iliescu, Victor Vladareanu, Alexandru Gal, Octavian Melinte, Adrian Margean

Branch Mathematics and Statistics Faculty and Staff Publications

The paper presents Intelligent Control (IC) Interfaces for real time control of mechatronic systems applied to Hardening Process Control (HPC) in order to improvement of the material’s mechanical characteristics. Implementation of IC laws in the intelligent real time control interfaces depends on the particular circumstances of the models characteristics used and the exact definition of optimization problem. The results led to the development of the IC interfaces in real time through Particle Swarm Optimization (PSO) and neural networks (NN) using off- line the regression methods.

Neutrosophic Set Is A Generalization Of Intuitionistic Fuzzy Set, Inconsistent Intuitionistic Fuzzy Set (Picture Fuzzy Set, Ternary Fuzzy Set), Pythagorean Fuzzy Set, Q-Rung Orthopair Fuzzy Set, Spherical Fuzzy Set, And N-Hyperspherical Fuzzy Set, While Neutrosophication Is A Generalization Of Regret Theory, Grey System Theory, And Three-Ways Decision (Revisited), Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we prove that Neutrosophic Set (NS) is an extension of Intuitionistic Fuzzy Set (IFS) no matter if the sum of single-valued neutrosophic components is < 1, or > 1, or = 1. For the case when the sum of components is 1 (as in IFS), after applying the neutrosophic aggregation operators one gets a different result from that of applying the intuitionistic fuzzy operators, since the intuitionistic fuzzy operators ignore the indeterminacy, while the neutrosophic aggregation operators take into consideration the indeterminacy at the same level as truth-membership and falsehood-nonmembership are taken. NS is also more flexible and effective because it …

Effective Plant Discrimination Based On The Combination Of Local Binary Pattern Operators And Multiclass Support Vector Machine Methods, Vi N T Le, Beniamin Apopei, Kamal Alameh

Research outputs 2014 to 2021

Accurate crop and weed discrimination plays a critical role in addressing the challenges of weed management in agriculture. The use of herbicides is currently the most common approach to weed control. However, herbicide resistant plants have long been recognised as a major concern due to the excessive use of herbicides. Effective weed detection techniques can reduce the cost of weed management and improve crop quality and yield. A computationally efficient and robust plant classification algorithm is developed and applied to the classification of three crops: Brassica napus (canola), Zea mays (maize/corn), and radish. The developed algorithm is based on the …

Keyword-Based Patent Citation Prediction Via Information Theory, Farshad Madani, Martin Zwick, Tugrul U. Daim

Engineering and Technology Management Faculty Publications and Presentations

Patent citation shows how a technology impacts other inventions, so the number of patent citations (backward citations) is used in many technology prediction studies. Current prediction methods use patent citations, but since it may take a long time till a patent is cited by other inventors, identifying impactful patents based on their citations is not an effective way. The prediction method offered in this article predicts patent citations based on the content of patents. In this research, Reconstructability Analysis (RA), which is based on information theory and graph theory, is applied to predict patent citations based on keywords extracted from …

Fundamentals Of Neutrosophic Logic And Sets And Their Role In Artificial Intelligence (Fundamentos De La Lógica Y Los Conjuntos Neutrosóficos Y Su Papel En La Inteligencia Artificial ), Florentin Smarandache, Maykel Leyva-Vazquez

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophy is a new branch of philosophy which studies the origin, nature and scope of neutralities. This has formed the basis for a series of mathematical theories that generalize the classical and fuzzy theories such as the neutrosophic sets and the neutrosophic logic. In the paper, the fundamental concepts related to neutrosophy and its antecedents are presented. Additionally, fundamental concepts of artificial intelligence will be defined and how neutrosophy has come to strengthen this discipline.

Mathematically Predicting The Aleut Tribe Population Using Archaeological Data, Jack Conrad Kiefer Ii, Paden Allen Thompson

Research on Capitol Hill

Sanak Island, located off the southern Alaska Peninsula, was home to the native Aleut peoples for thousands of years. Their hunter-gatherer society depended heavily on the arctic and marine ecosystem for food resources.

In 2015, a team of archaeologists from Idaho State and Utah State universities went to the island and collected data about the Aleut population size and their diet.

This study constructed a dynamical model to mathematically predict the Aleut population over time in order to gain insights into how food resources affected the Aleut people’s ability to survive.

Modelo De Recomendación Basado En Conocimiento Y Números Svn, Maykel Leyva-Vazquez, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Recommendation models are useful in the decision-making process that allow the user a set of options that are expected to meet their expectations. Recommendation models are useful in the decision-making process that offer the user a set of options that are expected to meet their SVN expectations to express linguistic terms.

Special Issue: Neutrosophic Information Theory And Applications, Florentin Smarandache, Jun Ye

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophiclogic,symboliclogic,set,probability,statistics,etc.,are,respectively,generalizations of fuzzy and intuitionistic fuzzy logic and set, classical and imprecise probability, classical statistics, and so on. Neutrosophic logic, symbol logic, and set are gaining significant attention in solving many real-life problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. A number of new neutrosophic theories have been proposed and have been applied in computational intelligence, multiple-attribute decision making, image processing, medical diagnosis, fault diagnosis, optimization design, etc. This Special Issue gathers original research papers that report on the state of the art, as well as on recent advancements in neutrosophic information theory in soft computing, artificial intelligence, …

Some Aggregation Operators For Bipolar-Valued Hesitant Fuzzy Information, Florentin Smarandache, Tahir Mahmood, Kifayat Ullah, Qaisar Khan

Branch Mathematics and Statistics Faculty and Staff Publications

In this article we define some aggregation operators for bipolar-valued hesitant fuzzy sets. These operations include bipolar-valued hesitant fuzzy ordered weighted averaging (BPVHFOWA) operator, bipolar-valued hesitant fuzzy ordered weighted geometric (BPVHFOWG) operator and their generalized forms. We also define hybrid aggregation operators and their generalized forms and solved a decision-making problem on these operation.

Application For Position And Load Reference Generation Of A Simulated Mechatronic Chain, Florentin Smarandache, V. Vladareanu, S.B. Cononovici, M. Migdalovici, H. Wang, Y. Feng

Branch Mathematics and Statistics Faculty and Staff Publications

The paper presents the position and load reference generation for a motor stand simulating a mechatronic chain, in this case a three degree of freedom robot leg. The task is accomplished using three PLC controlled motors in position as the robot joint actuators coupled with three controlled in torque, simulating the load at each simulation time-step. The paper briefly discusses the mathematical model and presents the visual interface used in the simulation, which is then to be further integrated into a virtual environment robot control application.

Pythagorean Approximations For Lego: Merging Educational Robot Construction With Programming And Data Analysis, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Abstract. This paper can be used in two ways. It can provide reference information for incorporating diagonal elements (for bracing or gear meshing) in educational robots built from standard LEGO kits. Alternatively, it can be used as the basis for an assignment for high school or college students to recreate this information; in the process, students will exercise skills in both computer programming and data analysis. Using the paper in the second way can be an excellent integrative experience to add to an existing course; for example, the Exploring Computer Science high school curriculum concludes with the units “Introduction to …

Shift-Symmetric Configurations In Two-Dimensional Cellular Automata: Irreversibility, Insolvability, And Enumeration, Peter Banda, John S. Caughman Iv, Martin Cenek, Christof Teuscher

Mathematics and Statistics Faculty Publications and Presentations

The search for symmetry as an unusual yet profoundly appealing phenomenon, and the origin of regular, repeating configuration patterns have been for a long time a central focus of complexity science, and physics.

Here, we introduce group-theoretic concepts to identify and enumerate the symmetric inputs, which result in irreversible system behaviors with undesired effects on many computational tasks. The concept of so-called configuration shift-symmetry is applied on two-dimensional cellular automata as an ideal model of computation. The results show the universal insolvability of “non-symmetric” tasks regardless of the transition function. By using a compact enumeration formula and bounding the number …

Stochastic Modelling For Levy Distributed Systems, Jonathan Blackledge, T Raja Rani

Articles

The purpose of this paper is to examine a range of results that can be derived from Einstein’s evolution equation focusing on (but not in an exclusive sense) the effect of introducing a L´evy distribution. In this context, we examine the derivation (as derived from the Einstein’s evolution equation) of the classical and fractional diffusion equations, the classical and generalised Kolmogorov-Feller equations, the evolution of self-affine stochastic fields through the fractional diffusion equation and the fractional Schr¨odinger equation, the fractional Poisson equation (for the time independent case), and, a derivation of the Lyapunov exponent. In this way, we provide a …