Downloads & Free Reading Options - Results

This document contains the outline for the Mathematical program offered by the Ordnance Management Engineering Training Agency.

This document contains the outline for the Mathematical program offered by the Ordnance Management Engineering Training Agency.

This document contains the outline for the Mathematical program offered by the Ordnance Management Engineering Training Agency.

This document contains the outline for the Mathematical program offered by the Ordnance Management Engineering Training Agency.

This document contains the outline for the Mathematical program offered by the Ordnance Management Engineering Training Agency.

Mathematical Programming 1995: Volume 70 , Issue Index. Digitized from IA1653230-03 . Previous issue: sim_mathematical-programming_1995-09-28_69_3_0 . Next issue: sim_mathematical-programming_1995-10-20_70_1_0 .

Mathematical Programming 1995: Volume 70 , Issue Index. Digitized from IA1653230-03 . Previous issue: sim_mathematical-programming_1995-09-28_69_3_0 . Next issue: sim_mathematical-programming_1995-10-20_70_1_0 .

Mathematical Programming 1995: Volume 70 , Issue Index. Digitized from IA1653230-03 . Previous issue: sim_mathematical-programming_1995-09-28_69_3_0 . Next issue: sim_mathematical-programming_1995-10-20_70_1_0 .

Mathematical Programming 1995: Volume 70 , Issue Index. Digitized from IA1653230-03 . Previous issue: sim_mathematical-programming_1995-09-28_69_3_0 . Next issue: sim_mathematical-programming_1995-10-20_70_1_0 .

Mathematical Programming 1995: Volume 70 , Issue Index. Digitized from IA1653230-03 . Previous issue: sim_mathematical-programming_1995-09-28_69_3_0 . Next issue: sim_mathematical-programming_1995-10-20_70_1_0 .

Computer Science - Number System Conversion and mathematical operation behind Programming

Mathematical Programming 1992: Volume 55 , Issue Index. Digitized from IA1652525-04 . Previous issue: sim_mathematical-programming_1992-03-16_54_3 . Next issue: sim_mathematical-programming_1992-04-06_55_1 .

Mathematical Programming 1995: Volume 68 , Issue Index. Digitized from IA1652525-04 . Previous issue: sim_mathematical-programming_1994-12-14_67_3 . Next issue: sim_mathematical-programming_1995-01-02_68_1 .

Mathematical Programming 1995: Volume 68 , Issue Index. Digitized from IA1652525-04 . Previous issue: sim_mathematical-programming_1994-12-14_67_3 . Next issue: sim_mathematical-programming_1995-01-02_68_1 .

Mathematical Programming 1995: Volume 68 , Issue Index. Digitized from IA1652525-04 . Previous issue: sim_mathematical-programming_1994-12-14_67_3 . Next issue: sim_mathematical-programming_1995-01-02_68_1 .

The ostensible purpose of a mathematical programming model is to optimize a stipulated objective function subject to stipulated constraints. But its true purpose, at least in strategic applications as every experienced practitioner should know, is to help develop insights into system behavior which in turn can be used to guide the development of effective plans and decisions. Such insights are seldom evident from the output of an optimization run. One must know not only what the optimal solution is for a given set of input data, but also why. This paper advocates the use of highly simplified analytic models to help explain the whys behind the solutions of conventional mathematical programming models. This approach is illustrated with reference to a facility location study carried out recently for a consumer products manufacturer.

This report contains a reasonably complete description of the analytical, geometrical, numerical, and computational aspects of the off-line programming of a rotating-traversing composite filament winding machine for wrapping general axisymmetric surfaces of revolution. The topics addressed are geodesic winding paths, path/angle relations, quasi-geodesic paths, wrappable paths and surfaces, path behavior near turning points, a square root singularity quadrature formula, piecewise linear approximation, path computation, path/ winder relations, winder data generation, time base computation, surface coverage relations, surface buildup relations, function definition, and indefinite integration. Keywords: Differential geometry, Variational calculus, Error analysis. (kr)

A comparison of econometric market simulations of pareto optima with mathematical programming calculations of pareto optima

A comparison of econometric market simulations of pareto optima with mathematical programming calculations of pareto optima

A comparison of econometric market simulations of pareto optima with mathematical programming calculations of pareto optima

In this report, the analysis and programming for various problems in the field of Electromagnetic propagation and antenna design are considered. The scope of our work extended into a variety of technical areas. Among the technical areas are: Magneto-acoustic surface waves, Signal analysis, Polar VLF propagation, Ionospheric pulse reflections, Detection and tracking of targets, and Antenna Design. (Author)

Complete operational and mathematical semantics are presented for a higher order applicative algorithmic language (BAL). Both semantics involve partially ordered domains closed under limits of convergent sequences. Procedure calls are formalized via lambda calculus reductions, or copy rule. Evaluations involve a more general form of computability described as nondeterministic computability. The mathematical semantics is obtained via embeddings in reflexive domains. Both semantics are proved to be equivalent, and several applications are given. The adequacy of the copy rule is proved in standard situations where computability is deterministic. Several examples are presented. (Author)

In this paper, we are concerned with the behaviour of the solutions of problems and also with the Lipschitzian dependence of the set of solutions with respect to the parameter alpha. The paper is organized as follows. The main theorems of the paper are stated. Sufficient conditions are give to have (1) local uniqueness of solutions and (2) Lipschitzian dependence of the solution with respect to the parameter alpha. The proofs of the theorems are given. The main tool, in this analysis, is an implicit function theorem for Lipschitzian mappings due to Clarke (see also Hiriart-Urruty). The main idea is to write the generalized equation as a system of Lipschitzian mapping, to which Clarke's implicit function can be applied. The notion of generalized derivative of the projection mapping on a convex are of particular use.

Mathematical Programming 1996: Volume 73 , Issue Index. Digitized from IA1652525-04 . Previous issue: sim_mathematical-programming_1996-03-31_72_3 . Next issue: sim_mathematical-programming_1996-04-30_73_1 .

Developed and demonstrated here is the design of interface systems for cost-effective communication of the user with the computerized operations research procedures. The concentration is in the area of interfacing methods for implementing the optimization techniques of mathematical programing. Emphasis is given to flexibility of accessing the algorithm, cost-effectiveness, and pedagogical or self-teaching aspects of the interface systems. Methods which take advantage of the characteristics of the input model, for soliciting, storing, and analyzing the input information, are investigated. Concepts in higher level interfacing systems are also explored. Linear programing is the vehicle for experimental development of interface systems. The results are applicable to other mathematical programing procedures. (Author/MP)

The issue of model validation is critical in the formulation and interpretation of mathematical programming models, yet this problem is largely ignored by contemporary modeling languages and the systems they support. This research advanced modeling languages for mathematical programming by providing a formalism and defining a language for specifying a dimensional complement, called typing, to the algebraic representation of models. Typing is a formal specification used to determine automatically whether the algebraic model is well-formed in the sense that its objective junction and constraints are composed of homogeneous components and that operations junction and constraints are composed of homogeneous components and that operations performed using indices are meaningful. A provision is made for the definition of dimensional axioms that can be applied automatically to resolve dimensional differences. The addiction of formal typing to mathematical programming models also yields a powerful abstraction mechanism for integrated modeling.

http://uf.catalog.fcla.edu/uf.jsp?st=UF021395991&ix=pm&I=0&V=D&pm=1

TRI 1 2016/2017

TRI 1 2016/2017

Mathematical Programming 1992: Volume 57 , Issue Index. Digitized from IA1653230-05 . Previous issue: sim_mathematical-programming_1992-10-05_56_3_0 . Next issue: sim_mathematical-programming_1992-05-04_57_1_0 .

Mathematical Programming 1993: Volume 61 , Issue Index. Digitized from IA1652525-04 . Previous issue: sim_mathematical-programming_1993-07-19_60_3 . Next issue: sim_mathematical-programming_1993-08-11_61_1 .

Covering the authors' own state-of-the-art research results, this book presents a rigorous, modern account of the mathematical methods and tools required for the semantic analysis of logic programs. It significantly extends the tools and methods from traditional order theory to include nonconventional methods from mathematical analysis that depend on topology, domain theory, generalized distance functions, and associated fixed-point theory. The authors closely examine the interrelationships between various semantics as well as the integration of logic programming and connectionist systems/neural networks.

Data banks with items calibrated under an item response model can be used for the construction of tests. Mathematical programming models like the Maximin Model are formulated for computerized item selection from a bank. In this paper, mathematical programming models based on the Maximin Model are proposed for the construction of weakly parallel tests. Numerical experiments were conducted to obtain an impression of the practicality of the approach using an item bank of 600 items from college placement mathematics examinations (520 items were from 13 previously administered American College Testing Assessment Program tests, and 80 were from the Collegiate Mathematics Placement Program). Six tests were constructed, and their test information functions were computed. The results demonstrate that tests constructed with the proposed models were near-optimal with respect to the Maximin criteria and were approximately weakly parallel. Five tables present information about the constructed tests. Four graphs illustrate the information functions. (Author/SLD)

Data banks with items calibrated under an item response model can be used for the construction of tests. Mathematical programming models like the Maximin Model are formulated for computerized item selection from a bank. In this paper, mathematical programming models based on the Maximin Model are proposed for the construction of weakly parallel tests. Numerical experiments were conducted to obtain an impression of the practicality of the approach using an item bank of 600 items from college placement mathematics examinations (520 items were from 13 previously administered American College Testing Assessment Program tests, and 80 were from the Collegiate Mathematics Placement Program). Six tests were constructed, and their test information functions were computed. The results demonstrate that tests constructed with the proposed models were near-optimal with respect to the Maximin criteria and were approximately weakly parallel. Five tables present information about the constructed tests. Four graphs illustrate the information functions. (Author/SLD)

Data banks with items calibrated under an item response model can be used for the construction of tests. Mathematical programming models like the Maximin Model are formulated for computerized item selection from a bank. In this paper, mathematical programming models based on the Maximin Model are proposed for the construction of weakly parallel tests. Numerical experiments were conducted to obtain an impression of the practicality of the approach using an item bank of 600 items from college placement mathematics examinations (520 items were from 13 previously administered American College Testing Assessment Program tests, and 80 were from the Collegiate Mathematics Placement Program). Six tests were constructed, and their test information functions were computed. The results demonstrate that tests constructed with the proposed models were near-optimal with respect to the Maximin criteria and were approximately weakly parallel. Five tables present information about the constructed tests. Four graphs illustrate the information functions. (Author/SLD)

Trimester 1 2016/2017

16 leaves

Approved for public release, distribution unlimited.

This paper aims at using a Use-Modify-Create approach to explore students' mathematical problem solving by means of computational thinking (CT) and programming activities. The data collection method is participant observation, in which the researcher also has the role as teacher, guiding the group activities. In our study, two groups of students at the undergraduate level solving a mathematical task. The main finding of the study shows that the progression through the Use-Modify-Create continuum did not work as expected and that the connections between mathematical thinking, computational thinking, and programming proved difficult for the students. Conclusions so far are drawn from the study to promote mathematical problem solving by means of computational thinking and programming in a Use-Modify-Create context. [For the full proceedings, see ED636095.]

This paper explores the application of a mathematical optimization model to the problem of optimal enrollments. The general model, which can be applied to any institution, seeks to enroll the "best" class of students (as defined by the institution) subject to constraints imposed on the institution (e.g., capacity, quality). Topics explored include how the model was applied to actual data and the results of that application. The presentation touches on how well the model mimics "real life," insights that can be gained from the output, the model's limitations, and the modifications that might be warranted to improve performance. (Contains 17 references.) (Author/SLD)

This paper presents an approach to item pool design that has the potential to improve on the quality of current item pools in educational and psychological testing and thus to increase both measurement precision and validity. The approach consists of the application of mathematical programming techniques to calculate optimal blueprints for item pools. These blueprints can be used to guide the item-writing process. Three different types of design problems are discussed: (1) item pools for linear tests; (2) item pools for computerized adaptive testing (CAT); and (3) systems of rotating pools for CAT. The paper concludes with an empirical example of the problem of designing a system or rotating item pools for CAT. (Contains 2 tables and 22 references.) (Author/SLD)

On the theory side, now complexity results were presented for various inter ior linear programming methods. New interior methods with polynomial complexity were described for certain quadratic programming, convex nonlinear programming, integer programming and linear complementarity problems. Strategies have also been developed for retaining polynomial convergence starting from an infeasible point. For all problem categories, properties of Newton's method and of the central path (the trajectory of minimizers of the logarithmic barrier function) play a key role in much of the analysis. A frequent theme is the development of large-step methods that do not require the iterates to follow the central path closely, yet achieve a polynomial complexity bound. Research on the anticipated complexity of certain interior methods may help to explain why the performance of these methods is substantially superior to their worst-case bounds.

There were seven invited lectures and 25 contributed talks at the meeting. The invited talks were on three broad topics: polymorphism, applications of category theory to programming semantics, and concurrency. The specific topics included polymorphism and type theory, the use of functor categories to model ALGOL like languages, linear logic, the semantics of dataflow networks, semantic models of CSP, and the use of probability theory to model nondeterminism.

A unifying framework of concepts central to the optimization of large structured systems is developed and used in the organization of the literature. The basic concepts are divided in two groups, (1) problem manipulations, in which a given problem is restated in an alternative form more amenable to solution, and (2) solution strategies which reduce an optimization problem to a related sequence of simpler problems that can be solved by specialized methods.

A large fleet of aircraft is to be modified by the installation on each aircraft in the fleet of a certain number of engineering change proposal (ECP) kits. the aircraft are deployed in smaller sub-fleets, called field units, at various locations around the world, and the kit installations are to take place at a single contractor facility. Therefore, each of the aircraft must be taken out of operation in the field and sent in to the contractor facility for modification. Each field unit has an authorized strength of aircraft with a specified operational readiness to maintain, permitting only a certain number of aircraft to be away from each field unit at a given time. Furthermore, ECP kits become available over a period of time. At the beginning of the program only certain types of kits are available, and the last type of kit doesn't become available until some time later. Therefore, an aircraft sent in for modification early in the program will not get all of the ECP kits and must be sent back at least a second time. In order to maintain operational readiness, the aircraft should be sent in as few times as possible and brought back as quickly as possible. An optimum solution to the problem of how many aircraft should be sent in and for how long they should remain can be developed using mathematical programming.

The paper studies for mathematical programming methods which are useful in pattern classification. Two of the models are for linearly separable problems, while the others work without separability.

This report illustrates the advantages of using the techniques of mathematical programming during an Air Defense exercise. It is directed toward the optimal deployment of Air Defense resources rather than any new methods of weapon system operations. Three levels of command in the United States Army Air Defense structure are involved in this study: the Group, the Battalion, and the Battery. Analytic modeling, linear and integer programming, network theory, and dynamic programming are used to develop this new approach for improved command and control at two of these levels. The immediate benefit of this approach is a reduction in personnel requirements in the command center, shorter response time, and optimal allocation of very scarce Air Defense resources. By applying very basic techniques of mathematical programming, the Army Air Defense field operations can be considerably improved. (Author)

A three unit mathematics course entitled Introduction to Computing evaluated the effectiveness of programing as an aid to learning math concepts and to developing student self-reliance. Sixteen students enrolled in the course at the College of Notre Dame in Belmont, California; one terminal was available, connected to the Stanford Computation Center IBM 360/67, and the interactive mode and BASIC were used. Two texts were required--BASIC Manual and Notes for BASIC. Students solved two problems a week in algebra, calculus, or linear algebra for the first eight weeks, providing problem descriptions, flowcharts, program listings, sample outputs, conjectures, and conclusions. In the last half of the course each student completed a major individual project. The teacher lectured on programing concepts and BASIC in the early part of the course and then served mainly as a resource person and consultant for the final 12 weeks of the semester. The course was deemed successful, for the students learned mathematical concepts well, developed creative approaches to independent problem solving, and developed an esprit de corps. An expanded version of the course will be taught to large groups in future years. (PB)

The final report of this study describes the objectives and plan of attack used for determining how novice students learn to interact with a computer and how instruction can result in meaningful learning. Changes to the original plans and significant outcomes are mentioned. The final report concludes with abstracts of research findings on the effects of models, the effects of practice questions and aptitude effects of program representations, and effects of computational vs. meaningful practice in programed instruction. A list of papers published and delivered under this study is provided. "Instructional Variables in Meaningful Learning of Computer Programing," a paper from the study, is appended to the final report. Additional appendixes contains the text of the model and rule booklets, typical practice and test questions and a pretest used in the study. (CH)

zsrr