The mathematics of some tomography algorithms used at JET

Energy Technology Data Exchange (ETDEWEB)

Ingesson, L

2000-03-01

Mathematical details are given of various tomographic reconstruction algorithms that are in use at JET. These algorithms include constrained optimization (CO) with local basis functions, the Cormack method, methods with natural basis functions and the iterative projection-space reconstruction method. Topics discussed include: derivation of the matrix equation for constrained optimization, variable grid size, basis functions, line integrals, derivative matrices, smoothness matrices, analytical expression of the CO solution, sparse matrix storage, projection-space coordinates, the Cormack method in elliptical coordinates, interpolative generalized natural basis functions and some details of the implementation of the filtered backprojection method. (author)

On-Line Algorithms and Reverse Mathematics

Science.gov (United States)

Harris, Seth

In this thesis, we classify the reverse-mathematical strength of sequential problems. If we are given a problem P of the form ∀X(alpha(X) → ∃Zbeta(X,Z)) then the corresponding sequential problem, SeqP, asserts the existence of infinitely many solutions to P: ∀X(∀nalpha(Xn) → ∃Z∀nbeta(X n,Zn)). P is typically provable in RCA0 if all objects involved are finite. SeqP, however, is only guaranteed to be provable in ACA0. In this thesis we exactly characterize which sequential problems are equivalent to RCA0, WKL0, or ACA0.. We say that a problem P is solvable by an on-line algorithm if P can be solved according to a two-player game, played by Alice and Bob, in which Bob has a winning strategy. Bob wins the game if Alice's sequence of plays 〈a0, ..., ak〉 and Bob's sequence of responses 〈 b0, ..., bk〉 constitute a solution to P. Formally, an on-line algorithm A is a function that inputs an admissible sequence of plays 〈a 0, b0, ..., aj〉 and outputs a new play bj for Bob. (This differs from the typical definition of "algorithm", though quite often a concrete set of instructions can be easily deduced from A.). We show that SeqP is provable in RCA0 precisely when P is solvable by an on-line algorithm. Schmerl proved this result specifically for the graph coloring problem; we generalize Schmerl's result to any problem that is on-line solvable. To prove our separation, we introduce a principle called Predictk(r) that is equivalent to -WKL0 for standard k, r.. We show that WKL0 is sufficient to prove SeqP precisely when P has a solvable closed kernel. This means that a solution exists, and each initial segment of this solution is a solution to the corresponding initial segment of the problem. (Certain bounding conditions are necessary as well.) If no such solution exists, then SeqP is equivalent to ACA0 over RCA 0 + ISigma02; RCA0 alone suffices if only sequences of standard length are considered. We use different techniques from Schmerl to prove

Mathematical analysis and algorithms for efficiently and accurately implementing stochastic simulations of short-term synaptic depression and facilitation

Directory of Open Access Journals (Sweden)

Mark D McDonnell

2013-05-01

Full Text Available The release of neurotransmitter vesicles after arrival of a pre-synaptic action potential at cortical synapses is known to be a stochastic process, as is the availability of vesicles for release. These processes are known to also depend on the recent history of action-potential arrivals, and this can be described in terms of time-varying probabilities of vesicle release. Mathematical models of such synaptic dynamics frequently are based only on the mean number of vesicles released by each pre-synaptic action potential, since if it is assumed there are sufficiently many vesicle sites, then variance is small. However, it has been shown recently that variance across sites can be significant for neuron and network dynamics, and this suggests the potential importance of studying short-term plasticity using simulations that do generate trial-to-trial variability. Therefore, in this paper we study several well-known conceptual models for stochastic availability and release. We state explicitly the random variables that these models describe and propose efficient algorithms for accurately implementing stochastic simulations of these random variables in software or hardware. Our results are complemented by mathematical analysis and statement of pseudo-code algorithms.

Algorithm for research of mathematical physics equations symmetries. Symmetries of the free Schroedinger equation

International Nuclear Information System (INIS)

Kotel'nikov, G.A.

1994-01-01

An algorithm id proposed for research the symmetries of mathematical physics equation. The application of this algorithm to the Schroedinger equation permitted to establish, that in addition to the known symmetry the Schroedinger equation possesses also the relativistic symmetry

DETERMINATION ALGORITHM OF OPTIMAL GEOMETRICAL PARAMETERS FOR COMPONENTS OF FREIGHT CARS ON THE BASIS OF GENERALIZED MATHEMATICAL MODELS

Directory of Open Access Journals (Sweden)

O. V. Fomin

2013-10-01

Full Text Available Purpose. Presentation of features and example of the use of the offered determination algorithm of optimum geometrical parameters for the components of freight cars on the basis of the generalized mathematical models, which is realized using computer. Methodology. The developed approach to search for optimal geometrical parameters can be described as the determination of optimal decision of the selected set of possible variants. Findings. The presented application example of the offered algorithm proved its operation capacity and efficiency of use. Originality. The determination procedure of optimal geometrical parameters for freight car components on the basis of the generalized mathematical models was formalized in the paper. Practical value. Practical introduction of the research results for universal open cars allows one to reduce container of their design and accordingly to increase the carrying capacity almost by100 kg with the improvement of strength characteristics. Taking into account the mass of their park this will provide a considerable economic effect when producing and operating. The offered approach is oriented to the distribution of the software packages (for example Microsoft Excel, which are used by technical services of the most enterprises, and does not require additional capital investments (acquisitions of the specialized programs and proper technical staff training. This proves the correctness of the research direction. The offered algorithm can be used for the solution of other optimization tasks on the basis of the generalized mathematical models.

A mathematical model for describing the mechanical behaviour of root canal instruments.

Science.gov (United States)

Zhang, E W; Cheung, G S P; Zheng, Y F

2011-01-01

The purpose of this study was to establish a general mathematical model for describing the mechanical behaviour of root canal instruments by combining a theoretical analytical approach with a numerical finite-element method. Mathematical formulas representing the longitudinal (taper, helical angle and pitch) and cross-sectional configurations and area, the bending and torsional inertia, the curvature of the boundary point and the (geometry of) loading condition were derived. Torsional and bending stresses and the resultant deformation were expressed mathematically as a function of these geometric parameters, modulus of elasticity of the material and the applied load. As illustrations, three brands of NiTi endodontic files of different cross-sectional configurations (ProTaper, Hero 642, and Mani NRT) were analysed under pure torsion and pure bending situation by entering the model into a finite-element analysis package (ANSYS). Numerical results confirmed that mathematical models were a feasible method to analyse the mechanical properties and predict the stress and deformation for root canal instruments during root canal preparation. Mathematical and numerical model can be a suitable way to examine mechanical behaviours as a criterion of the instrument design and to predict the stress and strain experienced by the endodontic instruments during root canal preparation. © 2010 International Endodontic Journal.

Design and implementation of universal mathematical library supporting algorithm development for FPGA based systems in high energy physics experiments

International Nuclear Information System (INIS)

Jalmuzna, W.

2006-02-01

The X-ray free-electron laser XFEL that is being planned at the DESY research center in cooperation with European partners will produce high-intensity ultra-short Xray flashes with the properties of laser light. This new light source, which can only be described in terms of superlatives, will open up a whole range of new perspectives for the natural sciences. It could also offer very promising opportunities for industrial users. SIMCON (SIMulator and CONtroller) is the project of the fast, low latency digital controller dedicated for LLRF system in VUV FEL experiment based on modern FPGA chips It is being developed by ELHEP group in Institute of Electronic Systems at Warsaw University of Technology. The main purpose of the project is to create a controller for stabilizing the vector sum of fields in cavities of one cryomodule in the experiment. The device can be also used as the simulator of the cavity and testbench for other devices. Flexibility and computation power of this device allow implementation of fast mathematical algorithms. This paper describes the concept, implementation and tests of universal mathematical library for FPGA algorithm implementation. It consists of many useful components such as IQ demodulator, division block, library for complex and floating point operations, etc. It is able to speed up implementation time of many complicated algorithms. Library have already been tested using real accelerator signals and the performance achieved is satisfactory. (Orig.)

Design and implementation of universal mathematical library supporting algorithm development for FPGA based systems in high energy physics experiments

Energy Technology Data Exchange (ETDEWEB)

Jalmuzna, W.

2006-02-15

The X-ray free-electron laser XFEL that is being planned at the DESY research center in cooperation with European partners will produce high-intensity ultra-short Xray flashes with the properties of laser light. This new light source, which can only be described in terms of superlatives, will open up a whole range of new perspectives for the natural sciences. It could also offer very promising opportunities for industrial users. SIMCON (SIMulator and CONtroller) is the project of the fast, low latency digital controller dedicated for LLRF system in VUV FEL experiment based on modern FPGA chips It is being developed by ELHEP group in Institute of Electronic Systems at Warsaw University of Technology. The main purpose of the project is to create a controller for stabilizing the vector sum of fields in cavities of one cryomodule in the experiment. The device can be also used as the simulator of the cavity and testbench for other devices. Flexibility and computation power of this device allow implementation of fast mathematical algorithms. This paper describes the concept, implementation and tests of universal mathematical library for FPGA algorithm implementation. It consists of many useful components such as IQ demodulator, division block, library for complex and floating point operations, etc. It is able to speed up implementation time of many complicated algorithms. Library have already been tested using real accelerator signals and the performance achieved is satisfactory. (Orig.)

Mathematical (diagnostic algorithms in the digitization of oral histopathology: The new frontier in histopathological diagnosis

Directory of Open Access Journals (Sweden)

Abhishek Banerjee

2015-01-01

Full Text Available The technological progress in the digitalization of a complete histological glass slide has opened a new door in the tissue based diagnosis. Automated slide diagnosis can be made possible by the use of mathematical algorithms which are formulated by binary codes or values. These algorithms (diagnostic algorithms include both object based (object features, structures and pixel based (texture measures. The intra- and inter-observer errors inherent in the visual diagnosis of a histopathological slide are largely replaced by the use of diagnostic algorithms leading to a standardized and reproducible diagnosis. The present paper reviews the advances in digital histopathology especially related to the use of mathematical algorithms (diagnostic algorithms in the field of oral histopathology. The literature was reviewed for data relating to the use of algorithms utilized in the construction of computational software with special applications in oral histopathological diagnosis. The data were analyzed, and the types and end targets of the algorithms were tabulated. The advantages, specificities and reproducibility of the software, its shortcomings and its comparison with traditional methods of histopathological diagnosis were evaluated. Algorithms help in automated slide diagnosis by creating software with possible reduced errors and bias with a high degree of specificity, sensitivity, and reproducibility. Akin to the identification of thumbprints and faces, software for histopathological diagnosis will in the near future be an important part of the histopathological diagnosis.

NLSE: Parameter-Based Inversion Algorithm

Science.gov (United States)

Sabbagh, Harold A.; Murphy, R. Kim; Sabbagh, Elias H.; Aldrin, John C.; Knopp, Jeremy S.

Chapter 11 introduced us to the notion of an inverse problem and gave us some examples of the value of this idea to the solution of realistic industrial problems. The basic inversion algorithm described in Chap. 11 was based upon the Gauss-Newton theory of nonlinear least-squares estimation and is called NLSE in this book. In this chapter we will develop the mathematical background of this theory more fully, because this algorithm will be the foundation of inverse methods and their applications during the remainder of this book. We hope, thereby, to introduce the reader to the application of sophisticated mathematical concepts to engineering practice without introducing excessive mathematical sophistication.

Discrete algorithmic mathematics

CERN Document Server

Maurer, Stephen B

2005-01-01

The exposition is self-contained, complemented by diverse exercises and also accompanied by an introduction to mathematical reasoning … this book is an excellent textbook for a one-semester undergraduate course and it includes a lot of additional material to choose from.-EMS, March 2006In a textbook, it is necessary to select carefully the statements and difficulty of the problems … in this textbook, this is fully achieved … This review considers this book an excellent one.-The Mathematical Gazette, March 2006

Optimal Design of Pumped Pipeline Systems Using Genetic Algorithm and Mathematical Optimization

Directory of Open Access Journals (Sweden)

Mohammadhadi Afshar

2007-12-01

Full Text Available In recent years, much attention has been paid to the optimal design of pipeline systems. In this study, the problem of pipeline system optimal design has been solved through genetic algorithm and mathematical optimization. Pipe diameters and their thicknesses are considered as decision variables to be designed in a manner that water column separation and excessive pressures are avoided in the event of pump failure. Capabilities of the genetic algorithm and the mathematical programming method are compared for the problem under consideration. For simulation of transient streams, explicit characteristic method is used in which devices such as pumps are defined as boundary conditions of the equations defining the hydraulic behavior of pipe segments. The problem of optimal design of pipeline systems is a constrained problem which is converted to an unconstrained optimization problem using an external penalty function approach. The efficiency of the proposed approaches is verified in one example and the results are presented.

FORMULATION OF MATHEMATICAL PROBLEM DESCRIBING PHYSICAL AND CHEMICAL PROCESSES AT CONCRETE CORROSION

Directory of Open Access Journals (Sweden)

Sergey V. Fedosov

2017-06-01

Full Text Available The article deals with the relevance of new scientific research focused on modeling of physical and chemical processes occurring in the cement concrete at their exploitation. The basic types of concrete corrosion are described. The problem of mass transfer processes in a flat reinforced concrete wall at concrete corrosion of the first and the second types has been mathematically formulated.

Optimal Design of Gravity Pipeline Systems Using Genetic Algorithm and Mathematical Optimization

Directory of Open Access Journals (Sweden)

maryam rohani

2015-03-01

Full Text Available In recent years, the optimal design of pipeline systems has become increasingly important in the water industry. In this study, the two methods of genetic algorithm and mathematical optimization were employed for the optimal design of pipeline systems with the objective of avoiding the water hammer effect caused by valve closure. The problem of optimal design of a pipeline system is a constrained one which should be converted to an unconstrained optimization problem using an external penalty function approach in the mathematical programming method. The quality of the optimal solution greatly depends on the value of the penalty factor that is calculated by the iterative method during the optimization procedure such that the computational effort is simultaneously minimized. The results obtained were used to compare the GA and mathematical optimization methods employed to determine their efficiency and capabilities for the problem under consideration. It was found that the mathematical optimization method exhibited a slightly better performance compared to the GA method.

Appendix F. Developmental enforcement algorithm definition document : predictive braking enforcement algorithm definition document.

Science.gov (United States)

2012-05-01

The purpose of this document is to fully define and describe the logic flow and mathematical equations for a predictive braking enforcement algorithm intended for implementation in a Positive Train Control (PTC) system.

REVIEW OF MATHEMATICAL METHODS AND ALGORITHMS OF MEDICAL IMAGE PROCESSING ON THE EXAMPLE OF TECHNOLOGY OF MEDICAL IMAGE PROCESSING FROM WOLFRAM MATHEMATICA

Directory of Open Access Journals (Sweden)

О. E. Prokopchenko

2015-09-01

Full Text Available The article analyzes the basic methods and algorithms of mathematical processing of medical images as objects of computer mathematics. The presented methods and computer algorithms of mathematics relevant and may find application in the field of medical imaging - automated processing of images; as a tool for measurement and determination the optical parameters; identification and formation of medical images database. Methods and computer algorithms presented in the article & based on Wolfram Mathematica are also relevant to the problem of modern medical education. As an example of Wolfram Mathematica may be considered appropriate demonstration, such as recognition of special radiographs and morphological imaging. These methods are used to improve the diagnostic significance and value of medical (clinical research and can serve as an educational interactive demonstration. Implementation submitted individual methods and algorithms of computer Wolfram Mathematics contributes, in general, the optimization process of practical processing and presentation of medical images.

A Mathematical Model and Algorithm for Routing Air Traffic Under Weather Uncertainty

Science.gov (United States)

Sadovsky, Alexander V.

2016-01-01

A central challenge in managing today's commercial en route air traffic is the task of routing the aircraft in the presence of adverse weather. Such weather can make regions of the airspace unusable, so all affected flights must be re-routed. Today this task is carried out by conference and negotiation between human air traffic controllers (ATC) responsible for the involved sectors of the airspace. One can argue that, in so doing, ATC try to solve an optimization problem without giving it a precise quantitative formulation. Such a formulation gives the mathematical machinery for constructing and verifying algorithms that are aimed at solving the problem. This paper contributes one such formulation and a corresponding algorithm. The algorithm addresses weather uncertainty and has closed form, which allows transparent analysis of correctness, realism, and computational costs.

The linogram algorithm and direct fourier method with linograms

International Nuclear Information System (INIS)

Edholm, P.R.

1990-01-01

This text is an attempt to describe the linogram algorithm based on a somewhat simplified mathematical description of the algorithm which is also more similar to the actual digital implementation. Another algorithm with linograms, which may be called a direct fourier method is also presented. (K.A.E.)

Thirty-three miniatures mathematical and algorithmic applications of linear algebra

CERN Document Server

Matousek, Jiří

2010-01-01

This volume contains a collection of clever mathematical applications of linear algebra, mainly in combinatorics, geometry, and algorithms. Each chapter covers a single main result with motivation and full proof in at most ten pages and can be read independently of all other chapters (with minor exceptions), assuming only a modest background in linear algebra. The topics include a number of well-known mathematical gems, such as Hamming codes, the matrix-tree theorem, the Lov�sz bound on the Shannon capacity, and a counterexample to Borsuk's conjecture, as well as other, perhaps less popular but similarly beautiful results, e.g., fast associativity testing, a lemma of Steinitz on ordering vectors, a monotonicity result for integer partitions, or a bound for set pairs via exterior products. The simpler results in the first part of the book provide ample material to liven up an undergraduate course of linear algebra. The more advanced parts can be used for a graduate course of linear-algebraic methods or for s...

Algorithmic foundation of multi-scale spatial representation

CERN Document Server

Li, Zhilin

2006-01-01

With the widespread use of GIS, multi-scale representation has become an important issue in the realm of spatial data handling. However, no book to date has systematically tackled the different aspects of this discipline. Emphasizing map generalization, Algorithmic Foundation of Multi-Scale Spatial Representation addresses the mathematical basis of multi-scale representation, specifically, the algorithmic foundation.Using easy-to-understand language, the author focuses on geometric transformations, with each chapter surveying a particular spatial feature. After an introduction to the essential operations required for geometric transformations as well as some mathematical and theoretical background, the book describes algorithms for a class of point features/clusters. It then examines algorithms for individual line features, such as the reduction of data points, smoothing (filtering), and scale-driven generalization, followed by a discussion of algorithms for a class of line features including contours, hydrog...

Reconciling taxonomy and phylogenetic inference: formalism and algorithms for describing discord and inferring taxonomic roots

Directory of Open Access Journals (Sweden)

Matsen Frederick A

2012-05-01

Full Text Available Abstract Background Although taxonomy is often used informally to evaluate the results of phylogenetic inference and the root of phylogenetic trees, algorithmic methods to do so are lacking. Results In this paper we formalize these procedures and develop algorithms to solve the relevant problems. In particular, we introduce a new algorithm that solves a "subcoloring" problem to express the difference between a taxonomy and a phylogeny at a given rank. This algorithm improves upon the current best algorithm in terms of asymptotic complexity for the parameter regime of interest; we also describe a branch-and-bound algorithm that saves orders of magnitude in computation on real data sets. We also develop a formalism and an algorithm for rooting phylogenetic trees according to a taxonomy. Conclusions The algorithms in this paper, and the associated freely-available software, will help biologists better use and understand taxonomically labeled phylogenetic trees.

Mathematical Model and Algorithm for the Reefer Mechanic Scheduling Problem at Seaports

Directory of Open Access Journals (Sweden)

Jiantong Zhang

2017-01-01

Full Text Available With the development of seaborne logistics, the international trade of goods transported in refrigerated containers is growing fast. Refrigerated containers, also known as reefers, are used in transportation of temperature sensitive cargo, such as perishable fruits. This trend brings new challenges to terminal managers, that is, how to efficiently arrange mechanics to plug and unplug power for the reefers (i.e., tasks at yards. This work investigates the reefer mechanics scheduling problem at container ports. To minimize the sum of the total tardiness of all tasks and the total working distance of all mechanics, we formulate a mathematical model. For the resolution of this problem, we propose a DE algorithm which is combined with efficient heuristics, local search strategies, and parameter adaption scheme. The proposed algorithm is tested and validated through numerical experiments. Computational results demonstrate the effectiveness and efficiency of the proposed algorithm.

Maximizing the nurses' preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm

Science.gov (United States)

Jafari, Hamed; Salmasi, Nasser

2015-09-01

The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital's demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses' preferences for working shifts and weekends off by considering several important factors such as hospital's policies, labor laws, governmental regulations, and the status of nurses at the end of the previous planning horizon in one of the largest hospitals in Iran i.e., Milad Hospital. Due to the shortage of available nurses, at first, the minimum total number of required nurses is determined. Then, a mathematical programming model is proposed to solve the problem optimally. Since the proposed research problem is NP-hard, a meta-heuristic algorithm based on simulated annealing (SA) is applied to heuristically solve the problem in a reasonable time. An initial feasible solution generator and several novel neighborhood structures are applied to enhance performance of the SA algorithm. Inspired from our observations in Milad hospital, random test problems are generated to evaluate the performance of the SA algorithm. The results of computational experiments indicate that the applied SA algorithm provides solutions with average percentage gap of 5.49 % compared to the upper bounds obtained from the mathematical model. Moreover, the applied SA algorithm provides significantly better solutions in a reasonable time than the schedules provided by the head nurses.

Expander graphs in pure and applied mathematics

OpenAIRE

Lubotzky, Alexander

2012-01-01

Expander graphs are highly connected sparse finite graphs. They play an important role in computer science as basic building blocks for network constructions, error correcting codes, algorithms and more. In recent years they have started to play an increasing role also in pure mathematics: number theory, group theory, geometry and more. This expository article describes their constructions and various applications in pure and applied mathematics.

A cognitive framework for analyzing and describing introductory students' use and understanding of mathematics in physics

Science.gov (United States)

Tuminaro, Jonathan

Many introductory, algebra-based physics students perform poorly on mathematical problem solving tasks in physics. There are at least two possible, distinct reasons for this poor performance: (1) students simply lack the mathematical skills needed to solve problems in physics, or (2) students do not know how to apply the mathematical skills they have to particular problem situations in physics. While many students do lack the requisite mathematical skills, a major finding from this work is that the majority of students possess the requisite mathematical skills, yet fail to use or interpret them in the context of physics. In this thesis I propose a theoretical framework to analyze and describe students' mathematical thinking in physics. In particular, I attempt to answer two questions. What are the cognitive tools involved in formal mathematical thinking in physics? And, why do students make the kinds of mistakes they do when using mathematics in physics? According to the proposed theoretical framework there are three major theoretical constructs: mathematical resources, which are the knowledge elements that are activated in mathematical thinking and problem solving; epistemic games, which are patterns of activities that use particular kinds of knowledge to create new knowledge or solve a problem; and frames, which are structures of expectations that determine how individuals interpret situations or events. The empirical basis for this study comes from videotaped sessions of college students solving homework problems. The students are enrolled in an algebra-based introductory physics course. The videotapes were transcribed and analyzed using the aforementioned theoretical framework. Two important results from this work are: (1) the construction of a theoretical framework that offers researchers a vocabulary (ontological classification of cognitive structures) and grammar (relationship between the cognitive structures) for understanding the nature and origin of

11th Biennial Conference on Emerging Mathematical Methods, Models and Algorithms for Science and Technology

CERN Document Server

Manchanda, Pammy; Bhardwaj, Rashmi

2015-01-01

The present volume contains invited talks of 11th biennial conference on “Emerging Mathematical Methods, Models and Algorithms for Science and Technology”. The main message of the book is that mathematics has a great potential to analyse and understand the challenging problems of nanotechnology, biotechnology, medical science, oil industry and financial technology. The book highlights all the features and main theme discussed in the conference. All contributing authors are eminent academicians, scientists, researchers and scholars in their respective fields, hailing from around the world.

An Algorithm for the Convolution of Legendre Series

KAUST Repository

Hale, Nicholas; Townsend, Alex

2014-01-01

An O(N2) algorithm for the convolution of compactly supported Legendre series is described. The algorithm is derived from the convolution theorem for Legendre polynomials and the recurrence relation satisfied by spherical Bessel functions. Combining with previous work yields an O(N 2) algorithm for the convolution of Chebyshev series. Numerical results are presented to demonstrate the improved efficiency over the existing algorithm. © 2014 Society for Industrial and Applied Mathematics.

Algorithm for programming function generators

International Nuclear Information System (INIS)

Bozoki, E.

1981-01-01

The present paper deals with a mathematical problem, encountered when driving a fully programmable μ-processor controlled function generator. An algorithm is presented to approximate a desired function by a set of straight segments in such a way that additional restrictions (hardware imposed) are also satisfied. A computer program which incorporates this algorithm and automatically generates the necessary input for the function generator for a broad class of desired functions is also described

Mathematical model of rhodium self-powered detectors and algorithms for correction of their time delay

International Nuclear Information System (INIS)

Bur'yan, V.I.; Kozlova, L.V.; Kuzhil', A.S.; Shikalov, V.F.

2005-01-01

The development of algorithms for correction of self-powered neutron detector (SPND) inertial is caused by necessity to increase the fast response of the in-core instrumentation systems (ICIS). The increase of ICIS fast response will permit to monitor in real time fast transient processes in the core, and in perspective - to use the signals of rhodium SPND for functions of emergency protection by local parameters. In this paper it is proposed to use mathematical model of neutron flux measurements by means of SPND in integral form for creation of correction algorithms. This approach, in the case, is the most convenient for creation of recurrent algorithms for flux estimation. The results of comparison for estimation of neutron flux and reactivity by readings of ionization chambers and SPND signals, corrected by proposed algorithms, are presented [ru

Introduction to genetic algorithms as a modeling tool

International Nuclear Information System (INIS)

Wildberger, A.M.; Hickok, K.A.

1990-01-01

Genetic algorithms are search and classification techniques modeled on natural adaptive systems. This is an introduction to their use as a modeling tool with emphasis on prospects for their application in the power industry. It is intended to provide enough background information for its audience to begin to follow technical developments in genetic algorithms and to recognize those which might impact on electric power engineering. Beginning with a discussion of genetic algorithms and their origin as a model of biological adaptation, their advantages and disadvantages are described in comparison with other modeling tools such as simulation and neural networks in order to provide guidance in selecting appropriate applications. In particular, their use is described for improving expert systems from actual data and they are suggested as an aid in building mathematical models. Using the Thermal Performance Advisor as an example, it is suggested how genetic algorithms might be used to make a conventional expert system and mathematical model of a power plant adapt automatically to changes in the plant's characteristics

New Mathematical Model and Algorithm for Economic Lot Scheduling Problem in Flexible Flow Shop

Directory of Open Access Journals (Sweden)

H. Zohali

2018-03-01

Full Text Available This paper addresses the lot sizing and scheduling problem for a number of products in flexible flow shop with identical parallel machines. The production stages are in series, while separated by finite intermediate buffers. The objective is to minimize the sum of setup and inventory holding costs per unit of time. The available mathematical model of this problem in the literature suffers from huge complexity in terms of size and computation. In this paper, a new mixed integer linear program is developed for delay with the huge dimentions of the problem. Also, a new meta heuristic algorithm is developed for the problem. The results of the numerical experiments represent a significant advantage of the proposed model and algorithm compared with the available models and algorithms in the literature.

A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model

International Nuclear Information System (INIS)

Zhang, Zili; Gao, Chao; Liu, Yuxin; Qian, Tao

2014-01-01

Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have lower search efficiency for solving the travelling salesman problem (TSP). According to these shortcomings, this paper proposes a universal optimization strategy for updating the pheromone matrix in the ACO algorithms. The new optimization strategy takes advantages of the unique feature of critical paths reserved in the process of evolving adaptive networks of the Physarum-inspired mathematical model (PMM). The optimized algorithms, denoted as PMACO algorithms, can enhance the amount of pheromone in the critical paths and promote the exploitation of the optimal solution. Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Meanwhile, we further analyse the influence of parameters on the performance of the PMACO algorithms. Based on these analyses, the best values of these parameters are worked out for the TSP. (paper)

Mathematical Methods and Algorithms of Mobile Parallel Computing on the Base of Multi-core Processors

Directory of Open Access Journals (Sweden)

Alexander B. Bakulev

2012-11-01

Full Text Available This article deals with mathematical models and algorithms, providing mobility of sequential programs parallel representation on the high-level language, presents formal model of operation environment processes management, based on the proposed model of programs parallel representation, presenting computation process on the base of multi-core processors.

Yeast for Mathematicians: A Ferment of Discovery and Model Competition to Describe Data.

Science.gov (United States)

Lewis, Matthew; Powell, James

2017-02-01

In addition to the memorization, algorithmic skills and vocabulary which are the default focus in many mathematics classrooms, professional mathematicians are expected to creatively apply known techniques, construct new mathematical approaches and communicate with and about mathematics. We propose that students can learn these professional, higher-level skills through Laboratory Experiences in Mathematical Biology which put students in the role of mathematics researcher creating mathematics to describe and understand biological data. Here we introduce a laboratory experience centered on yeast (Saccharomyces cerevisiae) growing in a small capped flask with a jar to collect carbon dioxide created during yeast growth and respiration. The lab requires no specialized equipment and can easily be run in the context of a college math class. Students collect data and develop mathematical models to explain the data. To help place instructors in the role of mentor/collaborator (as opposed to jury/judge), we facilitate the lab using model competition judged via Bayesian Information Criterion. This article includes details about the class activity conducted, student examples and pedagogical strategies for success.

Mathematical Sciences Institute Workshop

CERN Document Server

Scott, Philip

1990-01-01

A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "feasible" algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible algorithm is one which may be practical on today's or at least tomorrow's computers. There is no definitive analogue of Church's thesis giving a mathematical definition of feasibility; however, the most widely studied mathematical model of feasible computability is polynomial-time computability. Feasible Mathematics includes both the study of feasible computation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation. The diversity of Feasible Mathematics is illustrated by the. contents of this volume which includes papers on weak fragments of arithmetic, on higher type functionals, on bounded linear logic, on sub recursive definitions ...

Mathematical models and algorithms for the computer program 'WOLF'

International Nuclear Information System (INIS)

Halbach, K.

1975-12-01

The computer program FLOW finds the nonrelativistic self- consistent set of two-dimensional ion trajectories and electric fields (including space charges from ions and electrons) for a given set of initial and boundary conditions for the particles and fields. The combination of FLOW with the optimization code PISA gives the program WOLF, which finds the shape of the emitter which is consistent with the plasma forming it, and in addition varies physical characteristics such as electrode position, shapes, and potentials so that some performance characteristics are optimized. The motivation for developing these programs was the desire to design optimum ion source extractor/accelerator systems in a systematic fashion. The purpose of this report is to explain and derive the mathematical models and algorithms which approximate the real physical processes. It serves primarily to document the computer programs. 10 figures

Diffusion tensor and diffusion weighted imaging. Pictorial mathematics

Energy Technology Data Exchange (ETDEWEB)

Nakada, Tsutomu [California Univ., Davis, CA (United States)

1995-06-01

A new imaging algorithm for the treatment of a second order apparent diffusion tensor, D{sub app}{sup {xi}} is described. The method calls for only mathematics of images (pictorial mathematics) without necessity of eigenvalues/eigenvectors estimation. Nevertheless, it is capable of extracting properties of D{sub app}{sup {xi}} invariant to observation axes. While trace image is an example of images weighted by invariance of the tensor matrix, three dimensional anisotropy (3DAC) contrast represents the imaging method making use to anisotropic direction of tensor ellipsoid producing color coded contrast of exceptionally high anatomic resolution. Contrary to intuition, the processes require only a simple algorithm directly applicable to clinical magnetic resonance imaging (MRI). As a contrast method which precisely represents physical characteristics of a target tissue, invariant D{sub app}{sup {xi}} images produced by pictorial mathematics possess significant potential for a number of biological and clinical applications. (author).

TUTOR SUPPORT OF TEACHING MATHEMATICS WITH INFORMATION AND COMMUNICATION TECHNOLOGIES

Directory of Open Access Journals (Sweden)

Kateryna P. Osadcha

2017-10-01

Full Text Available The paper describes the tutor activity in the process of mathematics teaching support on the basis of the use of information and communication technologies (ICT. The author has analysed the available Internet resources and mobile applications in mathematics, which are classified according to their functional purposes into groups: systems of mass open courses, platforms for adaptive learning, video channels, mathematical online simulators, online tasks, mathematical games, mathematical portals, online platforms, mathematical sites, mathematical online platforms, mathematical services, mobile applications in mathematics (simulators, games, generators of example, assistant programs, training complexes, calculators. In accordance with the student age categories mathematical information and communication technologies are divided into three groups: for elementary school students, secondary school students and high school students. The basic ICT tools for teaching mathematics are outlined. The algorithm for constructing tutorial classes with their application is presented.

Common barrel and forward CA tracking algorithm

Energy Technology Data Exchange (ETDEWEB)

Mykhailo, Pugach [Goethe-Universitaet, Frankfurt (Germany); Frankfurt Institute for Advanced Studies, Frankfurt (Germany); KINR, Kyiv (Ukraine); Gorbunov, Sergey; Kisel, Ivan [Goethe-Universitaet, Frankfurt (Germany); Frankfurt Institute for Advanced Studies, Frankfurt (Germany); Collaboration: PANDA-Collaboration

2016-07-01

There are complex detector setups which consist of barrel (cylindrical) and forward parts, and such systems require a special approach in the registered charged particles track finding procedure. Currently the tracking procedure might be performed in both parts of such detector independently from each other, but the final goal on this direction is a creation of a combined tracking, which will work in both parts of the detector simultaneously. The basic algorithm is based on Kalman Filter (KF) and Cellular Automata (CA). And the tracking procedure in such a complex system is rather extraordinary as far as it requires 2 different models to describe the state vector of segments of the reconstructed track in the mathematical apparatus of the KF-algorithm. To overcome this specifics a mathematical apparatus of transition matrices must be developed and implemented, so that one can transfer from one track model to another. Afterwards the work of the CA is performed, which reduces to segments sorting, their union into track-candidates and selection of the best candidates by the chi-square criteria after fitting of the track-candidate by the KF. In this report the algorithm, status and perspectives of such combined tracking are described.

Mathematical foundations of event trees

International Nuclear Information System (INIS)

Papazoglou, Ioannis A.

1998-01-01

A mathematical foundation from first principles of event trees is presented. The main objective of this formulation is to offer a formal basis for developing automated computer assisted construction techniques for event trees. The mathematical theory of event trees is based on the correspondence between the paths of the tree and the elements of the outcome space of a joint event. The concept of a basic cylinder set is introduced to describe joint event outcomes conditional on specific outcomes of basic events or unconditional on the outcome of basic events. The concept of outcome space partition is used to describe the minimum amount of information intended to be preserved by the event tree representation. These concepts form the basis for an algorithm for systematic search for and generation of the most compact (reduced) form of an event tree consistent with the minimum amount of information the tree should preserve. This mathematical foundation allows for the development of techniques for automated generation of event trees corresponding to joint events which are formally described through other types of graphical models. Such a technique has been developed for complex systems described by functional blocks and it is reported elsewhere. On the quantification issue of event trees, a formal definition of a probability space corresponding to the event tree outcomes is provided. Finally, a short discussion is offered on the relationship of the presented mathematical theory with the more general use of event trees in reliability analysis of dynamic systems

Numerical methods of mathematical optimization with Algol and Fortran programs

CERN Document Server

Künzi, Hans P; Zehnder, C A; Rheinboldt, Werner

1971-01-01

Numerical Methods of Mathematical Optimization: With ALGOL and FORTRAN Programs reviews the theory and the practical application of the numerical methods of mathematical optimization. An ALGOL and a FORTRAN program was developed for each one of the algorithms described in the theoretical section. This should result in easy access to the application of the different optimization methods.Comprised of four chapters, this volume begins with a discussion on the theory of linear and nonlinear optimization, with the main stress on an easily understood, mathematically precise presentation. In addition

Imperialist Competitive Algorithm with Dynamic Parameter Adaptation Using Fuzzy Logic Applied to the Optimization of Mathematical Functions

Directory of Open Access Journals (Sweden)

Emer Bernal

2017-01-01

Full Text Available In this paper we are presenting a method using fuzzy logic for dynamic parameter adaptation in the imperialist competitive algorithm, which is usually known by its acronym ICA. The ICA algorithm was initially studied in its original form to find out how it works and what parameters have more effect upon its results. Based on this study, several designs of fuzzy systems for dynamic adjustment of the ICA parameters are proposed. The experiments were performed on the basis of solving complex optimization problems, particularly applied to benchmark mathematical functions. A comparison of the original imperialist competitive algorithm and our proposed fuzzy imperialist competitive algorithm was performed. In addition, the fuzzy ICA was compared with another metaheuristic using a statistical test to measure the advantage of the proposed fuzzy approach for dynamic parameter adaptation.

Mathematical Modeling of Hybrid Electrical Engineering Systems

Directory of Open Access Journals (Sweden)

A. A. Lobaty

2016-01-01

Full Text Available A large class of systems that have found application in various industries and households, electrified transportation facilities and energy sector has been classified as electrical engineering systems. Their characteristic feature is a combination of continuous and discontinuous modes of operation, which is reflected in the appearance of a relatively new term “hybrid systems”. A wide class of hybrid systems is pulsed DC converters operating in a pulse width modulation, which are non-linear systems with variable structure. Using various methods for linearization it is possible to obtain linear mathematical models that rather accurately simulate behavior of such systems. However, the presence in the mathematical models of exponential nonlinearities creates considerable difficulties in the implementation of digital hardware. The solution can be found while using an approximation of exponential functions by polynomials of the first order, that, however, violates the rigor accordance of the analytical model with characteristics of a real object. There are two practical approaches to synthesize algorithms for control of hybrid systems. The first approach is based on the representation of the whole system by a discrete model which is described by difference equations that makes it possible to synthesize discrete algorithms. The second approach is based on description of the system by differential equations. The equations describe synthesis of continuous algorithms and their further implementation in a digital computer included in the control loop system. The paper considers modeling of a hybrid electrical engineering system using differential equations. Neglecting the pulse duration, it has been proposed to describe behavior of vector components in phase coordinates of the hybrid system by stochastic differential equations containing generally non-linear differentiable random functions. A stochastic vector-matrix equation describing dynamics of the

The challenge of computer mathematics.

Science.gov (United States)

Barendregt, Henk; Wiedijk, Freek

2005-10-15

Progress in the foundations of mathematics has made it possible to formulate all thinkable mathematical concepts, algorithms and proofs in one language and in an impeccable way. This is not in spite of, but partially based on the famous results of Gödel and Turing. In this way statements are about mathematical objects and algorithms, proofs show the correctness of statements and computations, and computations are dealing with objects and proofs. Interactive computer systems for a full integration of defining, computing and proving are based on this. The human defines concepts, constructs algorithms and provides proofs, while the machine checks that the definitions are well formed and the proofs and computations are correct. Results formalized so far demonstrate the feasibility of this 'computer mathematics'. Also there are very good applications. The challenge is to make the systems more mathematician-friendly, by building libraries and tools. The eventual goal is to help humans to learn, develop, communicate, referee and apply mathematics.

Evaluation of stochastic algorithms for financial mathematics problems from point of view of energy-efficiency

Science.gov (United States)

Atanassov, E.; Dimitrov, D.; Gurov, T.

2015-10-01

The recent developments in the area of high-performance computing are driven not only by the desire for ever higher performance but also by the rising costs of electricity. The use of various types of accelerators like GPUs, Intel Xeon Phi has become mainstream and many algorithms and applications have been ported to make use of them where available. In Financial Mathematics the question of optimal use of computational resources should also take into account the limitations on space, because in many use cases the servers are deployed close to the exchanges. In this work we evaluate various algorithms for option pricing that we have implemented for different target architectures in terms of their energy and space efficiency. Since it has been established that low-discrepancy sequences may be better than pseudorandom numbers for these types of algorithms, we also test the Sobol and Halton sequences. We present the raw results, the computed metrics and conclusions from our tests.

Evaluation of stochastic algorithms for financial mathematics problems from point of view of energy-efficiency

Energy Technology Data Exchange (ETDEWEB)

Atanassov, E.; Dimitrov, D., E-mail: d.slavov@bas.bg, E-mail: emanouil@parallel.bas.bg, E-mail: gurov@bas.bg; Gurov, T. [Institute of Information and Communication Technologies, BAS, Acad. G. Bonchev str., bl. 25A, 1113 Sofia (Bulgaria)

2015-10-28

The recent developments in the area of high-performance computing are driven not only by the desire for ever higher performance but also by the rising costs of electricity. The use of various types of accelerators like GPUs, Intel Xeon Phi has become mainstream and many algorithms and applications have been ported to make use of them where available. In Financial Mathematics the question of optimal use of computational resources should also take into account the limitations on space, because in many use cases the servers are deployed close to the exchanges. In this work we evaluate various algorithms for option pricing that we have implemented for different target architectures in terms of their energy and space efficiency. Since it has been established that low-discrepancy sequences may be better than pseudorandom numbers for these types of algorithms, we also test the Sobol and Halton sequences. We present the raw results, the computed metrics and conclusions from our tests.

Stochastic time-dependent vehicle routing problem: Mathematical models and ant colony algorithm

Directory of Open Access Journals (Sweden)

Zhengyu Duan

2015-11-01

Full Text Available This article addresses the stochastic time-dependent vehicle routing problem. Two mathematical models named robust optimal schedule time model and minimum expected schedule time model are proposed for stochastic time-dependent vehicle routing problem, which can guarantee delivery within the time windows of customers. The robust optimal schedule time model only requires the variation range of link travel time, which can be conveniently derived from historical traffic data. In addition, the robust optimal schedule time model based on robust optimization method can be converted into a time-dependent vehicle routing problem. Moreover, an ant colony optimization algorithm is designed to solve stochastic time-dependent vehicle routing problem. As the improvements in initial solution and transition probability, ant colony optimization algorithm has a good performance in convergence. Through computational instances and Monte Carlo simulation tests, robust optimal schedule time model is proved to be better than minimum expected schedule time model in computational efficiency and coping with the travel time fluctuations. Therefore, robust optimal schedule time model is applicable in real road network.

Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.

OpenAIRE

Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence

2012-01-01

Abstract Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. Background There exist two major types of mathematical modeling approaches: (1) quantitative modeling, representing various chemical species concentrations by real...

Complex fluids modeling and algorithms

CERN Document Server

Saramito, Pierre

2016-01-01

This book presents a comprehensive overview of the modeling of complex fluids, including many common substances, such as toothpaste, hair gel, mayonnaise, liquid foam, cement and blood, which cannot be described by Navier-Stokes equations. It also offers an up-to-date mathematical and numerical analysis of the corresponding equations, as well as several practical numerical algorithms and software solutions for the approximation of the solutions. It discusses industrial (molten plastics, forming process), geophysical (mud flows, volcanic lava, glaciers and snow avalanches), and biological (blood flows, tissues) modeling applications. This book is a valuable resource for undergraduate students and researchers in applied mathematics, mechanical engineering and physics.

Genetic algorithms

Science.gov (United States)

Wang, Lui; Bayer, Steven E.

1991-01-01

Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

The reality of Mathematics

Science.gov (United States)

Ligomenides, Panos A.

2009-05-01

The power of mathematics is discussed as a way of expressing reasoning, aesthetics and insight in symbolic non-verbal communication. The human culture of discovering mathematical ways of thinking in the enterprise of exploring the understanding of the nature and the evolution of our world through hypotheses, theories and experimental affirmation of the scientific notion of algorithmic and non-algorithmic [`]computation', is examined and commended upon.

Introductory discrete mathematics

CERN Document Server

Balakrishnan, V K

2010-01-01

This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.Chapters 0-3 cover fundamental operations involv

Anisotropic generalization of well-known solutions describing relativistic self-gravitating fluid systems. An algorithm

Energy Technology Data Exchange (ETDEWEB)

Thirukkanesh, S. [Eastern University, Department of Mathematics, Chenkalady (Sri Lanka); Ragel, F.C. [Eastern University, Department of Physics, Chenkalady (Sri Lanka); Sharma, Ranjan; Das, Shyam [P.D. Women' s College, Department of Physics, Jalpaiguri (India)

2018-01-15

We present an algorithm to generalize a plethora of well-known solutions to Einstein field equations describing spherically symmetric relativistic fluid spheres by relaxing the pressure isotropy condition on the system. By suitably fixing the model parameters in our formulation, we generate closed-form solutions which may be treated as an anisotropic generalization of a large class of solutions describing isotropic fluid spheres. From the resultant solutions, a particular solution is taken up to show its physical acceptability. Making use of the current estimate of mass and radius of a known pulsar, the effects of anisotropic stress on the gross physical behaviour of a relativistic compact star is also highlighted. (orig.)

Application of a mathematical model to describe the effects of chlorpyrifos on Caenorhabditis elegans development.

Directory of Open Access Journals (Sweden)

Windy A Boyd

2009-09-01

Full Text Available The nematode Caenorhabditis elegans is being assessed as an alternative model organism as part of an interagency effort to develop better means to test potentially toxic substances. As part of this effort, assays that use the COPAS Biosort flow sorting technology to record optical measurements (time of flight (TOF and extinction (EXT of individual nematodes under various chemical exposure conditions are being developed. A mathematical model has been created that uses Biosort data to quantitatively and qualitatively describe C. elegans growth, and link changes in growth rates to biological events. Chlorpyrifos, an organophosphate pesticide known to cause developmental delays and malformations in mammals, was used as a model toxicant to test the applicability of the growth model for in vivo toxicological testing.L1 larval nematodes were exposed to a range of sub-lethal chlorpyrifos concentrations (0-75 microM and measured every 12 h. In the absence of toxicant, C. elegans matured from L1s to gravid adults by 60 h. A mathematical model was used to estimate nematode size distributions at various times. Mathematical modeling of the distributions allowed the number of measured nematodes and log(EXT and log(TOF growth rates to be estimated. The model revealed three distinct growth phases. The points at which estimated growth rates changed (change points were constant across the ten chlorpyrifos concentrations. Concentration response curves with respect to several model-estimated quantities (numbers of measured nematodes, mean log(TOF and log(EXT, growth rates, and time to reach change points showed a significant decrease in C. elegans growth with increasing chlorpyrifos concentration.Effects of chlorpyrifos on C. elegans growth and development were mathematically modeled. Statistical tests confirmed a significant concentration effect on several model endpoints. This confirmed that chlorpyrifos affects C. elegans development in a concentration dependent

Modified Clipped LMS Algorithm

Directory of Open Access Journals (Sweden)

Lotfizad Mojtaba

2005-01-01

Full Text Available Abstract A new algorithm is proposed for updating the weights of an adaptive filter. The proposed algorithm is a modification of an existing method, namely, the clipped LMS, and uses a three-level quantization ( scheme that involves the threshold clipping of the input signals in the filter weight update formula. Mathematical analysis shows the convergence of the filter weights to the optimum Wiener filter weights. Also, it can be proved that the proposed modified clipped LMS (MCLMS algorithm has better tracking than the LMS algorithm. In addition, this algorithm has reduced computational complexity relative to the unmodified one. By using a suitable threshold, it is possible to increase the tracking capability of the MCLMS algorithm compared to the LMS algorithm, but this causes slower convergence. Computer simulations confirm the mathematical analysis presented.

Learning Environments in Mathematics

Science.gov (United States)

Turner, Vanshelle E.

2017-01-01

Learning mathematics is problematic for most primary school age children because mathematics is rote and the memorization of steps rather than an approach to seeing relationships that builds inquiry and understanding. Therefore, the traditional "algorithmic" way of teaching mathematics has not fully prepared students to be critical…

Simulation of a coal-fired power plant using mathematical programming algorithms in order to optimize its efficiency

International Nuclear Information System (INIS)

Tzolakis, G.; Papanikolaou, P.; Kolokotronis, D.; Samaras, N.; Tourlidakis, A.; Tomboulides, A.

2012-01-01

Since most of the world's electric energy production is mainly based on fossil fuels and need for better efficiency of the energy conversion systems is imminent, mathematical programming algorithms were applied for the simulation and optimization of a detailed model of an existing lignite-fired power plant in Kozani, Greece (KARDIA IV). The optimization of its overall thermal efficiency, using as control variables the mass flow rates of the steam turbine extractions and the fuel consumption, was performed with the use of the simulation and optimization software gPROMS. The power plant components' mathematical models were imported in software by the authors and the results showed that further increase to the overall thermal efficiency of the plant can be achieved (a 0.55% absolute increase) through reduction of the HP turbine's and increase of the LP turbine's extractions mass flow rates and the parallel reduction of the fuel consumption by 2.05% which also results to an equivalent reduction of the greenhouse gasses. The setup of the mathematical model and the flexibility of gPROMS, make this software applicable to various power plants. - Highlights: ► Modeling and simulation of the flue gases circuit of a specific plant. ► Designing of modules in gPROMS FO (Foreign Objects). ► Simulation of the complete detailed plant with gPROMS. ► Optimization using a non-linear optimization algorithm of the plant's efficiency.

A Capstone Mathematics Course for Prospective Secondary Mathematics Teachers

Science.gov (United States)

Artzt, Alice F.; Sultan, Alan; Curcio, Frances R.; Gurl, Theresa

2012-01-01

This article describes an innovative capstone mathematics course that links college mathematics with school mathematics and pedagogy. It describes how college juniors in a secondary mathematics teacher preparation program engage in leadership experiences that enable them to learn mathematics for teaching while developing student-centered…

VLSI PARTITIONING ALGORITHM WITH ADAPTIVE CONTROL PARAMETER

Directory of Open Access Journals (Sweden)

P. N. Filippenko

2013-03-01

Full Text Available The article deals with the problem of very large-scale integration circuit partitioning. A graph is selected as a mathematical model describing integrated circuit. Modification of ant colony optimization algorithm is presented, which is used to solve graph partitioning problem. Ant colony optimization algorithm is an optimization method based on the principles of self-organization and other useful features of the ants’ behavior. The proposed search system is based on ant colony optimization algorithm with the improved method of the initial distribution and dynamic adjustment of the control search parameters. The experimental results and performance comparison show that the proposed method of very large-scale integration circuit partitioning provides the better search performance over other well known algorithms.

The Laws of Nature and the Effectiveness of Mathematics

Science.gov (United States)

Dorato, Mauro

In this paper I try to evaluate what I regard as the main attempts at explaining the effectiveness of mathematics in the natural sciences, namely (1) Antinaturalism, (2) Kantism, (3) Semanticism, (4) Algorithmic Complexity Theory. The first position has been defended by Mark Steiner, who claims that the "user friendliness" of nature for the applied mathematician is the best argument against a naturalistic explanation of the origin of the universe. The second is naturalistic and mixes the Kantian tradition with evolutionary studies about our innate mathematical abilities. The third turns to the Fregean tradition and considers mathematics a particular kind of language, thus treating the effectiveness of mathematics as a particular instance of the effectiveness of natural languages. The fourth hypothesis, building on formal results by Kolmogorov, Solomonov and Chaitin, claims that mathematics is so useful in describing the natural world because it is the science of the abbreviation of sequences, and mathematically formulated laws of nature enable us to compress the information contained in the sequence of numbers in which we code our observations. In this tradition, laws are equivalent to the shortest algorithms capable of generating the lists of zeros and ones representing the empirical data. Along the way, I present and reject the "deflationary explanation", which claims that in wondering about the applicability of so many mathematical structures to nature, we tend to forget the many cases in which no application is possible.

Online handwritten mathematical expression recognition

Science.gov (United States)

Büyükbayrak, Hakan; Yanikoglu, Berrin; Erçil, Aytül

2007-01-01

We describe a system for recognizing online, handwritten mathematical expressions. The system is designed with a user-interface for writing scientific articles, supporting the recognition of basic mathematical expressions as well as integrals, summations, matrices etc. A feed-forward neural network recognizes symbols which are assumed to be single-stroke and a recursive algorithm parses the expression by combining neural network output and the structure of the expression. Preliminary results show that writer-dependent recognition rates are very high (99.8%) while writer-independent symbol recognition rates are lower (75%). The interface associated with the proposed system integrates the built-in recognition capabilities of the Microsoft's Tablet PC API for recognizing textual input and supports conversion of hand-drawn figures into PNG format. This enables the user to enter text, mathematics and draw figures in a single interface. After recognition, all output is combined into one LATEX code and compiled into a PDF file.

Applications and algorithms for mixed integer nonlinear programming

International Nuclear Information System (INIS)

Leyffer, Sven; Munson, Todd; Linderoth, Jeff; Luedtke, James; Miller, Andrew

2009-01-01

The mathematical modeling of systems often requires the use of both nonlinear and discrete components. Discrete decision variables model dichotomies, discontinuities, and general logical relationships. Nonlinear functions are required to accurately represent physical properties such as pressure, stress, temperature, and equilibrium. Problems involving both discrete variables and nonlinear constraint functions are known as mixed-integer nonlinear programs (MINLPs) and are among the most challenging computational optimization problems faced by researchers and practitioners. In this paper, we describe relevant scientific applications that are naturally modeled as MINLPs, we provide an overview of available algorithms and software, and we describe ongoing methodological advances for solving MINLPs. These algorithmic advances are making increasingly larger instances of this important family of problems tractable.

Software design of automatic counting system for nuclear track based on mathematical morphology algorithm

International Nuclear Information System (INIS)

Pan Yi; Mao Wanchong

2010-01-01

The parameter measurement of nuclear track occupies an important position in the field of nuclear technology. However, traditional artificial counting method has many limitations. In recent years, DSP and digital image processing technology have been applied in nuclear field more and more. For the sake of reducing errors of visual measurement in artificial counting method, an automatic counting system for nuclear track based on DM642 real-time image processing platform is introduced in this article, which is able to effectively remove interferences from the background and noise points, as well as automatically extract nuclear track-points by using mathematical morphology algorithm. (authors)

Automated System for Teaching Computational Complexity of Algorithms Course

Directory of Open Access Journals (Sweden)

Vadim S. Roublev

2017-01-01

Full Text Available This article describes problems of designing automated teaching system for “Computational complexity of algorithms” course. This system should provide students with means to familiarize themselves with complex mathematical apparatus and improve their mathematical thinking in the respective area. The article introduces the technique of algorithms symbol scroll table that allows estimating lower and upper bounds of computational complexity. Further, we introduce a set of theorems that facilitate the analysis in cases when the integer rounding of algorithm parameters is involved and when analyzing the complexity of a sum. At the end, the article introduces a normal system of symbol transformations that allows one both to perform any symbol transformations and simplifies the automated validation of such transformations. The article is published in the authors’ wording.

Exploring Effects of High School Students' Mathematical Processing Skills and Conceptual Understanding of Chemical Concepts on Algorithmic Problem Solving

Science.gov (United States)

Gultepe, Nejla; Yalcin Celik, Ayse; Kilic, Ziya

2013-01-01

The purpose of the study was to examine the effects of students' conceptual understanding of chemical concepts and mathematical processing skills on algorithmic problem-solving skills. The sample (N = 554) included grades 9, 10, and 11 students in Turkey. Data were collected using the instrument "MPC Test" and with interviews. The MPC…

Algorithms in invariant theory

CERN Document Server

Sturmfels, Bernd

2008-01-01

J. Kung and G.-C. Rota, in their 1984 paper, write: "Like the Arabian phoenix rising out of its ashes, the theory of invariants, pronounced dead at the turn of the century, is once again at the forefront of mathematics". The book of Sturmfels is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. The Groebner bases method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematics, symbolic computation, and computer science will get access to a wealth of research ideas, hints for applications, outlines and details of algorithms, worked out examples, and research problems.

Algorithmic information theory mathematics of digital information processing

CERN Document Server

Seibt, Peter

2007-01-01

Treats the Mathematics of many important areas in digital information processing. This book covers, in a unified presentation, five topics: Data Compression, Cryptography, Sampling (Signal Theory), Error Control Codes, Data Reduction. It is useful for teachers, students and practitioners in Electronic Engineering, Computer Science and Mathematics.

Algorithm-structured computer arrays and networks architectures and processes for images, percepts, models, information

CERN Document Server

Uhr, Leonard

1984-01-01

Computer Science and Applied Mathematics: Algorithm-Structured Computer Arrays and Networks: Architectures and Processes for Images, Percepts, Models, Information examines the parallel-array, pipeline, and other network multi-computers.This book describes and explores arrays and networks, those built, being designed, or proposed. The problems of developing higher-level languages for systems and designing algorithm, program, data flow, and computer structure are also discussed. This text likewise describes several sequences of successively more general attempts to combine the power of arrays wi

Development of a mathematical model of the heating phase of rubber mixture and development of the synthesis of the heating control algorithm using the Pontryagin maximum principle

Directory of Open Access Journals (Sweden)

V. S. Kudryashov

2017-01-01

Full Text Available The article is devoted to the development of the algorithm of the heating phase control of a rubber compound for CJSC “Voronezh tyre plant”. The algorithm is designed for implementation on basis of controller Siemens S-300 to control the RS-270 mixer. To compile the algorithm a systematic analysis of the heating process has been performed as a control object, also the mathematical model of the heating phase has been developed on the basis of the heat balance equation, which describes the process of heating of a heat-transfer agent in the heat exchanger and further heating of the mixture in the mixer. The dynamic characteristics of temperature of the heat exchanger and the rubber mixer have been obtained. Taking into account the complexity and nonlinearity of the control object – a rubber mixer, as well as the availability of methods and great experience in managing this machine in an industrial environment, the algorithm has been implemented using the Pontryagin maximum principle. The optimization problem is reduced to determining the optimal control (heating steam supply and the optimal path of the object’s output coordinates (the temperature of the mixture which ensure the least flow of steam while heating a rubber compound in a limited time. To do this, the mathematical model of the heating phase has been written in matrix form. Coefficients matrices for each state of the control, control and disturbance vectors have been created, the Hamilton function has been obtained and time switching points have been found for constructing an optimal control and escape path of the object. Analysis of the model experiments and practical research results in the process of programming of the controller have showed a decrease in the heating steam consumption by 24.4% during the heating phase of the rubber compound.

Study on solitary word based on HMM model and Baum-Welch algorithm

Directory of Open Access Journals (Sweden)

Junxia CHEN

Full Text Available This paper introduces the principle of Hidden Markov Model, which is used to describe the Markov process with unknown parameters, is a probability model to describe the statistical properties of the random process. On this basis, designed a solitary word detection experiment based on HMM model, by optimizing the experimental model, Using Baum-Welch algorithm for training the problem of solving the HMM model, HMM model to estimate the parameters of the λ value is found, in this view of mathematics equivalent to other linear prediction coefficient. This experiment in reducing unnecessary HMM training at the same time, reduced the algorithm complexity. In order to test the effectiveness of the Baum-Welch algorithm, The simulation of experimental data, the results show that the algorithm is effective.

Mathematical model and calculation algorithm of micro and meso levels of separation process of gaseous mixtures in molecular sieves

International Nuclear Information System (INIS)

Umarova, Zhanat; Botayeva, Saule; Yegenova, Aliya; Usenova, Aisaule

2015-01-01

In the given article, the main thermodynamic aspects of the issue of modeling diffusion transfer in molecular sieves have been formulated. Dissipation function is used as a basic notion. The differential equation, connecting volume flow with the change of the concentration of catchable component has been derived. As a result, the expression for changing the concentration of the catchable component and the coefficient of membrane detecting has been received. As well, the system approach to describing the process of gases separation in ultra porous membranes has been realized and micro and meso-levels of mathematical modeling have been distinguished. The non-ideality of the shared system is primarily taken into consideration at the micro-level and the departure from the diffusion law of Fick has been taken into account. The calculation method of selectivity considering fractal structure of membranes has been developed at the meso level. The calculation algorithm and its software implementation have been suggested

Mathematical model and calculation algorithm of micro and meso levels of separation process of gaseous mixtures in molecular sieves

Energy Technology Data Exchange (ETDEWEB)

Umarova, Zhanat; Botayeva, Saule; Yegenova, Aliya; Usenova, Aisaule [South Kazakhstan State University, 5, Tauke Khan Avenue, 160012 Shymkent (Kazakhstan)

2015-05-15

In the given article, the main thermodynamic aspects of the issue of modeling diffusion transfer in molecular sieves have been formulated. Dissipation function is used as a basic notion. The differential equation, connecting volume flow with the change of the concentration of catchable component has been derived. As a result, the expression for changing the concentration of the catchable component and the coefficient of membrane detecting has been received. As well, the system approach to describing the process of gases separation in ultra porous membranes has been realized and micro and meso-levels of mathematical modeling have been distinguished. The non-ideality of the shared system is primarily taken into consideration at the micro-level and the departure from the diffusion law of Fick has been taken into account. The calculation method of selectivity considering fractal structure of membranes has been developed at the meso level. The calculation algorithm and its software implementation have been suggested.

Law and Order in Algorithmics

NARCIS (Netherlands)

Fokkinga, M.M.

1992-01-01

An algorithm is the input-output effect of a computer program; mathematically, the notion of algorithm comes close to the notion of function. Just as arithmetic is the theory and practice of calculating with numbers, so is ALGORITHMICS the theory and practice of calculating with algorithms. Just as

Moving boundary - Oxygen diffusion. Two algorithms using Landau transformation

International Nuclear Information System (INIS)

Moyano, E.A.

1991-01-01

A description is made of two algorithms which solve a mathematical model destinated for the study of one-dimensional problems with moving boundaries and implicit boundary conditions. The Landau transformation is used in both methods for each temporal level so as to work all through with the same amount of nodes. Thus, it is necessary to deal with a partial differential equation whose diffusive and convective terms are accompanied by variable coefficients. The partial differential equation is made discrete implicitly, using the Laasonen scheme -which is always stable- instead of the Crank-Nicholson scheme, as performed by Ferris and Hill (5), in the fixed time passing method. The second method employs the tridiagonal algorithm. The first algorithm uses fixed time passing and iterates with variable interface positions, that is to say, it varies δs until it satisfies the boundary condition. The mathematical model describes oxygen diffusion in live tissues. Its numerical solution is obtained by finite differences. An important application of this method could be the estimation of the radiation dose in cancerous tumor treatment. (Author) [es

Contrasts in Mathematical Challenges in A-Level Mathematics and Further Mathematics, and Undergraduate Mathematics Examinations

Science.gov (United States)

Darlington, Ellie

2014-01-01

This article describes part of a study which investigated the role of questions in students' approaches to learning mathematics at the secondary-tertiary interface, focussing on the enculturation of students at the University of Oxford. Use of the Mathematical Assessment Task Hierarchy taxonomy revealed A-level Mathematics and Further Mathematics…

Creativity and Technology in Mathematics: From Story Telling to Algorithmic with Op'Art

Science.gov (United States)

Mercat, Christian; Filho, Pedro Lealdino; El-Demerdash, Mohamed

2017-01-01

This article describes some of the results of the European project mcSquared (http://mc2-project.eu/) regarding the use of Op'Art and optical illusion pieces as a tool to foster modeling and creative mathematical thinking in students. We present briefly the c-book technology and some results we got experimenting it. The Op'Art movement, with…

Mathematical structures for computer graphics

CERN Document Server

Janke, Steven J

2014-01-01

A comprehensive exploration of the mathematics behind the modeling and rendering of computer graphics scenes Mathematical Structures for Computer Graphics presents an accessible and intuitive approach to the mathematical ideas and techniques necessary for two- and three-dimensional computer graphics. Focusing on the significant mathematical results, the book establishes key algorithms used to build complex graphics scenes. Written for readers with various levels of mathematical background, the book develops a solid foundation for graphics techniques and fills in relevant grap

Gems of combinatorial optimization and graph algorithms

CERN Document Server

Skutella, Martin; Stiller, Sebastian; Wagner, Dorothea

2015-01-01

Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory?  Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar?  Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science?   Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas.  Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.   This ...

System for corrosion monitoring in pipeline applying fuzzy logic mathematics

Science.gov (United States)

Kuzyakov, O. N.; Kolosova, A. L.; Andreeva, M. A.

2018-05-01

A list of factors influencing corrosion rate on the external side of underground pipeline is determined. Principles of constructing a corrosion monitoring system are described; the system performance algorithm and program are elaborated. A comparative analysis of methods for calculating corrosion rate is undertaken. Fuzzy logic mathematics is applied to reduce calculations while considering a wider range of corrosion factors.

Autumn Algorithm-Computation of Hybridization Networks for Realistic Phylogenetic Trees.

Science.gov (United States)

Huson, Daniel H; Linz, Simone

2018-01-01

A minimum hybridization network is a rooted phylogenetic network that displays two given rooted phylogenetic trees using a minimum number of reticulations. Previous mathematical work on their calculation has usually assumed the input trees to be bifurcating, correctly rooted, or that they both contain the same taxa. These assumptions do not hold in biological studies and "realistic" trees have multifurcations, are difficult to root, and rarely contain the same taxa. We present a new algorithm for computing minimum hybridization networks for a given pair of "realistic" rooted phylogenetic trees. We also describe how the algorithm might be used to improve the rooting of the input trees. We introduce the concept of "autumn trees", a nice framework for the formulation of algorithms based on the mathematics of "maximum acyclic agreement forests". While the main computational problem is hard, the run-time depends mainly on how different the given input trees are. In biological studies, where the trees are reasonably similar, our parallel implementation performs well in practice. The algorithm is available in our open source program Dendroscope 3, providing a platform for biologists to explore rooted phylogenetic networks. We demonstrate the utility of the algorithm using several previously studied data sets.

Bernhard Riemann 1826-1866 Turning Points in the Conception of Mathematics

CERN Document Server

Laugwitz, Detlef

2008-01-01

The name of Bernard Riemann is well known to mathematicians and physicists around the world. College students encounter the Riemann integral early in their studies. Real and complex function theories are founded on Riemann’s work. Einstein’s theory of gravitation would be unthinkable without Riemannian geometry. In number theory, Riemann’s famous conjecture stands as one of the classic challenges to the best mathematical minds and continues to stimulate deep mathematical research. The name is indelibly stamped on the literature of mathematics and physics. This book, originally written in German and presented here in an English-language translation, examines Riemann’s scientific work from a single unifying perspective. Laugwitz describes Riemann’s development of a conceptual approach to mathematics at a time when conventional algorithmic thinking dictated that formulas and figures, rigid constructs, and transformations of terms were the only legitimate means of studying mathematical objects. David Hi...

International seminar series on mathematics and applied mathematics and a series of three focused international research workshops on engineering mathematics organised by the Research Environment in Mathematics and Applied Mathematics at Mälardalen University from autumn 2014 to autumn 2015: the International Workshop on Engineering Mathematics for Electromagnetics and Health Technology; the International Workshop on Engineering Mathematics, Algebra, Analysis and Electromagnetics; and the 1st Swedish-Estonian International Workshop on Engineering Mathematics, Algebra, Analysis and Applications

CERN Document Server

Rancic, Milica

2016-01-01

This book highlights the latest advances in engineering mathematics with a main focus on the mathematical models, structures, concepts, problems and computational methods and algorithms most relevant for applications in modern technologies and engineering. It addresses mathematical methods of algebra, applied matrix analysis, operator analysis, probability theory and stochastic processes, geometry and computational methods in network analysis, data classification, ranking and optimisation. The individual chapters cover both theory and applications, and include a wealth of figures, schemes, algorithms, tables and results of data analysis and simulation. Presenting new methods and results, reviews of cutting-edge research, and open problems for future research, they equip readers to develop new mathematical methods and concepts of their own, and to further compare and analyse the methods and results discussed. The book consists of contributed chapters covering research developed as a result of a focused interna...

Field data-based mathematical modeling by Bode equations and vector fitting algorithm for renewable energy applications

Science.gov (United States)

W. Hasan, W. Z.

2018-01-01

The power system always has several variations in its profile due to random load changes or environmental effects such as device switching effects when generating further transients. Thus, an accurate mathematical model is important because most system parameters vary with time. Curve modeling of power generation is a significant tool for evaluating system performance, monitoring and forecasting. Several numerical techniques compete to fit the curves of empirical data such as wind, solar, and demand power rates. This paper proposes a new modified methodology presented as a parametric technique to determine the system’s modeling equations based on the Bode plot equations and the vector fitting (VF) algorithm by fitting the experimental data points. The modification is derived from the familiar VF algorithm as a robust numerical method. This development increases the application range of the VF algorithm for modeling not only in the frequency domain but also for all power curves. Four case studies are addressed and compared with several common methods. From the minimal RMSE, the results show clear improvements in data fitting over other methods. The most powerful features of this method is the ability to model irregular or randomly shaped data and to be applied to any algorithms that estimating models using frequency-domain data to provide state-space or transfer function for the model. PMID:29351554

Field data-based mathematical modeling by Bode equations and vector fitting algorithm for renewable energy applications.

Science.gov (United States)

Sabry, A H; W Hasan, W Z; Ab Kadir, M Z A; Radzi, M A M; Shafie, S

2018-01-01

The power system always has several variations in its profile due to random load changes or environmental effects such as device switching effects when generating further transients. Thus, an accurate mathematical model is important because most system parameters vary with time. Curve modeling of power generation is a significant tool for evaluating system performance, monitoring and forecasting. Several numerical techniques compete to fit the curves of empirical data such as wind, solar, and demand power rates. This paper proposes a new modified methodology presented as a parametric technique to determine the system's modeling equations based on the Bode plot equations and the vector fitting (VF) algorithm by fitting the experimental data points. The modification is derived from the familiar VF algorithm as a robust numerical method. This development increases the application range of the VF algorithm for modeling not only in the frequency domain but also for all power curves. Four case studies are addressed and compared with several common methods. From the minimal RMSE, the results show clear improvements in data fitting over other methods. The most powerful features of this method is the ability to model irregular or randomly shaped data and to be applied to any algorithms that estimating models using frequency-domain data to provide state-space or transfer function for the model.

Field data-based mathematical modeling by Bode equations and vector fitting algorithm for renewable energy applications.

Directory of Open Access Journals (Sweden)

A H Sabry

Full Text Available The power system always has several variations in its profile due to random load changes or environmental effects such as device switching effects when generating further transients. Thus, an accurate mathematical model is important because most system parameters vary with time. Curve modeling of power generation is a significant tool for evaluating system performance, monitoring and forecasting. Several numerical techniques compete to fit the curves of empirical data such as wind, solar, and demand power rates. This paper proposes a new modified methodology presented as a parametric technique to determine the system's modeling equations based on the Bode plot equations and the vector fitting (VF algorithm by fitting the experimental data points. The modification is derived from the familiar VF algorithm as a robust numerical method. This development increases the application range of the VF algorithm for modeling not only in the frequency domain but also for all power curves. Four case studies are addressed and compared with several common methods. From the minimal RMSE, the results show clear improvements in data fitting over other methods. The most powerful features of this method is the ability to model irregular or randomly shaped data and to be applied to any algorithms that estimating models using frequency-domain data to provide state-space or transfer function for the model.

Four (Algorithms) in One (Bag): An Integrative Framework of Knowledge for Teaching the Standard Algorithms of the Basic Arithmetic Operations

Science.gov (United States)

Raveh, Ira; Koichu, Boris; Peled, Irit; Zaslavsky, Orit

2016-01-01

In this article we present an integrative framework of knowledge for teaching the standard algorithms of the four basic arithmetic operations. The framework is based on a mathematical analysis of the algorithms, a connectionist perspective on teaching mathematics and an analogy with previous frameworks of knowledge for teaching arithmetic…

Algorithmic approach to diagram techniques

International Nuclear Information System (INIS)

Ponticopoulos, L.

1980-10-01

An algorithmic approach to diagram techniques of elementary particles is proposed. The definition and axiomatics of the theory of algorithms are presented, followed by the list of instructions of an algorithm formalizing the construction of graphs and the assignment of mathematical objects to them. (T.A.)

Mathematical Optimization Algorithm for Minimizing the Cost Function of GHG Emission in AS/RS Using Positive Selection Based Clonal Selection Principle

Science.gov (United States)

Mahalakshmi; Murugesan, R.

2018-04-01

This paper regards with the minimization of total cost of Greenhouse Gas (GHG) efficiency in Automated Storage and Retrieval System (AS/RS). A mathematical model is constructed based on tax cost, penalty cost and discount cost of GHG emission of AS/RS. A two stage algorithm namely positive selection based clonal selection principle (PSBCSP) is used to find the optimal solution of the constructed model. In the first stage positive selection principle is used to reduce the search space of the optimal solution by fixing a threshold value. In the later stage clonal selection principle is used to generate best solutions. The obtained results are compared with other existing algorithms in the literature, which shows that the proposed algorithm yields a better result compared to others.

Mathematical Modelling of Unmanned Aerial Vehicles with Four Rotors

Directory of Open Access Journals (Sweden)

Zoran Benić

2016-01-01

Full Text Available Mathematical model of an unmanned aerial vehicle with four propulsors (quadcopter is indispensable in quadcopter movement simulation and later modelling of the control algorithm. Mathematical model is, at the same time, the first step in comprehending the mathematical principles and physical laws which are applied to the quadcopter system. The objective is to define the mathematical model which will describe the quadcopter behavior with satisfactory accuracy and which can be, with certain modifications, applicable for the similar configurations of multirotor aerial vehicles. At the beginning of mathematical model derivation, coordinate systems are defined and explained. By using those coordinate systems, relations between parameters defined in the earth coordinate system and in the body coordinate system are defined. Further, the quadcopter kinematic is described which enables setting those relations. Also, quadcopter dynamics is used to introduce forces and torques to the model through usage of Newton-Euler method. Final derived equation is Newton’s second law in the matrix notation. For the sake of model simplification, hybrid coordinate system is defined, and quadcopter dynamic equations derived with the respect to it. Those equations are implemented in the simulation. Results of behavior of quadcopter mathematical model are graphically shown for four cases. For each of the cases the propellers revolutions per minute (RPM are set in a way that results in the occurrence of the controllable variables which causes one of four basic quadcopter movements in space.

Data assimilation a mathematical introduction

CERN Document Server

Law, Kody; Zygalakis, Konstantinos

2015-01-01

This book provides a systematic treatment of the mathematical underpinnings of work in data assimilation, covering both theoretical and computational approaches. Specifically the authors develop a unified mathematical framework in which a Bayesian formulation of the problem provides the bedrock for the derivation, development and analysis of algorithms; the many examples used in the text, together with the algorithms which are introduced and discussed, are all illustrated by the MATLAB software detailed in the book and made freely available online. The book is organized into nine chapters: the first contains a brief introduction to the mathematical tools around which the material is organized; the next four are concerned with discrete time dynamical systems and discrete time data; the last four are concerned with continuous time dynamical systems and continuous time data and are organized analogously to the corresponding discrete time chapters. This book is aimed at mathematical researchers interested in a sy...

An algorithm for three-dimensional imaging in the positron camera

International Nuclear Information System (INIS)

Chen Kun; Ma Mei; Xu Rongfen; Shen Miaohe

1986-01-01

A mathematical algorithm of back-projection filtered for image reconstructions using two-dimensional signals detected from parallel multiwire proportional chambers is described. The approaches of pseudo three-dimensional and full three-dimensional image reconstructions are introduced, and the available point response functions are defined as well. The designing parameters and computation procedure of the full three-dimensional method is presented

A Novel Plant Root Foraging Algorithm for Image Segmentation Problems

Directory of Open Access Journals (Sweden)

Lianbo Ma

2014-01-01

Full Text Available This paper presents a new type of biologically-inspired global optimization methodology for image segmentation based on plant root foraging behavior, namely, artificial root foraging algorithm (ARFO. The essential motive of ARFO is to imitate the significant characteristics of plant root foraging behavior including branching, regrowing, and tropisms for constructing a heuristic algorithm for multidimensional and multimodal problems. A mathematical model is firstly designed to abstract various plant root foraging patterns. Then, the basic process of ARFO algorithm derived in the model is described in details. When tested against ten benchmark functions, ARFO shows the superiority to other state-of-the-art algorithms on several benchmark functions. Further, we employed the ARFO algorithm to deal with multilevel threshold image segmentation problem. Experimental results of the new algorithm on a variety of images demonstrated the suitability of the proposed method for solving such problem.

Comparison of genetic algorithms with conjugate gradient methods

Science.gov (United States)

Bosworth, J. L.; Foo, N. Y.; Zeigler, B. P.

1972-01-01

Genetic algorithms for mathematical function optimization are modeled on search strategies employed in natural adaptation. Comparisons of genetic algorithms with conjugate gradient methods, which were made on an IBM 1800 digital computer, show that genetic algorithms display superior performance over gradient methods for functions which are poorly behaved mathematically, for multimodal functions, and for functions obscured by additive random noise. Genetic methods offer performance comparable to gradient methods for many of the standard functions.

Mathematics Teaching Today

Science.gov (United States)

Martin, Tami S.; Speer, William R.

2009-01-01

This article describes features, consistent messages, and new components of "Mathematics Teaching Today: Improving Practice, Improving Student Learning" (NCTM 2007), an updated edition of "Professional Standards for Teaching Mathematics" (NCTM 1991). The new book describes aspects of high-quality mathematics teaching; offers a model for observing,…

Foundations of mathematical logic

CERN Document Server

Curry, Haskell B

2010-01-01

Written by a pioneer of mathematical logic, this comprehensive graduate-level text explores the constructive theory of first-order predicate calculus. It covers formal methods, including algorithms and epitheory, and offers a brief treatment of Markov's approach to algorithms, explains elementary facts about lattices and similar algebraic systems, and more. 1963 edition.

Mathematical modeling with multidisciplinary applications

CERN Document Server

Yang, Xin-She

2013-01-01

Features mathematical modeling techniques and real-world processes with applications in diverse fields Mathematical Modeling with Multidisciplinary Applications details the interdisciplinary nature of mathematical modeling and numerical algorithms. The book combines a variety of applications from diverse fields to illustrate how the methods can be used to model physical processes, design new products, find solutions to challenging problems, and increase competitiveness in international markets. Written by leading scholars and international experts in the field, the

Euclidean shortest paths exact or approximate algorithms

CERN Document Server

Li, Fajie

2014-01-01

This book reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. The coverage includes mathematical proofs for many of the given statements.

Mathematics of optimization

CERN Document Server

Miller, Steven J

2017-01-01

Optimization Theory is an active area of research with numerous applications; many of the books are designed for engineering classes, and thus have an emphasis on problems from such fields. Covering much of the same material, there is less emphasis on coding and detailed applications as the intended audience is more mathematical. There are still several important problems discussed (especially scheduling problems), but there is more emphasis on theory and less on the nuts and bolts of coding. A constant theme of the text is the "why" and the "how" in the subject. Why are we able to do a calculation efficiently? How should we look at a problem? Extensive effort is made to motivate the mathematics and isolate how one can apply ideas/perspectives to a variety of problems. As many of the key algorithms in the subject require too much time or detail to analyze in a first course (such as the run-time of the Simplex Algorithm), there are numerous comparisons to simpler algorithms which students have either seen or c...

Computational mathematics and mathematical computer software. Vychislitel'naia matematika i matematicheskoe obespechenie EVM

Energy Technology Data Exchange (ETDEWEB)

Tikhonov, A.N.; Samarskii, A.A.

1985-01-01

Various aspects of mathematical modeling and problem-oriented computer software are examined with reference to numerical methods in mathematical physics, methods for solving inverse problems, development of automatic systems for experimental data processing, and mathematical modeling in plasma physics. Papers are presented on some properties of difference schemes in one-dimensional gas dynamics, an algorithm for processing signals reflected from multipoint targets, and the application of simplified Navier-Stokes equations for calculating flow of a viscous gas past long bodies.

Development of rubber mixing process mathematical model and synthesis of control correction algorithm by process temperature mode using an artificial neural network

Directory of Open Access Journals (Sweden)

V. S. Kudryashov

2016-01-01

Full Text Available The article is devoted to the development of a correction control algorithm by temperature mode of a periodic rubber mixing process for JSC "Voronezh tire plant". The algorithm is designed to perform in the main controller a section of rubber mixing Siemens S7 CPU319F-3 PN/DP, which forms tasks for the local temperature controllers HESCH HE086 and Jumo dTRON304, operating by tempering stations. To compile the algorithm was performed a systematic analysis of rubber mixing process as an object of control and was developed a mathematical model of the process based on the heat balance equations describing the processes of heat transfer through the walls of technological devices, the change of coolant temperature and the temperature of the rubber compound mixing until discharge from the mixer chamber. Due to the complexity and nonlinearity of the control object – Rubber mixers and the availability of methods and a wide experience of this device control in an industrial environment, a correction algorithm is implemented on the basis of an artificial single-layer neural network and it provides the correction of tasks for local controllers on the cooling water temperature and air temperature in the workshop, which may vary considerably depending on the time of the year, and during prolonged operation of the equipment or its downtime. Tempering stations control is carried out by changing the flow of cold water from the cooler and on/off control of the heating elements. The analysis of the model experiments results and practical research at the main controller programming in the STEP 7 environment at the enterprise showed a decrease in the mixing time for different types of rubbers by reducing of heat transfer process control error.

MATHEMATICAL AND INFORMATION SUPPORT FOR CALCULATION AND DESIGN OF TUBE GAS HEATERS LOCATED IN STRUCTURES

Directory of Open Access Journals (Sweden)

CHORNOMORETS H. Y.

2016-02-01

Full Text Available Raising of problem. For the design and construction of tube gas heaters in building structures to need solve the problems of analysis and synthesis of such heating system. The mathematical model of this system is consists of: mathematical model of the tube gas heater, mathematical model of heat distribution in the building structure and corresponding boundary conditions. To solve the tasks of analysis and synthesis must be appropriate mathematical and information support. Purpose. The purpose of this paper is to describe the developed mathematical and information support that solve the problems of analysis and synthesis of heating systems with gas tube heaters, located in building constructions.Conclusion. Mathematical support includes the development of algorithms and software for the numerical solution of problems analysis and synthesis heating system. Information support includes all the necessary parameters characterizing the thermal properties of materials which used in the heating system, and the parameters characterizing the heat exchange between the coolant and components of the heating system. It was developed algorithms for solving problems of analysis and synthesis heating system with tube gas heater located in structures to use evolutionary search algorithm and software. It was made experimental study and was obtained results allow to calculate the heat transfer from the gas-air mixture to the boundary surface of the building structure. This results and computation will provide full information support for solving problems of analysis and synthesis of the heating system. Was developed mathematical and software support, which allows to solve the problems of analysis and synthesis heating systems with gas tube heaters, located in building structures. Tube gas heaters located in the building structures allows with small capital expenditures to provide space heating. Is necessary to solve the problems of analysis (calculation and

Cascade Error Projection Learning Algorithm

Science.gov (United States)

Duong, T. A.; Stubberud, A. R.; Daud, T.

1995-01-01

A detailed mathematical analysis is presented for a new learning algorithm termed cascade error projection (CEP) and a general learning frame work. This frame work can be used to obtain the cascade correlation learning algorithm by choosing a particular set of parameters.

Flux-corrected transport principles, algorithms, and applications

CERN Document Server

Kuzmin, Dmitri; Turek, Stefan

2005-01-01

Addressing students and researchers as well as CFD practitioners, this book describes the state of the art in the development of high-resolution schemes based on the Flux-Corrected Transport (FCT) paradigm. Intended for readers who have a solid background in Computational Fluid Dynamics, the book begins with historical notes by J.P. Boris and D.L. Book. Review articles that follow describe recent advances in the design of FCT algorithms as well as various algorithmic aspects. The topics addressed in the book and its main highlights include: the derivation and analysis of classical FCT schemes with special emphasis on the underlying physical and mathematical constraints; flux limiting for hyperbolic systems; generalization of FCT to implicit time-stepping and finite element discretizations on unstructured meshes and its role as a subgrid scale model for Monotonically Integrated Large Eddy Simulation (MILES) of turbulent flows. The proposed enhancements of the FCT methodology also comprise the prelimiting and '...

System network planning expansion using mathematical programming, genetic algorithms and tabu search

International Nuclear Information System (INIS)

Sadegheih, A.; Drake, P.R.

2008-01-01

In this paper, system network planning expansion is formulated for mixed integer programming, a genetic algorithm (GA) and tabu search (TS). Compared with other optimization methods, GAs are suitable for traversing large search spaces, since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will tend to become more common as the search space increases in size. GA's give an excellent trade off between solution quality and computing time and flexibility for taking into account specific constraints in real situations. TS has emerged as a new, highly efficient, search paradigm for finding quality solutions to combinatorial problems. It is characterized by gathering knowledge during the search and subsequently profiting from this knowledge. The attractiveness of the technique comes from its ability to escape local optimality. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub-optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions and also provides information regarding the optimal generation at each generation point. This method of solution is demonstrated on the expansion of a 10 bus bar system to 18 bus bars. Finally, a steady-state genetic algorithm is employed rather than generational replacement, also uniform crossover is used

Validation of mathematical models to describe fluid dynamics of a cold riser by gamma ray attenuation

International Nuclear Information System (INIS)

Melo, Ana Cristina Bezerra Azedo de

2004-12-01

The fluid dynamic behavior of a riser in a cold type FCC model was investigated by means of catalyst concentration distribution measured with gamma attenuation and simulated with a mathematical model. In the riser of the cold model, MEF, 0,032 m in diameter, 2,30 m in length the fluidized bed, whose components are air and FCC catalyst, circulates. The MEF is operated by automatic control and instruments for measuring fluid dynamic variables. An axial catalyst concentration distribution was measured using an Am-241 gamma source and a NaI detector coupled to a multichannel provided with a software for data acquisition and evaluation. The MEF was adapted for a fluid dynamic model validation which describes the flow in the riser, for example, by introducing an injector for controlling the solid flow in circulation. Mathematical models were selected from literature, analyzed and tested to simulate the fluid dynamic of the riser. A methodology for validating fluid dynamic models was studied and implemented. The stages of the work were developed according to the validation methodology, such as data planning experiments, study of the equations which describe the fluidodynamic, computational solvers application and comparison with experimental data. Operational sequences were carried out keeping the MEF conditions for measuring catalyst concentration and simultaneously measuring the fluid dynamic variables, velocity of the components and pressure drop in the riser. Following this, simulated and experimental values were compared and statistical data treatment done, aiming at the required precision to validate the fluid dynamic model. The comparison tests between experimental and simulated data were carried out under validation criteria. The fluid dynamic behavior of the riser was analyzed and the results and the agreement with literature were discussed. The adopt model was validated under the MEF operational conditions, for a 3 to 6 m/s gas velocity in the riser and a slip

Using Coevolution Genetic Algorithm with Pareto Principles to Solve Project Scheduling Problem under Duration and Cost Constraints

Directory of Open Access Journals (Sweden)

Alexandr Victorovich Budylskiy

2014-06-01

Full Text Available This article considers the multicriteria optimization approach using the modified genetic algorithm to solve the project-scheduling problem under duration and cost constraints. The work contains the list of choices for solving this problem. The multicriteria optimization approach is justified here. The study describes the Pareto principles, which are used in the modified genetic algorithm. We identify the mathematical model of the project-scheduling problem. We introduced the modified genetic algorithm, the ranking strategies, the elitism approaches. The article includes the example.

Current Mathematical Methods Used in QSAR/QSPR Studies

Directory of Open Access Journals (Sweden)

Peixun Liu

2009-04-01

Full Text Available This paper gives an overview of the mathematical methods currently used in quantitative structure-activity/property relationship (QASR/QSPR studies. Recently, the mathematical methods applied to the regression of QASR/QSPR models are developing very fast, and new methods, such as Gene Expression Programming (GEP, Project Pursuit Regression (PPR and Local Lazy Regression (LLR have appeared on the QASR/QSPR stage. At the same time, the earlier methods, including Multiple Linear Regression (MLR, Partial Least Squares (PLS, Neural Networks (NN, Support Vector Machine (SVM and so on, are being upgraded to improve their performance in QASR/QSPR studies. These new and upgraded methods and algorithms are described in detail, and their advantages and disadvantages are evaluated and discussed, to show their application potential in QASR/QSPR studies in the future.

3rd International Conference on Computational Mathematics and Computational Geometry

CERN Document Server

Ravindran, Anton

2016-01-01

This volume presents original research contributed to the 3rd Annual International Conference on Computational Mathematics and Computational Geometry (CMCGS 2014), organized and administered by Global Science and Technology Forum (GSTF). Computational Mathematics and Computational Geometry are closely related subjects, but are often studied by separate communities and published in different venues. This volume is unique in its combination of these topics. After the conference, which took place in Singapore, selected contributions chosen for this volume and peer-reviewed. The section on Computational Mathematics contains papers that are concerned with developing new and efficient numerical algorithms for mathematical sciences or scientific computing. They also cover analysis of such algorithms to assess accuracy and reliability. The parts of this project that are related to Computational Geometry aim to develop effective and efficient algorithms for geometrical applications such as representation and computati...

Concurrent algorithms for nuclear shell model calculations

International Nuclear Information System (INIS)

Mackenzie, L.M.; Macleod, A.M.; Berry, D.J.; Whitehead, R.R.

1988-01-01

The calculation of nuclear properties has proved very successful for light nuclei, but is limited by the power of the present generation of computers. Starting with an analysis of current techniques, this paper discusses how these can be modified to map parallelism inherent in the mathematics onto appropriate parallel machines. A prototype dedicated multiprocessor for nuclear structure calculations, designed and constructed by the authors, is described and evaluated. The approach adopted is discussed in the context of a number of generically similar algorithms. (orig.)

Exponentially Convergent Algorithms for Abstract Differential Equations

CERN Document Server

Gavrilyuk, Ivan; Vasylyk, Vitalii

2011-01-01

This book presents new accurate and efficient exponentially convergent methods for abstract differential equations with unbounded operator coefficients in Banach space. These methods are highly relevant for the practical scientific computing since the equations under consideration can be seen as the meta-models of systems of ordinary differential equations (ODE) as well as the partial differential equations (PDEs) describing various applied problems. The framework of functional analysis allows one to obtain very general but at the same time transparent algorithms and mathematical results which

Applied Computational Mathematics in Social Sciences

CERN Document Server

Damaceanu, Romulus-Catalin

2010-01-01

Applied Computational Mathematics in Social Sciences adopts a modern scientific approach that combines knowledge from mathematical modeling with various aspects of social science. Special algorithms can be created to simulate an artificial society and a detailed analysis can subsequently be used to project social realities. This Ebook specifically deals with computations using the NetLogo platform, and is intended for researchers interested in advanced human geography and mathematical modeling studies.

Mathematics

International Nuclear Information System (INIS)

Demazure, M.

1988-01-01

The 1988 progress report of the Mathematics center (Polytechnic School, France), is presented. The Center is composed of different research teams: analysis, Riemann geometry, group theory, formal calculus and algorithm geometry, dynamical systems, topology and singularity. For each team, the members, the research topics, the national and international cooperations, are given. The papers concerning the investigations carried out in 1988, are listed [fr

A fitting algorithm based on simulated annealing techniques for efficiency calibration of HPGe detectors using different mathematical functions

Energy Technology Data Exchange (ETDEWEB)

Hurtado, S. [Servicio de Radioisotopos, Centro de Investigacion, Tecnologia e Innovacion (CITIUS), Universidad de Sevilla, Avda. Reina Mercedes s/n, 41012 Sevilla (Spain)], E-mail: shurtado@us.es; Garcia-Leon, M. [Departamento de Fisica Atomica, Molecular y Nuclear, Facultad de Fisica, Universidad de Sevilla, Aptd. 1065, 41080 Sevilla (Spain); Garcia-Tenorio, R. [Departamento de Fisica Aplicada II, E.T.S.A. Universidad de Sevilla, Avda, Reina Mercedes 2, 41012 Sevilla (Spain)

2008-09-11

In this work several mathematical functions are compared in order to perform the full-energy peak efficiency calibration of HPGe detectors using a 126cm{sup 3} HPGe coaxial detector and gamma-ray energies ranging from 36 to 1460 keV. Statistical tests and Monte Carlo simulations were used to study the performance of the fitting curve equations. Furthermore the fitting procedure of these complex functional forms to experimental data is a non-linear multi-parameter minimization problem. In gamma-ray spectrometry usually non-linear least-squares fitting algorithms (Levenberg-Marquardt method) provide a fast convergence while minimizing {chi}{sub R}{sup 2}, however, sometimes reaching only local minima. In order to overcome that shortcoming a hybrid algorithm based on simulated annealing (HSA) techniques is proposed. Additionally a new function is suggested that models the efficiency curve of germanium detectors in gamma-ray spectrometry.

Parallel algorithms and cluster computing

CERN Document Server

Hoffmann, Karl Heinz

2007-01-01

This book presents major advances in high performance computing as well as major advances due to high performance computing. It contains a collection of papers in which results achieved in the collaboration of scientists from computer science, mathematics, physics, and mechanical engineering are presented. From the science problems to the mathematical algorithms and on to the effective implementation of these algorithms on massively parallel and cluster computers we present state-of-the-art methods and technology as well as exemplary results in these fields. This book shows that problems which seem superficially distinct become intimately connected on a computational level.

Software and mathematical support of Kazakhstani star tracker

Science.gov (United States)

Akhmedov, D.; Yelubayev, S.; Ten, V.; Bopeyev, T.; Alipbayev, K.; Sukhenko, A.

2016-10-01

Currently the specialists of Kazakhstan have been developing the star tracker that is further planned to use on Kazakhstani satellites of various purposes. At the first stage it has been developed the experimental model of star tracker that has following characteristics: field of view 20°, update frequency 2 Hz, exclusion angle 40°, accuracy of attitude determination of optical axis/around optical axis 15/50 arcsec. Software and mathematical support are the most high technology parts of star tracker. The results of software and mathematical support development of experimental model of Kazakhstani star tracker are represented in this article. In particular, there are described the main mathematical models and algorithms that have been used as a basis for program units of preliminary image processing of starry sky, stars identification and star tracker attitude determination. The results of software and mathematical support testing with the help of program simulation complex using various configurations of defects including image sensor noises, point spread function modeling, optical system distortion up to 2% are presented. Analysis of testing results has shown that accuracy of attitude determination of star tracker is within the permissible range

Next Generation Suspension Dynamics Algorithms

Energy Technology Data Exchange (ETDEWEB)

Schunk, Peter Randall [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Higdon, Jonathon [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Chen, Steven [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2014-12-01

This research project has the objective to extend the range of application, improve the efficiency and conduct simulations with the Fast Lubrication Dynamics (FLD) algorithm for concentrated particle suspensions in a Newtonian fluid solvent. The research involves a combination of mathematical development, new computational algorithms, and application to processing flows of relevance in materials processing. The mathematical developments clarify the underlying theory, facilitate verification against classic monographs in the field and provide the framework for a novel parallel implementation optimized for an OpenMP shared memory environment. The project considered application to consolidation flows of major interest in high throughput materials processing and identified hitherto unforeseen challenges in the use of FLD in these applications. Extensions to the algorithm have been developed to improve its accuracy in these applications.

Algorithms in Algebraic Geometry

CERN Document Server

Dickenstein, Alicia; Sommese, Andrew J

2008-01-01

In the last decade, there has been a burgeoning of activity in the design and implementation of algorithms for algebraic geometric computation. Some of these algorithms were originally designed for abstract algebraic geometry, but now are of interest for use in applications and some of these algorithms were originally designed for applications, but now are of interest for use in abstract algebraic geometry. The workshop on Algorithms in Algebraic Geometry that was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its

Combinatorial optimization algorithms and complexity

CERN Document Server

Papadimitriou, Christos H

1998-01-01

This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering.

Optimization of Pressurizer Based on Genetic-Simplex Algorithm

International Nuclear Information System (INIS)

Wang, Cheng; Yan, Chang Qi; Wang, Jian Jun

2014-01-01

Pressurizer is one of key components in nuclear power system. It's important to control the dimension in the design of pressurizer through optimization techniques. In this work, a mathematic model of a vertical electric heating pressurizer was established. A new Genetic-Simplex Algorithm (GSA) that combines genetic algorithm and simplex algorithm was developed to enhance the searching ability, and the comparison among modified and original algorithms is conducted by calculating the benchmark function. Furthermore, the optimization design of pressurizer, taking minimization of volume and net weight as objectives, was carried out considering thermal-hydraulic and geometric constraints through GSA. The results indicate that the mathematical model is agreeable for the pressurizer and the new algorithm is more effective than the traditional genetic algorithm. The optimization design shows obvious validity and can provide guidance for real engineering design

Mathematics Teachers' Ideas about Mathematical Models: A Diverse Landscape

Science.gov (United States)

Bautista, Alfredo; Wilkerson-Jerde, Michelle H.; Tobin, Roger G.; Brizuela, Bárbara M.

2014-01-01

This paper describes the ideas that mathematics teachers (grades 5-9) have regarding mathematical models of real-world phenomena, and explores how teachers' ideas differ depending on their educational background. Participants were 56 United States in-service mathematics teachers. We analyzed teachers' written responses to three open-ended…

Continuous time Boolean modeling for biological signaling: application of Gillespie algorithm.

Science.gov (United States)

Stoll, Gautier; Viara, Eric; Barillot, Emmanuel; Calzone, Laurence

2012-08-29

Mathematical modeling is used as a Systems Biology tool to answer biological questions, and more precisely, to validate a network that describes biological observations and predict the effect of perturbations. This article presents an algorithm for modeling biological networks in a discrete framework with continuous time. There exist two major types of mathematical modeling approaches: (1) quantitative modeling, representing various chemical species concentrations by real numbers, mainly based on differential equations and chemical kinetics formalism; (2) and qualitative modeling, representing chemical species concentrations or activities by a finite set of discrete values. Both approaches answer particular (and often different) biological questions. Qualitative modeling approach permits a simple and less detailed description of the biological systems, efficiently describes stable state identification but remains inconvenient in describing the transient kinetics leading to these states. In this context, time is represented by discrete steps. Quantitative modeling, on the other hand, can describe more accurately the dynamical behavior of biological processes as it follows the evolution of concentration or activities of chemical species as a function of time, but requires an important amount of information on the parameters difficult to find in the literature. Here, we propose a modeling framework based on a qualitative approach that is intrinsically continuous in time. The algorithm presented in this article fills the gap between qualitative and quantitative modeling. It is based on continuous time Markov process applied on a Boolean state space. In order to describe the temporal evolution of the biological process we wish to model, we explicitly specify the transition rates for each node. For that purpose, we built a language that can be seen as a generalization of Boolean equations. Mathematically, this approach can be translated in a set of ordinary differential

Algorithms in Modern Mathematics and Computer Science.

Science.gov (United States)

1980-01-01

importance, since we will go on doing what we are doing no matter what it is called; after all, other disciplines like Mathematics and Chemistry are no...longer related very strongly to the etymology of their names. However, if I had a chance to vote for the name of my own discipline, I would choose to call

Honing process optimization algorithms

Science.gov (United States)

Kadyrov, Ramil R.; Charikov, Pavel N.; Pryanichnikova, Valeria V.

2018-03-01

This article considers the relevance of honing processes for creating high-quality mechanical engineering products. The features of the honing process are revealed and such important concepts as the task for optimization of honing operations, the optimal structure of the honing working cycles, stepped and stepless honing cycles, simulation of processing and its purpose are emphasized. It is noted that the reliability of the mathematical model determines the quality parameters of the honing process control. An algorithm for continuous control of the honing process is proposed. The process model reliably describes the machining of a workpiece in a sufficiently wide area and can be used to operate the CNC machine CC743.

An algorithm for discovering Lagrangians automatically from data

Directory of Open Access Journals (Sweden)

Daniel J.A. Hills

2015-11-01

Full Text Available An activity fundamental to science is building mathematical models. These models are used to both predict the results of future experiments and gain insight into the structure of the system under study. We present an algorithm that automates the model building process in a scientifically principled way. The algorithm can take observed trajectories from a wide variety of mechanical systems and, without any other prior knowledge or tuning of parameters, predict the future evolution of the system. It does this by applying the principle of least action and searching for the simplest Lagrangian that describes the system’s behaviour. By generating this Lagrangian in a human interpretable form, it can also provide insight into the workings of the system.

Mathematical model of accelerator output characteristics and their calculation on a computer

International Nuclear Information System (INIS)

Mishulina, O.A.; Ul'yanina, M.N.; Kornilova, T.V.

1975-01-01

A mathematical model is described of output characteristics of a linear accelerator. The model is a system of differential equations. Presence of phase limitations is a specific feature of setting the problem which makes it possible to ensure higher simulation accuracy and determine a capture coefficient. An algorithm is elaborated of computing output characteristics based upon the mathematical model suggested. A capture coefficient, coordinate expectation characterizing an average phase value of the beam particles, coordinate expectation characterizing an average value of the reverse relative velocity of the beam particles as well as dispersion of these coordinates are output characteristics of the accelerator. Calculation methods of the accelerator output characteristics are described in detail. The computations have been performed on the BESM-6 computer, the characteristics computing time being 2 min 20 sec. Relative error of parameter computation averages 10 -2

Mathematical Modelling in the Junior Secondary Years: An Approach Incorporating Mathematical Technology

Science.gov (United States)

Lowe, James; Carter, Merilyn; Cooper, Tom

2018-01-01

Mathematical models are conceptual processes that use mathematics to describe, explain, and/or predict the behaviour of complex systems. This article is written for teachers of mathematics in the junior secondary years (including out-of-field teachers of mathematics) who may be unfamiliar with mathematical modelling, to explain the steps involved…

Mathematical algorithm development and parametric studies with the GEOFRAC three-dimensional stochastic model of natural rock fracture systems

Science.gov (United States)

Ivanova, Violeta M.; Sousa, Rita; Murrihy, Brian; Einstein, Herbert H.

2014-06-01

This paper presents results from research conducted at MIT during 2010-2012 on modeling of natural rock fracture systems with the GEOFRAC three-dimensional stochastic model. Following a background summary of discrete fracture network models and a brief introduction of GEOFRAC, the paper provides a thorough description of the newly developed mathematical and computer algorithms for fracture intensity, aperture, and intersection representation, which have been implemented in MATLAB. The new methods optimize, in particular, the representation of fracture intensity in terms of cumulative fracture area per unit volume, P32, via the Poisson-Voronoi Tessellation of planes into polygonal fracture shapes. In addition, fracture apertures now can be represented probabilistically or deterministically whereas the newly implemented intersection algorithms allow for computing discrete pathways of interconnected fractures. In conclusion, results from a statistical parametric study, which was conducted with the enhanced GEOFRAC model and the new MATLAB-based Monte Carlo simulation program FRACSIM, demonstrate how fracture intensity, size, and orientations influence fracture connectivity.

Mathematical modeling of continuous ethanol fermentation in a membrane bioreactor by pervaporation compared to conventional system: Genetic algorithm.

Science.gov (United States)

Esfahanian, Mehri; Shokuhi Rad, Ali; Khoshhal, Saeed; Najafpour, Ghasem; Asghari, Behnam

2016-07-01

In this paper, genetic algorithm was used to investigate mathematical modeling of ethanol fermentation in a continuous conventional bioreactor (CCBR) and a continuous membrane bioreactor (CMBR) by ethanol permselective polydimethylsiloxane (PDMS) membrane. A lab scale CMBR with medium glucose concentration of 100gL(-1) and Saccharomyces cerevisiae microorganism was designed and fabricated. At dilution rate of 0.14h(-1), maximum specific cell growth rate and productivity of 0.27h(-1) and 6.49gL(-1)h(-1) were respectively found in CMBR. However, at very high dilution rate, the performance of CMBR was quite similar to conventional fermentation on account of insufficient incubation time. In both systems, genetic algorithm modeling of cell growth, ethanol production and glucose concentration were conducted based on Monod and Moser kinetic models during each retention time at unsteady condition. The results showed that Moser kinetic model was more satisfactory and desirable than Monod model. Copyright © 2016 Elsevier Ltd. All rights reserved.

33rd International School of Mathematics "G Stampacchia ": High Performance Algorithms and Software for Nonlinear Optics "Ettore Majorana"

CERN Document Server

Murli, Almerico; High Performance Algorithms and Software for Nonlinear Optics

2003-01-01

This volume contains the edited texts of the lectures presented at the Workshop on High Performance Algorithms and Software for Nonlinear Optimization held in Erice, Sicily, at the "G. Stampacchia" School of Mathematics of the "E. Majorana" Centre for Scientific Culture, June 30 - July 8, 2001. In the first year of the new century, the aim of the Workshop was to assess the past and to discuss the future of Nonlinear Optimization, and to highlight recent achieve­ ments and promising research trends in this field. An emphasis was requested on algorithmic and high performance software developments and on new computational experiences, as well as on theoretical advances. We believe that such goal was basically achieved. The Workshop was attended by 71 people from 22 countries. Although not all topics were covered, the presentations gave indeed a wide overview of the field, from different and complementary stand­ points. Besides the lectures, several formal and informal discussions took place. We wish ...

Discrete mathematics using a computer

CERN Document Server

Hall, Cordelia

2000-01-01

Several areas of mathematics find application throughout computer science, and all students of computer science need a practical working understanding of them. These core subjects are centred on logic, sets, recursion, induction, relations and functions. The material is often called discrete mathematics, to distinguish it from the traditional topics of continuous mathematics such as integration and differential equations. The central theme of this book is the connection between computing and discrete mathematics. This connection is useful in both directions: • Mathematics is used in many branches of computer science, in applica­ tions including program specification, datastructures,design and analysis of algorithms, database systems, hardware design, reasoning about the correctness of implementations, and much more; • Computers can help to make the mathematics easier to learn and use, by making mathematical terms executable, making abstract concepts more concrete, and through the use of software tools su...

Modelling and Optimizing Mathematics Learning in Children

Science.gov (United States)

Käser, Tanja; Busetto, Alberto Giovanni; Solenthaler, Barbara; Baschera, Gian-Marco; Kohn, Juliane; Kucian, Karin; von Aster, Michael; Gross, Markus

2013-01-01

This study introduces a student model and control algorithm, optimizing mathematics learning in children. The adaptive system is integrated into a computer-based training system for enhancing numerical cognition aimed at children with developmental dyscalculia or difficulties in learning mathematics. The student model consists of a dynamic…

Distributed Multi-Commodity Network Flow Algorithm for Energy Optimal Routing in Wireless Sensor Networks.

Directory of Open Access Journals (Sweden)

J. Trdlicka

2010-12-01

Full Text Available This work proposes a distributed algorithm for energy optimal routing in a wireless sensor network. The routing problem is described as a mathematical problem by the minimum-cost multi-commodity network flow problem. Due to the separability of the problem, we use the duality theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without any central node or knowledge of the whole network structure. Each node only needs to know the flow which is supposed to send or receive and the costs and capacities of the neighboring links. An evaluation of the presented algorithm on benchmarks for the energy optimal data flow routing in sensor networks with up to 100 nodes is presented.

Evolutionary Algorithms for Boolean Queries Optimization

Czech Academy of Sciences Publication Activity Database

Húsek, Dušan; Snášel, Václav; Neruda, Roman; Owais, S.S.J.; Krömer, P.

2006-01-01

Roč. 3, č. 1 (2006), s. 15-20 ISSN 1790-0832 R&D Projects: GA AV ČR 1ET100300414 Institutional research plan: CEZ:AV0Z10300504 Keywords : evolutionary algorithms * genetic algorithms * information retrieval * Boolean query Subject RIV: BA - General Mathematics

Mathematical Chemistry

OpenAIRE

Trinajstić, Nenad; Gutman, Ivan

2002-01-01

A brief description is given of the historical development of mathematics and chemistry. A path leading to the meeting of these two sciences is described. An attempt is made to define mathematical chemistry, and journals containing the term mathematical chemistry in their titles are noted. In conclusion, the statement is made that although chemistry is an experimental science aimed at preparing new compounds and materials, mathematics is very useful in chemistry, among other things, to produc...

Stochastic Recursive Algorithms for Optimization Simultaneous Perturbation Methods

CERN Document Server

Bhatnagar, S; Prashanth, L A

2013-01-01

Stochastic Recursive Algorithms for Optimization presents algorithms for constrained and unconstrained optimization and for reinforcement learning. Efficient perturbation approaches form a thread unifying all the algorithms considered. Simultaneous perturbation stochastic approximation and smooth fractional estimators for gradient- and Hessian-based methods are presented. These algorithms: • are easily implemented; • do not require an explicit system model; and • work with real or simulated data. Chapters on their application in service systems, vehicular traffic control and communications networks illustrate this point. The book is self-contained with necessary mathematical results placed in an appendix. The text provides easy-to-use, off-the-shelf algorithms that are given detailed mathematical treatment so the material presented will be of significant interest to practitioners, academic researchers and graduate students alike. The breadth of applications makes the book appropriate for reader from sim...

Framelets and wavelets algorithms, analysis, and applications

CERN Document Server

Han, Bin

2017-01-01

Marking a distinct departure from the perspectives of frame theory and discrete transforms, this book provides a comprehensive mathematical and algorithmic introduction to wavelet theory. As such, it can be used as either a textbook or reference guide. As a textbook for graduate mathematics students and beginning researchers, it offers detailed information on the basic theory of framelets and wavelets, complemented by self-contained elementary proofs, illustrative examples/figures, and supplementary exercises. Further, as an advanced reference guide for experienced researchers and practitioners in mathematics, physics, and engineering, the book addresses in detail a wide range of basic and advanced topics (such as multiwavelets/multiframelets in Sobolev spaces and directional framelets) in wavelet theory, together with systematic mathematical analysis, concrete algorithms, and recent developments in and applications of framelets and wavelets. Lastly, the book can also be used to teach on or study selected spe...

DaMoScope and its internet graphics for the visual control of adjusting mathematical models describing experimental data

Science.gov (United States)

Belousov, V. I.; Ezhela, V. V.; Kuyanov, Yu. V.; Tkachenko, N. P.

2015-12-01

The experience of using the dynamic atlas of the experimental data and mathematical models of their description in the problems of adjusting parametric models of observable values depending on kinematic variables is presented. The functional possibilities of an image of a large number of experimental data and the models describing them are shown by examples of data and models of observable values determined by the amplitudes of elastic scattering of hadrons. The Internet implementation of an interactive tool DaMoScope and its interface with the experimental data and codes of adjusted parametric models with the parameters of the best description of data are schematically shown. The DaMoScope codes are freely available.

DaMoScope and its internet graphics for the visual control of adjusting mathematical models describing experimental data

Energy Technology Data Exchange (ETDEWEB)

Belousov, V. I.; Ezhela, V. V.; Kuyanov, Yu. V., E-mail: Yu.Kuyanov@gmail.com; Tkachenko, N. P. [Institute for High Energy Physics, National Research Center Kurchatov Institute, COMPAS Group (Russian Federation)

2015-12-15

The experience of using the dynamic atlas of the experimental data and mathematical models of their description in the problems of adjusting parametric models of observable values depending on kinematic variables is presented. The functional possibilities of an image of a large number of experimental data and the models describing them are shown by examples of data and models of observable values determined by the amplitudes of elastic scattering of hadrons. The Internet implementation of an interactive tool DaMoScope and its interface with the experimental data and codes of adjusted parametric models with the parameters of the best description of data are schematically shown. The DaMoScope codes are freely available.

DaMoScope and its internet graphics for the visual control of adjusting mathematical models describing experimental data

International Nuclear Information System (INIS)

Belousov, V. I.; Ezhela, V. V.; Kuyanov, Yu. V.; Tkachenko, N. P.

2015-01-01

The experience of using the dynamic atlas of the experimental data and mathematical models of their description in the problems of adjusting parametric models of observable values depending on kinematic variables is presented. The functional possibilities of an image of a large number of experimental data and the models describing them are shown by examples of data and models of observable values determined by the amplitudes of elastic scattering of hadrons. The Internet implementation of an interactive tool DaMoScope and its interface with the experimental data and codes of adjusted parametric models with the parameters of the best description of data are schematically shown. The DaMoScope codes are freely available

A Novel Assembly Line Scheduling Algorithm Based on CE-PSO

Directory of Open Access Journals (Sweden)

Xiaomei Hu

2015-01-01

Full Text Available With the widespread application of assembly line in enterprises, assembly line scheduling is an important problem in the production since it directly affects the productivity of the whole manufacturing system. The mathematical model of assembly line scheduling problem is put forward and key data are confirmed. A double objective optimization model based on equipment utilization and delivery time loss is built, and optimization solution strategy is described. Based on the idea of solution strategy, assembly line scheduling algorithm based on CE-PSO is proposed to overcome the shortcomings of the standard PSO. Through the simulation experiments of two examples, the validity of the assembly line scheduling algorithm based on CE-PSO is proved.

The written mathematical communication profile of prospective math teacher in mathematical proving

Science.gov (United States)

Pantaleon, K. V.; Juniati, D.; Lukito, A.; Mandur, K.

2018-01-01

Written mathematical communication is the process of expressing mathematical ideas and understanding in writing. It is one of the important aspects that must be mastered by the prospective math teacher as tool of knowledge transfer. This research was a qualitative research that aimed to describe the mathematical communication profile of the prospective mathematics teacher in mathematical proving. This research involved 48 students of Mathematics Education Study Program; one of them with moderate math skills was chosen as the main subject. Data were collected through tests, assignments, and task-based interviews. The results of this study point out that in the proof of geometry, the subject explains what is understood, presents the idea in the form of drawing and symbols, and explains the content/meaning of a representation accurately and clearly, but the subject can not convey the argument systematically and logically. Whereas in the proof of algebra, the subject describes what is understood, explains the method used, and describes the content/meaning of a symbolic representation accurately, systematically, logically, but the argument presented is not clear because it is insufficient detailed and complete.

Machine Learning an algorithmic perspective

CERN Document Server

Marsland, Stephen

2009-01-01

Traditional books on machine learning can be divided into two groups - those aimed at advanced undergraduates or early postgraduates with reasonable mathematical knowledge and those that are primers on how to code algorithms. The field is ready for a text that not only demonstrates how to use the algorithms that make up machine learning methods, but also provides the background needed to understand how and why these algorithms work. Machine Learning: An Algorithmic Perspective is that text.Theory Backed up by Practical ExamplesThe book covers neural networks, graphical models, reinforcement le

A distributed multi-agent linear biobjective algorithm for energy flow optimization in microgrids

DEFF Research Database (Denmark)

Brehm, Robert; Top, Søren; Mátéfi-Tempfli, Stefan

2016-01-01

consisting of local energy resources and storage capacities is presented which is based on the auction algorithm for assignment problems originally introduced by Bertsekas in 1979 [1]. It is shown that the topology of a microgrid can be represented as a bipartite graph and mathematically be described...... as a classical transportation problem. This allows applying an auction algorithm scheme in a distributed way where each energy supply system node is either a source or a sink and is represented by an individual acting agent. The single-objective approach is extended towards bi-objectivity to build a framework...

The Mathematical Modelling of Heat Transfer in Electrical Cables

Directory of Open Access Journals (Sweden)

Bugajev Andrej

2014-05-01

Full Text Available This paper describes a mathematical modelling approach for heat transfer calculations in underground high voltage and middle voltage electrical power cables. First of the all typical layout of the cable in the sand or soil is described. Then numerical algorithms are targeted to the two-dimensional mathematical models of transient heat transfer. Finite Volume Method is suggested for calculations. Different strategies of nonorthogonality error elimination are considered. Acute triangles meshes were applied in two-dimensional domain to eliminate this error. Adaptive mesh is also tried. For calculations OpenFOAM open source software which uses Finite Volume Method is applied. To generate acute triangles meshes aCute library is used. The efficiency of the proposed approach is analyzed. The results show that the second order of convergence or close to that is achieved (in terms of sizes of finite volumes. Also it is shown that standard strategy, used by OpenFOAM is less efficient than the proposed approach. Finally it is concluded that for solving real problem a spatial adaptive mesh is essential and adaptive time steps also may be needed.

Machine Learning via Mathematical Programming

National Research Council Canada - National Science Library

Mamgasarian, Olivi

1999-01-01

Mathematical programming approaches were applied to a variety of problems in machine learning in order to gain deeper understanding of the problems and to come up with new and more efficient computational algorithms...

An Improved Harmony Search Algorithm for Power Distribution Network Planning

Directory of Open Access Journals (Sweden)

Wei Sun

2015-01-01

Full Text Available Distribution network planning because of involving many variables and constraints is a multiobjective, discrete, nonlinear, and large-scale optimization problem. Harmony search (HS algorithm is a metaheuristic algorithm inspired by the improvisation process of music players. HS algorithm has several impressive advantages, such as easy implementation, less adjustable parameters, and quick convergence. But HS algorithm still has some defects such as premature convergence and slow convergence speed. According to the defects of the standard algorithm and characteristics of distribution network planning, an improved harmony search (IHS algorithm is proposed in this paper. We set up a mathematical model of distribution network structure planning, whose optimal objective function is to get the minimum annual cost and constraint conditions are overload and radial network. IHS algorithm is applied to solve the complex optimization mathematical model. The empirical results strongly indicate that IHS algorithm can effectively provide better results for solving the distribution network planning problem compared to other optimization algorithms.

A simple algorithm for calculating the area of an arbitrary polygon

Directory of Open Access Journals (Sweden)

K.R. Wijeweera

2017-06-01

Full Text Available Computing the area of an arbitrary polygon is a popular problem in pure mathematics. The two methods used are Shoelace Method (SM and Orthogonal Trapezoids Method (OTM. In OTM, the polygon is partitioned into trapezoids by drawing either horizontal or vertical lines through its vertices. The area of each trapezoid is computed and the resultant areas are added up. In SM, a formula which is a generalization of Green’s Theorem for the discrete case is used. The most of the available systems is based on SM. Since an algorithm for OTM is not available in literature, this paper proposes an algorithm for OTM along with efficient implementation. Conversion of a pure mathematical method into an efficient computer program is not straightforward. In order to reduce the run time, minimal computation needs to be achieved. Handling of indeterminate forms and special cases separately can support this. On the other hand, precision error should also be avoided. Salient feature of the proposed algorithm is that it successfully handles these situations achieving minimum run time. Experimental results of the proposed method are compared against that of the existing algorithm. However, the proposed algorithm suggests a way to partition a polygon into orthogonal trapezoids which is not an easy task. Additionally, the proposed algorithm uses only basic mathematical concepts while the Green’s theorem uses complicated mathematical concepts. The proposed algorithm can be used when the simplicity is important than the speed.

Optimization of Consignment-Store-Based Supply Chain with Black Hole Algorithm

Directory of Open Access Journals (Sweden)

Ágota Bányai

2017-01-01

Full Text Available The globalization of economy and market led to increased networking in the field of manufacturing and services. These manufacturing and service processes including supply chain became more and more complex. The supply chain includes in many cases consignment stores. The design and operation of these complex supply chain processes can be described as NP-hard optimization problems. These problems can be solved using sophisticated models and methods based on metaheuristic algorithms. This research proposes an integrated supply model based on consignment stores. After a careful literature review, this paper introduces a mathematical model to formulate the problem of consignment-store-based supply chain optimization. The integrated model includes facility location and assignment problems to be solved. Next, an enhanced black hole algorithm dealing with multiobjective supply chain model is presented. The sensitivity analysis of the heuristic black hole optimization method is also described to check the efficiency of new operators to increase the convergence of the algorithm. Numerical results with different datasets demonstrate how the proposed model supports the efficiency, flexibility, and reliability of the consignment-store-based supply chain.

Protective relaying of power systems using mathematical morphology

CERN Document Server

Wu, QH; Ji, TY

2009-01-01

Discusses the development of novel protective relaying algorithms, using Mathematical Morphology (MM). This book introduces the fundamental principles of MM, and brings together the applications of MM to develop different protective relaying algorithms for the protection of a variety of power system components.

A short course in discrete mathematics

CERN Document Server

Bender, Edward A

2004-01-01

What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the text assumes some familiarity with calculus. Topics include Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, seq

Automatic optimization of constants and special mathematic ensuring algorithms SKALA-micro system of RBMK-1000 reactor self-certification in operation

International Nuclear Information System (INIS)

Aleksandrov, S.I.; Dmitrenko, V.V.; Postnikov, V.V.; Sviridenkov, A.N.; Yurkin, G.V.; Yakunin, I.S.

2007-01-01

Paper dwells upon problems dealing with accuracy improvement of the energy release distribution and the safety margin of the RBMK-1000 operation. The accuracy is improved through the automatic optimization of some constants used in the SKALA-micro system special mathematic ensuring program and the regular self-validation of the algorithm to determine the energy release distribution calculation error. The validation based on the regular scanning of the reactor core by a calibrating detector and through the sequence disabling of the internal detectors is shown to give the close results [ru

ROBUST CONTROL ALGORITHM FOR MULTIVARIABLE PLANTS WITH QUANTIZED OUTPUT

Directory of Open Access Journals (Sweden)

A. A. Margun

2017-01-01

Full Text Available The paper deals with robust output control algorithm for multivariable plants under disturbances. A plant is described by the system of linear differential equations with known relative degrees. Plant parameters are unknown but belong to the known closed bounded set. Plant state vector is unmeasured. Plant output is measured only via static quantizer. Control system algorithm is based on the high gain feedback method. Developed controller provides exponential convergence of tracking error to the bounded area. The area bounds depend on quantizer parameters and the value of external disturbances. Experimental approbation of the proposed control algorithm is performed with the use of Twin Rotor MIMO System laboratory bench. This bench is a helicopter like model with two degrees of freedom (pitch and yaw. DC motors are used as actuators. The output signals are measured via optical encoders. Mathematical model of laboratory bench is obtained. Proposed algorithm was compared with proportional - integral – differential controller in conditions of output quantization. Obtained results have confirmed the efficiency of proposed controller.

A new mathematical model of gastrointestinal transit incorporating age- and gender-dependent physiological parameters

International Nuclear Information System (INIS)

Stubbs, J.B.

1992-01-01

As part of the revision by the International Commission on Radiological Protection (ICRP) of its report on Reference Man, an extensive review of the literature regarding anatomy and morphology of the gastrointestinal (GI) tract has been completed. Data on age- and gender-dependent GI physiology and motility may be included in the proposed ICRP report. A new mathematical model describing the transit of substances through the GI tract as well as the absorption and secretion of material in the GI tract has been developed. This mathematical description of GI tract kinetics utilizes more physiologically accurate transit processes than the mathematically simple, but nonphysiological, GI tract model that was used in ICRP Report 30. The proposed model uses a combination of zero- and first-order kinetics to describe motility. Some of the physiological parameters that the new model accounts for include sex, age, pathophysiological condition and meal phase (solid versus liquid). A computer algorithm, written in BASIC, based on this new model has been derived and results are compared to those of the ICRP-30 model

Handbook of mathematical methods in imaging

CERN Document Server

2015-01-01

The Handbook of Mathematical Methods in Imaging provides a comprehensive treatment of the mathematical techniques used in imaging science. The material is grouped into two central themes, namely, Inverse Problems (Algorithmic Reconstruction) and Signal and Image Processing. Each section within the themes covers applications (modeling), mathematics, numerical methods (using a case example) and open questions. Written by experts in the area, the presentation is mathematically rigorous. This expanded and revised second edition contains updates to existing chapters and 16 additional entries on important mathematical methods such as graph cuts, morphology, discrete geometry, PDEs, conformal methods, to name a few. The entries are cross-referenced for easy navigation through connected topics. Available in both print and electronic forms, the handbook is enhanced by more than 200 illustrations and an extended bibliography. It will benefit students, scientists and researchers in applied mathematics. Engineers and com...

Deriving the Normalized Min-Sum Algorithm from Cooperative Optimization

OpenAIRE

Huang, Xiaofei

2006-01-01

The normalized min-sum algorithm can achieve near-optimal performance at decoding LDPC codes. However, it is a critical question to understand the mathematical principle underlying the algorithm. Traditionally, people thought that the normalized min-sum algorithm is a good approximation to the sum-product algorithm, the best known algorithm for decoding LDPC codes and Turbo codes. This paper offers an alternative approach to understand the normalized min-sum algorithm. The algorithm is derive...

Empowering Mathematical Practices

Science.gov (United States)

Coomes, Jacqueline; Lee, Hyung Sook

2017-01-01

Mathematics teachers want to empower students as mathematical thinkers and doers (NCTM 2000). Specific ways of thinking and doing mathematics were described in the Process Standards (NCTM 2000); they were further characterized as habits of mind (Mark, Goldenberg, and Sword 2010); and more recently, they were detailed in the Common Core's Standards…

Decoding algorithm for vortex communications receiver

Science.gov (United States)

Kupferman, Judy; Arnon, Shlomi

2018-01-01

Vortex light beams can provide a tremendous alphabet for encoding information. We derive a symbol decoding algorithm for a direct detection matrix detector vortex beam receiver using Laguerre Gauss (LG) modes, and develop a mathematical model of symbol error rate (SER) for this receiver. We compare SER as a function of signal to noise ratio (SNR) for our algorithm and for the Pearson correlation algorithm. To our knowledge, this is the first comprehensive treatment of a decoding algorithm of a matrix detector for an LG receiver.

Optimization algorithms and applications

CERN Document Server

Arora, Rajesh Kumar

2015-01-01

Choose the Correct Solution Method for Your Optimization ProblemOptimization: Algorithms and Applications presents a variety of solution techniques for optimization problems, emphasizing concepts rather than rigorous mathematical details and proofs. The book covers both gradient and stochastic methods as solution techniques for unconstrained and constrained optimization problems. It discusses the conjugate gradient method, Broyden-Fletcher-Goldfarb-Shanno algorithm, Powell method, penalty function, augmented Lagrange multiplier method, sequential quadratic programming, method of feasible direc

A mathematical approach to research problems of science and technology theoretical basis and developments in mathematical modeling

CERN Document Server

Ei, Shin-ichiro; Koiso, Miyuki; Ochiai, Hiroyuki; Okada, Kanzo; Saito, Shingo; Shirai, Tomoyuki

2014-01-01

This book deals with one of the most novel advances in mathematical modeling for applied scientific technology, including computer graphics, public-key encryption, data visualization, statistical data analysis, symbolic calculation, encryption, error correcting codes, and risk management. It also shows that mathematics can be used to solve problems from nature, e.g., slime mold algorithms. One of the unique features of this book is that it shows readers how to use pure and applied mathematics, especially those mathematical theory/techniques developed in the twentieth century, and developing now, to solve applied problems in several fields of industry. Each chapter includes clues on how to use "mathematics" to solve concrete problems faced in industry as well as practical applications. The target audience is not limited to researchers working in applied mathematics and includes those in engineering, material sciences, economics, and life sciences.

Mathematics for the environment

CERN Document Server

Walter, Martin

2011-01-01

MATHEMATICS IS CONNECTED TO EVERYTHING ELSEEarth's Climate and Some Basic Principles One of the Greatest Crimes of the 20th Century Feedback Edison's Algorithm: Listening to Nature's Feedback Fuzzy Logic, Filters, the Bigger Picture Principle Consequences of the Crime: Suburbia's Topology A Toxic Consequence of the Crime Hubbert's Peak and the End of Cheap Oil Resource Wars: Oil and Water The CO2 Greenhouse Law of Svante ArrheniusEconomic Instability: Ongoing Causes Necessary Conditions for Economic Success The Mathematical Structure of Ponzi Schemes Dishonest Assessment of Risk One Reason Why

Computer mathematics for programmers

CERN Document Server

Abney, Darrell H; Sibrel, Donald W

1985-01-01

Computer Mathematics for Programmers presents the Mathematics that is essential to the computer programmer.The book is comprised of 10 chapters. The first chapter introduces several computer number systems. Chapter 2 shows how to perform arithmetic operations using the number systems introduced in Chapter 1. The third chapter covers the way numbers are stored in computers, how the computer performs arithmetic on real numbers and integers, and how round-off errors are generated in computer programs. Chapter 4 details the use of algorithms and flowcharting as problem-solving tools for computer p

Secondary School Mathematics Teachers' Knowledge Levels and Use of History of Mathematics

Science.gov (United States)

Bütüner, Suphi Önder

2018-01-01

This study describes secondary school mathematics teachers' use of history of mathematics in their classes and their knowledge levels in this field. The study population included a total of 58 secondary school mathematics teachers working at the secondary schools located in Yozgat city center, and the sample included 32 mathematics teachers from…

Mathematics Alive and in Action

DEFF Research Database (Denmark)

Hansen, Vagn Lundsgaard

2005-01-01

This chapter addresses two main questions: What do mathematicians do? What is mathematics good for? With focus on recent times, a panorama of mathematical contributions to civilization is presented and the intellectual drive by which they were perceived is described.......This chapter addresses two main questions: What do mathematicians do? What is mathematics good for? With focus on recent times, a panorama of mathematical contributions to civilization is presented and the intellectual drive by which they were perceived is described....

Mathematical algorithm for the automatic recognition of intestinal parasites.

Directory of Open Access Journals (Sweden)

Alicia Alva

Full Text Available Parasitic infections are generally diagnosed by professionals trained to recognize the morphological characteristics of the eggs in microscopic images of fecal smears. However, this laboratory diagnosis requires medical specialists which are lacking in many of the areas where these infections are most prevalent. In response to this public health issue, we developed a software based on pattern recognition analysis from microscopi digital images of fecal smears, capable of automatically recognizing and diagnosing common human intestinal parasites. To this end, we selected 229, 124, 217, and 229 objects from microscopic images of fecal smears positive for Taenia sp., Trichuris trichiura, Diphyllobothrium latum, and Fasciola hepatica, respectively. Representative photographs were selected by a parasitologist. We then implemented our algorithm in the open source program SCILAB. The algorithm processes the image by first converting to gray-scale, then applies a fourteen step filtering process, and produces a skeletonized and tri-colored image. The features extracted fall into two general categories: geometric characteristics and brightness descriptions. Individual characteristics were quantified and evaluated with a logistic regression to model their ability to correctly identify each parasite separately. Subsequently, all algorithms were evaluated for false positive cross reactivity with the other parasites studied, excepting Taenia sp. which shares very few morphological characteristics with the others. The principal result showed that our algorithm reached sensitivities between 99.10%-100% and specificities between 98.13%- 98.38% to detect each parasite separately. We did not find any cross-positivity in the algorithms for the three parasites evaluated. In conclusion, the results demonstrated the capacity of our computer algorithm to automatically recognize and diagnose Taenia sp., Trichuris trichiura, Diphyllobothrium latum, and Fasciola hepatica

Mathematical algorithm for the automatic recognition of intestinal parasites.

Science.gov (United States)

Alva, Alicia; Cangalaya, Carla; Quiliano, Miguel; Krebs, Casey; Gilman, Robert H; Sheen, Patricia; Zimic, Mirko

2017-01-01

Parasitic infections are generally diagnosed by professionals trained to recognize the morphological characteristics of the eggs in microscopic images of fecal smears. However, this laboratory diagnosis requires medical specialists which are lacking in many of the areas where these infections are most prevalent. In response to this public health issue, we developed a software based on pattern recognition analysis from microscopi digital images of fecal smears, capable of automatically recognizing and diagnosing common human intestinal parasites. To this end, we selected 229, 124, 217, and 229 objects from microscopic images of fecal smears positive for Taenia sp., Trichuris trichiura, Diphyllobothrium latum, and Fasciola hepatica, respectively. Representative photographs were selected by a parasitologist. We then implemented our algorithm in the open source program SCILAB. The algorithm processes the image by first converting to gray-scale, then applies a fourteen step filtering process, and produces a skeletonized and tri-colored image. The features extracted fall into two general categories: geometric characteristics and brightness descriptions. Individual characteristics were quantified and evaluated with a logistic regression to model their ability to correctly identify each parasite separately. Subsequently, all algorithms were evaluated for false positive cross reactivity with the other parasites studied, excepting Taenia sp. which shares very few morphological characteristics with the others. The principal result showed that our algorithm reached sensitivities between 99.10%-100% and specificities between 98.13%- 98.38% to detect each parasite separately. We did not find any cross-positivity in the algorithms for the three parasites evaluated. In conclusion, the results demonstrated the capacity of our computer algorithm to automatically recognize and diagnose Taenia sp., Trichuris trichiura, Diphyllobothrium latum, and Fasciola hepatica with a high

E-learning support for Economic-mathematical methods

Directory of Open Access Journals (Sweden)

Pavel Kolman

2009-01-01

Full Text Available Article is describing process of creating and using of e-learning program for graphical solution of li­near programming problems that is used in the Economic mathematical methods course on Faculty of Business and Economics, MZLU. The program was created within FRVŠ 788/2008 grant and is intended for practicing of graphical solution of LP problems and allows better understanding of the li­near programming problems. In the article is on one hand described the way, how does the program work, it means how were the algorithms implemented, and on the other hand there is described way of use of that program. The program is constructed for working with integer and rational numbers. At the end of the article are shown basic statistics of programs use of students in the present form and the part-time form of study. It is mainly the number of programs downloads and comparison to another programs and students opinion on the e-learning support.

The Rhetorical Algorithm: WikiLeaks and the Elliptical Secrets of Donald J. Trump

Directory of Open Access Journals (Sweden)

Atilla Hallsby

2018-02-01

Full Text Available Algorithms were a generative force behind many of the leaks and secrets that dominated the 2016 election season. Taking the form of the identity-anonymizing Tor software that protected the identity of leakers, mathematical protocols occupied a prominent place in the secrets generated during the presidential campaign. This essay suggests that the rhetorical trope of ellipsis offers an equally crucial, algorithmic formula for explaining the public production of these secrets and leaks. It then describes the 2016 DNC leak and Donald Trump’s “I love Wikileaks” moment using the trope of ellipsis, which marks a discursive omission or gap in official executive discourse.

Mathematics education a spectrum of work in mathematical sciences departments

CERN Document Server

Hsu, Pao-sheng; Pollatsek, Harriet

2016-01-01

Many in the mathematics community in the U.S. are involved in mathematics education in various capacities. This book highlights the breadth of the work in K-16 mathematics education done by members of US departments of mathematical sciences. It contains contributions by mathematicians and mathematics educators who do work in areas such as teacher education, quantitative literacy, informal education, writing and communication, social justice, outreach and mentoring, tactile learning, art and mathematics, ethnomathematics, scholarship of teaching and learning, and mathematics education research. Contributors describe their work, its impact, and how it is perceived and valued. In addition, there is a chapter, co-authored by two mathematicians who have become administrators, on the challenges of supporting, evaluating, and rewarding work in mathematics education in departments of mathematical sciences. This book is intended to inform the readership of the breadth of the work and to encourage discussion of its val...

A readable introduction to real mathematics

CERN Document Server

Rosenthal, Daniel; Rosenthal, Peter

2014-01-01

Designed for an undergraduate course or for independent study, this text presents sophisticated mathematical ideas in an elementary and friendly fashion. The fundamental purpose of this book is to engage the reader and to teach a real understanding of mathematical thinking while conveying the beauty and elegance of mathematics. The text focuses on teaching the understanding of mathematical proofs. The material covered has applications both to mathematics and to other subjects. The book contains a large number of exercises of varying difficulty, designed to help reinforce basic concepts and to motivate and challenge the reader. The sole prerequisite for understanding the text is basic high school algebra; some trigonometry is needed for Chapters 9 and 12. Topics covered include: * mathematical induction * modular arithmetic * the fundamental theorem of arithmetic * Fermat's little theorem * RSA encryption * the Euclidean algorithm * rational and irrational numbers * complex numbers * cardinality * Euclidean pl...

Geomagnetic matching navigation algorithm based on robust estimation

Science.gov (United States)

Xie, Weinan; Huang, Liping; Qu, Zhenshen; Wang, Zhenhuan

2017-08-01

The outliers in the geomagnetic survey data seriously affect the precision of the geomagnetic matching navigation and badly disrupt its reliability. A novel algorithm which can eliminate the outliers influence is investigated in this paper. First, the weight function is designed and its principle of the robust estimation is introduced. By combining the relation equation between the matching trajectory and the reference trajectory with the Taylor series expansion for geomagnetic information, a mathematical expression of the longitude, latitude and heading errors is acquired. The robust target function is obtained by the weight function and the mathematical expression. Then the geomagnetic matching problem is converted to the solutions of nonlinear equations. Finally, Newton iteration is applied to implement the novel algorithm. Simulation results show that the matching error of the novel algorithm is decreased to 7.75% compared to the conventional mean square difference (MSD) algorithm, and is decreased to 18.39% to the conventional iterative contour matching algorithm when the outlier is 40nT. Meanwhile, the position error of the novel algorithm is 0.017° while the other two algorithms fail to match when the outlier is 400nT.

JIT-transportation problem and its algorithm

Science.gov (United States)

Bai, Guozhong; Gan, Xiao-Xiong

2011-12-01

This article introduces the (just-in-time) JIT-transportation problem, which requires that all demanded goods be shipped to their destinations on schedule, at a zero or minimal destination-storage cost. The JIT-transportation problem is a special goal programming problem with discrete constraints. This article provides a mathematical model for such a transportation problem and introduces the JIT solution, the deviation solution, the JIT deviation, etc. By introducing the B(λ)-problem, this article establishes the equivalence between the optimal solutions of the B(λ)-problem and the optimal solutions of the JIT-transportation problem, and then provides an algorithm for the JIT-transportation problems. This algorithm is proven mathematically and is also illustrated by an example.

Parallel asynchronous systems and image processing algorithms

Science.gov (United States)

Coon, D. D.; Perera, A. G. U.

1989-01-01

A new hardware approach to implementation of image processing algorithms is described. The approach is based on silicon devices which would permit an independent analog processing channel to be dedicated to evey pixel. A laminar architecture consisting of a stack of planar arrays of the device would form a two-dimensional array processor with a 2-D array of inputs located directly behind a focal plane detector array. A 2-D image data stream would propagate in neuronlike asynchronous pulse coded form through the laminar processor. Such systems would integrate image acquisition and image processing. Acquisition and processing would be performed concurrently as in natural vision systems. The research is aimed at implementation of algorithms, such as the intensity dependent summation algorithm and pyramid processing structures, which are motivated by the operation of natural vision systems. Implementation of natural vision algorithms would benefit from the use of neuronlike information coding and the laminar, 2-D parallel, vision system type architecture. Besides providing a neural network framework for implementation of natural vision algorithms, a 2-D parallel approach could eliminate the serial bottleneck of conventional processing systems. Conversion to serial format would occur only after raw intensity data has been substantially processed. An interesting challenge arises from the fact that the mathematical formulation of natural vision algorithms does not specify the means of implementation, so that hardware implementation poses intriguing questions involving vision science.

Mathematical olympiad challenges

CERN Document Server

Andreescu, Titu

2000-01-01

Mathematical Olympiad Challenges is a rich collection of problems put together by two experienced and well-known professors and coaches of the U.S. International Mathematical Olympiad Team. Hundreds of beautiful, challenging, and instructive problems from algebra, geometry, trigonometry, combinatorics, and number theory were selected from numerous mathematical competitions and journals. An important feature of the work is the comprehensive background material provided with each grouping of problems. The problems are clustered by topic into self-contained sections with solutions provided separately. All sections start with an essay discussing basic facts and one or two representative examples. A list of carefully chosen problems follows and the reader is invited to take them on. Additionally, historical insights and asides are presented to stimulate further inquiry. The emphasis throughout is on encouraging readers to move away from routine exercises and memorized algorithms toward creative solutions to open-e...

Causal Bayes Model of Mathematical Competence in Kindergarten

Directory of Open Access Journals (Sweden)

Božidar Tepeš

2016-06-01

Full Text Available In this paper authors define mathematical competences in the kindergarten. The basic objective was to measure the mathematical competences or mathematical knowledge, skills and abilities in mathematical education. Mathematical competences were grouped in the following areas: Arithmetic and Geometry. Statistical set consisted of 59 children, 65 to 85 months of age, from the Kindergarten Milan Sachs from Zagreb. The authors describe 13 variables for measuring mathematical competences. Five measuring variables were described for the geometry, and eight measuring variables for the arithmetic. Measuring variables are tasks which children solved with the evaluated results. By measuring mathematical competences the authors make causal Bayes model using free software Tetrad 5.2.1-3. Software makes many causal Bayes models and authors as experts chose the model of the mathematical competences in the kindergarten. Causal Bayes model describes five levels for mathematical competences. At the end of the modeling authors use Bayes estimator. In the results, authors describe by causal Bayes model of mathematical competences, causal effect mathematical competences or how intervention on some competences cause other competences. Authors measure mathematical competences with their expectation as random variables. When expectation of competences was greater, competences improved. Mathematical competences can be improved with intervention on causal competences. Levels of mathematical competences and the result of intervention on mathematical competences can help mathematical teachers.

Mathematics Reform Curricula and Special Education: Identifying Intersections and Implications for Practice

Science.gov (United States)

Sayeski, Kristin L.; Paulsen, Kim J.

2010-01-01

In many general education classrooms today, teachers are using "reform" mathematics curricula. These curricula emphasize the application of mathematics in real-life contexts and include such practices as collaborative, group problem solving and student-generated algorithms. Students with learning disabilities in the area of mathematics can…

Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms

DEFF Research Database (Denmark)

Elfving, Tommy; Hansen, Per Christian; Nikazad, Touraj

2012-01-01

We give a detailed study of the semiconverg ence behavior of projected nonstationary simultaneous iterative reconstruction technique (SIRT) algorithms, including the projected Landweber algorithm. We also consider the use of a relaxation parameter strategy, proposed recently for the standard...... algorithms, for controlling the semiconvergence of the projected algorithms. We demonstrate the semiconvergence and the performance of our strategies by examples taken from tomographic imaging. © 2012 Society for Industrial and Applied Mathematics....

Analysis of students’ mathematical reasoning

Science.gov (United States)

Sukirwan; Darhim; Herman, T.

2018-01-01

The reasoning is one of the mathematical abilities that have very complex implications. This complexity causes reasoning including abilities that are not easily attainable by students. Similarly, studies dealing with reason are quite diverse, primarily concerned with the quality of mathematical reasoning. The objective of this study was to determine the quality of mathematical reasoning based perspective Lithner. Lithner looked at how the environment affects the mathematical reasoning. In this regard, Lithner made two perspectives, namely imitative reasoning and creative reasoning. Imitative reasoning can be memorized and algorithmic reasoning. The Result study shows that although the students generally still have problems in reasoning. Students tend to be on imitative reasoning which means that students tend to use a routine procedure when dealing with reasoning. It is also shown that the traditional approach still dominates on the situation of students’ daily learning.

Adaptation of mathematical educational content in e-learning resources

Directory of Open Access Journals (Sweden)

Yuliya V. Vainshtein

2017-01-01

Full Text Available Modern trends in the world electronic educational system development determine the necessity of adaptive learning intellectual environments and resources’ development and implementation. An upcoming trend in improvement the quality of studying mathematical disciplines is the development and application of adaptive electronic educational resources. However, the development and application experience of adaptive technologies in higher education is currently extremely limited and does not imply the usage flexibility. Adaptive educational resources in the electronic environment are electronic educational resources that provide the student with a personal educational space, filled with educational content that “adapts” to the individual characteristics of the students and provides them with the necessary information.This article focuses on the mathematical educational content adaptation algorithms development and their implementation in the e-learning system. The peculiarity of the proposed algorithms is the possibility of their application and distribution for adaptive e-learning resources construction. The novelty of the proposed approach is the three-step content organization of the adaptive algorithms for the educational content: “introductory adaptation of content”, “the current adaptation of content”, “estimative and a corrective adaptation”. For each stage of the proposed system, mathematical algorithms for educational content adaptation in adaptive e-learning resources are presented.Due to the high level of abstraction and complexity perception of mathematical disciplines, educational content is represented in the various editions of presentation that correspond to the levels of assimilation of the course material. Adaptation consists in the selection of the optimal edition of the material that best matches the individual characteristics of the student. The introduction of a three-step content organization of the adaptive

Mathematization in introductory physics

Science.gov (United States)

Brahmia, Suzanne M.

Mathematization is central to STEM disciplines as a cornerstone of the quantitative reasoning that characterizes these fields. Introductory physics is required for most STEM majors in part so that students develop expert-like mathematization. This dissertation describes coordinated research and curriculum development for strengthening mathematization in introductory physics; it blends scholarship in physics and mathematics education in the form of three papers. The first paper explores mathematization in the context of physics, and makes an original contribution to the measurement of physics students' struggle to mathematize. Instructors naturally assume students have a conceptual mastery of algebra before embarking on a college physics course because these students are enrolled in math courses beyond algebra. This paper provides evidence that refutes the validity of this assumption and categorizes some of the barriers students commonly encounter with quantification and representing ideas symbolically. The second paper develops a model of instruction that can help students progress from their starting points to their instructor's desired endpoints. Instructors recognize that the introductory physics course introduces new ideas at an astonishing rate. More than most physicists realize, however, the way that mathematics is used in the course is foreign to a large portion of class. This paper puts forth an instructional model that can move all students toward better quantitative and physical reasoning, despite the substantial variability of those students' initial states. The third paper describes the design and testing of curricular materials that foster mathematical creativity to prepare students to better understand physics reasoning. Few students enter introductory physics with experience generating equations in response to specific challenges involving unfamiliar quantities and units, yet this generative use of mathematics is typical of the thinking involved in

Reorganizing Freshman Business Mathematics II: Authentic Assessment in Mathematics through Professional Memos

Science.gov (United States)

Green, Kris; Emerson, Allen

2008-01-01

The first part of this two-part paper [see EJ787497] described the development of a new freshman business mathematics (FBM) course at our college. In this paper, we discuss our assessment tool, the business memo, as a venue for students to apply mathematical skills, via mathematical modelling, to realistic business problems. These memos have…

The continuous-variable Deutsch–Jozsa algorithm using realistic quantum systems

International Nuclear Information System (INIS)

Wagner, Rob C; Kendon, Viv M

2012-01-01

This paper is a study of the continuous-variable Deutsch–Jozsa algorithm. First, we review an existing version of the algorithm for qunat states (Pati and Braunstein 2002 arXiv:0207108v1), and then, we present a realistic version of the Deutsch–Jozsa algorithm for continuous variables, which can be implemented in a physical quantum system given the appropriate oracle. Under these conditions, we have a probabilistic algorithm for deciding the function with a very high success rate with a single call to the oracle. Finally, we look at the effects of errors in both of these continuous-variable algorithms and how they affect the chances of success. We find that the algorithm is generally robust for errors in initialization and the oracle, but less so for errors in the measurement apparatus and the Fourier transform. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Coherent states: mathematical and physical aspects’. (paper)

Mathematical Tools for Geomagnetic Data Monitoring and the Intermagnet Russian Segment

Directory of Open Access Journals (Sweden)

Anatoly Soloviev

2013-02-01

Full Text Available In this paper, a new approach to the detection of anomalies in geophysical records is connected with a fuzzy mathematics application. The theory of discrete mathematical analysis and collection of algorithms for time series processing constructed on its basis represents the results of this research direction. These algorithms are the consequence of fuzzy modeling of the logic of an interpreter who visually recognizes anomalies in records. They allow analyzing large data sets that are not subjected to manual processing. The efficiency of these algorithms is demonstrated in several important geophysical applications. Plans for an extension of the Russian INTERMAGNET segment are presented.

A mathematical model describing the glycemic response of diabetic patients to meal and i.v. infusion of insulin.

Science.gov (United States)

Fabietti, P G; Calabrese, G; Iorio, M; Bistoni, S; Brunetti, P; Sarti, E; Benedetti, M M

2001-10-01

Nine type 1 diabetic patients were studied for 24 hours. During this period they were given three calibrated meals. The glycemia was feedback-controlled by means of an artificial pancreas. The blood concentration of glucose and the infusion speed of the insulin were measured every minute. The experimental data referring to each of the three meals were used to estimate the parameters of a mathematical model suitable for describing the glycemic response of diabetic patients at meals and at the i.v. infusion of exogenous insulin. From the estimate a marked dispersion of the parameters was found, both interindividual and intraindividual. Nevertheless the models thus obtained seem to be usable for the synthesis of a feedback controller, especially in view of creating a portable artificial pancreas that now seems possible owing to the realization (so far experimental) of sufficiently reliable glucose concentration sensors.

Brandon mathematical model describing the effect of calcination and reduction parameters on specific surface area of UO{sub 2} powders

Energy Technology Data Exchange (ETDEWEB)

Hung, Nguyen Trong; Thuan, Le Ba [Institute for Technology of Radioactive and Rare Elements (ITRRE), 48 Lang Ha, Dong Da, Ha Noi (Viet Nam); Van Khoai, Do [Micro-Emission Ltd., 1-1 Asahidai, Nomi, Ishikawa, 923-1211 (Japan); Lee, Jin-Young, E-mail: jinlee@kigam.re.kr [Convergence Research Center for Development of Mineral Resources (DMR), Korea Institute of Geoscience and Mineral Resources (KIGAM), Daejeon, 305-350 (Korea, Republic of); Jyothi, Rajesh Kumar, E-mail: rkumarphd@kigam.re.kr [Convergence Research Center for Development of Mineral Resources (DMR), Korea Institute of Geoscience and Mineral Resources (KIGAM), Daejeon, 305-350 (Korea, Republic of)

2016-06-15

Uranium dioxide (UO{sub 2}) powder has been widely used to prepare fuel pellets for commercial light water nuclear reactors. Among typical characteristics of the powder, specific surface area (SSA) is one of the most important parameter that determines the sintering ability of UO{sub 2} powder. This paper built up a mathematical model describing the effect of the fabrication parameters on SSA of UO{sub 2} powders. To the best of our knowledge, the Brandon model is used for the first time to describe the relationship between the essential fabrication parameters [reduction temperature (T{sub R}), calcination temperature (T{sub C}), calcination time (t{sub C}) and reduction time (t{sub R})] and SSA of the obtained UO{sub 2} powder product. The proposed model was tested with Wilcoxon's rank sum test, showing a good agreement with the experimental parameters. The proposed model can be used to predict and control the SSA of UO{sub 2} powder.

Could Elementary Mathematics Textbooks Help Give Attention to Reasons in the Classroom?

Science.gov (United States)

Newton, Douglas P.; Newton, Lynn D.

2007-01-01

Trainee teachers, new and non-specialist teachers of elementary mathematics have a tendency to avoid thought about reasons in mathematics. Instead, they tend to favour the development of computational skill through the rote application of procedures, routines and algorithms. Could elementary mathematics textbooks serve as models of practice and…

Mathematical methods in time series analysis and digital image processing

CERN Document Server

Kurths, J; Maass, P; Timmer, J

2008-01-01

The aim of this volume is to bring together research directions in theoretical signal and imaging processing developed rather independently in electrical engineering, theoretical physics, mathematics and the computer sciences. In particular, mathematically justified algorithms and methods, the mathematical analysis of these algorithms, and methods as well as the investigation of connections between methods from time series analysis and image processing are reviewed. An interdisciplinary comparison of these methods, drawing upon common sets of test problems from medicine and geophysical/enviromental sciences, is also addressed. This volume coherently summarizes work carried out in the field of theoretical signal and image processing. It focuses on non-linear and non-parametric models for time series as well as on adaptive methods in image processing.

New Avenues for History in Mathematics Education: Mathematical Competencies and Anchoring

DEFF Research Database (Denmark)

Jankvist, U. T.; Kjeldsen, T. H.

2011-01-01

. The first scenario occurs when history is used as a ‘tool’ for the learning and teaching of mathematics, the second when history of mathematics as a ‘goal’ is pursued as an integral part of mathematics education. We introduce a multiple-perspective approach to history, and suggest that research on history......The paper addresses the apparent lack of impact of ‘history in mathematics education’ in mathematics education research in general, and proposes new avenues for research. We identify two general scenarios of integrating history in mathematics education that each gives rise to different problems...... in mathematics education follows one of two different avenues in dealing with these scenarios. The first is to focus on students’ development of mathematical competencies when history is used a tool for the learning of curriculum-dictated mathematical in-issues. A framework for this is described. Secondly, when...

A Unified Differential Evolution Algorithm for Global Optimization

Energy Technology Data Exchange (ETDEWEB)

Qiang, Ji; Mitchell, Chad

2014-06-24

Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.

Mathematical models and heuristic solutions for container positioning problems in port terminals

DEFF Research Database (Denmark)

Kallehauge, Louise Sibbesen

2008-01-01

presents an efficient solution algorithm for the CPP. Based on a number of new concepts, an event-based construction heuristic is developed and its ability to solve real-life problem instances is established. The backbone of the algorithm is a list of events, corresponding to a sequence of operations...... by constructing mathematical programming formulations of the problem and developing an efficient heuristic algorithm for its solution. The thesis consists of an introduction, two main chapters concerning new mathematical formulations and a new heuristic for the CPP, technical issues, computational results...... concerning the subject is reviewed. The research presented in this thesis is divided into two main parts: Construction and investigation of new mathematical programming formulations of the CPP and development and implementation of a new event-based heuristic for the problem. The first part presents three...

Engineering Mathematics I : Electromagnetics, Fluid Mechanics, Material Physics and Financial Engineering

CERN Document Server

Rančić, Milica

2016-01-01

This book highlights the latest advances in engineering mathematics with a main focus on the mathematical models, structures, concepts, problems and computational methods and algorithms most relevant for applications in modern technologies and engineering. In particular, it features mathematical methods and models of applied analysis, probability theory, differential equations, tensor analysis and computational modelling used in applications to important problems concerning electromagnetics, antenna technologies, fluid dynamics, material and continuum physics and financial engineering. The individual chapters cover both theory and applications, and include a wealth of figures, schemes, algorithms, tables and results of data analysis and simulation. Presenting new methods and results, reviews of cutting-edge research, and open problems for future research, they equip readers to develop new mathematical methods and concepts of their own, and to further compare and analyse the methods and results discussed. The ...

Relation between brain architecture and mathematical ability in children: a DBM study.

Science.gov (United States)

Han, Zhaoying; Davis, Nicole; Fuchs, Lynn; Anderson, Adam W; Gore, John C; Dawant, Benoit M

2013-12-01

Population-based studies indicate that between 5 and 9 percent of US children exhibit significant deficits in mathematical reasoning, yet little is understood about the brain morphological features related to mathematical performances. In this work, deformation-based morphometry (DBM) analyses have been performed on magnetic resonance images of the brains of 79 third graders to investigate whether there is a correlation between brain morphological features and mathematical proficiency. Group comparison was also performed between Math Difficulties (MD-worst math performers) and Normal Controls (NC), where each subgroup consists of 20 age and gender matched subjects. DBM analysis is based on the analysis of the deformation fields generated by non-rigid registration algorithms, which warp the individual volumes to a common space. To evaluate the effect of registration algorithms on DBM results, five nonrigid registration algorithms have been used: (1) the Adaptive Bases Algorithm (ABA); (2) the Image Registration Toolkit (IRTK); (3) the FSL Nonlinear Image Registration Tool; (4) the Automatic Registration Tool (ART); and (5) the normalization algorithm available in SPM8. The deformation field magnitude (DFM) was used to measure the displacement at each voxel, and the Jacobian determinant (JAC) was used to quantify local volumetric changes. Results show there are no statistically significant volumetric differences between the NC and the MD groups using JAC. However, DBM analysis using DFM found statistically significant anatomical variations between the two groups around the left occipital-temporal cortex, left orbital-frontal cortex, and right insular cortex. Regions of agreement between at least two algorithms based on voxel-wise analysis were used to define Regions of Interest (ROIs) to perform an ROI-based correlation analysis on all 79 volumes. Correlations between average DFM values and standard mathematical scores over these regions were found to be significant

Xyce parallel electronic simulator design : mathematical formulation, version 2.0.

Energy Technology Data Exchange (ETDEWEB)

Hoekstra, Robert John; Waters, Lon J.; Hutchinson, Scott Alan; Keiter, Eric Richard; Russo, Thomas V.

2004-06-01

This document is intended to contain a detailed description of the mathematical formulation of Xyce, a massively parallel SPICE-style circuit simulator developed at Sandia National Laboratories. The target audience of this document are people in the role of 'service provider'. An example of such a person would be a linear solver expert who is spending a small fraction of his time developing solver algorithms for Xyce. Such a person probably is not an expert in circuit simulation, and would benefit from an description of the equations solved by Xyce. In this document, modified nodal analysis (MNA) is described in detail, with a number of examples. Issues that are unique to circuit simulation, such as voltage limiting, are also described in detail.

Mathematical Modeling and a Hybrid NSGA-II Algorithm for Process Planning Problem Considering Machining Cost and Carbon Emission

Directory of Open Access Journals (Sweden)

Jin Huang

2017-09-01

Full Text Available Process planning is an important function in a manufacturing system; it specifies the manufacturing requirements and details for the shop floor to convert a part from raw material to the finished form. However, considering only economical criterion with technological constraints is not enough in sustainable manufacturing practice; formerly, criteria about low carbon emission awareness have seldom been taken into account in process planning optimization. In this paper, a mathematical model that considers both machining costs reduction as well as carbon emission reduction is established for the process planning problem. However, due to various flexibilities together with complex precedence constraints between operations, the process planning problem is a non-deterministic polynomial-time (NP hard problem. Aiming at the distinctive feature of the multi-objectives process planning optimization, we then developed a hybrid non-dominated sorting genetic algorithm (NSGA-II to tackle this problem. A local search method that considers both the total cost criterion and the carbon emission criterion are introduced into the proposed algorithm to avoid being trapped into local optima. Moreover, the technique for order preference by similarity to an ideal solution (TOPSIS method is also adopted to determine the best solution from the Pareto front. Experiments have been conducted using Kim’s benchmark. Computational results show that process plan schemes with low carbon emission can be captured, and, more importantly, the proposed hybrid NSGA-II algorithm can obtain more promising optimal Pareto front than the plain NSGA-II algorithm. Meanwhile, according to the computational results of Kim’s benchmark, we find that both of the total machining cost and carbon emission are roughly proportional to the number of operations, and a process plan with less operation may be more satisfactory. This study will draw references for the further research on green

PRINCIPLES OF DEVELOPMENT MATHEMATICAL MODEL FOR RESEARCHING OF NONPULSATILE FLOW PUMP AND CARDIAC SYSTEM

Directory of Open Access Journals (Sweden)

I. V. Bykov

2013-01-01

Full Text Available Aim. The presented research uncovers the using of mathematical modeling methods for cardio-vascular system and axial blood pump interaction analysis under heart failure with combined valve pathology. The research will pro- vide data for automated pump control algorithm synthesis. Materials and methods. Mathematical model is build up by using experiments results from mock cardio-vascular circulation loop and mathematical representation of Newtonian fluid dynamics in pulsing circulation loop. The model implemented in modeling environment Simulink (Matlab. Results. Authors implemented mathematical model which describe cardio-vascular system and left-ven- tricular assistive device interaction for intact conditions. Values of parameters for intact conditions were acquired in the experiments on animals with implanted axial pump, experiments were conducted in FRCTAO. The model was verified by comparison of instantaneous blood flowrate values in experiments and in model. Conclusion. The paper present implemented mathematical model of cardio-vascular system and axial pump interaction for intact conditions, where the pump connected between left ventricle and aorta. In the next part of research authors will use the presented model to evaluate using the biotechnical system in conditions of heart failure and valve pathology. 

How Well Does A-Level Mathematics Prepare Students for the Mathematical Demands of Chemistry Degrees?

Science.gov (United States)

Darlington, Ellie; Bowyer, Jessica

2016-01-01

332 undergraduate chemistry students were surveyed in order to establish whether they had found A-level Mathematics and/or Further Mathematics to be good preparation for their degree. Perceptions of both subjects were found to be positive, with more than 80% of participants describing Mathematics or Further Mathematics as good preparation. In…

Critical function monitoring system algorithm development

International Nuclear Information System (INIS)

Harmon, D.L.

1984-01-01

Accurate critical function status information is a key to operator decision-making during events threatening nuclear power plant safety. The Critical Function Monitoring System provides continuous critical function status monitoring by use of algorithms which mathematically represent the processes by which an operating staff would determine critical function status. This paper discusses in detail the systematic design methodology employed to develop adequate Critical Function Monitoring System algorithms

Theorema 2.0: Computer-Assisted Natural-Style Mathematics

Directory of Open Access Journals (Sweden)

Bruno Buchberger

2016-01-01

Full Text Available The Theorema project aims at the development of a computer assistant for the working mathematician. Support should be given throughout all phases of mathematical activity, from introducing new mathematical concepts by definitions or axioms, through first (computational experiments, the formulation of theorems, their justification by an exact proof, the application of a theorem as an algorithm, until to the dissemination of the results in form of a mathematical publication, the build up of bigger libraries of certified mathematical content and the like. This ambitious project is exactly along the lines of the QED manifesto issued in 1994 (see e.g. http://www.cs.ru.nl/~freek/qed/qed.html and it was initiated in the mid-1990s by Bruno Buchberger. The Theorema system is a computer implementation of the ideas behind the Theorema project. One focus lies on the natural style of system input (in form of definitions, theorems, algorithms, etc., system output (mainly in form of mathematical proofs and user interaction. Another focus is theory exploration, i.e. the development of large consistent mathematical theories in a formal frame, in contrast to just proving single isolated theorems. When using the Theorema system, a user should not have to follow a certain style of mathematics enforced by the system (e.g. basing all of mathematics on set theory or certain variants of type theory, rather should the system support the user in her preferred flavour of doing math. The new implementation of the system, which we refer to as Theorema 2.0, is open-source and available through GitHub.

Theoretical Basics of Teaching Discrete Mathematics

Directory of Open Access Journals (Sweden)

Y. A. Perminov

2012-01-01

Full Text Available  The paper deals with the research findings concerning the process of mastering the theoretical basics of discrete mathematics by the students of vocational pedagogic profile. The methodological analysis is based on the subject and functions of the modern discrete mathematics and its role in mathematical modeling and computing. The modern discrete mathematics (i.e. mathematics of the finite type structures plays the important role in modernization of vocational training. It is especially rele- vant to training students for vocational pedagogic qualifications, as in the future they will be responsible for training the middle and the senior level specialists in engineer- ing and technical spheres. Nowadays in different industries, there arise the problems which require for their solving both continual – based on the classical mathematical methods – and discrete modeling. The teaching course of discrete mathematics for the future vocational teachers should be relevant to the target qualification and aimed at mastering the mathematical modeling, systems of computer mathematics and computer technologies. The author emphasizes the fundamental role of mastering the language of algebraic and serial structures, as well as the logical, algorithmic, combinatory schemes dominating in dis- crete mathematics. The guidelines for selecting the content of the course in discrete mathematics are specified. The theoretical findings of the research can be put into practice whilst developing curricula and working programs for bachelors and masters’ training. 

Optimization of the reflux ratio for a stage distillation column based on an improved particle swarm algorithm

DEFF Research Database (Denmark)

Ren, Jingzheng; Tan, Shiyu; Dong, Lichun

2010-01-01

A mathematical model relating operation profits with reflux ratio of a stage distillation column was established. In order to optimize the reflux ratio by solving the nonlinear objective function, an improved particle swarm algorithm was developed and has been proved to be able to enhance...... the searching ability of basic particle swarm algorithm significantly. An example of utilizing the improved algorithm to solve the mathematical model was demonstrated; the result showed that it is efficient and convenient to optimize the reflux ratio for a distillation column by using the mathematical model...

Mathematical model and algorithm of operation scheduling for monitoring situation in local waters

Directory of Open Access Journals (Sweden)

Sokolov Boris

2017-01-01

Full Text Available A multiple-model approach to description and investigation of control processes in regional maritime security system is presented. The processes considered in this paper were qualified as control processes of computing operations providing monitoring of the situation adding in the local water area and connected to relocation of different ships classes (further the active mobile objects (AMO. Previously developed concept of active moving object (AMO is used. The models describe operation of AMO automated monitoring and control system (AMCS elements as well as their interaction with objects-in-service that are sources or recipients of information being processed. The unified description of various control processes allows synthesizing simultaneously both technical and functional structures of AMO AMCS. The algorithm for solving the scheduling problem is described in terms of the classical theory of optimal automatic control.

The development of mathematics

CERN Document Server

Bell, Eric Temple

1945-01-01

""This important book . . . presents a broad account of the part played by mathematics in the evolution of civilization, describing clearly the main principles, methods, and theories of mathematics that have survived from about 4000 BC to 1940.""― BooklistIn this time-honored study, one of the 20th century's foremost scholars and interpreters of the history and meaning of mathematics masterfully outlines the development of its leading ideas, and clearly explains the mathematics involved in each. According to the author, a professor of mathematics at the California Institute of Technology from

Teaching Mathematics in Geography Degrees

Science.gov (United States)

Bennett, Robert

1978-01-01

Examines ways of developing college students' motivation for mathematical training; describes the type of mathematical knowledge required in the geography discipline; and explores an applied approach to mathematics teaching based on a systems concept. For journal availability, see SO 506 224. (Author/AV)

Design of Elliptic Reflective LED Surgical Shadowless Lamps Using Mathematical Optical Tracing Algorithms

Directory of Open Access Journals (Sweden)

Cheng-Tang Pan

2014-01-01

Full Text Available Traditional surgical shadowless halogen lamps are generally designed as projection type with many light bulbs, which can produce not only mercury pollution but also heat radiation that are serious problems to patient. The study utilized Runge-Kutta methods and mathematical algorithms to design and optimize the freeform lens. The LED (light-emitting diode was adopted to replace the traditional halogen lamp. A uniform lens was designed and fabricated based on the energy conservation. At first, the light field of LED is concentrated through the freeform lens to improve the optical efficiency. Second, the three-shell elliptic curves are applied to the reflective surgical shadowless lamps, where only few LED chips are needed. Light rays emitting from different directions to the target plane can achieve the goal of shadowless. In this study, the LED’s luminance flux is 1,895 lm. The shadow dilution on the target plane is 54%. Ec (central illuminance is 114,900 lux, and the d50/d10 is 57% which is higher than the regulation by 7%, whereas the power consumption is only 20 W. The energy of reflective surgical shadowless lamps can save more than 50%, compared with the traditional projective one.

Analytical Solutions To Describe Juxtaposed Sands | Adeniji ...

African Journals Online (AJOL)

Mathematical (linear diffusion) equations are presented for two pseudoreservoir regions intersected by fault that describe the effects of partial communicating fault on pressure transient behaviour for each fault block. Green's and source function technique solve these equations. A two-well system is considered for the ...

Analysis and application of two recursive parametric estimation algorithms for an asynchronous machine

International Nuclear Information System (INIS)

Damek, Nawel; Kamoun, Samira

2011-01-01

In this communication, two recursive parametric estimation algorithms are analyzed and applied to an squirrelcage asynchronous machine located at the research ''Unit of Automatic Control'' (UCA) at ENIS. The first algorithm which, use the transfer matrix mathematical model, is based on the gradient principle. The second algorithm, which use the state-space mathematical model, is based on the minimization of the estimation error. These algorithms are applied as a key technique to estimate asynchronous machine with unknown, but constant or timevarying parameters. Stator voltage and current are used as measured data. The proposed recursive parametric estimation algorithms are validated on the experimental data of an asynchronous machine under normal operating condition as full load. The results show that these algorithms can estimate effectively the machine parameters with reliability.

Results from a new mathematical model of gastrointestinal transit that incorporates age and gender-dependent physiological parameters

International Nuclear Information System (INIS)

Stubbs, J.B.

1992-01-01

Recently published data on effects of age and gender-dependent GI physiology and motility have been used to develop a new mathematical model describing the transit and adsorption of substances through the GI tract. This mathematical description of GI tract kinetics utilises more physiologically accurate transit processes than the ICRP Report 30 GI model. The model uses a combination of zero and first-order kinetics to describe motility. Some of the physiological parameters that the new model uses are gender, age, phase of the menstrual cycle, meal composition and gastric phase (solid versus liquid). A computer algorithm based on this model has been derived and results for young males are compared to those of the ICRP 30 model. Comparison of gastrointestinal residence times for 99 Tc m and 111 In labelled compounds, as a function of gender and age, are also presented. (author)

PolyPole-1: An accurate numerical algorithm for intra-granular fission gas release

International Nuclear Information System (INIS)

Pizzocri, D.; Rabiti, C.; Luzzi, L.; Barani, T.; Van Uffelen, P.; Pastore, G.

2016-01-01

The transport of fission gas from within the fuel grains to the grain boundaries (intra-granular fission gas release) is a fundamental controlling mechanism of fission gas release and gaseous swelling in nuclear fuel. Hence, accurate numerical solution of the corresponding mathematical problem needs to be included in fission gas behaviour models used in fuel performance codes. Under the assumption of equilibrium between trapping and resolution, the process can be described mathematically by a single diffusion equation for the gas atom concentration in a grain. In this paper, we propose a new numerical algorithm (PolyPole-1) to efficiently solve the fission gas diffusion equation in time-varying conditions. The PolyPole-1 algorithm is based on the analytic modal solution of the diffusion equation for constant conditions, combined with polynomial corrective terms that embody the information on the deviation from constant conditions. The new algorithm is verified by comparing the results to a finite difference solution over a large number of randomly generated operation histories. Furthermore, comparison to state-of-the-art algorithms used in fuel performance codes demonstrates that the accuracy of PolyPole-1 is superior to other algorithms, with similar computational effort. Finally, the concept of PolyPole-1 may be extended to the solution of the general problem of intra-granular fission gas diffusion during non-equilibrium trapping and resolution, which will be the subject of future work. - Highlights: • A new numerical algorithm (PolyPole-1) for intra-granular fission gas release in time-varying conditions is developed. • The concept combines the modal analytic solution for constant conditions and a polynomial correction. • PolyPole-1 is extensively verified and compared to other state-of-the-art algorithms. • PolyPole-1 exhibits a superior accuracy and a similar computational time relative to other algorithms. • The PolyPole-1 algorithm can be

PolyPole-1: An accurate numerical algorithm for intra-granular fission gas release

Energy Technology Data Exchange (ETDEWEB)

Pizzocri, D. [Politecnico di Milano, Department of Energy, Nuclear Engineering Division, Via La Masa 34, 20156 Milano (Italy); Rabiti, C. [Idaho National Laboratory, P.O. Box 1625, Idaho Falls, ID 83415-3840 (United States); Luzzi, L.; Barani, T. [Politecnico di Milano, Department of Energy, Nuclear Engineering Division, Via La Masa 34, 20156 Milano (Italy); Van Uffelen, P. [European Commission, Joint Research Centre, Institute for Transuranium Elements, P.O. Box 2340, 76125 Karlsruhe (Germany); Pastore, G., E-mail: giovanni.pastore@inl.gov [Idaho National Laboratory, P.O. Box 1625, Idaho Falls, ID 83415-3840 (United States)

2016-09-15

The transport of fission gas from within the fuel grains to the grain boundaries (intra-granular fission gas release) is a fundamental controlling mechanism of fission gas release and gaseous swelling in nuclear fuel. Hence, accurate numerical solution of the corresponding mathematical problem needs to be included in fission gas behaviour models used in fuel performance codes. Under the assumption of equilibrium between trapping and resolution, the process can be described mathematically by a single diffusion equation for the gas atom concentration in a grain. In this paper, we propose a new numerical algorithm (PolyPole-1) to efficiently solve the fission gas diffusion equation in time-varying conditions. The PolyPole-1 algorithm is based on the analytic modal solution of the diffusion equation for constant conditions, combined with polynomial corrective terms that embody the information on the deviation from constant conditions. The new algorithm is verified by comparing the results to a finite difference solution over a large number of randomly generated operation histories. Furthermore, comparison to state-of-the-art algorithms used in fuel performance codes demonstrates that the accuracy of PolyPole-1 is superior to other algorithms, with similar computational effort. Finally, the concept of PolyPole-1 may be extended to the solution of the general problem of intra-granular fission gas diffusion during non-equilibrium trapping and resolution, which will be the subject of future work. - Highlights: • A new numerical algorithm (PolyPole-1) for intra-granular fission gas release in time-varying conditions is developed. • The concept combines the modal analytic solution for constant conditions and a polynomial correction. • PolyPole-1 is extensively verified and compared to other state-of-the-art algorithms. • PolyPole-1 exhibits a superior accuracy and a similar computational time relative to other algorithms. • The PolyPole-1 algorithm can be

Mathematical models in biology bringing mathematics to life

CERN Document Server

Ferraro, Maria; Guarracino, Mario

2015-01-01

This book presents an exciting collection of contributions based on the workshop “Bringing Maths to Life” held October 27-29, 2014 in Naples, Italy.  The state-of-the art research in biology and the statistical and analytical challenges facing huge masses of data collection are treated in this Work. Specific topics explored in depth surround the sessions and special invited sessions of the workshop and include genetic variability via differential expression, molecular dynamics and modeling, complex biological systems viewed from quantitative models, and microscopy images processing, to name several. In depth discussions of the mathematical analysis required to extract insights from complex bodies of biological datasets, to aid development in the field novel algorithms, methods and software tools for genetic variability, molecular dynamics, and complex biological systems are presented in this book. Researchers and graduate students in biology, life science, and mathematics/statistics will find the content...

Mathematical foundations of epistemology based on experiments

Directory of Open Access Journals (Sweden)

Sergey M. Krylov

2015-09-01

Full Text Available The paper deals with basic prerequisites for the development of epistemology, which uses information concerning real experiments in the real world (with real objects. Such experiments are conducted by “formal-technological” analogs of Turing Machines. These analogs are called “universal synthesizers-analyzers”. They can perform syntheses and analyses of various objects or constructions (obtained by conjunctions of finite number of smaller objects called basic elements with the help of various algorithmic systems having some restrictions. Such algorithmic systems are called Formal Technologies. They have formal structures that are very similar to the formal structure of Maltsev's algebraic systems. This formal closeness allows us, first, to set up a hypothesis concerning algorithmic basis of almost all surrounding physical processes, as understandable as well as till non-understandable ones, that partially explains the wide applicability of mathematics to the outer world; second, this closeness allows one to formulate and prove some theorems (called assertions concerning features and peculiar properties of cognitive algorithms in one-, two- or three-dimensional surroundings for various formal technological systems, including a so called “acquired knowledge effectiveness theorem”. The theorem (assertion can be applied to a very wide class of formal technologies which use an equality predicate for objects analyses. In the paper various cognitive algorithms are listed and proved. These algorithms have different sets of technological operations resembling syntheses and decompositions, as well as different sets of analytical operations including equality predicates, “random stationary mapping” operations (which use unknown algorithms to obtain stationary results, therefore these operations are very similar to oracles in Turing Machines, operations that define object shapes, and so on. The structure of automatic cognitive devices called

Algorithms for worst-case tolerance optimization

DEFF Research Database (Denmark)

Schjær-Jacobsen, Hans; Madsen, Kaj

1979-01-01

New algorithms are presented for the solution of optimum tolerance assignment problems. The problems considered are defined mathematically as a worst-case problem (WCP), a fixed tolerance problem (FTP), and a variable tolerance problem (VTP). The basic optimization problem without tolerances...... is denoted the zero tolerance problem (ZTP). For solution of the WCP we suggest application of interval arithmetic and also alternative methods. For solution of the FTP an algorithm is suggested which is conceptually similar to algorithms previously developed by the authors for the ZTP. Finally, the VTP...... is solved by a double-iterative algorithm in which the inner iteration is performed by the FTP- algorithm. The application of the algorithm is demonstrated by means of relatively simple numerical examples. Basic properties, such as convergence properties, are displayed based on the examples....

The 24-Hour Mathematical Modeling Challenge

Science.gov (United States)

Galluzzo, Benjamin J.; Wendt, Theodore J.

2015-01-01

Across the mathematics curriculum there is a renewed emphasis on applications of mathematics and on mathematical modeling. Providing students with modeling experiences beyond the ordinary classroom setting remains a challenge, however. In this article, we describe the 24-hour Mathematical Modeling Challenge, an extracurricular event that exposes…

An algorithm for analysis of the structure of finitely presented Lie algebras

Directory of Open Access Journals (Sweden)

Vladimir P. Gerdt

1997-12-01

Full Text Available We consider the following problem: what is the most general Lie algebra satisfying a given set of Lie polynomial equations? The presentation of Lie algebras by a finite set of generators and defining relations is one of the most general mathematical and algorithmic schemes of their analysis. That problem is of great practical importance, covering applications ranging from mathematical physics to combinatorial algebra. Some particular applications are constructionof prolongation algebras in the Wahlquist-Estabrook method for integrability analysis of nonlinear partial differential equations and investigation of Lie algebras arising in different physical models. The finite presentations also indicate a way to q-quantize Lie algebras. To solve this problem, one should perform a large volume of algebraic transformations which is sharply increased with growth of the number of generators and relations. For this reason, in practice one needs to use a computer algebra tool. We describe here an algorithm for constructing the basis of a finitely presented Lie algebra and its commutator table, and its implementation in the C language. Some computer results illustrating our algorithmand its actual implementation are also presented.

A HYBRID ALGORITHM FOR THE ROBUST GRAPH COLORING PROBLEM

Directory of Open Access Journals (Sweden)

Román Anselmo Mora Gutiérrez

2016-08-01

Full Text Available A hybridalgorithm which combines mathematical programming techniques (Kruskal’s algorithm and the strategy of maintaining arc consistency to solve constraint satisfaction problem “CSP” and heuristic methods (musical composition method and DSATUR to resolve the robust graph coloring problem (RGCP is proposed in this paper. Experimental result shows that this algorithm is better than the other algorithms presented on the literature.

Children, algorithm and the decimal numeral system

Directory of Open Access Journals (Sweden)

Clélia Maria Ignatius Nogueira

2010-08-01

Full Text Available A large number of studies in Mathematics Education approach some possible problems in the study of algorithms in the early school years of arithmetic teaching. However, this discussion is not exhausted. In this feature, this article presents the results of a research which proposed to investigate if the arithmetic’s teaching, with emphasis in the fundamental operation’s algorithm, cooperate to build the mathematics knowledge, specifically of the Decimal Numeral System. In order to achieve this purpose, we interviewed, using the Piaget Critique Clinical Method, twenty students from a public school. The result’s analysis indicates that they mechanically reproduce the regular algorithm’s techniques without notice the relations between the techniques and the principle and the Decimal Numeral System’s properties.

Macroscopic models for vehicular flows and crowd dynamics theory and applications classical and non–classical advanced mathematics for real life applications

CERN Document Server

Rosini, Massimiliano Daniele

2013-01-01

This monograph  presents a systematic treatment of the theory for hyperbolic conservation laws and their applications to vehicular traffics and crowd dynamics. In the first part of the book, the author presents very basic considerations and gradually introduces the mathematical tools necessary to describe and understand the mathematical models developed in the following parts focusing on vehicular and pedestrian traffic. The book is a self-contained valuable resource for advanced courses in mathematical modeling, physics and civil engineering. A number of examples and figures facilitate a better understanding of the underlying concepts and motivations for the students. Important new techniques are presented, in particular the wave front tracking algorithm, the operator splitting approach, the non-classical theory of conservation laws and the constrained problems. This book is the first to present a comprehensive account of these fundamental new mathematical advances.  

A Novel Discrete Differential Evolution Algorithm for the Vehicle Routing Problem in B2C E-Commerce

Science.gov (United States)

Xia, Chao; Sheng, Ying; Jiang, Zhong-Zhong; Tan, Chunqiao; Huang, Min; He, Yuanjian

2015-12-01

In this paper, a novel discrete differential evolution (DDE) algorithm is proposed to solve the vehicle routing problems (VRP) in B2C e-commerce, in which VRP is modeled by the incomplete graph based on the actual urban road system. First, a variant of classical VRP is described and a mathematical programming model for the variant is given. Second, the DDE is presented, where individuals are represented as the sequential encoding scheme, and a novel reparation operator is employed to repair the infeasible solutions. Furthermore, a FLOYD operator for dealing with the shortest route is embedded in the proposed DDE. Finally, an extensive computational study is carried out in comparison with the predatory search algorithm and genetic algorithm, and the results show that the proposed DDE is an effective algorithm for VRP in B2C e-commerce.

VLSI implementation of RSA encryption system using ancient Indian Vedic mathematics

Science.gov (United States)

Thapliyal, Himanshu; Srinivas, M. B.

2005-06-01

This paper proposes the hardware implementation of RSA encryption/decryption algorithm using the algorithms of Ancient Indian Vedic Mathematics that have been modified to improve performance. The recently proposed hierarchical overlay multiplier architecture is used in the RSA circuitry for multiplication operation. The most significant aspect of the paper is the development of a division architecture based on Straight Division algorithm of Ancient Indian Vedic Mathematics and embedding it in RSA encryption/decryption circuitry for improved efficiency. The coding is done in Verilog HDL and the FPGA synthesis is done using Xilinx Spartan library. The results show that RSA circuitry implemented using Vedic division and multiplication is efficient in terms of area/speed compared to its implementation using conventional multiplication and division architectures.

An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems

Directory of Open Access Journals (Sweden)

Dębski Roman

2016-06-01

Full Text Available A new dynamic programming based parallel algorithm adapted to on-board heterogeneous computers for simulation based trajectory optimization is studied in the context of “high-performance sailing”. The algorithm uses a new discrete space of continuously differentiable functions called the multi-splines as its search space representation. A basic version of the algorithm is presented in detail (pseudo-code, time and space complexity, search space auto-adaptation properties. Possible extensions of the basic algorithm are also described. The presented experimental results show that contemporary heterogeneous on-board computers can be effectively used for solving simulation based trajectory optimization problems. These computers can be considered micro high performance computing (HPC platforms-they offer high performance while remaining energy and cost efficient. The simulation based approach can potentially give highly accurate results since the mathematical model that the simulator is built upon may be as complex as required. The approach described is applicable to many trajectory optimization problems due to its black-box represented performance measure and use of OpenCL.

The Emergence of Mathematical Structures

Science.gov (United States)

Hegedus, Stephen John; Moreno-Armella, Luis

2011-01-01

We present epistemological ruptures that have occurred in mathematical history and in the transformation of using technology in mathematics education in the twenty-first century. We describe how such changes establish a new form of digital semiotics that challenges learning paradigms and mathematical inquiry for learners today. We focus on drawing…

Control and adaptation in telecommunication systems mathematical foundations

CERN Document Server

Popovskij, Vladimir; Titarenko, Larysa

2011-01-01

This book is devoted to mathematical foundations providing synthesis and analysis of control and adaptation algorithms targeting modern telecommunication systems (TCS). The most popular technologies and network management methods are discussed.

Biogeneric tooth: a new mathematical representation for tooth morphology in lower first molars.

Science.gov (United States)

Mehl, Albert; Blanz, Volker; Hickel, Reinhard

2005-08-01

A mathematical representation of tooth morphology may help to improve and automate restorative computer-aided design processes, virtual dental education, and parametric morphology. However, to date, no quantitative formulation has been identified for the description of dental features. The aim of this study was to establish and to validate a mathematical process for describing the morphology of first lower molars. Stone replicas of 170 caries-free first lower molars from young patients were measured three-dimensionally with a resolution of about 100,000 points. First, the average tooth was computed, which captures the common features of the molar's surface quantitatively. For this, the crucial step was to establish a dense point-to-point correspondence between all teeth. The algorithm did not involve any prior knowledge about teeth. In a second step, principal component analysis was carried out. Repeated for 3 different reference teeth, the procedure yielded average teeth that were nearly independent of the reference (less than +/- 40 microm). Additionally, the results indicate that only a few principal components determine a high percentage of the three-dimensional shape variability of first lower molars (e.g. the first five principal components describe 52% of the total variance, the first 10 principal components 72% and the first 20 principal components 83%). With the novel approach presented in this paper, surfaces of teeth can be described efficiently in terms of only a few parameters. This mathematical representation is called the 'biogeneric tooth'.

Supporting Mathematics Instruction through Community

Science.gov (United States)

Amidon, Joel C.; Trevathan, Morgan L.

2016-01-01

Raising expectations is nothing new. Every iteration of standards elevates the expectations for what students should know and be able to do. The Common Core State Standards for Mathematics (CCSSM) is no exception, with standards for content and practice that move beyond memorization of traditional algorithms to "make sense of problems and…

Data fusion mathematics theory and practice

CERN Document Server

Raol, Jitendra R

2015-01-01

Fills the Existing Gap of Mathematics for Data FusionData fusion (DF) combines large amounts of information from a variety of sources and fuses this data algorithmically, logically and, if required intelligently, using artificial intelligence (AI). Also, known as sensor data fusion (SDF), the DF fusion system is an important component for use in various applications that include the monitoring of vehicles, aerospace systems, large-scale structures, and large industrial automation plants. Data Fusion Mathematics: Theory and Practice offers a comprehensive overview of data fusion, and provides a

Unconventional Algorithms: Complementarity of Axiomatics and Construction

Directory of Open Access Journals (Sweden)

Gordana Dodig Crnkovic

2012-10-01

Full Text Available In this paper, we analyze axiomatic and constructive issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms and unconventional computations change the algorithmic universe, making it open and allowing increased flexibility and expressive power that augment creativity. At the same time, the greater power of new types of algorithms also results in the greater complexity of the algorithmic universe, transforming it into the algorithmic multiverse and demanding new tools for its study. That is why we analyze new powerful tools brought forth by local mathematics, local logics, logical varieties and the axiomatic theory of algorithms, automata and computation. We demonstrate how these new tools allow efficient navigation in the algorithmic multiverse. Further work includes study of natural computation by unconventional algorithms and constructive approaches.

A General Mathematical Algorithm for Predicting the Course of Unfused Tetanic Contractions of Motor Units in Rat Muscle.

Directory of Open Access Journals (Sweden)

Rositsa Raikova

Full Text Available An unfused tetanus of a motor unit (MU evoked by a train of pulses at variable interpulse intervals is the sum of non-equal twitch-like responses to these stimuli. A tool for a precise prediction of these successive contractions for MUs of different physiological types with different contractile properties is crucial for modeling the whole muscle behavior during various types of activity. The aim of this paper is to develop such a general mathematical algorithm for the MUs of the medial gastrocnemius muscle of rats. For this purpose, tetanic curves recorded for 30 MUs (10 slow, 10 fast fatigue-resistant and 10 fast fatigable were mathematically decomposed into twitch-like contractions. Each contraction was modeled by the previously proposed 6-parameter analytical function, and the analysis of these six parameters allowed us to develop a prediction algorithm based on the following input data: parameters of the initial twitch, the maximum force of a MU and the series of pulses. Linear relationship was found between the normalized amplitudes of the successive contractions and the remainder between the actual force levels at which the contraction started and the maximum tetanic force. The normalization was made according to the amplitude of the first decomposed twitch. However, the respective approximation lines had different specific angles with respect to the ordinate. These angles had different and non-overlapping ranges for slow and fast MUs. A sensitivity analysis concerning this slope was performed and the dependence between the angles and the maximal fused tetanic force normalized to the amplitude of the first contraction was approximated by a power function. The normalized MU contraction and half-relaxation times were approximated by linear functions depending on the normalized actual force levels at which each contraction starts. The normalization was made according to the contraction time of the first contraction. The actual force levels

Mathematical model of 137Cs dynamics in the deciduous forest

International Nuclear Information System (INIS)

Mamikhin, S.V.; Klyashtorin, A.L.

1999-01-01

A mathematical model of 137 Cs behaviour in the forest ecosystem is presented. The behaviour of this radionuclide is assumed to obey the same regularities as the behaviour of its stable chemical analogue, potassium. Radionuclide dynamics are considered in parallel with the dynamics of the phytomass. Radionuclides contained in the vegetation are pooled into two basic compartments: external and internal contamination, with separate analysis of each. The model was verified using the data obtained in the 30-km zone of the Chernobyl NPP in 1986-1994. The algorithm described was found to be the most efficient in terms of 137 Cs behaviour in the forest environments

Results from a new mathematical model of gastrointestinal transit that incorporates age and gender-dependent physiological parameters

Energy Technology Data Exchange (ETDEWEB)

Stubbs, J B [Oak Ridge Associated Universities, Inc., TN (United States). Medical and Health Science Div.

1992-01-01

Recently published data on effects of age and gender-dependent GI physiology and motility have been used to develop a new mathematical model describing the transit and adsorption of substances through the GI tract. This mathematical description of GI tract kinetics utilises more physiologically accurate transit processes than the ICRP Report 30 GI model. The model uses a combination of zero and first-order kinetics to describe motility. Some of the physiological parameters that the new model uses are gender, age, phase of the menstrual cycle, meal composition and gastric phase (solid versus liquid). A computer algorithm based on this model has been derived and results for young males are compared to those of the ICRP 30 model. Comparison of gastrointestinal residence times for {sup 99}Tc{sup m} and {sup 111}In labelled compounds, as a function of gender and age, are also presented. (author).

A mathematical tapestry demonstrating the beautiful unity of mathematics

CERN Document Server

Hilton, Peter; Donmoyer, Sylvie

2010-01-01

This easy-to-read 2010 book demonstrates how a simple geometric idea reveals fascinating connections and results in number theory, the mathematics of polyhedra, combinatorial geometry, and group theory. Using a systematic paper-folding procedure it is possible to construct a regular polygon with any number of sides. This remarkable algorithm has led to interesting proofs of certain results in number theory, has been used to answer combinatorial questions involving partitions of space, and has enabled the authors to obtain the formula for the volume of a regular tetrahedron in around three steps, using nothing more complicated than basic arithmetic and the most elementary plane geometry. All of these ideas, and more, reveal the beauty of mathematics and the interconnectedness of its various branches. Detailed instructions, including clear illustrations, enable the reader to gain hands-on experience constructing these models and to discover for themselves the patterns and relationships they unearth.

Mathematical methods for cancer evolution

CERN Document Server

Suzuki, Takashi

2017-01-01

The purpose of this monograph is to describe recent developments in mathematical modeling and mathematical analysis of certain problems arising from cell biology. Cancer cells and their growth via several stages are of particular interest. To describe these events, multi-scale models are applied, involving continuously distributed environment variables and several components related to particles. Hybrid simulations are also carried out, using discretization of environment variables and the Monte Carlo method for the principal particle variables. Rigorous mathematical foundations are the bases of these tools. The monograph is composed of four chapters. The first three chapters are concerned with modeling, while the last one is devoted to mathematical analysis. The first chapter deals with molecular dynamics occurring at the early stage of cancer invasion. A pathway network model based on a biological scenario is constructed, and then its mathematical structures are determined. In the second chapter mathematica...

Derivation and implementation of a cone-beam reconstruction algorithm for nonplanar orbits

International Nuclear Information System (INIS)

Kudo, Hiroyuki; Saito, Tsuneo

1994-01-01

Smith and Grangeat derived a cone-beam inversion formula that can be applied when a nonplanar orbit satisfying the completeness condition is used. Although Grangeat's inversion formula is mathematically different from Smith's, they have similar overall structures to each other. The contribution of this paper is two-fold. First, based on the derivation of Smith, the authors point out that Grangeat's inversion formula and Smith's can be conveniently described using a single formula (the Smith-Grangeat inversion formula) that is in the form of space-variant filtering followed by cone-beam backprojection. Furthermore, the resulting formula is reformulated for data acquisition systems with a planar detector to obtain a new reconstruction algorithm. Second, the authors make two significant modifications to the new algorithm to reduce artifacts and numerical errors encountered in direct implementation of the new algorithm. As for exactness of the new algorithm, the following fact can be stated. The algorithm based on Grangeat's intermediate function is exact for any complete orbit, whereas that based on Smith's intermediate function should be considered as an approximate inverse excepting the special case where almost every plane in 3-D space meets the orbit. The validity of the new algorithm is demonstrated by simulation studies

A mathematical model for describing the retinal nerve fiber bundle trajectories in the human eye : Average course, variability, and influence of refraction, optic disc size and optic disc position

NARCIS (Netherlands)

Jansonius, Nomdo M.; Schiefer, Julia; Nevalainen, Jukka; Paetzold, Jens; Schiefer, Ulrich

2012-01-01

Previously we developed a mathematical model for describing the retinal nerve fiber bundle trajectories in the superior-temporal and inferior-temporal regions of the human retina, based on traced trajectories extracted from fundus photographs. Aims of the current study were to (i) validate the

[Application of a mathematical algorithm for the detection of electroneuromyographic results in the pathogenesis study of facial dyskinesia].

Science.gov (United States)

Gribova, N P; Iudel'son, Ia B; Golubev, V L; Abramenkova, I V

2003-01-01

To carry out a differential diagnosis of two facial dyskinesia (FD) models--facial hemispasm (FH) and facial paraspasm (FP), a combined program of electroneuromyographic (ENMG) examination has been created, using statistical analyses, including that for objects identification based on hybrid neural network with the application of adaptive fuzzy logic method and standard statistics programs (Wilcoxon, Student statistics). In FH, a lesion of peripheral facial neuromotor apparatus with augmentation of functions of inter-neurons in segmental and upper segmental stem levels predominated. In FP, primary afferent strengthening in mimic muscles was accompanied by increased motor neurons activity and reciprocal augmentation of inter-neurons, inhibiting motor portion of V pair. Mathematical algorithm for ENMG results recognition worked out in the study provides a precise differentiation of two FD models and opens possibilities for differential diagnosis of other facial motor disorders.

Exploded view diagrams of mathematical surfaces

KAUST Repository

Karpenko, Olga A.

2010-11-01

We present a technique for visualizing complicated mathematical surfaces that is inspired by hand-designed topological illustrations. Our approach generates exploded views that expose the internal structure of such a surface by partitioning it into parallel slices, which are separated from each other along a single linear explosion axis. Our contributions include a set of simple, prescriptive design rules for choosing an explosion axis and placing cutting planes, as well as automatic algorithms for applying these rules. First we analyze the input shape to select the explosion axis based on the detected rotational and reflective symmetries of the input model. We then partition the shape into slices that are designed to help viewers better understand how the shape of the surface and its cross-sections vary along the explosion axis. Our algorithms work directly on triangle meshes, and do not depend on any specific parameterization of the surface. We generate exploded views for a variety of mathematical surfaces using our system. © 2006 IEEE.

Head injury management algorithm as described in Hippocrates' "peri ton en cephali traumaton".

Science.gov (United States)

Dimopoulos, Vassilios G; Machinis, Theofilos G; Fountas, Kostas N; Robinson, Joe S

2005-12-01

HIPPOCRATIC WORKS LEND themselves still today to the modern physician for further analysis of his approach to the diagnosis and treatment of various pathological conditions. We present an attempt to systematize his methodology regarding the management of head trauma and present it in the format of a modern-era algorithm.

The Mathematical State of the World

DEFF Research Database (Denmark)

Christensen, Ole Ravn; Skovsmose, Ole; Yasukawa, Keiko

2009-01-01

the concepts of “mathematical description” and “mathematical model” are inadequate to evaluate the use of mathematics in decision-making processes. As a result we develop a conceptual framework that is complex enough to match what goes on in scenarios involving applications of mathematics.......In this article we try to analyse the conditions for describing the world mathematically. We consider the role played by mathematics in discussing and analysing “the state of the world.” We use this discussion to clarify what it means to use a mathematical description. We illustrate why...

Index Theory with Applications to Mathematics and Physics

DEFF Research Database (Denmark)

Booss-Bavnbek, Bernhelm; Bleecker, David

Index Theory with Applications to Mathematics and Physics describes, explains, and explores the Index Theorem of Atiyah and Singer, one of the truly great accomplishments of twentieth-century mathematics whose influence continues to grow, fifty years after its discovery. The Index Theorem has giv...... birth to many mathematical research areas and exposed profound connections between analysis, geometry, topology, algebra, and mathematical physics. Hardly any topic of modern mathematics stands independent of its influence.......Index Theory with Applications to Mathematics and Physics describes, explains, and explores the Index Theorem of Atiyah and Singer, one of the truly great accomplishments of twentieth-century mathematics whose influence continues to grow, fifty years after its discovery. The Index Theorem has given...

A novel highly parallel algorithm for linearly unmixing hyperspectral images

Science.gov (United States)

Guerra, Raúl; López, Sebastián.; Callico, Gustavo M.; López, Jose F.; Sarmiento, Roberto

2014-10-01

Endmember extraction and abundances calculation represent critical steps within the process of linearly unmixing a given hyperspectral image because of two main reasons. The first one is due to the need of computing a set of accurate endmembers in order to further obtain confident abundance maps. The second one refers to the huge amount of operations involved in these time-consuming processes. This work proposes an algorithm to estimate the endmembers of a hyperspectral image under analysis and its abundances at the same time. The main advantage of this algorithm is its high parallelization degree and the mathematical simplicity of the operations implemented. This algorithm estimates the endmembers as virtual pixels. In particular, the proposed algorithm performs the descent gradient method to iteratively refine the endmembers and the abundances, reducing the mean square error, according with the linear unmixing model. Some mathematical restrictions must be added so the method converges in a unique and realistic solution. According with the algorithm nature, these restrictions can be easily implemented. The results obtained with synthetic images demonstrate the well behavior of the algorithm proposed. Moreover, the results obtained with the well-known Cuprite dataset also corroborate the benefits of our proposal.

Perception determinants in learning mathematics

Science.gov (United States)

Mokhtar, Siti Fairus; Ali, Noor Rasidah; Rashid, Nurazlina Abdul

2015-05-01

This article described a statistical study of students' perception in mathematics. The objective of this study is to identify factors related to perception about learning mathematics among non mathematics' student. This study also determined the relationship between of these factors among non mathematics' student. 43 items questionnaires were distributed to one hundred students in UiTM Kedah who enrolled in the Business Mathematics course. These items were measured by using a semantic scale with the following anchors: 1 = strongly disagree to 7 = strongly agree. A factor analysis of respondents were identified into five factors that influencing the students' perception in mathematics. In my study, factors identified were attitude, interest, role of the teacher, role of peers and usefulness of mathematics that may relate to the perception about learning mathematics among non mathematics' student.

A discretized algorithm for the solution of a constrained, continuous ...

African Journals Online (AJOL)

A discretized algorithm for the solution of a constrained, continuous quadratic control problem. ... The results obtained show that the Discretized constrained algorithm (DCA) is much more accurate and more efficient than some of these techniques, particularly the FSA. Journal of the Nigerian Association of Mathematical ...

Mathematical Foundations of Quantum Information and Computation and Its Applications to Nano- and Bio-systems

CERN Document Server

Ohya, Masanori

2011-01-01

This monograph provides a mathematical foundation  to  the theory of quantum information and computation, with applications to various open systems including nano and bio systems. It includes introductory material on algorithm, functional analysis, probability theory, information theory, quantum mechanics and quantum field theory. Apart from standard material on quantum information like quantum algorithm and teleportation, the authors discuss findings on the theory of entropy in C*-dynamical systems, space-time dependence of quantum entangled states, entangling operators, adaptive dynamics, relativistic quantum information, and a new paradigm for quantum computation beyond the usual quantum Turing machine. Also, some important applications of information theory to genetics and life sciences, as well as recent experimental and theoretical discoveries in quantum photosynthesis are described.

Mathematical thinking and origami

Science.gov (United States)

Wares, Arsalan

2016-01-01

The purpose of this paper is to describe the mathematics that emanates from the construction of an origami box. We first construct a simple origami box from a rectangular sheet and then discuss some of the mathematical questions that arise in the context of geometry and calculus.

Discrete Mathematics Re "Tooled."

Science.gov (United States)

Grassl, Richard M.; Mingus, Tabitha T. Y.

1999-01-01

Indicates the importance of teaching discrete mathematics. Describes how the use of technology can enhance the teaching and learning of discrete mathematics. Explorations using Excel, Derive, and the TI-92 proved how preservice and inservice teachers experienced a new dimension in problem solving and discovery. (ASK)

Techtalk: Mobile Apps and College Mathematics

Science.gov (United States)

Hoang, Theresa V.; Caverly, David C.

2013-01-01

In this column, the authors discuss apps useful in developing mathematical reasoning. They place these into a theoretical framework, suggesting how they could be used in an instructional model such as the Algorithmic Instructional Technique (AIT) developed by Vasquez (2003). This model includes four stages: modeling, practice, transition, and…

Principal component analysis networks and algorithms

CERN Document Server

Kong, Xiangyu; Duan, Zhansheng

2017-01-01

This book not only provides a comprehensive introduction to neural-based PCA methods in control science, but also presents many novel PCA algorithms and their extensions and generalizations, e.g., dual purpose, coupled PCA, GED, neural based SVD algorithms, etc. It also discusses in detail various analysis methods for the convergence, stabilizing, self-stabilizing property of algorithms, and introduces the deterministic discrete-time systems method to analyze the convergence of PCA/MCA algorithms. Readers should be familiar with numerical analysis and the fundamentals of statistics, such as the basics of least squares and stochastic algorithms. Although it focuses on neural networks, the book only presents their learning law, which is simply an iterative algorithm. Therefore, no a priori knowledge of neural networks is required. This book will be of interest and serve as a reference source to researchers and students in applied mathematics, statistics, engineering, and other related fields.

Dataset exploited for the development and validation of automated cyanobacteria quantification algorithm, ACQUA

Directory of Open Access Journals (Sweden)

Emanuele Gandola

2016-09-01

Full Text Available The estimation and quantification of potentially toxic cyanobacteria in lakes and reservoirs are often used as a proxy of risk for water intended for human consumption and recreational activities. Here, we present data sets collected from three volcanic Italian lakes (Albano, Vico, Nemi that present filamentous cyanobacteria strains at different environments. Presented data sets were used to estimate abundance and morphometric characteristics of potentially toxic cyanobacteria comparing manual Vs. automated estimation performed by ACQUA (“ACQUA: Automated Cyanobacterial Quantification Algorithm for toxic filamentous genera using spline curves, pattern recognition and machine learning” (Gandola et al., 2016 [1]. This strategy was used to assess the algorithm performance and to set up the denoising algorithm. Abundance and total length estimations were used for software development, to this aim we evaluated the efficiency of statistical tools and mathematical algorithms, here described. The image convolution with the Sobel filter has been chosen to denoise input images from background signals, then spline curves and least square method were used to parameterize detected filaments and to recombine crossing and interrupted sections aimed at performing precise abundances estimations and morphometric measurements. Keywords: Comparing data, Filamentous cyanobacteria, Algorithm, Deoising, Natural sample

Optimization of welding parameters using a genetic algorithm: A robotic arm–assisted implementation for recovery of Pelton turbine blades

Directory of Open Access Journals (Sweden)

Luis Pérez Pozo

2015-11-01

Full Text Available This work presents the operational optimization of a welding operation involving using genetic algorithms. The welding curves correspond to the profile of a blade-shaped Pelton turbine. The procedure involved the development of a series of tests and observation of the parameters that will be controlled during the welding process. After the tests were performed, the samples were prepared for chemical attack, which allowed observation of the penetration, weld area, and dilution. After that, mathematical models were developed that correlate the controllable welding parameters with the aforementioned bead parameters. In those mathematical models, the optimization of the process parameters was performed using genetic algorithms. Specially programmed functions for mutation, reproduction, and initialization processes were written and used in the implemented model. After the optimization process was completed, the results were evaluated through new tests to verify whether the obtained objective functions properly describe the characteristics of the weld. The comparisons showed errors of less than 6%.

Essential algorithms a practical approach to computer algorithms

CERN Document Server

Stephens, Rod

2013-01-01

A friendly and accessible introduction to the most useful algorithms Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new algorithms to meet future needs. The book also includes a collection of questions that can help readers prepare for a programming job interview. Reveals methods for manipulating common data structures s

Comparison of two mathematical models for describing heat-induced cell killing

International Nuclear Information System (INIS)

Roti Roti, J.L.; Henle, K.J.

1980-01-01

A computer-based minimization algorithm is utilized to obtain the optimum fits of two models to hyperthermic cell killing data. The models chosen are the multitarget, single-hit equation, which is in general use, and the linear-quadratic equation, which has been applied to cell killing by ionizing irradiation but not to heat-induced cell killing. The linear-quadratic equation fits hyperthermic cell killing data as well as the multitarget, single-hit equation. Both parameters of the linear-quadratic equation obey the Arrhenius law, whereas only one of the two parameters of the multitarget, single-hit equation obeys the Arrhenius law. Thus the linear-quadratic function can completely define cell killing as a function of both time and temperature. In addition, the linear-quadratic model will provide a simplified approach to the study of the synergism between heat and X irradiation

Early Years Students' Relationships with Mathematics

Science.gov (United States)

Takeuchi, Miwa Aoki; Towers, Jo; Plosz, Jennifer

2016-01-01

Early years mathematics experiences have been shown to be a significant predictor for students' school readiness and future mathematics achievement. Previous research also indicates an important connection between emotion and mathematics learning. How do students in early years education in Alberta describe their emotional relationship with…

Mathematical concepts

CERN Document Server

Jost, Jürgen

2015-01-01

The main intention of this book is to describe and develop the conceptual, structural and abstract thinking of mathematics. Specific mathematical structures are used to illustrate the conceptual approach; providing a deeper insight into mutual relationships and abstract common features. These ideas are carefully motivated, explained and illustrated by examples so that many of the more technical proofs can be omitted. The book can therefore be used: ·         simply as an overview of the panorama of mathematical structures and the relations between them, to be supplemented by more detailed texts whenever you want to acquire a working knowledge of some structure ·         by itself as a first introduction to abstract mathematics ·         together with existing textbooks, to put their results into a more general perspective ·         to gain a new and hopefully deeper perspective after having studied such textbooks Mathematical Concepts has a broader scope and is less detaile...

Algorithmic cryptanalysis

CERN Document Server

Joux, Antoine

2009-01-01

Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic

Educating mathematics teacher educators

DEFF Research Database (Denmark)

Højgaard, Tomas; Jankvist, Uffe Thomas

2014-01-01

The paper argues for a three-dimensional course design structure for future mathematics teacher educators. More precisely we describe the design and implementation of a course basing itself on: the two mathematical competencies of modelling and problem tackling, this being the first dimension......; the two mathematical topics of differential equations and stochastics, this being the second dimension; and finally a third dimension the purpose of which is to deepen the two others by means of a didactical perspective....

Teaching Computation in Primary School without Traditional Written Algorithms

Science.gov (United States)

Hartnett, Judy

2015-01-01

Concerns regarding the dominance of the traditional written algorithms in schools have been raised by many mathematics educators, yet the teaching of these procedures remains a dominant focus in in primary schools. This paper reports on a project in one school where the staff agreed to put the teaching of the traditional written algorithm aside,…

Comparative behaviour of the Dynamically Penalized Likelihood algorithm in inverse radiation therapy planning

Energy Technology Data Exchange (ETDEWEB)

Llacer, Jorge [EC Engineering Consultants, LLC, Los Gatos, CA (United States)]. E-mail: jllacer@home.com; Solberg, Timothy D. [Department of Radiation Oncology, University of California, Los Angeles, CA (United States)]. E-mail: Solberg@radonc.ucla.edu; Promberger, Claus [BrainLAB AG, Heimstetten (Germany)]. E-mail: promberg@brainlab.com

2001-10-01

This paper presents a description of tests carried out to compare the behaviour of five algorithms in inverse radiation therapy planning: (1) The Dynamically Penalized Likelihood (DPL), an algorithm based on statistical estimation theory; (2) an accelerated version of the same algorithm; (3) a new fast adaptive simulated annealing (ASA) algorithm; (4) a conjugate gradient method; and (5) a Newton gradient method. A three-dimensional mathematical phantom and two clinical cases have been studied in detail. The phantom consisted of a U-shaped tumour with a partially enclosed 'spinal cord'. The clinical examples were a cavernous sinus meningioma and a prostate case. The algorithms have been tested in carefully selected and controlled conditions so as to ensure fairness in the assessment of results. It has been found that all five methods can yield relatively similar optimizations, except when a very demanding optimization is carried out. For the easier cases, the differences are principally in robustness, ease of use and optimization speed. In the more demanding case, there are significant differences in the resulting dose distributions. The accelerated DPL emerges as possibly the algorithm of choice for clinical practice. An appendix describes the differences in behaviour between the new ASA method and the one based on a patent by the Nomos Corporation. (author)

Giving Reason to Prospective Mathematics Teachers

Science.gov (United States)

D'Ambrosio, Beatriz; Kastberg, Signe

2012-01-01

This article describes the development of the authors' understanding of the contradictions in their mathematics teacher education practice. This understanding emerged from contrasting analyses of the impact of the authors' practices in mathematics content courses versus mathematics methods courses. Examples of the authors' work with two students,…

The Princeton companion to mathematics

CERN Document Server

Barrow-Green, June; Leader, Imre

2008-01-01

This is a one-of-a-kind reference for anyone with a serious interest in mathematics. Edited by Timothy Gowers, a recipient of the Fields Medal, it presents nearly two hundred entries, written especially for this book by some of the world's leading mathematicians, that introduce basic mathematical tools and vocabulary; trace the development of modern mathematics; explain essential terms and concepts; examine core ideas in major areas of mathematics; describe the achievements of scores of famous mathematicians; explore the impact of mathematics on other disciplines such as biology, finance, and music--and much, much more

Application of particle swarm optimization algorithm in the heating system planning problem.

Science.gov (United States)

Ma, Rong-Jiang; Yu, Nan-Yang; Hu, Jun-Yi

2013-01-01

Based on the life cycle cost (LCC) approach, this paper presents an integral mathematical model and particle swarm optimization (PSO) algorithm for the heating system planning (HSP) problem. The proposed mathematical model minimizes the cost of heating system as the objective for a given life cycle time. For the particularity of HSP problem, the general particle swarm optimization algorithm was improved. An actual case study was calculated to check its feasibility in practical use. The results show that the improved particle swarm optimization (IPSO) algorithm can more preferably solve the HSP problem than PSO algorithm. Moreover, the results also present the potential to provide useful information when making decisions in the practical planning process. Therefore, it is believed that if this approach is applied correctly and in combination with other elements, it can become a powerful and effective optimization tool for HSP problem.

Solution of the mathematical adjoint equations for an interface current nodal formulation

International Nuclear Information System (INIS)

Yang, W.S.; Taiwo, T.A.; Khalil, H.

1994-01-01

Two techniques for solving the mathematical adjoint equations of an interface current nodal method are described. These techniques are the ''similarity transformation'' procedure and a direct solution scheme. A theoretical basis is provided for the similarity transformation procedure originally proposed by Lawrence. It is shown that the matrices associated with the mathematical and physical adjoint equations are similar to each other for the flat transverse leakage approximation but not for the quadratic leakage approximation. It is also shown that a good approximate solution of the mathematical adjoint for the quadratic transverse leakage approximation is obtained by applying the similarity transformation for the flat transverse leakage approximation to the physical adjoint solution. The direct solution scheme, which was developed as an alternative to the similarity transformation procedure, yields the correct mathematical adjoint solution for both flat and quadratic transverse leakage approximations. In this scheme, adjoint nodal equations are cast in a form very similar to that of the forward equations by employing a linear transformation of the adjoint partial currents. This enables the use of the forward solution algorithm with only minor modifications for solving the mathematical adjoint equations. By using the direct solution scheme as a reference method, it is shown that while the results computed with the similarity transformation procedure are approximate, they are sufficiently accurate for calculations of global and local reactivity changes resulting from coolant voiding in a liquid-metal reactor

Mathematics and Measurement.

Science.gov (United States)

Boisvert, R F; Donahue, M J; Lozier, D W; McMichael, R; Rust, B W

2001-01-01

In this paper we describe the role that mathematics plays in measurement science at NIST. We first survey the history behind NIST's current work in this area, starting with the NBS Math Tables project of the 1930s. We then provide examples of more recent efforts in the application of mathematics to measurement science, including the solution of ill-posed inverse problems, characterization of the accuracy of software for micromagnetic modeling, and in the development and dissemination of mathematical reference data. Finally, we comment on emerging issues in measurement science to which mathematicians will devote their energies in coming years.

Annual report of the Center for Applied Mathematics, 1985

International Nuclear Information System (INIS)

1986-01-01

Research on the mathematical aspects of wave propagation; particulate methods in fluid physics and mechanics; nonlinear problems; stochastic equations; martingales, and interacting particle systems; and computer programming and algorithms is presented [fr

Annual report of the Center for Applied Mathematics, 1986

International Nuclear Information System (INIS)

1987-01-01

Research on the mathematical aspects of wave propagation; particulate methods in fluid physics and mechanics; nonlinear problems; stochastic equations; martingales, and interacting particle systems; and computer programming and algorithms is presented [fr

Soundoff: Mathematics Is Getting Easier.

Science.gov (United States)

Usiskin, Zalman

1984-01-01

Teaching mathematics in hard ways, rather than using easier methods or technology, is described. Employing the most efficient means possible to solve a problem is the essence of good mathematics, rather than wasting time in practicing obsolete skills. (MNS)

MATHEMATICAL MODEL MANIPULATOR ROBOTS

Directory of Open Access Journals (Sweden)

O. N. Krakhmalev

2015-12-01

Full Text Available A mathematical model to describe the dynamics of manipulator robots. Mathematical model are the implementation of the method based on the Lagrange equation and using the transformation matrices of elastic coordinates. Mathematical model make it possible to determine the elastic deviations of manipulator robots from programmed motion trajectories caused by elastic deformations in hinges, which are taken into account in directions of change of the corresponding generalized coordinates. Mathematical model is approximated and makes it possible to determine small elastic quasi-static deviations and elastic vibrations. The results of modeling the dynamics by model are compared to the example of a two-link manipulator system. The considered model can be used when performing investigations of the mathematical accuracy of the manipulator robots.

Assessing Mathematical Competencies: An Analysis of Swedish National Mathematics Tests

Science.gov (United States)

Boesen, Jesper; Lithner, Johan; Palm, Torulf

2018-01-01

Internationally, education reform has been directed towards describing educational goals that go beyond topic and content descriptions. The idea of mathematical competencies describes such goals. National tests have been seen as one way of communicating these goals and influence teaching. The present study analyses Swedish national tests in…

Multimodal optimization by using hybrid of artificial bee colony algorithm and BFGS algorithm

Science.gov (United States)

Anam, S.

2017-10-01

Optimization has become one of the important fields in Mathematics. Many problems in engineering and science can be formulated into optimization problems. They maybe have many local optima. The optimization problem with many local optima, known as multimodal optimization problem, is how to find the global solution. Several metaheuristic methods have been proposed to solve multimodal optimization problems such as Particle Swarm Optimization (PSO), Genetics Algorithm (GA), Artificial Bee Colony (ABC) algorithm, etc. The performance of the ABC algorithm is better than or similar to those of other population-based algorithms with the advantage of employing a fewer control parameters. The ABC algorithm also has the advantages of strong robustness, fast convergence and high flexibility. However, it has the disadvantages premature convergence in the later search period. The accuracy of the optimal value cannot meet the requirements sometimes. Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm is a good iterative method for finding a local optimum. Compared with other local optimization methods, the BFGS algorithm is better. Based on the advantages of the ABC algorithm and the BFGS algorithm, this paper proposes a hybrid of the artificial bee colony algorithm and the BFGS algorithm to solve the multimodal optimization problem. The first step is that the ABC algorithm is run to find a point. In the second step is that the point obtained by the first step is used as an initial point of BFGS algorithm. The results show that the hybrid method can overcome from the basic ABC algorithm problems for almost all test function. However, if the shape of function is flat, the proposed method cannot work well.

Numerical algorithms for contact problems in linear elastostatics

International Nuclear Information System (INIS)

Barbosa, H.J.C.; Feijoo, R.A.

1984-01-01

In this work contact problems in linear elasticity are analysed by means of Finite Elements and Mathematical Programming Techniques. The principle of virtual work leads in this case to a variational inequality which in turn is equivalent, for Hookean materials and infinitesimal strains, to the minimization of the total potential energy over the set of all admissible virtual displacements. The use of Gauss-Seidel algorithm with relaxation and projection and also Lemke's algorithm and Uzawa's algorithm for solving the minimization problem is discussed. Finally numerical examples are presented. (Author) [pt

Pseudo-deterministic Algorithms

OpenAIRE

Goldwasser , Shafi

2012-01-01

International audience; In this talk we describe a new type of probabilistic algorithm which we call Bellagio Algorithms: a randomized algorithm which is guaranteed to run in expected polynomial time, and to produce a correct and unique solution with high probability. These algorithms are pseudo-deterministic: they can not be distinguished from deterministic algorithms in polynomial time by a probabilistic polynomial time observer with black box access to the algorithm. We show a necessary an...

Mathematics and linguistics

Energy Technology Data Exchange (ETDEWEB)

Landauer, C.; Bellman, K.L.

1996-12-31

In this paper, we study foundational issues that we believe will help us develop a theoretically sound approach to constructing complex systems. The two theoretical approaches that have helped us understand and develop computational systems in the past are mathematics and linguistics. We describe some differences and strengths of the approaches, and propose a research program to combine the richness of linguistic reasoning with the precision of mathematics.

CATEGORIES OF COMPUTER SYSTEMS ALGORITHMS

Directory of Open Access Journals (Sweden)

A. V. Poltavskiy

2015-01-01

Full Text Available Philosophy as a frame of reference on world around and as the first science is a fundamental basis, "roots" (R. Descartes for all branches of the scientific knowledge accumulated and applied in all fields of activity of a human being person. The theory of algorithms as one of the fundamental sections of mathematics, is also based on researches of the gnoseology conducting cognition of a true picture of the world of the buman being. From gnoseology and ontology positions as fundamental sections of philosophy modern innovative projects are inconceivable without development of programs,and algorithms.

A feature matching and fusion-based positive obstacle detection algorithm for field autonomous land vehicles

Directory of Open Access Journals (Sweden)

Tao Wu

2017-03-01

Full Text Available Positive obstacles will cause damage to field robotics during traveling in field. Field autonomous land vehicle is a typical field robotic. This article presents a feature matching and fusion-based algorithm to detect obstacles using LiDARs for field autonomous land vehicles. There are three main contributions: (1 A novel setup method of compact LiDAR is introduced. This method improved the LiDAR data density and reduced the blind region of the LiDAR sensor. (2 A mathematical model is deduced under this new setup method. The ideal scan line is generated by using the deduced mathematical model. (3 Based on the proposed mathematical model, a feature matching and fusion (FMAF-based algorithm is presented in this article, which is employed to detect obstacles. Experimental results show that the performance of the proposed algorithm is robust and stable, and the computing time is reduced by an order of two magnitudes by comparing with other exited algorithms. This algorithm has been perfectly applied to our autonomous land vehicle, which has won the champion in the challenge of Chinese “Overcome Danger 2014” ground unmanned vehicle.

Improved multivariate polynomial factoring algorithm

International Nuclear Information System (INIS)

Wang, P.S.

1978-01-01

A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described. The new algorithm has improved strategies for dealing with the known problems of the original algorithm, namely, the leading coefficient problem, the bad-zero problem and the occurrence of extraneous factors. It has an algorithm for correctly predetermining leading coefficients of the factors. A new and efficient p-adic algorithm named EEZ is described. Bascially it is a linearly convergent variable-by-variable parallel construction. The improved algorithm is generally faster and requires less store then the original algorithm. Machine examples with comparative timing are included

The materiality of mathematics: presenting mathematics at the blackboard.

Science.gov (United States)

Greiffenhagen, Christian

2014-09-01

Sociology has been accused of neglecting the importance of material things in human life and the material aspects of social practices. Efforts to correct this have recently been made, with a growing concern to demonstrate the materiality of social organization, not least through attention to objects and the body. As a result, there have been a plethora of studies reporting the social construction and effects of a variety of material objects as well as studies that have explored the material dimensions of a diversity of practices. In different ways these studies have questioned the Cartesian dualism of a strict separation of 'mind' and 'body'. However, it could be argued that the idea of the mind as immaterial has not been entirely banished and lingers when it comes to discussing abstract thinking and reasoning. The aim of this article is to extend the material turn to abstract thought, using mathematics as a paradigmatic example. This paper explores how writing mathematics (on paper, blackboards, or even in the air) is indispensable for doing and thinking mathematics. The paper is based on video recordings of lectures in formal logic and investigates how mathematics is presented at the blackboard. The paper discusses the iconic character of blackboards in mathematics and describes in detail a number of inscription practices of presenting mathematics at the blackboard (such as the use of lines and boxes, the designation of particular regions for specific mathematical purposes, as well as creating an 'architecture' visualizing the overall structure of the proof). The paper argues that doing mathematics really is 'thinking with eyes and hands' (Latour 1986). Thinking in mathematics is inextricably interwoven with writing mathematics. © London School of Economics and Political Science 2014.

Geocaching: Finding Mathematics in a Global Treasure Hunt

Science.gov (United States)

Bragg, Leicha A.

2014-01-01

If you love taking mathematics lessons outdoors, then you will love this article. Leicha Bragg describes geocaching, which combines technology, treasure hunting and mathematics, and results in purposeful, authentic and engaging mathematics.

A mathematical model of star formation in the Galaxy

Directory of Open Access Journals (Sweden)

M.A. Sharaf

2012-06-01

Full Text Available This paper is generally concerned with star formation in the Galaxy, especially blue stars. Blue stars are the most luminous, massive and the largest in radius. A simple mathematical model of the formation of the stars is established and put in computational algorithm. This algorithm enables us to know more about the formation of the star. Some real and artificial examples had been used to justify this model.

Parallel Processing and Applied Mathematics. 10th International Conference, PPAM 2013. Revised Selected Papers

DEFF Research Database (Denmark)

The following topics are dealt with: parallel scientific computing; numerical algorithms; parallel nonnumerical algorithms; cloud computing; evolutionary computing; metaheuristics; applied mathematics; GPU computing; multicore systems; hybrid architectures; hierarchical parallelism; HPC systems......; power monitoring; energy monitoring; and distributed computing....

A method for the interpretation of flow cytometry data using genetic algorithms

Directory of Open Access Journals (Sweden)

Cesar Angeletti

2018-01-01

Full Text Available Background: Flow cytometry analysis is the method of choice for the differential diagnosis of hematologic disorders. It is typically performed by a trained hematopathologist through visual examination of bidimensional plots, making the analysis time-consuming and sometimes too subjective. Here, a pilot study applying genetic algorithms to flow cytometry data from normal and acute myeloid leukemia subjects is described. Subjects and Methods: Initially, Flow Cytometry Standard files from 316 normal and 43 acute myeloid leukemia subjects were transformed into multidimensional FITS image metafiles. Training was performed through introduction of FITS metafiles from 4 normal and 4 acute myeloid leukemia in the artificial intelligence system. Results: Two mathematical algorithms termed 018330 and 025886 were generated. When tested against a cohort of 312 normal and 39 acute myeloid leukemia subjects, both algorithms combined showed high discriminatory power with a receiver operating characteristic (ROC curve of 0.912. Conclusions: The present results suggest that machine learning systems hold a great promise in the interpretation of hematological flow cytometry data.

The Texas Medication Algorithm Project (TMAP) schizophrenia algorithms.

Science.gov (United States)

Miller, A L; Chiles, J A; Chiles, J K; Crismon, M L; Rush, A J; Shon, S P

1999-10-01

In the Texas Medication Algorithm Project (TMAP), detailed guidelines for medication management of schizophrenia and related disorders, bipolar disorders, and major depressive disorders have been developed and implemented. This article describes the algorithms developed for medication treatment of schizophrenia and related disorders. The guidelines recommend a sequence of medications and discuss dosing, duration, and switch-over tactics. They also specify response criteria at each stage of the algorithm for both positive and negative symptoms. The rationale and evidence for each aspect of the algorithms are presented.

Mathematical models to describe iontophoretic transport in vitro and in vivo and the effect of current application on the skin barrier.

Science.gov (United States)

Gratieri, Taís; Kalia, Yogeshvar N

2013-02-01

more esoteric "constant phase element"; the latter provides a better mathematical description of the "non-ideal" behaviour of skin impedance. However, in addition to simply providing a "mathematical" fit of the observed data, it is essential to relate these circuit elements to biological structures present in the skin. More recently, attention has also turned to what happens when the permeant crosses the epidermis and reaches the systemic circulation and pharmacokinetic models have been proposed to interpret data from iontophoretic delivery studies in vivo. Here, we provide an overview of mathematical models that have been proposed to describe (i) the effect of current application on the skin and the implications for potential iontophoretic transport pathways, (ii) electrotransport kinetics and (iii) the fate of iontophoretically delivered drugs once they enter the systemic circulation. Copyright © 2012 Elsevier B.V. All rights reserved.

Optimization Solution of Troesch’s and Bratu’s Problems of Ordinary Type Using Novel Continuous Genetic Algorithm

Directory of Open Access Journals (Sweden)

Zaer Abo-Hammour

2014-01-01

Full Text Available A new kind of optimization technique, namely, continuous genetic algorithm, is presented in this paper for numerically approximating the solutions of Troesch’s and Bratu’s problems. The underlying idea of the method is to convert the two differential problems into discrete versions by replacing each of the second derivatives by an appropriate difference quotient approximation. The new method has the following characteristics. First, it should not resort to more advanced mathematical tools; that is, the algorithm should be simple to understand and implement and should be thus easily accepted in the mathematical and physical application fields. Second, the algorithm is of global nature in terms of the solutions obtained as well as its ability to solve other mathematical and physical problems. Third, the proposed methodology has an implicit parallel nature which points to its implementation on parallel machines. The algorithm is tested on different versions of Troesch’s and Bratu’s problems. Experimental results show that the proposed algorithm is effective, straightforward, and simple.

Science, technology, engineering, mathematics (STEM) as mathematics learning approach in 21st century

Science.gov (United States)

Milaturrahmah, Naila; Mardiyana, Pramudya, Ikrar

2017-08-01

This 21st century demands competent human resources in science, technology, engineering design and mathematics so that education is expected to integrate the four disciplines. This paper aims to describe the importance of STEM as mathematics learning approach in Indonesia in the 21st century. This paper uses a descriptive analysis research method, and the method reveals that STEM education growing in developed countries today can be a framework for innovation mathematics in Indonesia in the 21st century. STEM education integrate understanding of science, math skills, and the available technology with the ability to perform engineering design process. Implementation of mathematics learning with STEM approach makes graduates trained in using of mathematics knowledge that they have to create innovative products that are able to solve the problems that exist in society.

Finite element methods for viscous incompressible flows a guide to theory, practice, and algorithms

CERN Document Server

Gunzburger, Max D

2012-01-01

In this book, the author examines mathematical aspects of finite element methods for the approximate solution of incompressible flow problems. The principal goal is to present some of the important mathematical results that are relevant to practical computations. In so doing, useful algorithms are also discussed. Although rigorous results are stated, no detailed proofs are supplied; rather, the intention is to present these results so that they can serve as a guide for the selection and, in certain respects, the implementation of algorithms.

An Implementation of RC4+ Algorithm and Zig-zag Algorithm in a Super Encryption Scheme for Text Security

Science.gov (United States)

Budiman, M. A.; Amalia; Chayanie, N. I.

2018-03-01

Cryptography is the art and science of using mathematical methods to preserve message security. There are two types of cryptography, namely classical and modern cryptography. Nowadays, most people would rather use modern cryptography than classical cryptography because it is harder to break than the classical one. One of classical algorithm is the Zig-zag algorithm that uses the transposition technique: the original message is unreadable unless the person has the key to decrypt the message. To improve the security, the Zig-zag Cipher is combined with RC4+ Cipher which is one of the symmetric key algorithms in the form of stream cipher. The two algorithms are combined to make a super-encryption. By combining these two algorithms, the message will be harder to break by a cryptanalyst. The result showed that complexity of the combined algorithm is θ(n2 ), while the complexity of Zig-zag Cipher and RC4+ Cipher are θ(n2 ) and θ(n), respectively.

The methods and algorithms for designing complex three-dimensional robots

International Nuclear Information System (INIS)

Solovjev, A.E.; Naumov, V.B.

1996-01-01

For automation designing by the Robotics laboratory were executed some fundamental and applied researches. This researching allowed to create rational mathematical model for numeric modeling with real-time simulation. In the mathematical model used set of equations of rigid body's motion in Lagrange's form and set of Appel's equations taking into consideration holonomic and non-holonomic connections. In present article are considered methods and algorithms of dynamic modeling of a system of rigid bodies for robotics task and brief description of the package Computer Aided Engineering for Industrial Robots, based on considered algorithms. So far as, in researching of robots the dynamic tasks (direct and inverse) are more interesting than another tasks, authors pay attention just on these problems

Modifications of the branch-and-bound algorithm for application in constrained adaptive testing

NARCIS (Netherlands)

Veldkamp, Bernard P.

2000-01-01

A mathematical programming approach is presented for computer adaptive testing (CAT) with many constraints on the item and test attributes. Because mathematical programming problems have to be solved while the examinee waits for the next item, a fast implementation of the Branch-and-Bound algorithm

An Adaptive Unified Differential Evolution Algorithm for Global Optimization

Energy Technology Data Exchange (ETDEWEB)

Qiang, Ji; Mitchell, Chad

2014-11-03

In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.

Look-ahead fermion algorithm

International Nuclear Information System (INIS)

Grady, M.

1986-01-01

I describe a fast fermion algorithm which utilizes pseudofermion fields but appears to have little or no systematic error. Test simulations on two-dimensional gauge theories are described. A possible justification for the algorithm being exact is discussed. 8 refs

Algorithms for image processing and computer vision

CERN Document Server

Parker, J R

2010-01-01

A cookbook of algorithms for common image processing applications Thanks to advances in computer hardware and software, algorithms have been developed that support sophisticated image processing without requiring an extensive background in mathematics. This bestselling book has been fully updated with the newest of these, including 2D vision methods in content-based searches and the use of graphics cards as image processing computational aids. It's an ideal reference for software engineers and developers, advanced programmers, graphics programmers, scientists, and other specialists wh

Mathematics anxiety: what have we learned in 60 years?

Directory of Open Access Journals (Sweden)

Ann eDowker

2016-04-01

Full Text Available The construct of mathematics anxiety has been an important topic of study at least since the concept of 'number anxiety' was introduced by Dreger & Aiken (1957, and has received increasing attention in recent years. This paper focuses on what research has revealed about mathematics anxiety in the last 60 years, and what still remains to be learned. We discuss what mathematics anxiety is; how distinct it is from other forms of anxiety; and how it relates to attitudes to mathematics. We discuss the relationships between mathematics anxiety and mathematics performance. We describe ways in which mathematics anxiety is measured, both by questionnaires, and by physiological measures. We discuss some possible factors in mathematics anxiety, including genetics, gender, age and culture. Finally, we describe some research on treatment. We conclude with a brief discussion of what still needs to be learned.

PRE-SERVICE MATHEMATICS TEACHERS’ CONCEPTION OF HIGHER-ORDER THINKING LEVEL IN BLOOM'S TAXONOMY

OpenAIRE

Damianus D Samo

2017-01-01

The purpose of this study is to explore pre-service mathematics teachers' conception of higher-order thinking in Bloom's Taxonomy, to explore pre-service mathematics teachers' ability in categorizing six cognitive levels of Bloom's Taxonomy as lower-order thinking and higher-order thinking, and pre-service mathematics teachers' ability in identifying some questionable items as lower-order and higher-order thinking. The higher-order thinking is the type of non-algorithm thinking which include ...

Mathematical and Metaheuristic Applications in Design Optimization of Steel Frame Structures: An Extensive Review

Directory of Open Access Journals (Sweden)

Mehmet Polat Saka

2013-01-01

Full Text Available The type of mathematical modeling selected for the optimum design problems of steel skeletal frames affects the size and mathematical complexity of the programming problem obtained. Survey on the structural optimization literature reveals that there are basically two types of design optimization formulation. In the first type only cross sectional properties of frame members are taken as design variables. In such formulation when the values of design variables change during design cycles, it becomes necessary to analyze the structure and update the response of steel frame to the external loading. Structural analysis in this type is a complementary part of the design process. In the second type joint coordinates are also treated as design variables in addition to the cross sectional properties of members. Such formulation eliminates the necessity of carrying out structural analysis in every design cycle. The values of the joint displacements are determined by the optimization techniques in addition to cross sectional properties. The structural optimization literature contains structural design algorithms that make use of both type of formulation. In this study a review is carried out on mathematical and metaheuristic algorithms where the effect of the mathematical modeling on the efficiency of these algorithms is discussed.

Experimental Investigation and Optimization of TIG Welding Parameters on Aluminum 6061 Alloy Using Firefly Algorithm

Science.gov (United States)

Kumar, Rishi; Mevada, N. Ramesh; Rathore, Santosh; Agarwal, Nitin; Rajput, Vinod; Sinh Barad, AjayPal

2017-08-01

To improve Welding quality of aluminum (Al) plate, the TIG Welding system has been prepared, by which Welding current, Shielding gas flow rate and Current polarity can be controlled during Welding process. In the present work, an attempt has been made to study the effect of Welding current, current polarity, and shielding gas flow rate on the tensile strength of the weld joint. Based on the number of parameters and their levels, the Response Surface Methodology technique has been selected as the Design of Experiment. For understanding the influence of input parameters on Ultimate tensile strength of weldment, ANOVA analysis has been carried out. Also to describe and optimize TIG Welding using a new metaheuristic Nature - inspired algorithm which is called as Firefly algorithm which was developed by Dr. Xin-She Yang at Cambridge University in 2007. A general formulation of firefly algorithm is presented together with an analytical, mathematical modeling to optimize the TIG Welding process by a single equivalent objective function.

Mathematics Placement Test: Typical Results with Unexpected Outcomes

Science.gov (United States)

Ingalls, Victoria

2011-01-01

Based on the results of a prior case-study analysis of mathematics placement at one university, the mathematics department developed and piloted a mathematics placement test. This article describes the implementation process for a mathematics placement test and further analyzes the test results for the pilot group. As an unexpected result, the…

MATHEMATICAL MODEL OF UNSTEADY HEAT TRANSFER OF PASSENGER CAR WITH HEATING SYSTEM

Directory of Open Access Journals (Sweden)

E. V. Biloshytskyi

2018-02-01

Full Text Available Purpose. The existing mathematical models of unsteady heat processes in a passenger car do not fully reflect the thermal processes, occurring in the car wits a heating system. In addition, unsteady heat processes are often studied in steady regime, when the heat fluxes and the parameters of the thermal circuit are constant and do not depend on time. In connection with the emergence of more effective technical solutions to the life support system there is a need for creating a new mathematical apparatus, which would allow taking into account these features and their influence on the course of unsteady heat processes throughout the travel time. The purpose of this work is to create a mathematical model of the heat regime of a passenger car with a heating system that takes into account the unsteady heat processes. Methodology. To achieve this task the author composed a system of differential equations, describing unsteady heat processes during the heating of a passenger car. For the solution of the composed system of equations, the author used the method of elementary balances. Findings. The paper presents the developed numerical algorithm and computer program for simulation of transitional heat processes in a locomotive traction passenger car, which allows taking into account the various constructive solutions of the life support system of passenger cars and to simulate unsteady heat processes at any stage of the trip. Originality. For the first time the author developed a mathematical model of heat processes in a car with a heating system, that unlike existing models, allows to investigate the unsteady heat engineering performance in the cabin of the car under different operating conditions and compare the work of various life support systems from the point of view their constructive solutions. Practical value. The work presented the developed mathematical model of the unsteady heat regime of the passenger car with a heating system to estimate

Modelling and Quantitative Analysis of LTRACK–A Novel Mobility Management Algorithm

Directory of Open Access Journals (Sweden)

Benedek Kovács

2006-01-01

Full Text Available This paper discusses the improvements and parameter optimization issues of LTRACK, a recently proposed mobility management algorithm. Mathematical modelling of the algorithm and the behavior of the Mobile Node (MN are used to optimize the parameters of LTRACK. A numerical method is given to determine the optimal values of the parameters. Markov chains are used to model both the base algorithm and the so-called loop removal effect. An extended qualitative and quantitative analysis is carried out to compare LTRACK to existing handover mechanisms such as MIP, Hierarchical Mobile IP (HMIP, Dynamic Hierarchical Mobility Management Strategy (DHMIP, Telecommunication Enhanced Mobile IP (TeleMIP, Cellular IP (CIP and HAWAII. LTRACK is sensitive to network topology and MN behavior so MN movement modelling is also introduced and discussed with different topologies. The techniques presented here can not only be used to model the LTRACK algorithm, but other algorithms too. There are many discussions and calculations to support our mathematical model to prove that it is adequate in many cases. The model is valid on various network levels, scalable vertically in the ISO-OSI layers and also scales well with the number of network elements.

Herbart's mathematical psychology.

Science.gov (United States)

Boudewijnse, G J; Murray, D J; Bandomir, C A

1999-08-01

J.F. Herbart (1824/1890b) provided a mathematical theory about how mental ideas (Vorstellungen) in consciousness at Time 1 (T1) could compete, possibly driving 1 or more Vorstellungen below a threshold of consciousness. At T1 a Vorstellung A could also fuse with another, B. If at a later T2, A resurfaced into consciousness, it could help B to re-resurface into consciousness. This article describes the historical and mathematical background of Herbart's theory, outlines the mathematical theory itself with the aid of computer graphics, and argues that the theory can be applied to the modern problem of predicting recognition latencies in short-term memory (Sternberg's task; Sternberg, 1966)

Mathematics Anxiety: What Have We Learned in 60 Years?

Science.gov (United States)

Dowker, Ann; Sarkar, Amar; Looi, Chung Yen

2016-01-01

The construct of mathematics anxiety has been an important topic of study at least since the concept of “number anxiety” was introduced by Dreger and Aiken (1957), and has received increasing attention in recent years. This paper focuses on what research has revealed about mathematics anxiety in the last 60 years, and what still remains to be learned. We discuss what mathematics anxiety is; how distinct it is from other forms of anxiety; and how it relates to attitudes to mathematics. We discuss the relationships between mathematics anxiety and mathematics performance. We describe ways in which mathematics anxiety is measured, both by questionnaires, and by physiological measures. We discuss some possible factors in mathematics anxiety, including genetics, gender, age, and culture. Finally, we describe some research on treatment. We conclude with a brief discussion of what still needs to be learned. PMID:27199789

On an efficient general mathematical library

International Nuclear Information System (INIS)

Li Xiaomei; Yan Baoyong

1992-01-01

In this paper, the architecture of vector pipeline computer YH-1 is briefly described, and the characteristics of an efficient vector general mathematical library are discussed. Some approaches to vectorization, adopted in developing the vector mathematical library, are presented

Mathematical biophysics

CERN Document Server

Rubin, Andrew

2014-01-01

This book presents concise descriptions and analysis of the classical and modern models used in mathematical biophysics. The authors ask the question "what new information can be provided by the models that cannot be obtained directly from experimental data?" Actively developing fields such as regulatory mechanisms in cells and subcellular systems and electron transport and energy transport in membranes are addressed together with more classical topics such as metabolic processes, nerve conduction and heart activity, chemical kinetics, population dynamics, and photosynthesis. The main approach is to describe biological processes using different mathematical approaches necessary to reveal characteristic features and properties of simulated systems. With the emergence of powerful mathematics software packages such as MAPLE, Mathematica, Mathcad, and MatLab, these methodologies are now accessible to a wide audience. Provides succinct but authoritative coverage of a broad array of biophysical topics and models Wr...

Variants of Learning Algorithm Based on Kolmogorov Theorem

Czech Academy of Sciences Publication Activity Database

Neruda, Roman; Štědrý, Arnošt; Drkošová, Jitka

2002-01-01

Roč. 12, č. 6 (2002), s. 587-597 ISSN 1210-0552 R&D Projects: GA AV ČR IAB1030006 Institutional research plan: AV0Z1030915 Keywords : Kolmogorov networks * approximation theory * parallel algorithms Subject RIV: BA - General Mathematics

Interval Mathematics Applied to Critical Point Transitions

Directory of Open Access Journals (Sweden)

Benito A. Stradi

2012-03-01

Full Text Available The determination of critical points of mixtures is important for both practical and theoretical reasons in the modeling of phase behavior, especially at high pressure. The equations that describe the behavior of complex mixtures near critical points are highly nonlinear and with multiplicity of solutions to the critical point equations. Interval arithmetic can be used to reliably locate all the critical points of a given mixture. The method also verifies the nonexistence of a critical point if a mixture of a given composition does not have one. This study uses an interval Newton/Generalized Bisection algorithm that provides a mathematical and computational guarantee that all mixture critical points are located. The technique is illustrated using several example problems. These problems involve cubic equation of state models; however, the technique is general purpose and can be applied in connection with other nonlinear problems.

Wind turbine pitch control using ICPSO-PID algorithm

DEFF Research Database (Denmark)

Xu, Chang; Tian, Qiangqiang; Shen, Wen Zhong

2013-01-01

For the traditional simplified first-order pitch-control system model, it is difficult to describe a real dynamic characteristic of a variable pitch action system, thus a complete high order mathematical model has to be developed for the pitch control of wind turbine generation (WTG). In the paper...... controller parameters quickly; and the feed-forward controller for wind speed can improve dynamics of a pitch-control system; additionally the power controller can allow a wind turbine to have a constant power output as a wind speed is over the rated one. Compared with a conventional PID, the controller...... with ICPSO-PID algorithm has a smaller overshoot, a shorter tuning time and better robustness. The design method proposed in the paper can be applied in a practical electro-hydraulic pitch control system for WTG....

Optimal design of the rotor geometry of line-start permanent magnet synchronous motor using the bat algorithm

Science.gov (United States)

Knypiński, Łukasz

2017-12-01

In this paper an algorithm for the optimization of excitation system of line-start permanent magnet synchronous motors will be presented. For the basis of this algorithm, software was developed in the Borland Delphi environment. The software consists of two independent modules: an optimization solver, and a module including the mathematical model of a synchronous motor with a self-start ability. The optimization module contains the bat algorithm procedure. The mathematical model of the motor has been developed in an Ansys Maxwell environment. In order to determine the functional parameters of the motor, additional scripts in Visual Basic language were developed. Selected results of the optimization calculation are presented and compared with results for the particle swarm optimization algorithm.

Development of a mathematical model describing hydrolysis and co-fermentation of C6 and C5 sugars

DEFF Research Database (Denmark)

Morales Rodriguez, Ricardo; Gernaey, Krist; Meyer, Anne S.

2010-01-01

saccharification and co-fermentation (SSCF) of C6 and C5 sugars. Model construction has been carried out by combining existing mathematical models for enzymatic hydrolysis on the one hand and co-fermentation on the other hand. An inhibition of ethanol on cellulose conversion was introduced in order to increase...

Mathematical modeling of control subsystems for CELSS: Application to diet

Science.gov (United States)

Waleh, Ahmad; Nguyen, Thoi K.; Kanevsky, Valery

1991-01-01

The dynamic control of a Closed Ecological Life Support System (CELSS) in a closed space habitat is of critical importance. The development of a practical method of control is also a necessary step for the selection and design of realistic subsystems and processors for a CELSS. Diet is one of the dynamic factors that strongly influences, and is influenced, by the operational states of all major CELSS subsystems. The problems of design and maintenance of a stable diet must be obtained from well characterized expert subsystems. The general description of a mathematical model that forms the basis of an expert control program for a CELSS is described. The formulation is expressed in terms of a complete set of time dependent canonical variables. System representation is dynamic and includes time dependent storage buffers. The details of the algorithm are described. The steady state results of the application of the method for representative diets made from wheat, potato, and soybean are presented.

Mathematical simulation of cascade-probabilistic functions for charged particles

International Nuclear Information System (INIS)

Kupchishin, A.A.; Kupchishin, A.I.; Smygaleva, T.A.

1998-01-01

Analytical expressions for cascade-probabilistic functions (CPF) for electrons, protons, α-particles and ions with taking into account energy losses are received. Mathematical analysis of these functions is carried out and main properties of function are determined. Algorithms of CPF are developed and their computer calculation were conducted. Regularities in behavior of function in dependence on initial particles energy, atomic number and registration depth are established. Book is intended to specialists on mathematical simulation of radiation defects, solid state physics, elementary particle physics and applied mathematics. There are 3 chapters in the book: 1. Cascade-probabilistic functions for electrons; 2. CPF for protons and α-particles; 3. CPF with taking unto account energy losses of ions. (author)

A flooding algorithm for multirobot exploration.

Science.gov (United States)

Cabrera-Mora, Flavio; Xiao, Jizhong

2012-06-01

In this paper, we present a multirobot exploration algorithm that aims at reducing the exploration time and to minimize the overall traverse distance of the robots by coordinating the movement of the robots performing the exploration. Modeling the environment as a tree, we consider a coordination model that restricts the number of robots allowed to traverse an edge and to enter a vertex during each step. This coordination is achieved in a decentralized manner by the robots using a set of active landmarks that are dropped by them at explored vertices. We mathematically analyze the algorithm on trees, obtaining its main properties and specifying its bounds on the exploration time. We also define three metrics of performance for multirobot algorithms. We simulate and compare the performance of this new algorithm with those of our multirobot depth first search (MR-DFS) approach presented in our recent paper and classic single-robot DFS.

Mental Computation or Standard Algorithm? Children's Strategy Choices on Multi-Digit Subtractions

Science.gov (United States)

Torbeyns, Joke; Verschaffel, Lieven

2016-01-01

This study analyzed children's use of mental computation strategies and the standard algorithm on multi-digit subtractions. Fifty-eight Flemish 4th graders of varying mathematical achievement level were individually offered subtractions that either stimulated the use of mental computation strategies or the standard algorithm in one choice and two…

An Improved Hierarchical Genetic Algorithm for Sheet Cutting Scheduling with Process Constraints

OpenAIRE

Yunqing Rao; Dezhong Qi; Jinling Li

2013-01-01

For the first time, an improved hierarchical genetic algorithm for sheet cutting problem which involves n cutting patterns for m non-identical parallel machines with process constraints has been proposed in the integrated cutting stock model. The objective of the cutting scheduling problem is minimizing the weighted completed time. A mathematical model for this problem is presented, an improved hierarchical genetic algorithm (ant colony—hierarchical genetic algorithm) is developed for better ...

iSTEM: Promoting Fifth Graders' Mathematical Modeling

Science.gov (United States)

Yanik, H. Bahadir; Karabas, Celil

2014-01-01

Modeling requires that people develop representations or procedures to address particular problem situations (Lesh et al. 2000). Mathematical modeling is used to describe essential characteristics of a phenomenon or a situation that one intends to study in the real world through building mathematical objects. This article describes how fifth-grade…

Three dimensional fuzzy influence analysis of fitting algorithms on integrated chip topographic modeling

International Nuclear Information System (INIS)

Liang, Zhong Wei; Wang, Yi Jun; Ye, Bang Yan; Brauwer, Richard Kars

2012-01-01

In inspecting the detailed performance results of surface precision modeling in different external parameter conditions, the integrated chip surfaces should be evaluated and assessed during topographic spatial modeling processes. The application of surface fitting algorithms exerts a considerable influence on topographic mathematical features. The influence mechanisms caused by different surface fitting algorithms on the integrated chip surface facilitate the quantitative analysis of different external parameter conditions. By extracting the coordinate information from the selected physical control points and using a set of precise spatial coordinate measuring apparatus, several typical surface fitting algorithms are used for constructing micro topographic models with the obtained point cloud. In computing for the newly proposed mathematical features on surface models, we construct the fuzzy evaluating data sequence and present a new three dimensional fuzzy quantitative evaluating method. Through this method, the value variation tendencies of topographic features can be clearly quantified. The fuzzy influence discipline among different surface fitting algorithms, topography spatial features, and the external science parameter conditions can be analyzed quantitatively and in detail. In addition, quantitative analysis can provide final conclusions on the inherent influence mechanism and internal mathematical relation in the performance results of different surface fitting algorithms, topographic spatial features, and their scientific parameter conditions in the case of surface micro modeling. The performance inspection of surface precision modeling will be facilitated and optimized as a new research idea for micro-surface reconstruction that will be monitored in a modeling process

Three dimensional fuzzy influence analysis of fitting algorithms on integrated chip topographic modeling

Energy Technology Data Exchange (ETDEWEB)

Liang, Zhong Wei; Wang, Yi Jun [Guangzhou Univ., Guangzhou (China); Ye, Bang Yan [South China Univ. of Technology, Guangzhou (China); Brauwer, Richard Kars [Indian Institute of Technology, Kanpur (India)

2012-10-15

In inspecting the detailed performance results of surface precision modeling in different external parameter conditions, the integrated chip surfaces should be evaluated and assessed during topographic spatial modeling processes. The application of surface fitting algorithms exerts a considerable influence on topographic mathematical features. The influence mechanisms caused by different surface fitting algorithms on the integrated chip surface facilitate the quantitative analysis of different external parameter conditions. By extracting the coordinate information from the selected physical control points and using a set of precise spatial coordinate measuring apparatus, several typical surface fitting algorithms are used for constructing micro topographic models with the obtained point cloud. In computing for the newly proposed mathematical features on surface models, we construct the fuzzy evaluating data sequence and present a new three dimensional fuzzy quantitative evaluating method. Through this method, the value variation tendencies of topographic features can be clearly quantified. The fuzzy influence discipline among different surface fitting algorithms, topography spatial features, and the external science parameter conditions can be analyzed quantitatively and in detail. In addition, quantitative analysis can provide final conclusions on the inherent influence mechanism and internal mathematical relation in the performance results of different surface fitting algorithms, topographic spatial features, and their scientific parameter conditions in the case of surface micro modeling. The performance inspection of surface precision modeling will be facilitated and optimized as a new research idea for micro-surface reconstruction that will be monitored in a modeling process.

Partitional clustering algorithms

CERN Document Server

2015-01-01

This book summarizes the state-of-the-art in partitional clustering. Clustering, the unsupervised classification of patterns into groups, is one of the most important tasks in exploratory data analysis. Primary goals of clustering include gaining insight into, classifying, and compressing data. Clustering has a long and rich history that spans a variety of scientific disciplines including anthropology, biology, medicine, psychology, statistics, mathematics, engineering, and computer science. As a result, numerous clustering algorithms have been proposed since the early 1950s. Among these algorithms, partitional (nonhierarchical) ones have found many applications, especially in engineering and computer science. This book provides coverage of consensus clustering, constrained clustering, large scale and/or high dimensional clustering, cluster validity, cluster visualization, and applications of clustering. Examines clustering as it applies to large and/or high-dimensional data sets commonly encountered in reali...

Yes, but why? Teaching for understanding in mathematics

OpenAIRE

Southall, Edward

2017-01-01

Getting the right answers in maths is only half the problem. Understanding why what you’re doing works is the part that often stumps students and teachers alike. This book informs existing and trainee teachers how and why popular algorithms and mathematical properties work, and how they make sense.

Science modelling in pre-calculus: how to make mathematics problems contextually meaningful

Science.gov (United States)

Sokolowski, Andrzej; Yalvac, Bugrahan; Loving, Cathleen

2011-04-01

'Use of mathematical representations to model and interpret physical phenomena and solve problems is one of the major teaching objectives in high school math curriculum' (National Council of Teachers of Mathematics (NCTM), Principles and Standards for School Mathematics, NCTM, Reston, VA, 2000). Commonly used pre-calculus textbooks provide a wide range of application problems. However, these problems focus students' attention on evaluating or solving pre-arranged formulas for given values. The role of scientific content is reduced to provide a background for these problems instead of being sources of data gathering for inducing mathematical tools. Students are neither required to construct mathematical models based on the contexts nor are they asked to validate or discuss the limitations of applied formulas. Using these contexts, the instructor may think that he/she is teaching problem solving, where in reality he/she is teaching algorithms of the mathematical operations (G. Kulm (ed.), New directions for mathematics assessment, in Assessing Higher Order Thinking in Mathematics, Erlbaum, Hillsdale, NJ, 1994, pp. 221-240). Without a thorough representation of the physical phenomena and the mathematical modelling processes undertaken, problem solving unintentionally appears as simple algorithmic operations. In this article, we deconstruct the representations of mathematics problems from selected pre-calculus textbooks and explicate their limitations. We argue that the structure and content of those problems limits students' coherent understanding of mathematical modelling, and this could result in weak student problem-solving skills. Simultaneously, we explore the ways to enhance representations of those mathematical problems, which we have characterized as lacking a meaningful physical context and limiting coherent student understanding. In light of our discussion, we recommend an alternative to strengthen the process of teaching mathematical modelling - utilization

Engineering of Algorithms for Hidden Markov models and Tree Distances

DEFF Research Database (Denmark)

Sand, Andreas

Bioinformatics is an interdisciplinary scientific field that combines biology with mathematics, statistics and computer science in an effort to develop computational methods for handling, analyzing and learning from biological data. In the recent decades, the amount of available biological data has...... speed up all the classical algorithms for analyses and training of hidden Markov models. And I show how two particularly important algorithms, the forward algorithm and the Viterbi algorithm, can be accelerated through a reformulation of the algorithms and a somewhat more complicated parallelization...... contribution to the theoretically fastest set of algorithms presently available to compute two closely related measures of tree distance, the triplet distance and the quartet distance. And I further demonstrate that they are also the fastest algorithms in almost all cases when tested in practice....

Algorithms for Scheduling and Network Problems

Science.gov (United States)

1991-09-01

time. We already know, by Lemma 2.2.1, that WOPT = O(log( mpU )), so if we could solve this integer program optimally we would be done. However, the...Folydirat, 15:177-191, 1982. [6] I.S. Belov and Ya. N. Stolin. An algorithm in a single path operations scheduling problem. In Mathematical Economics and

Mathematical modelling in solid mechanics

CERN Document Server

Sofonea, Mircea; Steigmann, David

2017-01-01

This book presents new research results in multidisciplinary fields of mathematical and numerical modelling in mechanics. The chapters treat the topics: mathematical modelling in solid, fluid and contact mechanics nonconvex variational analysis with emphasis to nonlinear solid and structural mechanics numerical modelling of problems with non-smooth constitutive laws, approximation of variational and hemivariational inequalities, numerical analysis of discrete schemes, numerical methods and the corresponding algorithms, applications to mechanical engineering numerical aspects of non-smooth mechanics, with emphasis on developing accurate and reliable computational tools mechanics of fibre-reinforced materials behaviour of elasto-plastic materials accounting for the microstructural defects definition of structural defects based on the differential geometry concepts or on the atomistic basis interaction between phase transformation and dislocations at nano-scale energetic arguments bifurcation and post-buckling a...

Mathematics Education in Singapore--An Insider's Perspective

Science.gov (United States)

Kaur, Berinderjeet

2014-01-01

Singapore's Education System has evolved over time and so has Mathematics Education in Singapore. The present day School Mathematics Curricula can best be described as one that caters for the needs of every child in school. It is based on a framework that has mathematical problem solving as its primary focus. The developments from 1946 to 2012…

INFORMATIONAL-METHODICAL SUPPORT OF THE COURSE «MATHEMATICAL LOGIC AND THEORY OF ALGORITHMS»

Directory of Open Access Journals (Sweden)

Y. I. Sinko

2010-06-01

Full Text Available In this article the basic principles of training technique of future teachers of mathematics to foundations of mathematical logic and theory of algorithms in the Kherson State University with the use of information technologies are examined. General description of functioning of the methodical system of learning of mathematical logic with the use of information technologies, in that variant, when information technologies are presented by the integrated specialized programmatic environment of the educational purpose «MatLog» is given.

Mathematical Ties That Bind.

Science.gov (United States)

House, Peggy A.

1994-01-01

Describes some mathematical investigations of the necktie which includes applications of geometry, statistics, data analysis, sampling, probability, symmetry, proportion, problem solving, and business. (MKR)

Procedure to describe clavicular motion.

Science.gov (United States)

Gutierrez Delgado, Guivey; De Beule, Matthieu; Ortega Cardentey, Dolgis R; Segers, Patrick; Iznaga Benítez, Arsenio M; Rodríguez Moliner, Tania; Verhegghe, Benedict; Palmans, Tanneke; Van Hoof, Tom; Van Tongel, Alexander

2017-03-01

For many years, researchers have attempted to describe shoulder motions by using different mathematical methods. The aim of this study was to describe a procedure to quantify clavicular motion. The procedure proposed for the kinematic analysis consists of 4 main processes: 3 transcortical pins in the clavicle, motion capture, obtaining 3-dimensional bone models, and data processing. Clavicular motion by abduction (30° to 150°) and flexion (55° to 165°) were characterized by an increment of retraction of 27° to 33°, elevation of 25° to 28°, and posterior rotation of 14° to 15°, respectively. In circumduction, clavicular movement described an ellipse, which was reflected by retraction and elevation. Kinematic analysis shows that the articular surfaces move by simultaneously rolling and sliding on the convex surface of the sternum for the 3 movements of abduction, flexion, and circumduction. The use of 3 body landmarks in the clavicle and the direct measurement of bone allowed description of the osteokinematic and arthrokinematic movement of the clavicle. Copyright © 2017 Journal of Shoulder and Elbow Surgery Board of Trustees. Published by Elsevier Inc. All rights reserved.

The 1989 progress report: Mathematics

International Nuclear Information System (INIS)

Demazure, M.

1989-01-01

The 1989 progress report of the laboratory of Mathematics of the Polytechnic School (France) is presented. The investigations reported were performed in the following fields: analysis of nonlinear partial differential equations, quantum mechanics, scattering, fluid dynamics and homogenization, equations, varieties with negative curvature, elliptical problems on surfaces, Dirac operator, geometry of algorithms and formal calculus, singularities, Lie groups, dynamics systems. The published papers, the conferences and the Laboratory staff are listed [fr

Mathematics of aperiodic order

CERN Document Server

Lenz, Daniel; Savinien, Jean

2015-01-01

What is order that is not based on simple repetition, that is, periodicity? How must atoms be arranged in a material so that it diffracts like a quasicrystal? How can we describe aperiodically ordered systems mathematically? Originally triggered by the – later Nobel prize-winning – discovery of quasicrystals, the investigation of aperiodic order has since become a well-established and rapidly evolving field of mathematical research with close ties to a surprising variety of branches of mathematics and physics. This book offers an overview of the state of the art in the field of aperiodic order, presented in carefully selected authoritative surveys. It is intended for non-experts with a general background in mathematics, theoretical physics or computer science, and offers a highly accessible source of first-hand information for all those interested in this rich and exciting field. Topics covered include the mathematical theory of diffraction, the dynamical systems of tilings or Delone sets, their cohomolog...

Mathematical Biology Modules Based on Modern Molecular Biology and Modern Discrete Mathematics

Science.gov (United States)

Davies, Robin; Hodge, Terrell; Enyedi, Alexander

2010-01-01

We describe an ongoing collaborative curriculum materials development project between Sweet Briar College and Western Michigan University, with support from the National Science Foundation. We present a collection of modules under development that can be used in existing mathematics and biology courses, and we address a critical national need to introduce students to mathematical methods beyond the interface of biology with calculus. Based on ongoing research, and designed to use the project-based-learning approach, the modules highlight applications of modern discrete mathematics and algebraic statistics to pressing problems in molecular biology. For the majority of projects, calculus is not a required prerequisite and, due to the modest amount of mathematical background needed for some of the modules, the materials can be used for an early introduction to mathematical modeling. At the same time, most modules are connected with topics in linear and abstract algebra, algebraic geometry, and probability, and they can be used as meaningful applied introductions into the relevant advanced-level mathematics courses. Open-source software is used to facilitate the relevant computations. As a detailed example, we outline a module that focuses on Boolean models of the lac operon network. PMID:20810955

Mathematical biology modules based on modern molecular biology and modern discrete mathematics.

Science.gov (United States)

Robeva, Raina; Davies, Robin; Hodge, Terrell; Enyedi, Alexander

2010-01-01

We describe an ongoing collaborative curriculum materials development project between Sweet Briar College and Western Michigan University, with support from the National Science Foundation. We present a collection of modules under development that can be used in existing mathematics and biology courses, and we address a critical national need to introduce students to mathematical methods beyond the interface of biology with calculus. Based on ongoing research, and designed to use the project-based-learning approach, the modules highlight applications of modern discrete mathematics and algebraic statistics to pressing problems in molecular biology. For the majority of projects, calculus is not a required prerequisite and, due to the modest amount of mathematical background needed for some of the modules, the materials can be used for an early introduction to mathematical modeling. At the same time, most modules are connected with topics in linear and abstract algebra, algebraic geometry, and probability, and they can be used as meaningful applied introductions into the relevant advanced-level mathematics courses. Open-source software is used to facilitate the relevant computations. As a detailed example, we outline a module that focuses on Boolean models of the lac operon network.

Metaheuristic algorithms for building Covering Arrays: A review

Directory of Open Access Journals (Sweden)

Jimena Adriana Timaná-Peña

2016-09-01

Full Text Available Covering Arrays (CA are mathematical objects used in the functional testing of software components. They enable the testing of all interactions of a given size of input parameters in a procedure, function, or logical unit in general, using the minimum number of test cases. Building CA is a complex task (NP-complete problem that involves lengthy execution times and high computational loads. The most effective methods for building CAs are algebraic, Greedy, and metaheuristic-based. The latter have reported the best results to date. This paper presents a description of the major contributions made by a selection of different metaheuristics, including simulated annealing, tabu search, genetic algorithms, ant colony algorithms, particle swarm algorithms, and harmony search algorithms. It is worth noting that simulated annealing-based algorithms have evolved as the most competitive, and currently form the state of the art.

Mathematics for Physicists and Engineers.

Science.gov (United States)

Organisation for Economic Cooperation and Development, Paris (France).

The text is a report of the OEEC Seminar on "The Mathematical Knowledge Required by the Physicist and Engineer" held in Paris, 1961. There are twelve major papers presented: (1) An American Parallel (describes the work of the Panel on Physical Sciences and Engineering of the Committee on the Undergraduate Program in Mathematics of the Mathematical…

Algorithmic Algebraic Combinatorics and Gröbner Bases

CERN Document Server

Klin, Mikhail; Jurisic, Aleksandar

2009-01-01

This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with a special emphasis on algorithmic aspects and the use of the theory of Grobner bases. Topics covered include coherent configurations, association schemes, permutation groups, Latin squares, the Jacobian conjecture, mathematical chemistry, extremal combinatorics, coding theory, designs, etc. Special attention is paid to the description of innovative practical algorithms and their implementation in software packages such as GAP and MAGM

Convergence analysis of Chauvin's PCA learning algorithm with a constant learning rate

International Nuclear Information System (INIS)

Lv Jiancheng; Yi Zhang

2007-01-01

The convergence of Chauvin's PCA learning algorithm with a constant learning rate is studied in this paper by using a DDT method (deterministic discrete-time system method). Different from the DCT method (deterministic continuous-time system method), the DDT method does not require that the learning rate converges to zero. An invariant set of Chauvin's algorithm with a constant learning rate is obtained so that the non-divergence of this algorithm can be guaranteed. Rigorous mathematic proofs are provided to prove the local convergence of this algorithm

Easy as π? an introduction to higher mathematics

CERN Document Server

Ivanov, O A

1999-01-01

The present book is rare, even unique of its kind, at least among mathematics texts published in Russian. You have before you neither a textbook nor a monograph, although these selected chapters from elementary mathematics certainly constitute a fine educational tool. It is my opinion that this is more than just another book about mathematics and the art of teaching that subject. Without considering the actual topics treated (the author himself has described these in sufficient detail in of the book as a whole, the Introduction), I shall attempt to convey a general idea and describe the impressions it makes on the reader. Almost every chapter begins by considering well-known problems of elementary mathematics. Now, every worthwhile elementary problem has hidden behind its diverting formulation what might be called "higher mathematics," or, more simply, mathematics, and it is this that the author demonstrates to the reader in this book. It is thus to be expected that every chapter should contain subject matter...

Review Of Applied Mathematical Models For Describing The Behaviour Of Aqueous Humor In Eye Structures

Science.gov (United States)

Dzierka, M.; Jurczak, P.

2015-12-01

In the paper, currently used methods for modeling the flow of the aqueous humor through eye structures are presented. Then a computational model based on rheological models of Newtonian and non-Newtonian fluids is proposed. The proposed model may be used for modeling the flow of the aqueous humor through the trabecular meshwork. The trabecular meshwork is modeled as an array of rectilinear parallel capillary tubes. The flow of Newtonian and non-Newtonian fluids is considered. As a results of discussion mathematical equations of permeability of porous media and velocity of fluid flow through porous media have been received.

The use of anatomical information for molecular image reconstruction algorithms: Attention/Scatter correction, motion compensation, and noise reduction

Energy Technology Data Exchange (ETDEWEB)

Chun, Se Young [School of Electrical and Computer Engineering, Ulsan National Institute of Science and Technology (UNIST), Ulsan (Korea, Republic of)

2016-03-15

PET and SPECT are important tools for providing valuable molecular information about patients to clinicians. Advances in nuclear medicine hardware technologies and statistical image reconstruction algorithms enabled significantly improved image quality. Sequentially or simultaneously acquired anatomical images such as CT and MRI from hybrid scanners are also important ingredients for improving the image quality of PET or SPECT further. High-quality anatomical information has been used and investigated for attenuation and scatter corrections, motion compensation, and noise reduction via post-reconstruction filtering and regularization in inverse problems. In this article, we will review works using anatomical information for molecular image reconstruction algorithms for better image quality by describing mathematical models, discussing sources of anatomical information for different cases, and showing some examples.

Mathematics Education in Singapore - an Insider's Perspective

OpenAIRE

Kaur, Berinderjeet

2014-01-01

Singapore's Education System has evolved over time and so has Mathematics Education in Singapore. The present day School Mathematics Curricula can best be described as one that caters for the needs of every child in school. It is based on a framework that has mathematical problem solving as its primary focus. The developments from 1946 to 2012 that have shaped the present School Mathematics Curricula in Singapore are direct consequences of developments in the Education System of Singapore dur...

The Development Of Mathematical Model For Automated Fingerprint Identification Systems Analysis

International Nuclear Information System (INIS)

Ardisasmita, M. Syamsa

2001-01-01

Fingerprint has a strong oriented and periodic structure composed of dark lines of raised skin (ridges) and clear lines of lowered skin (furrows)that twist to form a distinct pattern. Although the manner in which the ridges flow is distinctive, other characteristics of the fingerprint called m inutiae a re what are most unique to the individual. These features are particular patterns consisting of terminations or bifurcations of the ridges. To assert if two fingerprints are from the same finger or not, experts detect those minutiae. AFIS (Automated Fingerprint Identification Systems) extract and compare these features for determining a match. The classic methods of fingerprints recognition are not suitable for direct implementation in form of computer algorithms. The creation of a finger's model was however the necessity of development of new, better algorithms of analysis. This paper presents a new numerical methods of fingerprints' simulation based on mathematical model of arrangement of dermatoglyphics and creation of minutiae. This paper describes also the design and implementation of an automated fingerprint identification systems which operates in two stages: minutiae extraction and minutiae matching

A density based algorithm to detect cavities and holes from planar points

Science.gov (United States)

Zhu, Jie; Sun, Yizhong; Pang, Yueyong

2017-12-01

Delaunay-based shape reconstruction algorithms are widely used in approximating the shape from planar points. However, these algorithms cannot ensure the optimality of varied reconstructed cavity boundaries and hole boundaries. This inadequate reconstruction can be primarily attributed to the lack of efficient mathematic formulation for the two structures (hole and cavity). In this paper, we develop an efficient algorithm for generating cavities and holes from planar points. The algorithm yields the final boundary based on an iterative removal of the Delaunay triangulation. Our algorithm is mainly divided into two steps, namely, rough and refined shape reconstructions. The rough shape reconstruction performed by the algorithm is controlled by a relative parameter. Based on the rough result, the refined shape reconstruction mainly aims to detect holes and pure cavities. Cavity and hole are conceptualized as a structure with a low-density region surrounded by the high-density region. With this structure, cavity and hole are characterized by a mathematic formulation called as compactness of point formed by the length variation of the edges incident to point in Delaunay triangulation. The boundaries of cavity and hole are then found by locating a shape gradient change in compactness of point set. The experimental comparison with other shape reconstruction approaches shows that the proposed algorithm is able to accurately yield the boundaries of cavity and hole with varying point set densities and distributions.

The Watershed Transform : Definitions, Algorithms and Parallelization Strategies

NARCIS (Netherlands)

Roerdink, Jos B.T.M.; Meijster, Arnold

2000-01-01

The watershed transform is the method of choice for image segmentation in the field of mathematical morphology. We present a critical review of several definitions of the watershed transform and the associated sequential algorithms, and discuss various issues which often cause confusion in the

An Application of Discrete Mathematics to Coding Theory.

Science.gov (United States)

Donohoe, L. Joyce

1992-01-01

Presents a public-key cryptosystem application to introduce students to several topics in discrete mathematics. A computer algorithms using recursive methods is presented to solve a problem in which one person wants to send a coded message to a second person while keeping the message secret from a third person. (MDH)

Using a Card Trick to Teach Discrete Mathematics

Science.gov (United States)

Simonson, Shai; Holm, Tara S.

2003-01-01

We present a card trick that can be used to review or teach a variety of topics in discrete mathematics. We address many subjects, including permutations, combinations, functions, graphs, depth first search, the pigeonhole principle, greedy algorithms, and concepts from number theory. Moreover, the trick motivates the use of computers in…

Mathematical Modeling of Contact Problems of Elasticity Theory with Unilateral Discrete Contact

Directory of Open Access Journals (Sweden)

I. V. Stankevich

2015-01-01

Full Text Available Development and operation of modern machinery and latest technology require reliable estimates of the strength characteristics of the critical elements of structures and technological equipment under the impact of high-intensity thermomechanical loading, accompanied, as a rule, by complex contact interaction. Mathematical modeling of stress-strain state of such parts and components in the contact area, based on adequate mathematical models, modern numerical methods and efficient algorithms that implement the direct determination of displacement fields, strains and stresses, is the main tool that allows fast acquisition of data required for the calculations of strength and durability. The paper considers an algorithm for constructing the numerical solution of the contact problem of elasticity theory in relation to the body, which has an obvious one-sided discrete contact interaction with an elastic half-space. The proposed algorithm is specially designed to have a correction of the tangential forces at discrete contact points, allowing us to achieve sufficiently accurate implementation of the adopted law of friction. The algorithm is embedded in a general finite element technology, with which the application code is generated. Numerical study of discrete unilateral contact interaction of an elastic plate and a rigid half-space showed a high efficiency of the developed algorithm and the application code that implements it.

Trajectory averaging for stochastic approximation MCMC algorithms

KAUST Repository

Liang, Faming

2010-10-01

The subject of stochastic approximation was founded by Robbins and Monro [Ann. Math. Statist. 22 (1951) 400-407]. After five decades of continual development, it has developed into an important area in systems control and optimization, and it has also served as a prototype for the development of adaptive algorithms for on-line estimation and control of stochastic systems. Recently, it has been used in statistics with Markov chain Monte Carlo for solving maximum likelihood estimation problems and for general simulation and optimizations. In this paper, we first show that the trajectory averaging estimator is asymptotically efficient for the stochastic approximation MCMC (SAMCMC) algorithm under mild conditions, and then apply this result to the stochastic approximation Monte Carlo algorithm [Liang, Liu and Carroll J. Amer. Statist. Assoc. 102 (2007) 305-320]. The application of the trajectory averaging estimator to other stochastic approximationMCMC algorithms, for example, a stochastic approximation MLE algorithm for missing data problems, is also considered in the paper. © Institute of Mathematical Statistics, 2010.

Mathematical beauty in service of deep approach to learning

DEFF Research Database (Denmark)

Karamehmedovic, Mirza

2015-01-01

was hands-on MATLAB programming, where the algorithms were tested and applied to solve physical modelbased problems. To encourage a deep approach, and discourage a surface approach to learning, I introduced into the lectures a basic but rigorous mathematical treatment of crucial theoretical points...

PROGRAMMING FUNDAMENTALS TEACHING TO THE STUDENTS OF PHYSICO-MATHEMATICAL PROFILE

Directory of Open Access Journals (Sweden)

Vdovychyn Tatiana

2017-05-01

Full Text Available The article provides methodical recommendations on studying of the discipline "Informatics" for the specialists preparation of the first (Bachelor level of higher education of the field of knowledge 01 "Education" of the specialty 014.04 "Secondary education (mathematics", 014.08 "Secondary education (physics". This discipline plays a particularly important role in the higher education establishments physical and mathematical field specialists training, since it combines both the fundamental concepts and principles of various mathematical and informatics disciplines, as well as applied models and algorithms for their application. The methodological aspects of the discipline "Informatics" study include the pedagogical feasibility of the forms, methods and means of training for students who are qualified as a teacher of mathematics and a physics teacher respectively. The discipline program includes issues on informatics theoretical foundations, applied software, and the basics of programming. Students are encouraged to consider the basics of programming in the C ++ environment. Basic C ++ language designs have a convenient, professional programming toolkit. Integrated C ++ environment is characterized by speed, convenience in debugging and compiling of the program. Therefore, the article focuses on the practical skills formation in the C ++ environment for the students of the physical and mathematical profile and highlights the methodological aspects of the C ++ programming language use in the course of the discipline "Informatics" teaching. The formation of practical skills takes place during the performance of laboratory works, namely: the original problem setting, the construction of an algorithm for its solution, analysis of the received results.

Research and application of multi-agent genetic algorithm in tower defense game

Science.gov (United States)

Jin, Shaohua

2018-04-01

In this paper, a new multi-agent genetic algorithm based on orthogonal experiment is proposed, which is based on multi-agent system, genetic algorithm and orthogonal experimental design. The design of neighborhood competition operator, orthogonal crossover operator, Son and self-learning operator. The new algorithm is applied to mobile tower defense game, according to the characteristics of the game, the establishment of mathematical models, and finally increases the value of the game's monster.

Learning algorithms and automatic processing of languages; Algorithmes a apprentissage et traitement automatique des langues

Energy Technology Data Exchange (ETDEWEB)

Fluhr, Christian Yves Andre

1977-06-15

This research thesis concerns the field of artificial intelligence. It addresses learning algorithms applied to automatic processing of languages. The author first briefly describes some mechanisms of human intelligence in order to describe how these mechanisms are simulated on a computer. He outlines the specific role of learning in various manifestations of intelligence. Then, based on the Markov's algorithm theory, the author discusses the notion of learning algorithm. Two main types of learning algorithms are then addressed: firstly, an 'algorithm-teacher dialogue' type sanction-based algorithm which aims at learning how to solve grammatical ambiguities in submitted texts; secondly, an algorithm related to a document system which structures semantic data automatically obtained from a set of texts in order to be able to understand by references to any question on the content of these texts.

Optimisation algorithms for ECG data compression.

Science.gov (United States)

Haugland, D; Heber, J G; Husøy, J H

1997-07-01

The use of exact optimisation algorithms for compressing digital electrocardiograms (ECGs) is demonstrated. As opposed to traditional time-domain methods, which use heuristics to select a small subset of representative signal samples, the problem of selecting the subset is formulated in rigorous mathematical terms. This approach makes it possible to derive algorithms guaranteeing the smallest possible reconstruction error when a bounded selection of signal samples is interpolated. The proposed model resembles well-known network models and is solved by a cubic dynamic programming algorithm. When applied to standard test problems, the algorithm produces a compressed representation for which the distortion is about one-half of that obtained by traditional time-domain compression techniques at reasonable compression ratios. This illustrates that, in terms of the accuracy of decoded signals, existing time-domain heuristics for ECG compression may be far from what is theoretically achievable. The paper is an attempt to bridge this gap.

TURING MACHINE AS UNIVERSAL ALGORITHM EXECUTOR AND ITS APPLICATION IN THE PROCESS OF HIGH-SCHOOL STUDENTS` ADVANCED STUDY OF ALGORITHMIZATION AND PROGRAMMING FUNDAMENTALS

Directory of Open Access Journals (Sweden)

Oleksandr B. Yashchyk

2016-05-01

Full Text Available The article discusses the importance of studying the notion of algorithm and its formal specification using Turing machines. In the article it was identified the basic hypothesis of the theory of algorithms for Turing as well as reviewed scientific research of modern scientists devoted to this issue and found the main principles of the Turing machine as an abstract mathematical model. The process of forming information competencies components, information culture and students` logical thinking development with the inclusion of the topic “Study and Application of Turing machine as Universal Algorithm Executor” in the course of Informatics was analyzed.

Friend Influence and Susceptibility to Influence: Changes in Mathematical Reasoning as a Function of Relative Peer Acceptance and Interest in Mathematics

Science.gov (United States)

DeLay, Dawn; Laursen, Brett; Kiuru, Noona; Poikkeus, Anna-Maija; Aunola, Kaisa

2016-01-01

This study investigated friend influence over mathematics achievement in 202 same-sex friendship dyads (106 girl dyads). Participants were in the third grade (around age 9) at the outset. Each friend completed a questionnaire describing interest in mathematics and a standardized mathematical reasoning assessment. Peer nominations provided a…

Parallel Algorithm of Geometrical Hashing Based on NumPy Package and Processes Pool

Directory of Open Access Journals (Sweden)

Klyachin Vladimir Aleksandrovich

2015-10-01

Full Text Available The article considers the problem of multi-dimensional geometric hashing. The paper describes a mathematical model of geometric hashing and considers an example of its use in localization problems for the point. A method of constructing the corresponding hash matrix by parallel algorithm is considered. In this paper an algorithm of parallel geometric hashing using a development pattern «pool processes» is proposed. The implementation of the algorithm is executed using the Python programming language and NumPy package for manipulating multidimensional data. To implement the process pool it is proposed to use a class Process Pool Executor imported from module concurrent.futures, which is included in the distribution of the interpreter Python since version 3.2. All the solutions are presented in the paper by corresponding UML class diagrams. Designed GeomNash package includes classes Data, Result, GeomHash, Job. The results of the developed program presents the corresponding graphs. Also, the article presents the theoretical justification for the application process pool for the implementation of parallel algorithms. It is obtained condition t2 > (p/(p-1*t1 of the appropriateness of process pool. Here t1 - the time of transmission unit of data between processes, and t2 - the time of processing unit data by one processor.

Determination of Pavement Rehabilitation Activities through a Permutation Algorithm

Directory of Open Access Journals (Sweden)

Sangyum Lee

2013-01-01

Full Text Available This paper presents a mathematical programming model for optimal pavement rehabilitation planning. The model maximized the rehabilitation area through a newly developed permutation algorithm, based on the procedures outlined in the harmony search (HS algorithm. Additionally, the proposed algorithm was based on an optimal solution method for the problem of multilocation rehabilitation activities on pavement structure, using empirical deterioration and rehabilitation effectiveness models, according to a limited maintenance budget. Thus, nonlinear pavement performance and rehabilitation activity decision models were used to maximize the objective functions of the rehabilitation area within a limited budget, through the permutation algorithm. Our results showed that the heuristic permutation algorithm provided a good optimum in terms of maximizing the rehabilitation area, compared with a method of the worst-first maintenance currently used in Seoul.

Criteria and algorithms for constructing reliable databases for statistical analysis of disruptions at ASDEX Upgrade

International Nuclear Information System (INIS)

Cannas, B.; Fanni, A.; Pautasso, G.; Sias, G.; Sonato, P.

2009-01-01

The present understanding of disruption physics has not gone so far as to provide a mathematical model describing the onset of this instability. A disruption prediction system, based on a statistical analysis of the diagnostic signals recorded during the experiments, would allow estimating the probability of a disruption to take place. A crucial point for a good design of such a prediction system is the appropriateness of the data set. This paper reports the details of the database built to train a disruption predictor based on neural networks for ASDEX Upgrade. The criteria of pulses selection, the analyses performed on plasma parameters and the implemented pre-processing algorithms, are described. As an example of application, a short description of the disruption predictor is reported.

Mathematical models for plant-herbivore interactions

Science.gov (United States)

Feng, Zhilan; DeAngelis, Donald L.

2017-01-01

Mathematical Models of Plant-Herbivore Interactions addresses mathematical models in the study of practical questions in ecology, particularly factors that affect herbivory, including plant defense, herbivore natural enemies, and adaptive herbivory, as well as the effects of these on plant community dynamics. The result of extensive research on the use of mathematical modeling to investigate the effects of plant defenses on plant-herbivore dynamics, this book describes a toxin-determined functional response model (TDFRM) that helps explains field observations of these interactions. This book is intended for graduate students and researchers interested in mathematical biology and ecology.

Forum of Mathematics for Industry 2013

CERN Document Server

Anderssen, Robert; Cheng, Jin; Fukumoto, Yasuhide; McKibbin, Robert; Polthier, Konrad; Takagi, Tsuyoshi; Toh, Kim-Chuan

2014-01-01

This book is a collection of papers presented at the Forum “The Impact of Applications on Mathematics” in October 2013. It describes an appropriate framework in which to highlight how real-world problems, over the centuries and today, have influenced and are influencing the development of mathematics and, thereby, how mathematics is reshaped, in order to advance mathematics and its application. The contents of this book address productive and successful interaction between industry and mathematicians, as well as the cross-fertilization and collaboration that result when mathematics is involved with the advancement of science and technology.

New Readings in Greek Mathematics: Sources, Problems, Publications.

Science.gov (United States)

Knorr, Wilbur R.

1990-01-01

The field of ancient Greek mathematics is discussed in terms of how representative is the surviving corpus of the ancient achievement in mathematics, the patterns of thought by which they were discovered, and the construction of mathematics during this period. The research being done in this field is described. (KR)

Mathematics in Literature and Cinema: An Interdisciplinary Course

Science.gov (United States)

Chabrán, H. Rafael; Kozek, Mark

2016-01-01

We describe our team-taught, interdisciplinary course "Numb3rs in Lett3rs & Fi1ms: Mathematics in Literature and Cinema," which explores mathematics in the context of modern literature and cinema. Our goal with this course is to advance collaborations between mathematics and the written/theatre-based creative arts.

An improved exponential-time algorithm for k-SAT

Czech Academy of Sciences Publication Activity Database

Pudlák, Pavel

2005-01-01

Roč. 52, č. 3 (2005), s. 337-364 ISSN 0004-5411 R&D Projects: GA AV ČR(CZ) IAA1019901 Institutional research plan: CEZ:AV0Z10190503 Keywords : CNF sat isfiability * randomized algorithms Subject RIV: BA - General Mathematics Impact factor: 2.197, year: 2005

Profile of Metacognition of Mathematics and Mathematics Education Students in Understanding the Concept of Integral Calculus

Science.gov (United States)

Misu, La; Ketut Budayasa, I.; Lukito, Agung

2018-03-01

This study describes the metacognition profile of mathematics and mathematics education students in understanding the concept of integral calculus. The metacognition profile is a natural and intact description of a person’s cognition that involves his own thinking in terms of using his knowledge, planning and monitoring his thinking process, and evaluating his thinking results when understanding a concept. The purpose of this study was to produce the metacognition profile of mathematics and mathematics education students in understanding the concept of integral calculus. This research method is explorative method with the qualitative approach. The subjects of this study are mathematics and mathematics education students who have studied integral calculus. The results of this study are as follows: (1) the summarizing category, the mathematics and mathematics education students can use metacognition knowledge and metacognition skills in understanding the concept of indefinite integrals. While the definite integrals, only mathematics education students use metacognition skills; and (2) the explaining category, mathematics students can use knowledge and metacognition skills in understanding the concept of indefinite integrals, while the definite integrals only use metacognition skills. In addition, mathematics education students can use knowledge and metacognition skills in understanding the concept of both indefinite and definite integrals.

Online algorithms for optimal energy distribution in microgrids

CERN Document Server

Wang, Yu; Nelms, R Mark

2015-01-01

Presenting an optimal energy distribution strategy for microgrids in a smart grid environment, and featuring a detailed analysis of the mathematical techniques of convex optimization and online algorithms, this book provides readers with essential content on how to achieve multi-objective optimization that takes into consideration power subscribers, energy providers and grid smoothing in microgrids. Featuring detailed theoretical proofs and simulation results that demonstrate and evaluate the correctness and effectiveness of the algorithm, this text explains step-by-step how the problem can b

Combinatorial Optimization in Project Selection Using Genetic Algorithm

Science.gov (United States)

Dewi, Sari; Sawaluddin

2018-01-01

This paper discusses the problem of project selection in the presence of two objective functions that maximize profit and minimize cost and the existence of some limitations is limited resources availability and time available so that there is need allocation of resources in each project. These resources are human resources, machine resources, raw material resources. This is treated as a consideration to not exceed the budget that has been determined. So that can be formulated mathematics for objective function (multi-objective) with boundaries that fulfilled. To assist the project selection process, a multi-objective combinatorial optimization approach is used to obtain an optimal solution for the selection of the right project. It then described a multi-objective method of genetic algorithm as one method of multi-objective combinatorial optimization approach to simplify the project selection process in a large scope.

Prediction of paddy drying kinetics: A comparative study between mathematical and artificial neural network modelling

Directory of Open Access Journals (Sweden)

Beigi Mohsen

2017-01-01

Full Text Available The present study aimed at investigation of deep bed drying of rough rice kernels at various thin layers at different drying air temperatures and flow rates. A comparative study was performed between mathematical thin layer models and artificial neural networks to estimate the drying curves of rough rice. The suitability of nine mathematical models in simulating the drying kinetics was examined and the Midilli model was determined as the best approach for describing drying curves. Different feed forward-back propagation artificial neural networks were examined to predict the moisture content variations of the grains. The ANN with 4-18-18-1 topology, transfer function of hyperbolic tangent sigmoid and a Levenberg-Marquardt back propagation training algorithm provided the best results with the maximum correlation coefficient and the minimum mean square error values. Furthermore, it was revealed that ANN modeling had better performance in prediction of drying curves with lower root mean square error values.

An Interdisciplinary Approach to Designing Online Learning: Fostering Pre-Service Mathematics Teachers' Capabilities in Mathematical Modelling

Science.gov (United States)

Geiger, Vince; Mulligan, Joanne; Date-Huxtable, Liz; Ahlip, Rehez; Jones, D. Heath; May, E. Julian; Rylands, Leanne; Wright, Ian

2018-01-01

In this article we describe and evaluate processes utilized to develop an online learning module on mathematical modelling for pre-service teachers. The module development process involved a range of professionals working within the STEM disciplines including mathematics and science educators, mathematicians, scientists, in-service and pre-service…

Inhibiting Intuitive Thinking in Mathematics Education

Science.gov (United States)

Thomas, Michael O. J.

2015-01-01

The papers in this issue describe recent collaborative research into the role of inhibition of intuitive thinking in mathematics education. This commentary reflects on this research from a mathematics education perspective and draws attention to some of the challenges that arise in collaboration between research fields with different cultures,…

Using Student Contributions and Multiple Representations To Develop Mathematical Language.

Science.gov (United States)

Herbel-Eisenmann, Beth A.

2002-01-01

Describes a way to introduce and use mathematical language as an alternative to using vocabulary lists to introduce students to mathematical language in mathematics classrooms. Draws on multiple representations and student language. (YDS)

A Parallel Butterfly Algorithm

KAUST Repository

Poulson, Jack; Demanet, Laurent; Maxwell, Nicholas; Ying, Lexing

2014-01-01

The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.

A Parallel Butterfly Algorithm

KAUST Repository

Poulson, Jack

2014-02-04

The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.

University mathematics teachers' views on the required reasoning in calculus exams

OpenAIRE

Bergqvist, Ewa

2012-01-01

Students often use imitative reasoning, i.e. copy algorithms or recall facts, when solving mathematical tasks. Research show that this type of imitative reasoning might weaken the students' understanding of the underlying mathematical concepts. In a previous study, the author classified tasks from 16 final exams from introductory calculus courses at Swedish universities. The results showed that it was possible to pass 15 of the exams, and solve most of the tasks, using imitative reasoning. Th...

Hooke–Jeeves Method-used Local Search in a Hybrid Global Optimization Algorithm

Directory of Open Access Journals (Sweden)

V. D. Sulimov

2014-01-01

Full Text Available Modern methods for optimization investigation of complex systems are based on development and updating the mathematical models of systems because of solving the appropriate inverse problems. Input data desirable for solution are obtained from the analysis of experimentally defined consecutive characteristics for a system or a process. Causal characteristics are the sought ones to which equation coefficients of mathematical models of object, limit conditions, etc. belong. The optimization approach is one of the main ones to solve the inverse problems. In the main case it is necessary to find a global extremum of not everywhere differentiable criterion function. Global optimization methods are widely used in problems of identification and computation diagnosis system as well as in optimal control, computing to-mography, image restoration, teaching the neuron networks, other intelligence technologies. Increasingly complicated systems of optimization observed during last decades lead to more complicated mathematical models, thereby making solution of appropriate extreme problems significantly more difficult. A great deal of practical applications may have the problem con-ditions, which can restrict modeling. As a consequence, in inverse problems the criterion functions can be not everywhere differentiable and noisy. Available noise means that calculat-ing the derivatives is difficult and unreliable. It results in using the optimization methods without calculating the derivatives.An efficiency of deterministic algorithms of global optimization is significantly restrict-ed by their dependence on the extreme problem dimension. When the number of variables is large they use the stochastic global optimization algorithms. As stochastic algorithms yield too expensive solutions, so this drawback restricts their applications. Developing hybrid algo-rithms that combine a stochastic algorithm for scanning the variable space with deterministic local search

Mathematical tools for data mining set theory, partial orders, combinatorics

CERN Document Server

Simovici, Dan A

2014-01-01

Data mining essentially relies on several mathematical disciplines, many of which are presented in this second edition of this book. Topics include partially ordered sets, combinatorics, general topology, metric spaces, linear spaces, graph theory. To motivate the reader a significant number of applications of these mathematical tools are included ranging from association rules, clustering algorithms, classification, data constraints, logical data analysis, etc. The book is intended as a reference for researchers and graduate students. The current edition is a significant expansion of the firs

Rethinking Mathematics Teaching in Liberia: Realistic Mathematics Education

Science.gov (United States)

Stemn, Blidi S.

2017-01-01

In some African cultures, the concept of division does not necessarily mean sharing money or an item equally. How an item is shared might depend on the ages of the individuals involved. This article describes the use of the Realistic Mathematics Education (RME) approach to teach division word problems involving money in a 3rd-grade class in…

A mathematical model for the deformation of the eyeball by an elastic band.

Science.gov (United States)

Keeling, Stephen L; Propst, Georg; Stadler, Georg; Wackernagel, Werner

2009-06-01

In a certain kind of eye surgery, the human eyeball is deformed sustainably by the application of an elastic band. This article presents a mathematical model for the mechanics of the combined eye/band structure along with an algorithm to compute the model solutions. These predict the immediate and the lasting indentation of the eyeball. The model is derived from basic physical principles by minimizing a potential energy subject to a volume constraint. Assuming spherical symmetry, this leads to a two-point boundary-value problem for a non-linear second-order ordinary differential equation that describes the minimizing static equilibrium. By comparison with laboratory data, a preliminary validation of the model is given.

Using Mathematics, Mathematical Applications, Mathematical Modelling, and Mathematical Literacy: A Theoretical Study

Science.gov (United States)

Mumcu, Hayal Yavuz

2016-01-01

The purpose of this theoretical study is to explore the relationships between the concepts of using mathematics in the daily life, mathematical applications, mathematical modelling, and mathematical literacy. As these concepts are generally taken as independent concepts in the related literature, they are confused with each other and it becomes…

High-order hydrodynamic algorithms for exascale computing

Energy Technology Data Exchange (ETDEWEB)

Morgan, Nathaniel Ray [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2016-02-05

Hydrodynamic algorithms are at the core of many laboratory missions ranging from simulating ICF implosions to climate modeling. The hydrodynamic algorithms commonly employed at the laboratory and in industry (1) typically lack requisite accuracy for complex multi- material vortical flows and (2) are not well suited for exascale computing due to poor data locality and poor FLOP/memory ratios. Exascale computing requires advances in both computer science and numerical algorithms. We propose to research the second requirement and create a new high-order hydrodynamic algorithm that has superior accuracy, excellent data locality, and excellent FLOP/memory ratios. This proposal will impact a broad range of research areas including numerical theory, discrete mathematics, vorticity evolution, gas dynamics, interface instability evolution, turbulent flows, fluid dynamics and shock driven flows. If successful, the proposed research has the potential to radically transform simulation capabilities and help position the laboratory for computing at the exascale.

Using rapidly-exploring random tree-based algorithms to find smooth and optimal trajectories

CSIR Research Space (South Africa)

Matebese, B

2012-10-01

Full Text Available -exploring random tree-based algorithms to fi nd smooth and optimal trajectories B MATEBESE1, MK BANDA2 AND S UTETE1 1CSIR Modelling and Digital Science, PO Box 395, Pretoria, South Africa, 0001 2Department of Applied Mathematics, Stellenbosch University... and complex environments. The RRT algorithm is the most popular and has the ability to find a feasible solution faster than other algorithms. The drawback of using RRT is that, as the number of samples increases, the probability that the algorithm converges...

Effective use of Wikis in College Mathematics Classes

Directory of Open Access Journals (Sweden)

Paul Martin

2010-12-01

Full Text Available Wikis are used in mathematics education in a variety of ways [3]. As with Wikipedia, mathematics related Wikis provide pages and links that describe many different branches of mathematics. Another common use is as a portal for distributing and collecting mathematics course materials [1]. This article describes the authors' use of course wikis for two different purposes in two undergraduate math courses. In Calculus-I, a wiki was utilized to share and present the outcome of an optimization problem that required small groups to collect information about student homes' attic insulation status and eventually to compute the optimal amount of new insulation to add that maximizes heating savings. The second wiki was for a small seminar-style course on Mathematical Mysteries where students collected and posted the results of their research relating to famous unsolved problems in mathematics. This wiki was also used as a platform for in-class presentations by the students and the instructors. In both cases, the bulk of the wiki contribution was by students.

Algorithm For Hypersonic Flow In Chemical Equilibrium

Science.gov (United States)

Palmer, Grant

1989-01-01

Implicit, finite-difference, shock-capturing algorithm calculates inviscid, hypersonic flows in chemical equilibrium. Implicit formulation chosen because overcomes limitation on mathematical stability encountered in explicit formulations. For dynamical portion of problem, Euler equations written in conservation-law form in Cartesian coordinate system for two-dimensional or axisymmetric flow. For chemical portion of problem, equilibrium state of gas at each point in computational grid determined by minimizing local Gibbs free energy, subject to local conservation of molecules, atoms, ions, and total enthalpy. Major advantage: resulting algorithm naturally stable and captures strong shocks without help of artificial-dissipation terms to damp out spurious numerical oscillations.

Mathematical Methods in Tomography

CERN Document Server

Louis, Alfred; Natterer, Frank

1991-01-01

The conference was devoted to the discussion of present and future techniques in medical imaging, including 3D x-ray CT, ultrasound and diffraction tomography, and biomagnetic ima- ging. The mathematical models, their theoretical aspects and the development of algorithms were treated. The proceedings contains surveys on reconstruction in inverse obstacle scat- tering, inversion in 3D, and constrained least squares pro- blems.Research papers include besides the mentioned imaging techniques presentations on image reconstruction in Hilbert spaces, singular value decompositions, 3D cone beam recon- struction, diffuse tomography, regularization of ill-posed problems, evaluation reconstruction algorithms and applica- tions in non-medical fields. Contents: Theoretical Aspects: J.Boman: Helgason' s support theorem for Radon transforms-a newproof and a generalization -P.Maass: Singular value de- compositions for Radon transforms- W.R.Madych: Image recon- struction in Hilbert space -R.G.Mukhometov: A problem of in- teg...

Emotion and Disaffection with School Mathematics

Science.gov (United States)

Lewis, Gareth

2013-01-01

This paper reports some initial findings from research designed to understand more deeply the motivational and emotional landscape of disaffection with school mathematics. A context is described in which there has been significant concern expressed about a number of aspects of mathematics education, but where affect is seen as salient to these…

Mathematical Footprints Discovering Mathematics Everywhere

CERN Document Server

Pappas, Theoni

1999-01-01

MATHEMATICAL FOOTPRINTS takes a creative look at the role mathematics has played since prehistoric times, and will play in the future, and uncovers mathematics where you least expect to find it from its many uses in medicine, the sciences, and its appearance in art to its patterns in nature and its central role in the development of computers. Pappas presents mathematical ideas in a readable non-threatening manner. MATHEMATICAL FOOTPRINTS is another gem by the creator of THE MATHEMATICS CALENDAR and author of THE JOY OF MATHEMATICS. "Pappas's books have been gold mines of mathematical ent

TAO-robust backpropagation learning algorithm.

Science.gov (United States)

Pernía-Espinoza, Alpha V; Ordieres-Meré, Joaquín B; Martínez-de-Pisón, Francisco J; González-Marcos, Ana

2005-03-01

In several fields, as industrial modelling, multilayer feedforward neural networks are often used as universal function approximations. These supervised neural networks are commonly trained by a traditional backpropagation learning format, which minimises the mean squared error (mse) of the training data. However, in the presence of corrupted data (outliers) this training scheme may produce wrong models. We combine the benefits of the non-linear regression model tau-estimates [introduced by Tabatabai, M. A. Argyros, I. K. Robust Estimation and testing for general nonlinear regression models. Applied Mathematics and Computation. 58 (1993) 85-101] with the backpropagation algorithm to produce the TAO-robust learning algorithm, in order to deal with the problems of modelling with outliers. The cost function of this approach has a bounded influence function given by the weighted average of two psi functions, one corresponding to a very robust estimate and the other to a highly efficient estimate. The advantages of the proposed algorithm are studied with an example.

Linear programming algorithms and applications

CERN Document Server

Vajda, S

1981-01-01

This text is based on a course of about 16 hours lectures to students of mathematics, statistics, and/or operational research. It is intended to introduce readers to the very wide range of applicability of linear programming, covering problems of manage­ ment, administration, transportation and a number of other uses which are mentioned in their context. The emphasis is on numerical algorithms, which are illustrated by examples of such modest size that the solutions can be obtained using pen and paper. It is clear that these methods, if applied to larger problems, can also be carried out on automatic (electronic) computers. Commercially available computer packages are, in fact, mainly based on algorithms explained in this book. The author is convinced that the user of these algorithms ought to be knowledgeable about the underlying theory. Therefore this volume is not merely addressed to the practitioner, but also to the mathematician who is interested in relatively new developments in algebraic theory and in...

A Mathematics Support Programme for First-Year Engineering Students

Science.gov (United States)

Hillock, Poh Wah; Jennings, Michael; Roberts, Anthony; Scharaschkin, Victor

2013-01-01

This article describes a mathematics support programme at the University of Queensland, targeted at first-year engineering students identified as having a high risk of failing a first-year mathematics course in calculus and linear algebra. It describes how students were identified for the programme and the main features of the programme. The…

Model-based fault diagnosis techniques design schemes, algorithms, and tools

CERN Document Server

Ding, Steven

2008-01-01

The objective of this book is to introduce basic model-based FDI schemes, advanced analysis and design algorithms, and the needed mathematical and control theory tools at a level for graduate students and researchers as well as for engineers. This is a textbook with extensive examples and references. Most methods are given in the form of an algorithm that enables a direct implementation in a programme. Comparisons among different methods are included when possible.

Hybrid particle swarm optimization algorithm and its application in nuclear engineering

International Nuclear Information System (INIS)

Liu, C.Y.; Yan, C.Q.; Wang, J.J.

2014-01-01

Highlights: • We propose a hybrid particle swarm optimization algorithm (HPSO). • Modified Nelder–Mead simplex search method is applied in HPSO. • The algorithm has a high search precision and rapidly calculation speed. • HPSO can be used in the nuclear engineering optimization design problems. - Abstract: A hybrid particle swarm optimization algorithm with a feasibility-based rule for solving constrained optimization problems has been developed in this research. Firstly, the global optimal solution zone can be obtained through particle swarm optimization process, and then the refined search of the global optimal solution will be achieved through the modified Nelder–Mead simplex algorithm. Simulations based on two well-studied benchmark problems demonstrate the proposed algorithm will be an efficient alternative to solving constrained optimization problems. The vertical electrical heating pressurizer is one of the key components in reactor coolant system. The mathematical model of pressurizer has been established in steady state. The optimization design of pressurizer weight has been carried out through HPSO algorithm. The results show the pressurizer weight can be reduced by 16.92%. The thermal efficiencies of conventional PWR nuclear power plants are about 31–35% so far, which are much lower than fossil fueled plants based in a steam cycle as PWR. The thermal equilibrium mathematic model for nuclear power plant secondary loop has been established. An optimization case study has been conducted to improve the efficiency of the nuclear power plant with the proposed algorithm. The results show the thermal efficiency is improved by 0.5%

A hospital-level cost-effectiveness analysis model for toxigenic Clostridium difficile detection algorithms.

Science.gov (United States)

Verhoye, E; Vandecandelaere, P; De Beenhouwer, H; Coppens, G; Cartuyvels, R; Van den Abeele, A; Frans, J; Laffut, W

2015-10-01

Despite thorough analyses of the analytical performance of Clostridium difficile tests and test algorithms, the financial impact at hospital level has not been well described. Such a model should take institution-specific variables into account, such as incidence, request behaviour and infection control policies. To calculate the total hospital costs of different test algorithms, accounting for days on which infected patients with toxigenic strains were not isolated and therefore posed an infectious risk for new/secondary nosocomial infections. A mathematical algorithm was developed to gather the above parameters using data from seven Flemish hospital laboratories (Bilulu Microbiology Study Group) (number of tests, local prevalence and hospital hygiene measures). Measures of sensitivity and specificity for the evaluated tests were taken from the literature. List prices and costs of assays were provided by the manufacturer or the institutions. The calculated cost included reagent costs, personnel costs and the financial burden following due and undue isolations and antibiotic therapies. Five different test algorithms were compared. A dynamic calculation model was constructed to evaluate the cost:benefit ratio of each algorithm for a set of institution- and time-dependent inputted variables (prevalence, cost fluctuations and test performances), making it possible to choose the most advantageous algorithm for its setting. A two-step test algorithm with concomitant glutamate dehydrogenase and toxin testing, followed by a rapid molecular assay was found to be the most cost-effective algorithm. This enabled resolution of almost all cases on the day of arrival, minimizing the number of unnecessary or missing isolations. Copyright © 2015 The Healthcare Infection Society. Published by Elsevier Ltd. All rights reserved.

Modelling Mathematical Reasoning in Physics Education

Science.gov (United States)

Uhden, Olaf; Karam, Ricardo; Pietrocola, Maurício; Pospiech, Gesche

2012-04-01

Many findings from research as well as reports from teachers describe students' problem solving strategies as manipulation of formulas by rote. The resulting dissatisfaction with quantitative physical textbook problems seems to influence the attitude towards the role of mathematics in physics education in general. Mathematics is often seen as a tool for calculation which hinders a conceptual understanding of physical principles. However, the role of mathematics cannot be reduced to this technical aspect. Hence, instead of putting mathematics away we delve into the nature of physical science to reveal the strong conceptual relationship between mathematics and physics. Moreover, we suggest that, for both prospective teaching and further research, a focus on deeply exploring such interdependency can significantly improve the understanding of physics. To provide a suitable basis, we develop a new model which can be used for analysing different levels of mathematical reasoning within physics. It is also a guideline for shifting the attention from technical to structural mathematical skills while teaching physics. We demonstrate its applicability for analysing physical-mathematical reasoning processes with an example.

Perturbation resilience and superiorization of iterative algorithms

International Nuclear Information System (INIS)

Censor, Y; Davidi, R; Herman, G T

2010-01-01

Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there often exist iterative algorithms that impose very little demand on computer resources. For other problems, such as finding that point in the intersection at which the value of a given function is optimal, algorithms tend to need more computer memory and longer execution time. A methodology is presented whose aim is to produce automatically for an iterative algorithm of the first kind a 'superiorized version' of it that retains its computational efficiency but nevertheless goes a long way toward solving an optimization problem. This is possible to do if the original algorithm is 'perturbation resilient', which is shown to be the case for various projection algorithms for solving the consistent convex feasibility problem. The superiorized versions of such algorithms use perturbations that steer the process in the direction of a superior feasible point, which is not necessarily optimal, with respect to the given function. After presenting these intuitive ideas in a precise mathematical form, they are illustrated in image reconstruction from projections for two different projection algorithms superiorized for the function whose value is the total variation of the image

Standards for Reporting Mathematics Professional Development in Research Studies

Science.gov (United States)

Sztajn, Paola

2011-01-01

This Research Commentary addresses the need for standards for describing mathematics professional development in mathematics education research reports. Considering that mathematics professional development is an emerging research field, it is timely to set expectations for what constitutes high-quality reporting in this field. (Contains 2 tables.)

The Generalized Principle of the Golden Section and its applications in mathematics, science, and engineering

International Nuclear Information System (INIS)

Stakhov, A.P.

2005-01-01

The 'Dichotomy Principle' and the classical 'Golden Section Principle' are two of the most important principles of Nature, Science and also Art. The Generalized Principle of the Golden Section that follows from studying the diagonal sums of the Pascal triangle is a sweeping generalization of these important principles. This underlies the foundation of 'Harmony Mathematics', a new proposed mathematical direction. Harmony Mathematics includes a number of new mathematical theories: an algorithmic measurement theory, a new number theory, a new theory of hyperbolic functions based on Fibonacci and Lucas numbers, and a theory of the Fibonacci and 'Golden' matrices. These mathematical theories are the source of many new ideas in mathematics, philosophy, botanic and biology, electrical and computer science and engineering, communication systems, mathematical education as well as theoretical physics and physics of high energy particles

Assessing Journal Quality in Mathematics Education

Science.gov (United States)

Nivens, Ryan Andrew; Otten, Samuel

2017-01-01

In this Research Commentary, we describe 3 journal metrics--the Web of Science's Impact Factor, Scopus's SCImago Journal Rank, and Google Scholar Metrics' h5-index--and compile the rankings (if they exist) for 69 mathematics education journals. We then discuss 2 paths that the mathematics education community should consider with regard to these…

Students’ logical-mathematical intelligence profile

Science.gov (United States)

Arum, D. P.; Kusmayadi, T. A.; Pramudya, I.

2018-04-01

One of students’ characteristics which play an important role in learning mathematics is logical-mathematical intelligence. This present study aims to identify profile of students’ logical-mathematical intelligence in general and specifically in each indicator. It is also analyzed and described based on students’ sex. This research used qualitative method with case study strategy. The subjects involve 29 students of 9th grade that were selected by purposive sampling. Data in this research involve students’ logical-mathematical intelligence result and interview. The results show that students’ logical-mathematical intelligence was identified in the moderate level with the average score is 11.17 and 51.7% students in the range of the level. In addition, the level of both male and female students are also mostly in the moderate level. On the other hand, both male and female students’ logical-mathematical intelligence is strongly influenced by the indicator of ability to classify and understand patterns and relationships. Furthermore, the ability of comparison is the weakest indicator. It seems that students’ logical-mathematical intelligence is still not optimal because more than 50% students are identified in moderate and low level. Therefore, teachers need to design a lesson that can improve students’ logical-mathematical intelligence level, both in general and on each indicator.

Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

Science.gov (United States)

Van Benthem, Mark H.; Keenan, Michael R.

2008-11-11

A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

Mathematics for electronic technology

CERN Document Server

Howson, D P

1975-01-01

Mathematics for Electronic Technology is a nine-chapter book that begins with the elucidation of the introductory concepts related to use of mathematics in electronic engineering, including differentiation, integration, partial differentiation, infinite series, vectors, vector algebra, and surface, volume and line integrals. Subsequent chapters explore the determinants, differential equations, matrix analysis, complex variable, topography, graph theory, and numerical analysis used in this field. The use of Fourier method for harmonic analysis and the Laplace transform is also described. The ma

Research on distributed QOS routing algorithm based on TCP/IP

Science.gov (United States)

Liu, Xiaoyue; Chen, Yongqiang

2011-10-01

At present, network environment follow protocol standard of IPV4 is intended to do the best effort of network to provide network applied service for users, however, not caring about service quality.Thus the packet loss rate is high, it cannot reach an ideal applied results. This article through the establishment of mathematical model, put forward a new distributed multi QOS routing algorithm, given the realization process of this distributed QOS routing algorithm, and simulation was carried out by simulation software. The results show the proposed algorithm can improve the utilization rate of network resources and the service quality of network application.

A Note on Discrete Mathematics and Calculus.

Science.gov (United States)

O'Reilly, Thomas J.

1987-01-01

Much of the current literature on the topic of discrete mathematics and calculus during the first two years of an undergraduate mathematics curriculum is cited. A relationship between the recursive integration formulas and recursively defined polynomials is described. A Pascal program is included. (Author/RH)

Student-Made Games to Learn the History of Mathematics

Science.gov (United States)

Huntley, Mary Ann; Flores, Alfinio

2011-01-01

In this article, the authors describe how prospective secondary mathematics teachers designed their own adaptations of popular board and computer games to learn the history of mathematics. They begin the article by describing some of the games students designed and used, and follow this with a discussion of factors for successful use of games in…

Recognition algorithms in knot theory

International Nuclear Information System (INIS)

Dynnikov, I A

2003-01-01

In this paper the problem of constructing algorithms for comparing knots and links is discussed. A survey of existing approaches and basic results in this area is given. In particular, diverse combinatorial methods for representing links are discussed, the Haken algorithm for recognizing a trivial knot (the unknot) and a scheme for constructing a general algorithm (using Haken's ideas) for comparing links are presented, an approach based on representing links by closed braids is described, the known algorithms for solving the word problem and the conjugacy problem for braid groups are described, and the complexity of the algorithms under consideration is discussed. A new method of combinatorial description of knots is given together with a new algorithm (based on this description) for recognizing the unknot by using a procedure for monotone simplification. In the conclusion of the paper several problems are formulated whose solution could help to advance towards the 'algorithmization' of knot theory

European Success Stories in Industrial Mathematics

CERN Document Server

Esteban, Maria J; Lery, Thibaut; Maday, Yvon

2011-01-01

This unique book presents real world success stories of collaboration between mathematicians and industrial partners, showcasing first-hand case studies, and lessons learned from the experiences, technologies, and business challenges that led to the successful development of industrial solutions based on mathematics. It shows the crucial contribution of mathematics to innovation and to the industrial creation of value, and the key position of mathematics in the handling of complex systems, amplifying innovation. Each story describes the challenge that led to the industrial cooperation, how the

The Role of Mathematics Learning Centres in Engineering Education.

Science.gov (United States)

Fuller, Milton

2002-01-01

Points out the diminishing demand for mathematics undergraduate programs and the strong trend in engineering education to make greater use of computer coursework such as Mathcad, Matlab, and other software systems for the mathematical and statistical components of engineering programs. Describes the changing role of mathematics learning centers…

The Role of Expository Writing in Mathematical Problem Solving

Science.gov (United States)

Craig, Tracy S.

2016-01-01

Mathematical problem-solving is notoriously difficult to teach in a standard university mathematics classroom. The project on which this article reports aimed to investigate the effect of the writing of explanatory strategies in the context of mathematical problem solving on problem-solving behaviour. This article serves to describe the…

Mathematical modeling of efficient protocols to control glioma growth.

Science.gov (United States)

Branco, J R; Ferreira, J A; de Oliveira, Paula

2014-09-01

In this paper we propose a mathematical model to describe the evolution of glioma cells taking into account the viscoelastic properties of brain tissue. The mathematical model is established considering that the glioma cells are of two phenotypes: migratory and proliferative. The evolution of the migratory cells is described by a diffusion-reaction equation of non Fickian type deduced considering a mass conservation law with a non Fickian migratory mass flux. The evolution of the proliferative cells is described by a reaction equation. A stability analysis that leads to the design of efficient protocols is presented. Numerical simulations that illustrate the behavior of the mathematical model are included. Copyright © 2014 Elsevier Inc. All rights reserved.

Data analysis algorithms for gravitational-wave experiments

International Nuclear Information System (INIS)

Bonifazi, P.; Ferrari, V.; Frasca, S.; Pallottino, G.V.; Pizzella, G.

1978-01-01

The analysis of the sensitivity of a gravitational-wave antenna system shows that the role of the algorithms used for the analysis of the experimental data is comparable to that of the experimental apparatus. After a discussion of the processing performed on the input signals by the antenna and the electronic instrumentation, we derive a mathematical model of the system. This model is then used as a basis for the discussion of a number of data analysis algorithms that include also the Wiener-Kolmogoroff optimum filter; the performances of the algorithms are presented in terms of signal-to-noise ratio and sensitivity to short bursts of resonant gravitational waves. The theoretical results are in good agreement with the experimental results obtained with a small cryogenic antenna (24 kg)

The BR eigenvalue algorithm

Energy Technology Data Exchange (ETDEWEB)

Geist, G.A. [Oak Ridge National Lab., TN (United States). Computer Science and Mathematics Div.; Howell, G.W. [Florida Inst. of Tech., Melbourne, FL (United States). Dept. of Applied Mathematics; Watkins, D.S. [Washington State Univ., Pullman, WA (United States). Dept. of Pure and Applied Mathematics

1997-11-01

The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrowband, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30--60 in computing time and a factor of over 100 in matrix storage space.

Mathematical Modelling of Surfactant Self-assembly at Interfaces

KAUST Repository

Morgan, C. E.; Breward, C. J. W.; Griffiths, I. M.; Howell, P. D.

2015-01-01

© 2015 Society for Industrial and Applied Mathematics. We present a mathematical model to describe the distribution of surfactant pairs in a multilayer structure beneath an adsorbed monolayer. A mesoscopic model comprising a set of ordinary

Mathematical Modeling of Diverse Phenomena

Science.gov (United States)

Howard, J. C.

1979-01-01

Tensor calculus is applied to the formulation of mathematical models of diverse phenomena. Aeronautics, fluid dynamics, and cosmology are among the areas of application. The feasibility of combining tensor methods and computer capability to formulate problems is demonstrated. The techniques described are an attempt to simplify the formulation of mathematical models by reducing the modeling process to a series of routine operations, which can be performed either manually or by computer.

Experiments with conjugate gradient algorithms for homotopy curve tracking

Science.gov (United States)

Irani, Kashmira M.; Ribbens, Calvin J.; Watson, Layne T.; Kamat, Manohar P.; Walker, Homer F.

1991-01-01

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

Fast Algorithm for Computing the Discrete Hartley Transform of Type-II

Directory of Open Access Journals (Sweden)

Mounir Taha Hamood

2016-06-01

Full Text Available The generalized discrete Hartley transforms (GDHTs have proved to be an efficient alternative to the generalized discrete Fourier transforms (GDFTs for real-valued data applications. In this paper, the development of direct computation of radix-2 decimation-in-time (DIT algorithm for the fast calculation of the GDHT of type-II (DHT-II is presented. The mathematical analysis and the implementation of the developed algorithm are derived, showing that this algorithm possesses a regular structure and can be implemented in-place for efficient memory utilization.The performance of the proposed algorithm is analyzed and the computational complexity is calculated for different transform lengths. A comparison between this algorithm and existing DHT-II algorithms shows that it can be considered as a good compromise between the structural and computational complexities.

Influence of mathematical models in design of PV-Diesel systems

International Nuclear Information System (INIS)

Dufo-Lopez, Rodolfo; Bernal-Agustin, Jose L.

2008-01-01

This paper presents a study of the influence of mathematical models in the optimal design of PV-Diesel systems. For this purpose, a design tool developed by the authors, which allows obtaining the most cost effective design of a PV-Diesel system through the genetic algorithm technique, has been used. The mathematical models of some elements of the hybrid system have been improved in comparison to those usually employed in hybrid systems design programs. Furthermore, a more complete general control strategy has been developed, one that also takes into account more characteristics than those usually considered in this kind of design. Several designs have been made, evaluating the effect on the results of the different mathematical models and the novel strategy that can be considered

a pyramid algorithm for the haar discrete wavelet packet transform

African Journals Online (AJOL)

PROF EKWUEME

computer-aided signal processing of non-stationary signals, this paper develops a pyramid algorithm for the discrete wavelet packet ... Edith T. Luhanga, School of Computational and Communication Sciences and Engineering, Nelson Mandela African. Institute of ..... Mathematics, Washington University. 134. EDITH T.

Preparing Mathematics Teachers for Technology-Rich Environments

Science.gov (United States)

Sturdivant, Rodney X.; Dunham, Penelope; Jardine, Richard

2009-01-01

This article describes key elements for faculty development programs to prepare mathematics teachers for technology-rich environments. We offer practical examples from our experiences in teaching mathematics with technology and in teaching others to incorporate technology-based pedagogies. We address challenges faced by faculty using technology,…

Intrafirm planning and mathematical modeling of owner's equity in industrial enterprises

Science.gov (United States)

Ponomareva, S. V.; Zheleznova, I. V.

2018-05-01

The article aims to review the different approaches to intrafirm planning of owner's equity in industrial enterprises. Since charter capital, additional capital and reserve capital do not change in the process of enterprise activity, the main interest lies on the field of share repurchases from shareholders and retained earnings within the owner's equity of the enterprise. In order to study the effect of share repurchases on the activities of the enterprise, let us use such mathematical methods as event study and econometric modeling. This article describes the step-by-step algorithm of carrying out event study and justifies the choice of Logit model in econometric analysis. The article represents basic results of conducted regression analysis on the effect of share repurchases on the key financial indicators in industrial enterprises.

Teaching Proofs and Algorithms in Discrete Mathematics with Online Visual Logic Puzzles

Science.gov (United States)

Cigas, John; Hsin, Wen-Jung

2005-01-01

Visual logic puzzles provide a fertile environment for teaching multiple topics in discrete mathematics. Many puzzles can be solved by the repeated application of a small, finite set of strategies. Explicitly reasoning from a strategy to a new puzzle state illustrates theorems, proofs, and logic principles. These provide valuable, concrete…

Hybrid modelling framework by using mathematics-based and information-based methods

International Nuclear Information System (INIS)

Ghaboussi, J; Kim, J; Elnashai, A

2010-01-01

Mathematics-based computational mechanics involves idealization in going from the observed behaviour of a system into mathematical equations representing the underlying mechanics of that behaviour. Idealization may lead mathematical models that exclude certain aspects of the complex behaviour that may be significant. An alternative approach is data-centric modelling that constitutes a fundamental shift from mathematical equations to data that contain the required information about the underlying mechanics. However, purely data-centric methods often fail for infrequent events and large state changes. In this article, a new hybrid modelling framework is proposed to improve accuracy in simulation of real-world systems. In the hybrid framework, a mathematical model is complemented by information-based components. The role of informational components is to model aspects which the mathematical model leaves out. The missing aspects are extracted and identified through Autoprogressive Algorithms. The proposed hybrid modelling framework has a wide range of potential applications for natural and engineered systems. The potential of the hybrid methodology is illustrated through modelling highly pinched hysteretic behaviour of beam-to-column connections in steel frames.

MODELING OF HARDWARE AND ALGORITHMIC STRUCTURE OF MOBILE MULTIPOSITIONING RADIO RANGEFINDING NAVIGATION AND LANDING AEROSYSTEM IN ITS SPATIAL CONFIGURATION

Directory of Open Access Journals (Sweden)

Ya. V. Kondrashov

2014-01-01

Full Text Available The concept of structuring of radio equipment, mathematical and algorithmic tools to provide computing operations for determining the location of aircraft in spatial configuration of mobile (portable multipositioning radio rangefinding interrogation-reply navigation and landing system is considered in this article. The mathematical modeling of algorithms of aircraft traffic terminal control is carried out. The results of calculations of potential system performance and its analysis for compliance with international safety requirements are represented.

Mathematical foundation of quantum annealing

International Nuclear Information System (INIS)

Morita, Satoshi; Nishimori, Hidetoshi

2008-01-01

Quantum annealing is a generic name of quantum algorithms that use quantum-mechanical fluctuations to search for the solution of an optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundations of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schroedinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence for both the Schroedinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping

Mathematics, curriculum and assessment: The role of taxonomies in the quest for coherence

Directory of Open Access Journals (Sweden)

Caroline Long

2014-12-01

Full Text Available A challenge encountered when monitoring mathematics teaching and learning at high school is that taxonomies such as Bloom’s, and variations of this work, are not entirely adequate for providing meaningful feedback to teachers beyond very general cognitive categories that are difficult to interpret. Challenges of this nature are also encountered in the setting of examinations, where the requirement is to cover a range of skills and cognitive domains. The contestation as to the cognitive level is inevitable as it is necessary to analyse the relationship between the problem and the learners’ background experience. The challenge in the project described in this article was to find descriptive terms that would be meaningful to teachers. The first attempt at providing explicit feedback was to apply the assessment frameworks that include a content component and a cognitive component, namely knowledge, routine procedures, complex procedures and problem solving, currently used in the South African curriculum documents. The second attempt investigated various taxonomies, including those used in international assessments and in mathematics education research, for constructs that teachers of mathematics might find meaningful. The final outcome of this investigation was to apply the dimensions required to understand a mathematical concept proposed by Usiskin (2012: the skills-algorithm, property-proof, use-application and representation-metaphor dimension. A feature of these dimensions is that they are not hierarchical; rather, within each of the dimensions, the mathematical task may demand recall but may also demand the highest level of creativity. For our purpose, we developed a two-way matrix using Usiskin’s dimensions on one axis and a variation of Bloom’s revised taxonomy on the second axis. Our findings are that this two-way matrix provides an alternative to current taxonomies, is more directly applicable to mathematics and provides the

Spherical Detector Device Mathematical Modelling with Taking into Account Detector Module Symmetry

International Nuclear Information System (INIS)

Batyj, V.G.; Fedorchenko, D.V.; Prokopets, S.I.; Prokopets, I.M.; Kazhmuradov, M.A.

2005-01-01

Mathematical Model for spherical detector device accounting to symmetry properties is considered. Exact algorithm for simulation of measurement procedure with multiple radiation sources is developed. Modelling results are shown to have perfect agreement with calibration measurements

Ordering Operations in Square Root Extractions, Analyzing Some Early Medieval Sanskrit Mathematical Texts with the Help of Speech Act Theory

Science.gov (United States)

Keller, Agathe

Procedures for extracting square roots written in Sanskrit in two treatises and their commentaries from the fifth to the twelfth centuries are explored with the help of Textology and Speech Act Theory. An analysis of the number and order of the steps presented in these texts is used to show that their aims were not limited to only describing how to carry out the algorithm. The intentions of authors of these Sanskrit mathematical texts are questioned by taking into account the expressivity of relationships established between the world and the text.1

A Systematic Approach to Modified BCJR MAP Algorithms for Convolutional Codes

Directory of Open Access Journals (Sweden)

Patenaude François

2006-01-01

Full Text Available Since Berrou, Glavieux and Thitimajshima published their landmark paper in 1993, different modified BCJR MAP algorithms have appeared in the literature. The existence of a relatively large number of similar but different modified BCJR MAP algorithms, derived using the Markov chain properties of convolutional codes, naturally leads to the following questions. What is the relationship among the different modified BCJR MAP algorithms? What are their relative performance, computational complexities, and memory requirements? In this paper, we answer these questions. We derive systematically four major modified BCJR MAP algorithms from the BCJR MAP algorithm using simple mathematical transformations. The connections between the original and the four modified BCJR MAP algorithms are established. A detailed analysis of the different modified BCJR MAP algorithms shows that they have identical computational complexities and memory requirements. Computer simulations demonstrate that the four modified BCJR MAP algorithms all have identical performance to the BCJR MAP algorithm.

Mathematics of Web science: structure, dynamics and incentives.

Science.gov (United States)

Chayes, Jennifer

2013-03-28

Dr Chayes' talk described how, to a discrete mathematician, 'all the world's a graph, and all the people and domains merely vertices'. A graph is represented as a set of vertices V and a set of edges E, so that, for instance, in the World Wide Web, V is the set of pages and E the directed hyperlinks; in a social network, V is the people and E the set of relationships; and in the autonomous system Internet, V is the set of autonomous systems (such as AOL, Yahoo! and MSN) and E the set of connections. This means that mathematics can be used to study the Web (and other large graphs in the online world) in the following way: first, we can model online networks as large finite graphs; second, we can sample pieces of these graphs; third, we can understand and then control processes on these graphs; and fourth, we can develop algorithms for these graphs and apply them to improve the online experience.

The concept of stability in numerical mathematics

CERN Document Server

Hackbusch, Wolfgang

2014-01-01

In this book, the author compares the meaning of stability in different subfields of numerical mathematics.  Concept of Stability in numerical mathematics opens by examining the stability of finite algorithms. A more precise definition of stability holds for quadrature and interpolation methods, which the following chapters focus on. The discussion then progresses to the numerical treatment of ordinary differential equations (ODEs). While one-step methods for ODEs are always stable, this is not the case for hyperbolic or parabolic differential equations, which are investigated next. The final chapters discuss stability for discretisations of elliptic differential equations and integral equations. In comparison among the subfields we discuss the practical importance of stability and the possible conflict between higher consistency order and stability.  

Mathematics and art a cultural history

CERN Document Server

Gamwell, Lynn

2016-01-01

This is a cultural history of mathematics and art, from antiquity to the present. Mathematicians and artists have long been on a quest to understand the physical world they see before them and the abstract objects they know by thought alone. Taking readers on a tour of the practice of mathematics and the philosophical ideas that drive the discipline, Lynn Gamwell points out the important ways mathematical concepts have been expressed by artists. Sumptuous illustrations of artworks and cogent math diagrams are featured in Gamwell’s comprehensive exploration. Gamwell begins by describing mathematics from antiquity to the Enlightenment, including Greek, Islamic, and Asian mathematics. Then focusing on modern culture, Gamwell traces mathematicians’ search for the foundations of their science, such as David Hilbert’s conception of mathematics as an arrangement of meaning-free signs, as well as artists’ search for the essence of their craft, such as Aleksandr Rodchenko’s monochrome paintings. She shows t...

Tasks that May Occasion Mathematical Creativity: Teachers' Choices

Science.gov (United States)

Levenson, Esther

2013-01-01

Promoting mathematical creativity is one of the aims of mathematics education. This study investigates the tasks teachers chose when their aim was to occasion mathematical creativity in the classroom. Five cases are described in depth, and general trends found among these cases as well as in additional data are discussed. Findings indicated that…

The Generalized Principle of the Golden Section and its applications in mathematics, science, and engineering

Energy Technology Data Exchange (ETDEWEB)

Stakhov, A.P. [International Club of the Golden Section, 6 McCreary Trail, Bolton, ON, L7E 2C8 (Canada)] e-mail: goldenmuseum@rogers.com

2005-10-01

The 'Dichotomy Principle' and the classical 'Golden Section Principle' are two of the most important principles of Nature, Science and also Art. The Generalized Principle of the Golden Section that follows from studying the diagonal sums of the Pascal triangle is a sweeping generalization of these important principles. This underlies the foundation of 'Harmony Mathematics', a new proposed mathematical direction. Harmony Mathematics includes a number of new mathematical theories: an algorithmic measurement theory, a new number theory, a new theory of hyperbolic functions based on Fibonacci and Lucas numbers, and a theory of the Fibonacci and 'Golden' matrices. These mathematical theories are the source of many new ideas in mathematics, philosophy, botanic and biology, electrical and computer science and engineering, communication systems, mathematical education as well as theoretical physics and physics of high energy particles.

Efficient algorithms for conditional independence inference

Czech Academy of Sciences Publication Activity Database

Bouckaert, R.; Hemmecke, R.; Lindner, S.; Studený, Milan

2010-01-01

Roč. 11, č. 1 (2010), s. 3453-3479 ISSN 1532-4435 R&D Projects: GA ČR GA201/08/0539; GA MŠk 1M0572 Institutional research plan: CEZ:AV0Z10750506 Keywords : conditional independence inference * linear programming approach Subject RIV: BA - General Mathematics Impact factor: 2.949, year: 2010 http://library.utia.cas.cz/separaty/2010/MTR/studeny-efficient algorithms for conditional independence inference.pdf

Basic mathematical cognition.

Science.gov (United States)

Gaber, David; Schlimm, Dirk

2015-01-01

Mathematics is a powerful tool for describing and developing our knowledge of the physical world. It informs our understanding of subjects as diverse as music, games, science, economics, communications protocols, and visual arts. Mathematical thinking has its roots in the adaptive behavior of living creatures: animals must employ judgments about quantities and magnitudes in the assessment of both threats (how many foes) and opportunities (how much food) in order to make effective decisions, and use geometric information in the environment for recognizing landmarks and navigating environments. Correspondingly, cognitive systems that are dedicated to the processing of distinctly mathematical information have developed. In particular, there is evidence that certain core systems for understanding different aspects of arithmetic as well as geometry are employed by humans and many other animals. They become active early in life and, particularly in the case of humans, develop through maturation. Although these core systems individually appear to be quite limited in application, in combination they allow for the recognition of mathematical properties and the formation of appropriate inferences based upon those properties. In this overview, the core systems, their roles, their limitations, and their interaction with external representations are discussed, as well as possibilities for how they can be employed together to allow us to reason about more complex mathematical domains. © 2015 John Wiley & Sons, Ltd.

The Mathematics of Mixing Things Up

Science.gov (United States)

Diaconis, Persi

2011-08-01

How long should a Markov chain Monte Carlo algorithm be run? Using examples from statistical physics (Ehrenfest urn, Ising model, hard discs) as well as card shuffling, this tutorial paper gives an overview of a body of mathematical results that can give useful answers to practitioners (viz: seven shuffles suffice for practical purposes). It points to new techniques (path coupling, geometric inequalities, and Harris recurrence). The discovery of phase transitions in mixing times (the cutoff phenomenon) is emphasized.

Mathematics of Photoacoustic and Thermoacoustic Tomography

KAUST Repository

Kuchment, Peter; Kunyansky, Leonid

2011-01-01

The chapter surveys the mathematical models, problems, and algorithms of the thermoacoustic tomography (TAT) and photoacoustic tomography (PAT). TAT and PAT represent probably the most developed of the several novel “hybrid” methods of medical imaging. These new modalities combine different physical types of waves (electromagnetic and acoustic in case of TAT and PAT) in such a way that the resolution and contrast of the resulting method are much higher than those achievable using only acoustic or electromagnetic measurements.

A Developed Artificial Bee Colony Algorithm Based on Cloud Model

Directory of Open Access Journals (Sweden)

Ye Jin

2018-04-01

Full Text Available The Artificial Bee Colony (ABC algorithm is a bionic intelligent optimization method. The cloud model is a kind of uncertainty conversion model between a qualitative concept T ˜ that is presented by nature language and its quantitative expression, which integrates probability theory and the fuzzy mathematics. A developed ABC algorithm based on cloud model is proposed to enhance accuracy of the basic ABC algorithm and avoid getting trapped into local optima by introducing a new select mechanism, replacing the onlooker bees’ search formula and changing the scout bees’ updating formula. Experiments on CEC15 show that the new algorithm has a faster convergence speed and higher accuracy than the basic ABC and some cloud model based ABC variants.

Plato's problem an introduction to mathematical platonism

CERN Document Server

Panza, M

2013-01-01

What is mathematics about? And how can we have access to the reality it is supposed to describe? The book tells the story of this problem, first raised by Plato, through the views of Aristotle, Proclus, Kant, Frege, Gödel, Benacerraf, up to the most recent debate on mathematical platonism.

Mathematical literacy teachers' engagement with contextual tasks ...

African Journals Online (AJOL)

This article reports on a study carried out with a group of 108 practising Mathematical Literacy (ML) teachers who participated in an Advanced Certificate in Education (ACE) programme. The purpose of the qualitative study was to identify and describe the teachers' varying levels of engagement with mathematics tools and ...

Technology-Enhanced Learning in College Mathematics Remediation

Science.gov (United States)

Foshee, Cecile M.; Elliott, Stephen N.; Atkinson, Robert K.

2016-01-01

US colleges presently face an academic plight; thousands of high school graduates are performing below the expected ability for college-level mathematics. This paper describes an innovative approach intended to improve the mathematics performance of first-year college students, at a large US university. The innovation involved the integration of…

Exhibition - Mathematics, A Beautiful Elsewhere

CERN Multimedia

2011-01-01

From 21 October 2011 to 18 March 2012, the Fondation Cartier pour l’art contemporain will present the exhibition Mathematics: A Beautiful Elsewhere, an exhibition developed in association with the Institut des Hautes Études Scientifiques (IHÉS) and under the patronage of UNESCO. For this unprecedented event, the foundation invited mathematicians to work with artists with whom it has previously worked to create an exhibition that allows visitors to see, hear, do, interpret and think about mathematics. By bringing mathematics into its premises, the Fondation Cartier is itself undergoing the “sudden change of scenery” described by mathematician Alexandre Grothendieck. More information is available here. Fondation Cartier pour l’art contemporain 261, boulevard Raspail 75014 Paris http://fondation.cartier.com Private Visit For professors, researchers and all the staff of Mathematics departments...

Implementation of a cone-beam reconstruction algorithm for the single-circle source orbit with embedded misalignment correction using homogeneous coordinates

International Nuclear Information System (INIS)

Karolczak, Marek; Schaller, Stefan; Engelke, Klaus; Lutz, Andreas; Taubenreuther, Ulrike; Wiesent, Karl; Kalender, Willi

2001-01-01

We present an efficient implementation of an approximate cone-beam image reconstruction algorithm for application in tomography, which accounts for scanner mechanical misalignment. The implementation is based on the algorithm proposed by Feldkamp et al. [J. Opt. Soc. Am. A 6, 612-619 (1984)] and is directed at circular scan paths. The algorithm has been developed for the purpose of reconstructing volume data from projections acquired in an experimental x-ray microtomography (μCT) scanner [Engelke et al., Der Radiologe 39, 203-212 (1999)]. To mathematically model misalignment we use matrix notation with homogeneous coordinates to describe the scanner geometry, its misalignment, and the acquisition process. For convenience analysis is carried out for x-ray CT scanners, but it is applicable to any tomographic modality, where two-dimensional projection acquisition in cone beam geometry takes place, e.g., single photon emission computerized tomography. We derive an algorithm assuming misalignment errors to be small enough to weight and filter original projections and to embed compensation for misalignment in the backprojection. We verify the algorithm on simulations of virtual phantoms and scans of a physical multidisk (Defrise) phantom

Rent pricing decision support mathematical model for finance leases under effective risks

Directory of Open Access Journals (Sweden)

Rabbani Masoud

2015-01-01

Full Text Available Nowadays, leasing has become an increasingly important and popular method for equipment acquisition. But, because of the rent pricing difficulties and some risks that affect the lessor and lessee's decision making, there are many people that still tend to buy equipment instead of lease it. In this paper we explore how risk can affect the leasing issue support mathematical model. For this purpose, we consider three types of risk; Credit risk, Transaction risk and Risk based pricing. In particular, our focus was on how to make decision about rent pricing in a leasing problem with different customers, various quality levels and different pricing methods. Finally, the mathematical model has been solved by Genetic Algorithm that is a search heuristic to optimize the problem. This algorithm was coded in MATLAB® R2012a to provide the best set of results.

Mathematical simulation of oil reservoir properties

International Nuclear Information System (INIS)

Ramirez, A.; Romero, A.; Chavez, F.; Carrillo, F.; Lopez, S.

2008-01-01

The study and computational representation of porous media properties are very important for many industries where problems of fluid flow, percolation phenomena and liquid movement and stagnation are involved, for example, in building constructions, ore processing, chemical industries, mining, corrosion sciences, etc. Nevertheless, these kinds of processes present a noneasy behavior to be predicted and mathematical models must include statistical analysis, fractal and/or stochastic procedures to do it. This work shows the characterization of sandstone berea core samples which can be found as a porous media (PM) in natural oil reservoirs, rock formations, etc. and the development of a mathematical algorithm for simulating the anisotropic characteristics of a PM based on a stochastic distribution of some of their most important properties like porosity, permeability, pressure and saturation. Finally a stochastic process is used again to simulated the topography of an oil reservoir

In-Place Algorithms for Computing (Layers of) Maxima

DEFF Research Database (Denmark)

Blunck, Henrik; Vahrenhold, Jan

2010-01-01

We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal time and occupy only constant extra......We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal time and occupy only constant extra...

Convergence analysis of Chauvin's PCA learning algorithm with a constant learning rate

Energy Technology Data Exchange (ETDEWEB)

Lv Jiancheng [Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054 (China); Yi Zhang [Computational Intelligence Laboratory, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 610054 (China)]. E-mail: zhangyi@uestc.edu.cn

2007-05-15

The convergence of Chauvin's PCA learning algorithm with a constant learning rate is studied in this paper by using a DDT method (deterministic discrete-time system method). Different from the DCT method (deterministic continuous-time system method), the DDT method does not require that the learning rate converges to zero. An invariant set of Chauvin's algorithm with a constant learning rate is obtained so that the non-divergence of this algorithm can be guaranteed. Rigorous mathematic proofs are provided to prove the local convergence of this algorithm.

Algorithm for repairing the damaged images of grain structures obtained from the cellular automata and measurement of grain size

Science.gov (United States)

Ramírez-López, A.; Romero-Romo, M. A.; Muñoz-Negron, D.; López-Ramírez, S.; Escarela-Pérez, R.; Duran-Valencia, C.

2012-10-01

Computational models are developed to create grain structures using mathematical algorithms based on the chaos theory such as cellular automaton, geometrical models, fractals, and stochastic methods. Because of the chaotic nature of grain structures, some of the most popular routines are based on the Monte Carlo method, statistical distributions, and random walk methods, which can be easily programmed and included in nested loops. Nevertheless, grain structures are not well defined as the results of computational errors and numerical inconsistencies on mathematical methods. Due to the finite definition of numbers or the numerical restrictions during the simulation of solidification, damaged images appear on the screen. These images must be repaired to obtain a good measurement of grain geometrical properties. Some mathematical algorithms were developed to repair, measure, and characterize grain structures obtained from cellular automata in the present work. An appropriate measurement of grain size and the corrected identification of interfaces and length are very important topics in materials science because they are the representation and validation of mathematical models with real samples. As a result, the developed algorithms are tested and proved to be appropriate and efficient to eliminate the errors and characterize the grain structures.

Continental Mathematics League.

Science.gov (United States)

Quartararo, Joseph

2002-01-01

This article describes the activities of the Continental Mathematics League, which offers a series of meets for children in grades 3 though 9. In addition, a Calculus League and a Computer Contest are offered. The league allows schools to participate by mail so that rural schools can participate. (CR)

Fault-tolerant search algorithms reliable computation with unreliable information

CERN Document Server

Cicalese, Ferdinando

2013-01-01

Why a book on fault-tolerant search algorithms? Searching is one of the fundamental problems in computer science. Time and again algorithmic and combinatorial issues originally studied in the context of search find application in the most diverse areas of computer science and discrete mathematics. On the other hand, fault-tolerance is a necessary ingredient of computing. Due to their inherent complexity, information systems are naturally prone to errors, which may appear at any level - as imprecisions in the data, bugs in the software, or transient or permanent hardware failures. This book pr