Super Edge-Antimagic Graphs

A Wealth of Problems and Some Solutions

by Martin Baca and Mirka Miller

10/15/2008

Graph theory, and graph labeling in particular, are fast-growing research areas in mathematics. New results are constantly being discovered and published at a rapidly increasing rate due to the enormous number of open problems and conjectures in the field. This book deals mainly with the super edge-antimagic branch of graph labeling. It is written for specialists, but could be read also by postgraduate or undergraduate students with high school knowledge of mathematics and a vibrant interest in problem-solving.

The Foundations of Real Analysis

A Fundamental Course with 347 Exercises and Detailed Solutions

by Richard Mikula

11/01/2015

This textbook covers the subject of real analysis from the fundamentals up through beginning graduate level. It is appropriate as an introductory course text or a review text for graduate qualifying examinations. Some special features of the text include a thorough discussion of transcendental functions such as trigonometric, logarithmic, and exponential from power series expansions, deducing all important functional properties from the series definitions. The text is written in a user-friendly manner, and includes full solutions to all assigned exercises throughout the text.

Geometry by Construction

Object Creation and Problem-solving in Euclidean and Non-Euclidean Geometries

by Michael McDaniel

02/19/2015

College geometry students, professors interested in undergraduate research and secondary geometry teachers will find three rich environments in this textbook. The first chapter contains many of the standards of Euclidean college geometry. The second and third chapters introduce non-Euclidean models where some Euclidean rules hold and others do not. With emphases on constructions and proofs, the reader is encouraged to create the objects under investigation and verify the results with reasoning. Since both models of “bent” spaces exist in Euclidean geometry, the reader gains facility with Euclidean moves through the whole book, even while exploring non-Euclidean spaces. The book itself is meant to be unpacked, expanded and taken further, just like the problems it contains. Geometry b...

by Whye-Teong Ang

08/31/2007

This is a course in boundary element methods for the absolute beginners. Basic concepts are carefully explained through the use of progressively more complicated boundary value problems in engineering and physical sciences. The readers are assumed to have prior basic knowledge of vector calculus (covering topics such as line, surface and volume integrals and the various integral theorems), ordinary and partial differential equations, complex variables, and computer programming.

Idolatry and Infinity

Of Art, Math, and God

by David R. Topper

08/11/2014

Some unwritten stories only exist in fragments. In this book, for the first time, the histories of the injunction against idolatry and the dread of infinity are uniquely woven into one. The spectre of idolatry has haunted the three Western religions since the biblical prohibition. The story of iconoclasm runs from ancient times, where Jews largely ignored the ban on images, through the iconoclastic episodes in Islam and Christianity, and into modern times during the French Revolution. A perhaps surprising thesis of this book is that a conceptual and secular form of iconoclasm continued as the revulsion of illusionism in Modern Art. More recently it flared-up in the dynamiting of two large statues of the Buddha by the Taliban in Afghanistan in 2001. The phobia of infinity arose from P...

Finding the Real Odds

Attrition and Time-to-Degree in the FSU College of Criminology and Criminal Justice

by Robert C. Lightfoot

04/09/2009

Attrition and time-to-degree issues remain poorly understood in academia, and almost completely unexplored in criminology and criminal justice. Loss rates of fifty percent or more are common in the social sciences, while the success rates for criminal justice are unknown for most schools. This study attempts to investigate completion levels at the Florida State University (FSU) College of Criminology and Criminal Justice, using descriptive and inferential techniques, survival analysis, and questionnaires. Problems with data collection impeded analysis of even basic statistical operations, resulting in the exclusion of some independent variables due to unavailability of readily obtainable information. Both the Master's and Ph.D. programs had similar attrition rates, with nearly two-thirds o...

Some Recent Developments in Statistical Theory and Applications

Selected Proceedings of the International Conference on Recent Developments in Statistics, Econometrics and Forecasting, University of Allahabad, India, December 27-28, 2010

by Kuldeep Kumar & Anoop Chaturvedi (editors)

06/21/2012

This book is part of the proceedings of The International Conference on Recent Developments in Statistics, Econometrics and Forecasting 2010, which was organized to provide opportunities for academics and researchers to share their knowledge on recent developments in this area. The conference featured the most up-to-date research results and applications in statistics, econometrics and forecasting. The book has fifteen chapters contributed by different authors and can be divided into five parts: Time Series and Econometric Modelling, Linear Models, Non-parametrics, Statistical Applications and Statistical Methodology. This book will be helpful to graduate students, researchers and applied statisticians working in the area of time series, statistical and econometric modelling.

by Amanda A. Reece

05/07/2009

The purpose of this qualitative study was to measure the effectiveness of a new reusable learning object design model for elementary mathematics. This study was motivated by the lack of general reusable learning object design models and, specifically, elementary mathematics design models that include both technical and learning specifications. The research design method was a qualitative Delphi technique and included participants across the United States and other countries. Ten participants were provided the design model and a questionnaire to analyze the effectiveness of the model on the online instructional design process. Two rounds of questionnaire responses and model refinements were conducted, at which point a consensus was reached. As a result of the data collected, the elementary ...

by Giray Okten

01/31/1999

Quasi-Monte Carlo methods, which are often described as deterministic versions of Monte Carlo methods, were introduced in the 1950s by number theoreticians. They improve several deficiencies of Monte Carlo methods; such as providing estimates with deterministic bounds and avoiding the paradoxical difficulty of generating random numbers in a computer. However, they have their own drawbacks. First, although they provide faster convergence than Monte Carlo methods asymptotically, the advantage may not be practical to obtain in "high" dimensional problems. Second, there is not a practical way to measure the error of a quasi-Monte Carlo simulation. Finally, unlike Monte Carlo methods, there is a scarcity of error reduction techniques for these methods. In this dissertation, we attempt to pro...

by Martin P. Wolf

02/17/2002

The thesis starts with a short description of the credit derivatives' place in the credit risk management. Then it proceeds by outlining the basic forms of credit derivatives, their applications, and their contract elements. A short description of the two common pricing frameworks for credit derivatives, the Firm's Value Models and the Credit Rating Transition Models is given. The major approach reviewed in this thesis is the one of Duffie-Singleton for valuing credit derivatives with term structure models. This framework is also applied in a simulation and examines the importance of the different parameters on the outcome. Also examples for the valuation of Default Digital Swaps and Puts as well as Credit Default Swaps and Puts are given.

by Marcia Woolf Bulach

03/26/1999

The study of Multivariate Time Series has always been more difficult at the modeling stage than the univariate case. Identification of a suitable model, questions of stability, and the difficulties of prediction are well recognised. A variety of methods appear to be worth examining. This thesis is concerned with the proposal of an useful tool which is to apply canonical analysis to a realisation of a Multivariate Time Series and concentrates it's attention on k-variate ARMA(p,q) models. The multivariate series is partitioned into two overlapping or non-overlapping sets of different sizes. The left set is kept at lag 0 (without loss of generality) and the right set at a sequence of lags s=0,1,... . The model includes the possibility that the same subset of variables belong to the left set a...

by Silva Jorg

03/31/1998

In this work we explore the relation between some local Dirichlet spaces and some operator ranges. As an application we give numerical bounds for an equivalence of norms on a particular subspace of the Hardy space.Based on these results we introduce an operator on H^2 which we study in some detail. We also introduce a Hilbert space of analytic functions on the unit disc, prove the polynomials are dense in it, and give a characterization of its elements. On these spaces we study the action of composition operators induced by holomorphic self maps of the disc. We give characterizations of the bounded and compact ones in terms of the behavior of the inducing maps.

by Silva Jorg

03/31/1998

Combinatorial Games are a generalization of real numbers. Each game has a recursively defined complexity (birthday). In this paper we establish some game bounds. We find some limit cases for how big and how small a game can be, based on its complexity. For each finite birthday, N, we find the smallest positive number and the greatest game born by day N, as well as the smallest and the largest positive infinitesimals. As for each particular birthday we provide the extreme values for those types of games, these results extend those in [1, page 214]. The main references in the theory of combinatorial games are ONAG [1] and WW [2]. We'll use the notation and some fundamental results from WW---mainly from its first six chapters---to establish some bounds to the size of the games.

by Shouhong Wang and Hai Wang

01/02/2012

Information Systems Analysis and Design presents essential knowledge about management information systems development, while providing a good balance between the core concepts and secondary concepts. It is intended for four-year university/college students who study information systems analysis and design. Students will learn the information systems development strategies, the systems acquisition approach to information systems development, and the process of information systems development. The book highlights the most important methods for information systems acquisition development, such as process modeling and systems acquisition design. To maintain a well-rounded approach to the topic, both fundamental knowledge about information systems development and hands-on material are presen...

by Jibendu Kumar Mantri

12/15/2008

Data Envelopment Analysis (DEA) represents a milestone in the progression of a continuously advancing methodology for data analysis, which finds extensive use in industry, society and even in education. This book is a handy encyclopedia for researchers, students and practitioners looking for the latest and most comprehensive references in DEA. J.K. Mantri has specifically selected 22 research papers where DEA is applied in different fields so that the techniques discussed in this book can be used for various applications. In A Bibliography of Data Envelopment Analysis (1978-2001), Gabriel Tavares states that DEA is a mathematical programme for measuring performance efficiency of organizations popularly named as decision-making units (DMU). The DMU can be of any kind such as manufacturing ...

by Carnell Littlejohn

12/16/2004

Radiative transfer of photons though a random distribution of scatterers is considered. The Boltzmann transport eq is used to develop a program to obtain real values of intensity based on a set of discrete time intervals. A Newton-Raphson method is used to determine a set of eigenvalues based on the boundary conditions and system geometry. A numerical method due to Lanczos is used to approximately invert a Laplace transform. The algorithm is designed for easy modification to more general problems. PART II: Eigenvalues for the intensity distribution from the one speed Boltzmann transport equation can be computed using an iteration method with the roots and coefficients for the zeros of the Legendre polynomials and the results converge to the known values based on a Newton-R...

by Charles H. Aboughantous

11/09/2010

A High School First Course in Euclidean Plane Geometry is intended to be a first course in plane geometry at the high school level. Individuals who do not have a formal background in geometry can also benefit from studying the subject using this book. The content of the book is based on Euclid's five postulates of plane geometry and the most common theorems. It promotes the art and the skills of developing logical proofs. Most of the theorems are provided with detailed proofs. A large number of sample problems are presented throughout the book with detailed solutions. Practice problems are included at the end of each chapter and are presented in three groups: geometric construction problems, computational problems, and theorematical problems. The answers to the computational problems ar...

by Ioan Burda

08/10/2005

Introduction to Quantum Computation is an introduction to a new rapidly developing theory of quantum computing. The book is a comprehensive introduction to the main ideas and techniques of quantum computation. It begins with the basics of classical theory of computation: NP-complete problems, Boolean circuits, Finite state machine, Turing machine and the idea of complexity of an algorithm. The general quantum formalism (pure states, qubit, superposition, evolution of quantum system, entanglement, multi-qubit system ...) and complex algorithm examples are also presented. Matlab is a well known in engineer academia as matrix computing environment, which makes it well suited for simulating quantum algorithms. The (Quantum Computer Toolbox) QCT is written entirely in the Matlab and m-files ar...

by Jonathan Okeke Chimakonam

10/25/2012

When in 1900 David Hilbert produced a list of 23 mathematical problems and expressed optimism in the power of the human mind to proffer positive solutions to them, little did he know that it would take much of the century for solutions to be found for some of the problems. The problems numbered 1, 2, and 10 which concern mathematical logic and which gave birth to what is called the entscheidungsproblem or the decision problem were eventually solved though in the negative by Alonzo Church and Alan Turing in their famous Church-Turing thesis. Given any fixed machine M and input n, there are gamma (a set of formulas) and D (a single formula) such that M halts on input n is identical to (gamma) (superset) D. So, if there were an effective means of deciding in first-order-logic in general wheth...

by Christian Kahl

01/28/2008

The famous Black-Scholes model was the starting point of a new financial industry and has been a very important pillar of all options trading since. One of its core assumptions is that the volatility of the underlying asset is constant. It was realised early that one has to specify a dynamic on the volatility itself to get closer to market behaviour. There are mainly two aspects making this fact apparent. Considering historical evolution of volatility by analysing time series data one observes erratic behaviour over time. Secondly, backing out implied volatility from daily traded plain vanilla options, the volatility changes with strike. The most common realisations of this phenomenon are the implied volatility smile or skew. The natural question arises how to extend the Black...

by Jacques Tagoudjeu

05/05/2011

This thesis focuses on iterative methods for the treatment of the steady state neutron transport equation in slab geometry, bounded convex domain of Rn (n = 2,3) and in 1-D spherical geometry. We introduce a generic Alternate Direction Implicit (ADI)-like iterative method based on positive definite and m-accretive splitting (PAS) for linear operator equations with operators admitting such splitting. This method converges unconditionally and its SOR acceleration yields convergence results similar to those obtained in presence of finite dimensional systems with matrices possessing the Young property A. The proposed methods are illustrated by a numerical example in which an integro-differential problem of transport theory is considered. In the particular case where the positive definite par...

Ordinary Differential Equations

Methods and Applications

by W. T. Ang and Y. S. Park

07/10/2008

This introductory course in ordinary differential equations, intended for junior undergraduate students in applied mathematics, science and engineering, focuses on methods of solution and applications rather than theoretical analyses. Applications drawn mainly from dynamics, population biology and electric circuit theory are used to show how ordinary differential equations appear in the formulation of problems in science and engineering. The calculus required to comprehend this course is rather elementary, involving differentiation, integration and power series representation of only real functions of one variable. A basic knowledge of complex numbers and their arithmetic is also assumed, so that elementary complex functions which can be used for working out easily the general solutions of...