Emerging Certifications and Teacher Preparation

Dr. Andersen has worked as a science education professor at Indiana University, Bloomington, since 1966. He has authored six textbooks and over 100 articles on science teacher preparation, science teaching, and science curriculum. He has served as president of the Association for the Education of Teachers in Science, as chair of the Education Section of the American Association for the Advancement of Science, and as a president of the National Science Teachers Association. Among many other honors, he has received the Distinguished Teaching Award at Indiana University and Robert E. Carlton Award for Distinguished National Leadership in Science Education (NSTA).     

Science Education for the 21st Century

Paul DeHart Hurd was a biology teacher and science supervisor in Colorado and California high schools and junior colleges for 20 years and a professor of science education at Stanford University for 22 years. He has authored 11 books and monographs on developments in the sciences and over 300 articles on various aspects of science education in the US and foreign countries. He has served on the National Science Foundation's Advisory Committee for Science Education and as a special educational consultant to the National Academy of Sciences, Commission on Life Sciences. Honors include the Apollo Award from the National Aeronautics and Space Agency, the Distinguished Contributions to Science Education Through Research Award from the National Association for Research in Science Teaching, and the Award for National Leadership in Science Education from the National Science Teachers Association. Dr. Hurd is currently focusing his writings on the history of science and technology education in the US over the past 200 years and current activities to modernize the precollege science curriculum.     

Anglo-Danish conference on History of Mathematics in Education: Bath Spa,August 2016

We report on the Anglo-Danish History of Mathematics in Education conference, drawing on an article written for the Danish Association of Teachers of Mathematics (LFMK) by Jeanette Axelsen (Vordingborg Gymnasium), Kristian Danielsen (Center for Science Studies, University of Aarhus) and Henrik Kragh Sørensen (Department of Science Education, University of Copenhagen). Thirty attendees enjoyed an intense programme of talks and practical workshops over three days in Bath. Teachers from Denmark and England shared their pedagogical developments inspired by the history of mathematics.     

On the characterization of strong convergence of an iterative algorithm for a class of multi-valued variational inclusions

This paper introduces an Ishikawa type iterative algorithm for finding approximating solutions of a class of multi-valued variational inclusion problems. Characterization of strong convergence of this iterative method is established. L. C. Ceng’s research partially supported by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Education Institutions of MOE, China and the Dawn Program Foundation in Shanghai. S. Schaible’s research partially supported by the National Science Council of Taiwan. This research was partially supported by the grant NSC 96-2628-E-110-014-MY3.     

SU(3) limit ofsdgpf interacting boson model

TheSU(3) limit of thesdg-pf interacting boson model is proposed. Applications to the collective states of^236,238U are discussed. It is shown that the spectra can be well described by the model. Project sapported by the National Natural Science Foundation of China (Grant No. 19775025), Science Fund of China Nuclear Industry, Excellent Young University Teachers Fund of China National Education Commitee, Fok YingTung Education Foundation.     

Parallel decomposition of large-scale stochastic nonlinear programs

Many practical decision problems involve both nonlinear relationships and uncertainties. The resulting stochastic nonlinear programs become quite difficult to solve as the number of possible scenarios increases. In this paper, we provide a decomposition method for problems in which nonlinear constraints appear within periods. We also show how the method extends to lower bounding refinements of the set of scenarios when the random data are independent from period to period. We then apply the method to a stochastic model of the U.S. economy based on the Global 2100 method developed by Manne and Richels.This material is based upon work supported by the National Science Foundation under Award Numbers SES-9211937 and DDM-9215921.The research was performed under appointment to the U.S. Department of Energy, Graduate Fellowships for Global Change Program, administered by Oak Ridge Institute for Science and Education.     

The Special Issue Is Dedicated to Prof Li Tatsien on the Occasion of His 70th Birthday

Professor Li has published more than 200 papers and 16 monographs and textbooks, among which 4 monographs are printed in English in U.S.A., U.K. and France respectively. He has received domestic prizes and awards, including: Shanghai Top Science and Technology Award, Hua Loo-Keng Prize of Mathematics, one Second Prize and one Third Prize of National Natural Sciences from the State, one First Prize of Scientific and Technological Progress from the State Education Commission, and one First Prize of Scientific and Technological Progress from Shanghai Municipality. Two of his works are awarded as Excellent University Textbooks from the State. One Exceptional Shanghai Award for Teaching Achievements in Higher Education and one First National Award for Teaching Achievements in Higher Education. Moreover, he has received the Science and Technology Progress Award of Ho Leug Ho Lee Foundation.     

Large-scale linearly constrained optimization

An algorithm for solving large-scale nonlinear programs with linear constraints is presented. The method combines efficient sparse-matrix techniques as in the revised simplex method with stable quasi-Newton methods for handling the nonlinearities. A general-purpose production code (MINOS) is described, along with computational experience on a wide variety of problems.This research was supported by the U.S. Office of Naval Research (Contract N00014-75-C-0267), the National Science Foundation (Grants MCS71-03341 A04, DCR75-04544), the U.S. Energy Research and Development Administration (Contract E(04-3)-326 PA #18), the Victoria University of Wellington, New Zealand, and the Department of Scientific and Industrial Research Wellington, New Zealand.     

On the Predator-Prey System with Holling-（n ＋ 1） Functional Response

The qualitative properties of a predatorprey system with Holling-（n ＋ 1） functional response and a fairly general growth rate are completely investigated. The necessary and sufficient condition to guarantee the uniqueness of limit cycles is given. Our work extends the previous relevant results in the reference.     

The empirical behavior of sampling methods for stochastic programming

We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed software tool executing on a computational grid to solve many large instances of these problems, allowing us to obtain high-quality solutions and to verify optimality and near-optimality of the computed solutions in various ways. Research supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38, and by the National Science Foundation under Grant 9726385. Research supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38, and by the National Science Foundation under Grant DMS-0073770. Research supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38, and by the National Science Foundation under Grants 9726385 and 0082065.     

Error bounds in mathematical programming

Originated from the practical implementation and numerical considerations of iterative methods for solving mathematical programs, the study of error bounds has grown and proliferated in many interesting areas within mathematical programming. This paper gives a comprehensive, state-of-the-art survey of the extensive theory and rich applications of error bounds for inequality and optimization systems and solution sets of equilibrium problems. This work is based on research supported by the U.S. National Science Foundation under grant CCR-9624018.     

Existence Theorems for Variational Inequalities in Banach Spaces

In this paper, by employing the notion of generalized projection operators and the well-known Fan’s lemma, we establish some existence results for the variational inequality problem and the quasivariational inequality problem in reflexive, strictly convex, and smooth Banach spaces. We propose also an iterative method for approximate solutions of the variational inequality problem and we establish some convergence results for this iterative method. L. C. Zeng, His research was partially supported by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Education Institutions of MOE, China and by the Dawn Program Foundation, Shanghai, China. J. C. Yao, His research was partially supported by the National Science Council of the Republic of China     

Teaching for Understanding and Application of Science Knowledge

James Gallagher is Professor of Science Education at Michigan State University and currently co‐editor of Journal of Research in Science Teaching. He was a member of the Working Group on Teaching in the formulation of National Science Education Standards. His recent work has included the me of continuous assessment as a tool to aid teachers in teaching for understanding.     

The maximum principle at infinity for minimal surfaces in flat three manifolds

The research described in this paper was supported by research grant DE-FG02-86ER250125 of the Applied Mathematical Science subprogram of Office of Energy Research, U.S. Department of Energy, and National Science Foundation grant DMS-8611574.     

Quadrilaterals and extremal quasiconformal extensions

We show that the smallest maximal dilatation for a quasiconformal extension of a quasisymmetric function of the unit circle may be larger than indicated by the change in the module of the quadrilaterals with vertices on the circle. The research of the second author has been partially supported by the Alfred P. Sloan Foundation and by the U.S. National Science Foundation grant DMS 94-00999. This research was completed while the first author was visiting the University of Illinois at Urbana-Champaign. He wishes to thank the Department of Mathematics for its kind hospitality.     

Solving combinatorial optimization problems using Karmarkar's algorithm

We describe a cutting plane algorithm for solving combinatorial optimization problems. The primal projective standard-form variant of Karmarkar's algorithm for linear programming is applied to the duals of a sequence of linear programming relaxations of the combinatorial optimization problem.Computational facilities provided by the Cornell Computational Optimization Project supported by NSF Grant DMS-8706133 and by the Cornell National Supercomputer Facility. The Cornell National Supercomputer Facility is a resource of the Center for Theory and Simulation in Science and Engineering at Cornell Unversity, which is funded in part by the National Science Foundation, New York State, and the IBM Corporation. The research of both authors was partially supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.Research partially supported by ONR Grant N00014-90-J-1714.Research partially supported by NSF Grant ECS-8602534 and by ONR Contract N00014-87-K-0212.     

Hybrid Proximal-Point Methods for Common Solutions of Equilibrium Problems and Zeros of Maximal Monotone Operators

The purpose of this paper is to introduce and study two hybrid proximal-point algorithms for finding a common element of the set of solutions of an equilibrium problem and the set of solutions to the equation 0∈Tx for a maximal monotone operator T in a uniformly smooth and uniformly convex Banach space X. Strong and weak convergence results of these two hybrid proximal-point algorithms are established, respectively. The research of L.C. Ceng was partially supported by the National Science Foundation of China (10771141), Ph.D. Program Foundation of Ministry of Education of China (20070270004), Science and Technology Commission of Shanghai Municipality Grant (075105118), Innovation Program of Shanghai Municipal Education Commission (09ZZ133), and Shanghai Leading Academic Discipline Project (S30405). The research of J.C. Yao was partially supported by Grant NSC 97-2115-M-110-001. Research was carried on within the agreement between National Sun Yat-Sen University of Kaohsiung, Taiwan and Pisa University, Pisa, Italy, 2008.     

Classification of Hardy Submodules and Characteristic Space Theory（A Brief and Selective Survey）

This paper is a brief and selective survey on classification of Hardy Submodules over the polydisk. The survey reports some progress in classification of Hardy submodules.     

Two topological properties of topological linear spaces

A topological and a geometrical-topological property, previously known only for normed linear spaces, are established here for much more general classes of topological linear spaces. This research was conducted at the University of Washington in 1963 when the first author was visiting there. The work of both authors was supported in part by the National Science Foundation, U. S. A. (NSF-GP-378).     

Mathematical Literacy and Abstraction in the 21st Century

Ed Dubinsky received his Ph.D. in mathematics from the University of Michigan in 1962 and for the next 25 years engaged in research in theoretical mathematics. In the mid‐80′s he became interested in mathematics education and has worked exclusively in the area since then. In his research, he tries to understand how a person's mind might be working when he or she tries to understand mathematical concepts at the postsecondary level. Based on this research, he has conducted large‐scale curriculum development projects in calculus, discrete mathematics, abstract algebra and cooperative learning. He has been editor or co‐editor of UME Trends, Research in Collegiate Mathematics Education, and the Journal of Computers in Mathematics and Science Teaching. He has held faculty positions at 8 universities in 5 countries on 3 continents: Fourah Bey College (Sierra Leone), University of Ghana, Tulane University, McMaster University, Polish Academy of Sciences, Clarkson University, Purdue University, and Georgia State University. Dr. Dubinsky is presently retired and consults with several universities on education matters.