Other Mathematics Commons^™

(Φ, Ψ)-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.

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 …

General Nonlinear-Material Elasticity In Classical One-Dimensional Solid Mechanics, Ronald Joseph Giardina Jr

LSU New Orleans Theses and Dissertations

We will create a class of generalized ellipses and explore their ability to define a distance on a space and generate continuous, periodic functions. Connections between these continuous, periodic functions and the generalizations of trigonometric functions known in the literature shall be established along with connections between these generalized ellipses and some spectrahedral projections onto the plane, more specifically the well-known multifocal ellipses. The superellipse, or Lam\'{e} curve, will be a special case of the generalized ellipse. Applications of these generalized ellipses shall be explored with regards to some one-dimensional systems of classical mechanics. We will adopt the Ramberg-Osgood relation …

Graph Formalisms And Technologies To Support To Systems Engineering Modeling And Analysis, Mil'yonta Williams

Research Horizons Day Posters

No abstract provided.

Optimal Supply Delivery Under Military Specific Constraints, Talena Fletcher

College of Graduate Studies: Theses & Dissertations

Through-out military history, the need to safely and effectively allocate resources to various military operations was a task of extreme importance. Satisfying the needs of multiple consumers by optimally pairing with appropriate suppliers falls into the category of vehicle routing problems (VRP), which has been intensively studied over the years. In general, finding the optimal solution to VRP is known to be NP-hard. The proposed solutions rely on mathematical programming and the size of the problems that can be optimally solved is typically limited. In military settings, balancing the needs of multiple consumers with the current operational environment has always …

Neutrosophic Computing With Sympy (Computación Neutrosófica Mediante Sympy ), Maykel Leyva-Vazquez, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this article the concept of neutrosophic number is presented. Jupyter through Google Colaboratory is introduced for calculations. The Sympy library is used to perform the process of neutrosophic computation. Systems of linear neutrosóficas equations are solved by means of the symbolic computation in python. A case study was developed for the determination of vehicular traffic with indeterminacy. As future works are the development of new applications in different areas of engineering and science.

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.

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.

Nonlinear Coupled Effects In Nanomaterials, Sia Bhowmick

Theses and Dissertations (Comprehensive)

Materials at the nanoscale have different chemical, structural, and optoelectrical properties compared to their bulk counterparts. As a result, such materials, called nanomaterials, exhibit observable differences in certain physical phenomena. One such resulting phenomenon called the piezoelectric effect has played a crucial role in miniature self-powering electronic devices called nanogenerators which are fabricated by using nanostructures, such as nanowires, nanorods, and nanofilms. These devices are capable of harvesting electrical energy by inducing mechanical strain on the individual nanostructures. Electrical energy created in this manner does not have environmental limitations. In this thesis, important coupled effects, such as the nonlinear piezoelectric …

Ns-K-Nn: Neutrosophic Set-Based K-Nearest Neighbors Classifier, Florentin Smarandache, Yaman Akbulut, Abdulkadir Sengur, Yanhui Guo

Branch Mathematics and Statistics Faculty and Staff Publications

k-nearest neighbors (k-NN), which is known to be a simple and efficient approach, is a non-parametric supervised classifier. It aims to determine the class label of an unknown sample by its k-nearest neighbors that are stored in a training set. The k-nearest neighbors are determined based on some distance functions. Although k-NN produces successful results, there have been some extensions for improving its precision. The neutrosophic set (NS) defines three memberships namely T, I and F. T, I, and F shows the truth membership degree, the false membership degree, and the indeterminacy membership degree, respectively. In this paper, the NS …

Quasivarieties And Varieties Of Ordered Algebras: Regularity And Exactness, Alexander Kurz

Engineering Faculty Articles and Research

We characterise quasivarieties and varieties of ordered algebras categorically in terms of regularity, exactness and the existence of a suitable generator. The notions of regularity and exactness need to be understood in the sense of category theory enriched over posets.

We also prove that finitary varieties of ordered algebras are cocompletions of their theories under sifted colimits (again, in the enriched sense).

The Positivication Of Coalgebraic Logics, Fredrik Dahlqvist, Alexander Kurz

Engineering Faculty Articles and Research

We present positive coalgebraic logic in full generality, and show how to obtain a positive coalgebraic logic from a boolean one. On the model side this involves canonically computing a endofunctor T': Pos->Pos from an endofunctor T: Set->Set, in a procedure previously defined by the second author et alii called posetification. On the syntax side, it involves canonically computing a syntax-building functor L': DL->DL from a syntax-building functor L: BA->BA, in a dual procedure which we call positivication. These operations are interesting in their own right and we explicitly compute posetifications and positivications in the case …

Features Of Agent-Based Models, Reiko Heckel, Alexander Kurz, Edmund Chattoe-Brown

Engineering Faculty Articles and Research

The design of agent-based models (ABMs) is often ad-hoc when it comes to defining their scope. In order for the inclusion of features such as network structure, location, or dynamic change to be justified, their role in a model should be systematically analysed. We propose a mechanism to compare and assess the impact of such features. In particular we are using techniques from software engineering and semantics to support the development and assessment of ABMs, such as graph transformations as semantic representations for agent-based models, feature diagrams to identify ingredients under consideration, and extension relations between graph transformation systems to …

Accuracy And Precision In Force-Distance Curves, Stephen Morgan

Summer Community of Scholars Posters (RCEU and HCR Combined Programs)

No abstract provided.

Foreword: Special Issue On Coalgebraic Logic, Alexander Kurz

Engineering Faculty Articles and Research

The second Dagstuhl seminar on coalgebraic logics took place from October 7-12, 2012, in the Leibniz Forschungszentrum Schloss Dagstuhl, following a successful earlier one in December 2009. From the 44 researchers who attended and the 30 talks presented, this collection highlights some of the progress that has been made in the field. We are grateful to Giuseppe Longo and his interest in a special issue in Mathematical Structures in Computer Science.

Generalized Interval Valued Neutrosophic Graphs Of First Type, Florentin Smarandache, Said Broumi, Mohamed Talea, Assia Bakali, Ali Hassan

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, motivated by the notion of generalized single valued neutrosophic graphs of first type, we defined a new neutrosophic graphs named generalized interval valued neutrosophic graphs of first type (GIVNG1) and presented a matrix representation for it and studied few properties of this new concept. The concept of GIVNG1 is an extension of generalized fuzzy graphs (GFG1) and generalized single valued neutrosophic of first type (GSVNG1).

Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.

A Traders Guide To The Predictive Universe- A Model For Predicting Oil Price Targets And Trading On Them, Jimmie Harold Lenz

Doctor of Business Administration Dissertations

At heart every trader loves volatility; this is where return on investment comes from, this is what drives the proverbial “positive alpha.” As a trader, understanding the probabilities related to the volatility of prices is key, however if you could also predict future prices with reliability the world would be your oyster. To this end, I have achieved three goals with this dissertation, to develop a model to predict future short term prices (direction and magnitude), to effectively test this by generating consistent profits utilizing a trading model developed for this purpose, and to write a paper that anyone with …

Multi-Type Display Calculus For Dynamic Epistemic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimić

Engineering Faculty Articles and Research

In the present paper, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The displayapproach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoretic treatment, and paves the way towards a general methodology for the design of proof systems for the generality of dynamic logics, and certainly beyond dynamic epistemic logic. We prove that the Dynamic Calculus adequately captures Baltag-Moss-Solecki’s dynamic epistemic logic, and enjoys Belnap-style cut …

Multi-Type Display Calculus For Propositional Dynamic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style cut-elimination and subformula property.

Tool Support For Reasoning In Display Calculi, Samuel Balco, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

We present a tool for reasoning in and about propositional sequent calculi. One aim is to support reasoning in calculi that contain a hundred rules or more, so that even relatively small pen and paper derivations become tedious and error prone. As an example, we implement the display calculus D.EAK of dynamic epistemic logic. Second, we provide embeddings of the calculus in the theorem prover Isabelle for formalising proofs about D.EAK. As a case study we show that the solution of the muddy children puzzle is derivable for any number of muddy children. Third, there is a set of meta-tools, …

Applying Dijkstra Algorithm For Solving Neutrosophic Shortest Path Problem, Florentin Smarandache, Luige Vladareanu, Said Broumi, Assia Bakali, Muhammad Akram

Branch Mathematics and Statistics Faculty and Staff Publications

The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.

Manipulating The Mass Distribution Of A Golf Putter, Paul J. Hessler Jr.

Senior Honors Projects

Putting may appear to be the easiest but is actually the most technically challenging part of the game of golf. The ideal putting stroke will remain parallel to its desired trajectory both in the reverse and forward direction when the putter head is within six inches of the ball. Deviation from this concept will cause a cut or sidespin on the ball that will affect the path the ball will travel.

Club design plays a large part in how well a player will be able to achieve a straight back and straight through club head path near impact; specifically the …

Positive Fragments Of Coalgebraic Logics, Adriana Balan, Alexander Kurz, Jirí Velebil

Engineering Faculty Articles and Research

Positive modal logic was introduced in an influential 1995 paper of Dunn as the positive fragment of standard modal logic. His completeness result consists of an axiomatization that derives all modal formulas that are valid on all Kripke frames and are built only from atomic propositions, conjunction, disjunction, box and diamond. In this paper, we provide a coalgebraic analysis of this theorem, which not only gives a conceptual proof based on duality theory, but also generalizes Dunn's result from Kripke frames to coalgebras for weak-pullback preserving functors. To facilitate this analysis we prove a number of category theoretic results on …

Presenting Distributive Laws, Marcello M. Bonsangue, Helle H. Hansen, Alexander Kurz, Jurriaan Rot

Engineering Faculty Articles and Research

Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational semantics and, more recently, also for enhancements of the bisimulation proof method. If T is a free monad, then such distributive laws correspond to simple natural transformations. However, when T is not free it can be rather difficult to prove the defining axioms of a distributive law. In this paper we describe how to obtain a distributive law for a monad with an equational presentation …

Extensions Of Functors From Set To V-Cat, Adriana Balan, Alexander Kurz, Jirí Velebil

Engineering Faculty Articles and Research

We show that for a commutative quantale V every functor Set --> V-cat has an enriched left- Kan extension. As a consequence, coalgebras over Set are subsumed by coalgebras over V-cat. Moreover, one can build functors on V-cat by equipping Set-functors with a metric.

Approximation Of Nested Fixpoints, Alexander Kurz

Engineering Faculty Articles and Research

The question addressed in this paper is how to correctly approximate infinite data given by systems of simultaneous corecursive definitions. We devise a categorical framework for reasoning about regular datatypes, that is, datatypes closed under products, coproducts and fixpoints. We argue that the right methodology is on one hand coalgebraic (to deal with possible nontermination and infinite data) and on the other hand 2-categorical (to deal with parameters in a disciplined manner). We prove a coalgebraic version of Bekic lemma that allows us to reduce simultaneous fixpoints to a single fix point. Thus a possibly infinite object of interest is …

Coalgebraic Semantics Of Reflexive Economics (Dagstuhl Seminar 15042), Samson Abramsky, Alexander Kurz, Pierre Lescanne, Viktor Winschel

Engineering Faculty Articles and Research

This report documents the program and the outcomes of Dagstuhl Seminar 15042 “Coalgebraic Semantics of Reflexive Economics”.

Parameters Estimation Of Material Constitutive Models Using Optimization Algorithms, Kiswendsida Jules Kere

Williams Honors College, Honors Research Projects

Optimization Algorithms are very useful for solving engineering problems. Indeed, optimization algorithms can be used to optimize engineering designs in terms of safety and economy. Understanding the proprieties of materials in engineering designs is very important in order to make designs safe. Materials are not really perfectly homogeneous and there are heterogeneous distributions in most materials. In this paper, Self-OPTIM which is an inverse constitutive parameter identification framework will be used to identify parameters of a linear elastic material constitutive model. Data for Self-OPTIM will be obtained using ABAQUS simulation of a dog-bone uniaxial test. Optimization Algorithms will be used …

The Simulation & Evaluation Of Surge Hazard Using A Response Surface Method In The New York Bight, Michael H. Bredesen

UNF Graduate Theses and Dissertations

Atmospheric features, such as tropical cyclones, act as a driving mechanism for many of the major hazards affecting coastal areas around the world. Accurate and efficient quantification of tropical cyclone surge hazard is essential to the development of resilient coastal communities, particularly given continued sea level trend concerns. Recent major tropical cyclones that have impacted the northeastern portion of the United States have resulted in devastating flooding in New York City, the most densely populated city in the US. As a part of national effort to re-evaluate coastal inundation hazards, the Federal Emergency Management Agency used the Joint Probability Method …