Science.gov

Sample records for geometric programming problem

  1. Chemical Equilibrium Problems Treated by Geometric and Transcendental Programming

    DTIC Science & Technology

    1975-04-01

    RCRPONMINO ORCANIZATION NAMt AND ADORCU Department of Operations Research Stanford University Stanford, CA 95305 M. CONTROLLINO OFFICE NAME AND...Equilibrium 86 6.2 Verification of the Model 88 6.3 Sensitivity Analysis 92 6.4 Coaling Problems 99 7 A DUAL CHEMICAL ALGORITHM 108 7.1 Introduction...experience and judgment. In general the choice of species is up to the designer of the model. The mathematical analysis of the system assumes a given set

  2. Solving a class of geometric programming problems by an efficient dynamic model

    NASA Astrophysics Data System (ADS)

    Nazemi, Alireza; Sharifi, Elahe

    2013-03-01

    In this paper, a neural network model is constructed on the basis of the duality theory, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalle invariance principle to solve geometric programming (GP) problems. The main idea is to convert the GP problem into an equivalent convex optimization problem. A neural network model is then constructed for solving the obtained convex programming problem. By employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact optimal solution of the original problem. The simulation results also show that the proposed neural network is feasible and efficient.

  3. MM Algorithms for Geometric and Signomial Programming.

    PubMed

    Lange, Kenneth; Zhou, Hua

    2014-02-01

    This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimum points. Conditions under which the minimum point is unique or occurs in the interior of parameter space are proved for geometric programming. Convergence to an interior point occurs at a linear rate. Finally, the MM framework easily accommodates equality and inequality constraints of signomial type. For the most important special case, constrained quadratic programming, the MM algorithm involves very simple updates.

  4. MM Algorithms for Geometric and Signomial Programming

    PubMed Central

    Lange, Kenneth; Zhou, Hua

    2013-01-01

    This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimum points. Conditions under which the minimum point is unique or occurs in the interior of parameter space are proved for geometric programming. Convergence to an interior point occurs at a linear rate. Finally, the MM framework easily accommodates equality and inequality constraints of signomial type. For the most important special case, constrained quadratic programming, the MM algorithm involves very simple updates. PMID:24634545

  5. Optimization of biotechnological systems through geometric programming

    PubMed Central

    Marin-Sanguino, Alberto; Voit, Eberhard O; Gonzalez-Alcon, Carlos; Torres, Nestor V

    2007-01-01

    Background In the past, tasks of model based yield optimization in metabolic engineering were either approached with stoichiometric models or with structured nonlinear models such as S-systems or linear-logarithmic representations. These models stand out among most others, because they allow the optimization task to be converted into a linear program, for which efficient solution methods are widely available. For pathway models not in one of these formats, an Indirect Optimization Method (IOM) was developed where the original model is sequentially represented as an S-system model, optimized in this format with linear programming methods, reinterpreted in the initial model form, and further optimized as necessary. Results A new method is proposed for this task. We show here that the model format of a Generalized Mass Action (GMA) system may be optimized very efficiently with techniques of geometric programming. We briefly review the basics of GMA systems and of geometric programming, demonstrate how the latter may be applied to the former, and illustrate the combined method with a didactic problem and two examples based on models of real systems. The first is a relatively small yet representative model of the anaerobic fermentation pathway in S. cerevisiae, while the second describes the dynamics of the tryptophan operon in E. coli. Both models have previously been used for benchmarking purposes, thus facilitating comparisons with the proposed new method. In these comparisons, the geometric programming method was found to be equal or better than the earlier methods in terms of successful identification of optima and efficiency. Conclusion GMA systems are of importance, because they contain stoichiometric, mass action and S-systems as special cases, along with many other models. Furthermore, it was previously shown that algebraic equivalence transformations of variables are sufficient to convert virtually any types of dynamical models into the GMA form. Thus

  6. A geometrical perspective for the bargaining problem.

    PubMed

    Wong, Kelvin Kian Loong

    2010-04-26

    A new treatment to determine the Pareto-optimal outcome for a non-zero-sum game is presented. An equilibrium point for any game is defined here as a set of strategy choices for the players, such that no change in the choice of any single player will increase the overall payoff of all the players. Determining equilibrium for multi-player games is a complex problem. An intuitive conceptual tool for reducing the complexity, via the idea of spatially representing strategy options in the bargaining problem is proposed. Based on this geometry, an equilibrium condition is established such that the product of their gains over what each receives is maximal. The geometrical analysis of a cooperative bargaining game provides an example for solving multi-player and non-zero-sum games efficiently.

  7. Geometric Modeling Application Interface Program

    DTIC Science & Technology

    1990-11-01

    run-time environment must satisfy the interlanguage communication requirements of all the languages involved. This appendix discusses the HAS... interlanguage environment conventions and the composition of the PASCAL dynamic storage areas. Examples are given for a FORTRAN program that uses HAS routines... INTERLANGUAGE CONVENTIONS When the HAS subprograms were compiled, they were defined as PROCEDUREs using SUBPROGRAM declarations. The subprogram

  8. Geometric Error Analysis in Applied Calculus Problem Solving

    ERIC Educational Resources Information Center

    Usman, Ahmed Ibrahim

    2017-01-01

    The paper investigates geometric errors students made as they tried to use their basic geometric knowledge in the solution of the Applied Calculus Optimization Problem (ACOP). Inaccuracies related to the drawing of geometric diagrams (visualization skills) and those associated with the application of basic differentiation concepts into ACOP…

  9. Calculus students' ability to solve geometric related-rates problems

    NASA Astrophysics Data System (ADS)

    Martin, Tami

    2000-09-01

    This study assessed the ability of university students enrolled in an introductory calculus course to solve related-rates problems set in geometric contexts. Students completed a problem-solving test and a test of performance on the individual steps involved in solving such problems. Each step was characterised as primarily relying on procedural knowledge or conceptual understanding. Results indicated that overall performance on the geometric related-rates problems was poor. The poorest performance was on steps linked to conceptual understanding, specifically steps involving the translation of prose to geometric and symbolic representations. Overall performance was most strongly related to performance on the procedural steps.

  10. Algebraic and Geometric Approach in Function Problem Solving

    ERIC Educational Resources Information Center

    Mousoulides, Nikos; Gagatsis, Athanasios

    2004-01-01

    This study explores students algebraic and geometric approach in solving tasks in functions and the relation of these approaches with complex geometric problem solving. Data were obtained from 95 sophomore pre-service teachers, enrolled in a basic algebra course. Implicative statistical analysis was performed to evaluate the relation between…

  11. Geometrical aspects on the dark matter problem

    SciTech Connect

    Capistrano, A.J.S.; Cabral, L.A.

    2014-09-15

    In the present paper we apply Nash’s theory of perturbative geometry to the study of dark matter gravity in a higher-dimensional space–time. It is shown that the dark matter gravitational perturbations at local scale can be explained by the extrinsic curvature of the standard cosmology. In order to test our model, we use a spherically symmetric metric embedded in a five-dimensional bulk. As a result, considering a sample of 10 low surface brightness and 6 high surface brightness galaxies, we find a very good agreement with the observed rotation curves of smooth hybrid alpha-HI measurements. - Highlights: • The metric perturbation and the embedding lead naturally to a “brane-world”-like higher dimensional structure. • Nash’s theorem as a cornerstone of the formation of geometrical structures. • The dark matter gravitational perturbations at local scale can be explained by the extrinsic curvature. • A good agreement was found with the observed rotation curves of smooth hybrid alpha-HI measurements.

  12. Geometric and analytic problems on bicomplex plane

    NASA Astrophysics Data System (ADS)

    Dimiev, Stancho; Stoev, Peter; Stoilova, Stanislava

    2015-11-01

    Let us recall that the bicomplex plane is a complex ring of complex dimension 2. It consists of couples of the kind (z, w) = z + jw, where z and w are complex numbers and j is a symbol with the property j2 = -1. We note that the bicomplex plane admits singular points. The set of these singular points coincides with the cross-choped set of complex bisectrices (z, ±z), z is a complex. The main problem in the function theory on the bicomplex plane is to describe the interconnection between the same theory of the cross-choped subset and whole bicomplex plane. The first theory is of one complex variable and the second one is of two complex variables. Another problems are related with the comformal mappings and the movement of a partials of this subset on the whole one. Presented paper is a start studies in this direction.

  13. Bounding solutions of geometrically nonlinear viscoelastic problems

    NASA Technical Reports Server (NTRS)

    Stubstad, J. M.; Simitses, G. J.

    1986-01-01

    Integral transform techniques, such as the Laplace transform, provide simple and direct methods for solving viscoelastic problems formulated within a context of linear material response and using linear measures for deformation. Application of the transform operator reduces the governing linear integro-differential equations to a set of algebraic relations between the transforms of the unknown functions, the viscoelastic operators, and the initial and boundary conditions. Inversion either directly or through the use of the appropriate convolution theorem, provides the time domain response once the unknown functions have been expressed in terms of sums, products or ratios of known transforms. When exact inversion is not possible approximate techniques may provide accurate results. The overall problem becomes substantially more complex when nonlinear effects must be included. Situations where a linear material constitutive law can still be productively employed but where the magnitude of the resulting time dependent deformations warrants the use of a nonlinear kinematic analysis are considered. The governing equations will be nonlinear integro-differential equations for this class of problems. Thus traditional as well as approximate techniques, such as cited above, cannot be employed since the transform of a nonlinear function is not explicitly expressible.

  14. Bounding solutions of geometrically nonlinear viscoelastic problems

    NASA Technical Reports Server (NTRS)

    Stubstad, J. M.; Simitses, G. J.

    1985-01-01

    Integral transform techniques, such as the Laplace transform, provide simple and direct methods for solving viscoelastic problems formulated within a context of linear material response and using linear measures for deformation. Application of the transform operator reduces the governing linear integro-differential equations to a set of algebraic relations between the transforms of the unknown functions, the viscoelastic operators, and the initial and boundary conditions. Inversion either directly or through the use of the appropriate convolution theorem, provides the time domain response once the unknown functions have been expressed in terms of sums, products or ratios of known transforms. When exact inversion is not possible approximate techniques may provide accurate results. The overall problem becomes substantially more complex when nonlinear effects must be included. Situations where a linear material constitutive law can still be productively employed but where the magnitude of the resulting time dependent deformations warrants the use of a nonlinear kinematic analysis are considered. The governing equations will be nonlinear integro-differential equations for this class of problems. Thus traditional as well as approximate techniques, such as cited above, cannot be employed since the transform of a nonlinear function is not explicitly expressible.

  15. Control of tree water networks: A geometric programming approach

    NASA Astrophysics Data System (ADS)

    Sela Perelman, L.; Amin, S.

    2015-10-01

    This paper presents a modeling and operation approach for tree water supply systems. The network control problem is approximated as a geometric programming (GP) problem. The original nonlinear nonconvex network control problem is transformed into a convex optimization problem. The optimization model can be efficiently solved to optimality using state-of-the-art solvers. Two control schemes are presented: (1) operation of network actuators (pumps and valves) and (2) controlled demand shedding allocation between network consumers with limited resources. The dual of the network control problem is formulated and is used to perform sensitivity analysis with respect to hydraulic constraints. The approach is demonstrated on a small branched-topology network and later extended to a medium-size irrigation network. The results demonstrate an intrinsic trade-off between energy costs and demand shedding policy, providing an efficient decision support tool for active management of water systems.

  16. Iso-geometric analysis for neutron diffusion problems

    SciTech Connect

    Hall, S. K.; Eaton, M. D.; Williams, M. M. R.

    2012-07-01

    Iso-geometric analysis can be viewed as a generalisation of the finite element method. It permits the exact representation of a wider range of geometries including conic sections. This is possible due to the use of concepts employed in computer-aided design. The underlying mathematical representations from computer-aided design are used to capture both the geometry and approximate the solution. In this paper the neutron diffusion equation is solved using iso-geometric analysis. The practical advantages are highlighted by looking at the problem of a circular fuel pin in a square moderator. For this problem the finite element method requires the geometry to be approximated. This leads to errors in the shape and size of the interface between the fuel and the moderator. In contrast to this iso-geometric analysis allows the interface to be represented exactly. It is found that, due to a cancellation of errors, the finite element method converges more quickly than iso-geometric analysis for this problem. A fuel pin in a vacuum was then considered as this problem is highly sensitive to the leakage across the interface. In this case iso-geometric analysis greatly outperforms the finite element method. Due to the improvement in the representation of the geometry iso-geometric analysis can outperform traditional finite element methods. It is proposed that the use of iso-geometric analysis on neutron transport problems will allow deterministic solutions to be obtained for exact geometries. Something that is only currently possible with Monte Carlo techniques. (authors)

  17. Geometric modeling in the problem of ball bearing accuracy

    NASA Astrophysics Data System (ADS)

    Glukhov, V. I.; Pushkarev, V. V.; Khomchenko, V. G.

    2017-06-01

    The manufacturing quality of ball bearings is an urgent problem for machine-building industry. The aim of the research is to improve the geometric specifications accuracy of bearings based on evidence-based systematic approach and the method of adequate size, location and form deviations modeling of the rings and assembled ball bearings. The present work addressed the problem of bearing geometric specifications identification and the study of these specifications. The deviation from symmetric planar of rings and bearings assembly and mounting width are among these specifications. A systematic approach to geometric specifications values and ball bearings tolerances normalization in coordinate systems will improve the quality of bearings by optimizing and minimizing the number of specifications. The introduction of systematic approach to the international standards on rolling bearings is a guarantee of a significant increase in accuracy of bearings and the quality of products where they are applied.

  18. The lawnmower problem and other geometric path covering problems

    SciTech Connect

    Fekete, S.; Arkin, E.; Mitchell, J.

    1994-12-31

    We discuss the Lawnmower Problem: Given a polygonal region, find the shortest closed path along which we have to move a given object (typically a square or a circle), such that any point of the region will be covered by the object for some position of it movement. In another version of the problem, known as the Milling Problem, the object has to stay within the region at all times. Practical motivations for considering the Lawnmower Problem come from manufacturing (spray painting, quality control), geography (aerial surveys), optimization (tour planning for a large number of clients with limited mobility), and gardening. The Milling Problem has gained attention by its importance for NC pocket machining. We show that both problems are NP-hard and discuss approximation methods for various versions of the problem.

  19. Geometric programming prediction of design trends for OMV protective structures

    NASA Technical Reports Server (NTRS)

    Mog, R. A.; Horn, J. R.

    1990-01-01

    The global optimization trends of protective honeycomb structural designs for spacecraft subject to hypervelocity meteroid and space debris are presented. This nonlinear problem is first formulated for weight minimization of the orbital maneuvering vehicle (OMV) using a generic monomial predictor. Five problem formulations are considered, each dependent on the selection of independent design variables. Each case is optimized by considering the dual geometric programming problem. The dual variables are solved for in terms of the generic estimated exponents of the monomial predictor. The primal variables are then solved for by conversion. Finally, parametric design trends are developed for ranges of the estimated regression parameters. Results specify nonmonotonic relationships for the optimal first and second sheet mass per unit areas in terms of the estimated exponents.

  20. Tangram solved? Prefrontal cortex activation analysis during geometric problem solving.

    PubMed

    Ayaz, Hasan; Shewokis, Patricia A; Izzetoğlu, Meltem; Çakır, Murat P; Onaral, Banu

    2012-01-01

    Recent neuroimaging studies have implicated prefrontal and parietal cortices for mathematical problem solving. Mental arithmetic tasks have been used extensively to study neural correlates of mathematical reasoning. In the present study we used geometric problem sets (tangram tasks) that require executive planning and visuospatial reasoning without any linguistic representation interference. We used portable optical brain imaging (functional near infrared spectroscopy--fNIR) to monitor hemodynamic changes within anterior prefrontal cortex during tangram tasks. Twelve healthy subjects were asked to solve a series of computerized tangram puzzles and control tasks that required same geometric shape manipulation without problem solving. Total hemoglobin (HbT) concentration changes indicated a significant increase during tangram problem solving in the right hemisphere. Moreover, HbT changes during failed trials (when no solution found) were significantly higher compared to successful trials. These preliminary results suggest that fNIR can be used to assess cortical activation changes induced by geometric problem solving. Since fNIR is safe, wearable and can be used in ecologically valid environments such as classrooms, this neuroimaging tool may help to improve and optimize learning in educational settings.

  1. Study of Historical Geometric Problems by Means of CAS and DGS

    ERIC Educational Resources Information Center

    Hašek, Roman; Zahradník, Jan

    2015-01-01

    The use of the dynamic mathematics software GeoGebra to solve geometric problems on conics and loci from an 18th century textbook will be presented. In particular, examples will be shown of how the use of this program helped the authors to understand the method that our predecessors used to deal with conic sections together with solving loci…

  2. Geometric programming design of spacecraft protective structures to defeat earth-orbital space debris

    NASA Technical Reports Server (NTRS)

    Mog, Robert A.; Price, D. Marvin

    1990-01-01

    A unique methodology providing global optimization of spacecraft protective structures is presented. The Geometric Programming optimization technique, which has a long history of application to structural design problems, is employed to minimize spacecraft weight of protective structural systems exposed to meteoroid and space debris hypervelocity impacts. The space debris and meteoroid environment are defined followed by the formulation of the general weight objective function. The Wilkinson, Burch, and Nysmith hypervelocity impact predictor models are then used in example cases to display Geometric Programming capabilities. Results show that global nonlinear design optimization can be performed for hypervelocity impact models that follow the Geometric Programming form.

  3. GEOMETRIC PROGRAMMING, CHEMICAL EQUILIBRIUM, AND THE ANTI-ENTROPY FUNCTION*

    PubMed Central

    Duffin, R. J.; Zener, C.

    1969-01-01

    The culmination of this paper is the following duality principle of thermodynamics: maximum S = minimum S*. (1) The left side of relation (1) is the classical characterization of equilibrium. It says to maximize the entropy function S with respect to extensive variables which are subject to certain constraints. The right side of (1) is a new characterization of equilibrium and concerns minimization of an anti-entropy function S* with respect to intensive variables. Relation (1) is applied to the chemical equilibrium of a mixture of gases at constant temperature and volume. Then (1) specializes to minimum F = maximum F*, (2) where F is the Helmholtz function for free energy and F* is an anti-Helmholtz function. The right-side of (2) is an unconstrained maximization problem and gives a simplified practical procedure for calculating equilibrium concentrations. We also give a direct proof of (2) by the duality theorem of geometric programming. The duality theorem of geometric programming states that minimum cost = maximum anti-cost. (30) PMID:16591769

  4. Geometric MCMC for infinite-dimensional inverse problems

    NASA Astrophysics Data System (ADS)

    Beskos, Alexandros; Girolami, Mark; Lan, Shiwei; Farrell, Patrick E.; Stuart, Andrew M.

    2017-04-01

    Bayesian inverse problems often involve sampling posterior distributions on infinite-dimensional function spaces. Traditional Markov chain Monte Carlo (MCMC) algorithms are characterized by deteriorating mixing times upon mesh-refinement, when the finite-dimensional approximations become more accurate. Such methods are typically forced to reduce step-sizes as the discretization gets finer, and thus are expensive as a function of dimension. Recently, a new class of MCMC methods with mesh-independent convergence times has emerged. However, few of them take into account the geometry of the posterior informed by the data. At the same time, recently developed geometric MCMC algorithms have been found to be powerful in exploring complicated distributions that deviate significantly from elliptic Gaussian laws, but are in general computationally intractable for models defined in infinite dimensions. In this work, we combine geometric methods on a finite-dimensional subspace with mesh-independent infinite-dimensional approaches. Our objective is to speed up MCMC mixing times, without significantly increasing the computational cost per step (for instance, in comparison with the vanilla preconditioned Crank-Nicolson (pCN) method). This is achieved by using ideas from geometric MCMC to probe the complex structure of an intrinsic finite-dimensional subspace where most data information concentrates, while retaining robust mixing times as the dimension grows by using pCN-like methods in the complementary subspace. The resulting algorithms are demonstrated in the context of three challenging inverse problems arising in subsurface flow, heat conduction and incompressible flow control. The algorithms exhibit up to two orders of magnitude improvement in sampling efficiency when compared with the pCN method.

  5. Programming and Problem Solving.

    ERIC Educational Resources Information Center

    Elias, Barbara P.

    A study was conducted to examine computer programming as a problem solving activity. Thirteen fifth grade children were selected by their teacher from an above average class to use Apple IIe microcomputers. The investigator conducted sessions of 40-50 minutes with the children in groups of two or three. Four problems, incorporating the programming…

  6. Failure of geometric electromagnetism in the adiabatic vector Kepler problem

    SciTech Connect

    Anglin, J.R.; Schmiedmayer, J.

    2004-02-01

    The magnetic moment of a particle orbiting a straight current-carrying wire may precess rapidly enough in the wire's magnetic field to justify an adiabatic approximation, eliminating the rapid time dependence of the magnetic moment and leaving only the particle position as a slow degree of freedom. To zeroth order in the adiabatic expansion, the orbits of the particle in the plane perpendicular to the wire are Keplerian ellipses. Higher-order postadiabatic corrections make the orbits precess, but recent analysis of this 'vector Kepler problem' has shown that the effective Hamiltonian incorporating a postadiabatic scalar potential ('geometric electromagnetism') fails to predict the precession correctly, while a heuristic alternative succeeds. In this paper we resolve the apparent failure of the postadiabatic approximation, by pointing out that the correct second-order analysis produces a third Hamiltonian, in which geometric electromagnetism is supplemented by a tensor potential. The heuristic Hamiltonian of Schmiedmayer and Scrinzi is then shown to be a canonical transformation of the correct adiabatic Hamiltonian, to second order. The transformation has the important advantage of removing a 1/r{sup 3} singularity which is an artifact of the adiabatic approximation.

  7. Scale Problems in Geometric-Kinematic Modelling of Geological Objects

    NASA Astrophysics Data System (ADS)

    Siehl, Agemar; Thomsen, Andreas

    To reveal, to render and to handle complex geological objects and their history of structural development, appropriate geometric models have to be designed. Geological maps, sections, sketches of strain and stress patterns are such well-known analogous two-dimensional models. Normally, the set of observations and measurements supporting them is small in relation to the complexity of the real objects they derive from. Therefore, modelling needs guidance by additional expert knowledge to bridge empty spaces which are not supported by data. Generating digital models of geological objects has some substantial advantages compared to conventional methods, especially if they are supported by an efficient database management system. Consistent 3D models of some complexity can be created, and experiments with time-dependent geological geometries may help to restore coherent sequences of paleogeological states. In order to cope with the problems arising from the combined usage of 3D-geometry models of different scale and resolution within an information system on subsurface geology, geometrical objects need to be annotated with information on the context, within which the geometry model has been established and within which it is valid, and methods supporting storage and retrieval as well as manipulation of geometry at different scales must also take into account and handle such context information to achieve meaningful results. An example is given of a detailed structural study of an open pit lignite mine in the Lower Rhine Basin.

  8. Investigation of the Computational Utility of Geometric Programming Formulation and Algorithms.

    DTIC Science & Technology

    1981-01-01

    Programming (GP) is a body of theoretical and algorithmic results concerned with constrained optimization problems involving a class of nonlinear ...South Wales, Australia, 1974. 17. M. Ratner, L.S. Lasdon, and A. Jain, "Solving Geometric Programs using GRG : Results and Comparisons", J. Optimization ...computational tests in the study will be performed using the leading specialized GP and GGP codes as well as a selection of general nonlinear programing codes

  9. Strengthening Programs through Problem Solving.

    ERIC Educational Resources Information Center

    Dyer, Jim

    1993-01-01

    Describes a secondary agricultural education program that was a dumping ground for academically disadvantaged students. Discusses how such a program can be improved by identifying problems and symptoms, treating problems, and goal setting. (JOW)

  10. Strengthening Programs through Problem Solving.

    ERIC Educational Resources Information Center

    Dyer, Jim

    1993-01-01

    Describes a secondary agricultural education program that was a dumping ground for academically disadvantaged students. Discusses how such a program can be improved by identifying problems and symptoms, treating problems, and goal setting. (JOW)

  11. Applying genetic programming and ant colony optimisation to improve the geometric design of a reflector

    NASA Astrophysics Data System (ADS)

    Hsu, Chih-Ming

    2012-05-01

    The lighting performance of an LED (light-emitting diode) flash is significantly influenced by the geometric form of a reflector. Previously, design engineers have usually determined the geometric design of a reflector according to the principles of optics and their own experience. Some real reflectors have then been created to verify the feasibility and performance of a certain geometric design. This, however, is a costly and time-consuming procedure. Furthermore, the geometric design of a reflector cannot be proven to be actually optimal. This study proposes a systematic approach based on genetic programming (GP) and ant colony optimisation (ACO), called the GP-ACO procedure, to improve the geometric design of a reflector. A case study is used to demonstrate the feasibility and effectiveness of the proposed optimisation procedure. The results show that all the crucial quality characteristics of an LED flash fulfil the required specifications; thus, the optimal geometric parameter settings of the reflector obtained can be directly applied to mass production. Consequently, the proposed GP-ACO procedure can be considered an effective method for resolving general multi-response parameter design problems.

  12. Development of computer program NAS3D using Vector processing for geometric nonlinear analysis of structures

    NASA Technical Reports Server (NTRS)

    Mangalgiri, P. D.; Prabhakaran, R.

    1986-01-01

    An algorithm for vectorized computation of stiffness matrices of an 8 noded isoparametric hexahedron element for geometric nonlinear analysis was developed. This was used in conjunction with the earlier 2-D program GAMNAS to develop the new program NAS3D for geometric nonlinear analysis. A conventional, modified Newton-Raphson process is used for the nonlinear analysis. New schemes for the computation of stiffness and strain energy release rates is presented. The organization the program is explained and some results on four sample problems are given. The study of CPU times showed that savings by a factor of 11 to 13 were achieved when vectorized computation was used for the stiffness instead of the conventional scalar one. Finally, the scheme of inputting data is explained.

  13. A solution to the surface intersection problem. [Boolean functions in geometric modeling

    NASA Technical Reports Server (NTRS)

    Timer, H. G.

    1977-01-01

    An application-independent geometric model within a data base framework should support the use of Boolean operators which allow the user to construct a complex model by appropriately combining a series of simple models. The use of these operators leads to the concept of implicitly and explicitly defined surfaces. With an explicitly defined model, the surface area may be computed by simply summing the surface areas of the bounding surfaces. For an implicitly defined model, the surface area computation must deal with active and inactive regions. Because the surface intersection problem involves four unknowns and its solution is a space curve, the parametric coordinates of each surface must be determined as a function of the arc length. Various subproblems involved in the general intersection problem are discussed, and the mathematical basis for their solution is presented along with a program written in FORTRAN IV for implementation on the IBM 370 TSO system.

  14. Problem Solving and Beginning Programming.

    ERIC Educational Resources Information Center

    McAllister, Alan

    Based on current models of problem solving within cognitive psychology, this study focused on the spontaneous problem solving strategies used by children as they first learned LOGO computer programming, and on strategy transformations that took place during the problem solving process. The research consisted of a six weeks programming training…

  15. New Protocols for Solving Geometric Calculation Problems Incorporating Dynamic Geometry and Computer Algebra Software.

    ERIC Educational Resources Information Center

    Schumann, Heinz; Green, David

    2000-01-01

    Discusses software for geometric construction, measurement, and calculation, and software for numerical calculation and symbolic analysis that allows for new approaches to the solution of geometric problems. Illustrates these computer-aided graphical, numerical, and algebraic methods of solution and discusses examples using the appropriate choice…

  16. Articulation of Spatial and Geometrical Knowledge in Problem Solving with Technology at Primary School

    ERIC Educational Resources Information Center

    Soury-Lavergne, Sophie; Maschietto, Michela

    2015-01-01

    Our paper focuses on the relationship between spatial and geometrical knowledge in problem solving situations at primary school. We have created tasks that involve three different spaces: physical space, graphical space and geometrical space. We aim to study the specific role of graphical space as a bridge between the other two spaces using paper…

  17. Articulation of Spatial and Geometrical Knowledge in Problem Solving with Technology at Primary School

    ERIC Educational Resources Information Center

    Soury-Lavergne, Sophie; Maschietto, Michela

    2015-01-01

    Our paper focuses on the relationship between spatial and geometrical knowledge in problem solving situations at primary school. We have created tasks that involve three different spaces: physical space, graphical space and geometrical space. We aim to study the specific role of graphical space as a bridge between the other two spaces using paper…

  18. New Protocols for Solving Geometric Calculation Problems Incorporating Dynamic Geometry and Computer Algebra Software.

    ERIC Educational Resources Information Center

    Schumann, Heinz; Green, David

    2000-01-01

    Discusses software for geometric construction, measurement, and calculation, and software for numerical calculation and symbolic analysis that allows for new approaches to the solution of geometric problems. Illustrates these computer-aided graphical, numerical, and algebraic methods of solution and discusses examples using the appropriate choice…

  19. Geometric Modeling Applications Interface Program (GMAP). Volume 2. Program Description

    DTIC Science & Technology

    1989-09-01

    Retirement for Cause ..................................................... 3- 41 3-21 Interrelationship of GMAP Documents...M a 9 2a. ~* .E 0 4) -------- U- 00 004-4 a___ cam 0 0 Z CL cw; 3- 41 CI FTR560240001U September 1989 Initially, GMAP looked at several programs...oteInpcinPanGnrto Sub System Intgratof IBIs.tfaiithPats hinecto AMofa Syservic Rene aoressr bade fo sufaenoaiesuin fluo.ResCInteetrface inspetin. ee eainhp 3.3.21

  20. Towards programming immune tolerance through geometric manipulation of phosphatidylserine

    PubMed Central

    Johnson, Brandon M.; Short, Patrick J.; McKinnon, Karen P.; Reisdorf, Shannon; Luft, J. Christopher; DeSimone, Joseph M.

    2016-01-01

    The possibility of engineering the immune system in a targeted fashion using biomaterials such as nanoparticles has made considerable headway in recent years. However, little is known as to how modulating the spatial presentation of a ligand augments downstream immune responses. In this report we show that geometric manipulation of phosphatidylserine (PS) through fabrication on rod-shaped PLGA nanoparticles robustly dampens inflammatory responses from innate immune cells while promoting T regulatory cell abundance by impeding effector T cell expansion. This response depends on the geometry of PS presentation as both PS liposomes and 1 micron cylindrical PS-PLGA particles are less potent signal inducers than 80 × 320 nm rod-shaped PS-PLGA particles for an equivalent dose of PS. We show that this immune tolerizing effect can be co-opted for therapeutic benefit in a mouse model of multiple sclerosis and an assay of organ rejection using a mixed lymphocyte reaction with primary human immune cells. These data provide evidence that geometric manipulation of a ligand via biomaterials may enable more efficient and tunable programming of cellular signaling networks for therapeutic benefit in a variety of disease states, including autoimmunity and organ rejection, and thus should be an active area of further research. PMID:26325217

  1. Towards programming immune tolerance through geometric manipulation of phosphatidylserine.

    PubMed

    Roberts, Reid A; Eitas, Timothy K; Byrne, James D; Johnson, Brandon M; Short, Patrick J; McKinnon, Karen P; Reisdorf, Shannon; Luft, J Christopher; DeSimone, Joseph M; Ting, Jenny P

    2015-12-01

    The possibility of engineering the immune system in a targeted fashion using biomaterials such as nanoparticles has made considerable headway in recent years. However, little is known as to how modulating the spatial presentation of a ligand augments downstream immune responses. In this report we show that geometric manipulation of phosphatidylserine (PS) through fabrication on rod-shaped PLGA nanoparticles robustly dampens inflammatory responses from innate immune cells while promoting T regulatory cell abundance by impeding effector T cell expansion. This response depends on the geometry of PS presentation as both PS liposomes and 1 micron cylindrical PS-PLGA particles are less potent signal inducers than 80 × 320 nm rod-shaped PS-PLGA particles for an equivalent dose of PS. We show that this immune tolerizing effect can be co-opted for therapeutic benefit in a mouse model of multiple sclerosis and an assay of organ rejection using a mixed lymphocyte reaction with primary human immune cells. These data provide evidence that geometric manipulation of a ligand via biomaterials may enable more efficient and tunable programming of cellular signaling networks for therapeutic benefit in a variety of disease states, including autoimmunity and organ rejection, and thus should be an active area of further research.

  2. Geometric Series: A New Solution to the Dog Problem

    ERIC Educational Resources Information Center

    Dion, Peter; Ho, Anthony

    2013-01-01

    This article describes what is often referred to as the dog, beetle, mice, ant, or turtle problem. Solutions to this problem exist, some being variations of each other, which involve mathematics of a wide range of complexity. Herein, the authors describe the intuitive solution and the calculus solution and then offer a completely new solution…

  3. Developing Shift Problems to Foster Geometrical Proof and Understanding

    ERIC Educational Resources Information Center

    Palha, Sonia; Dekker, Rijkje; Gravemeijer, Koeno; van Hout-Wolters, Bernadette

    2013-01-01

    Meaningful learning of formal mathematics in regular classrooms remains a problem in mathematics education. Research shows that instructional approaches in which students work collaboratively on tasks that are tailored to problem solving and reflection can improve students' learning in experimental classrooms. However, these sequences involve…

  4. Geometric Problem Solving Abilities of Children in the Primary Grades.

    ERIC Educational Resources Information Center

    Bright, George W.

    The problem investigated was the analysis of a complex figure by identifying simpler figures embedded in it. The primary goal was to determine the level of sophistication of analysis employed by children in the primary grades; a secondary goal was to determine if students could be led to expand their analyses. Drawings and problems were prepared…

  5. The Future Problem Solving Program.

    ERIC Educational Resources Information Center

    Crabbe, Anne B.

    1989-01-01

    Describes the Future Problem Solving Program, in which students from the U.S. and around the world are tackling some complex challenges facing society, ranging from acid rain to terrorism. The program uses a creative problem solving process developed for business and industry. A sixth-grade toxic waste cleanup project illustrates the process.…

  6. Geometric projection filter: an efficient solution to the SLAM problem

    NASA Astrophysics Data System (ADS)

    Newman, Paul M.; Durrant-Whyte, Hugh F.

    2001-10-01

    This paper is concerned with the simultaneous localization and map building (SLAM) problem. The SLAM problem asks if it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and then to incrementally build a map of this environment while simultaneously using this map to compute absolute vehicle location. Conventional approaches to this problem are plagued with a prohibitively large increase in computation with the size of the environment. This paper offers a new solution to the SLAM problem that is both consistent and computationally feasible. The proposed algorithm builds a map expressing the relationships between landmarks which is then transformed into landmark locations. Experimental results are presented employing the new algorithm on a subsea vehicle using a scanning sonar sensor.

  7. Geometric properties of solutions to the total variation denoising problem

    NASA Astrophysics Data System (ADS)

    Chambolle, Antonin; Duval, Vincent; Peyré, Gabriel; Poon, Clarice

    2017-01-01

    This article studies the denoising performance of total variation (TV) image regularization. More precisely, we study geometrical properties of the solution to the so-called Rudin-Osher-Fatemi total variation denoising method. The first contribution of this paper is a precise mathematical definition of the ‘extended support’ (associated to the noise-free image) of TV denoising. It is intuitively the region which is unstable and will suffer from the staircasing effect. We highlight in several practical cases, such as the indicator of convex sets, that this region can be determined explicitly. Our second and main contribution is a proof that the TV denoising method indeed restores an image which is exactly constant outside a small tube surrounding the extended support. The radius of this tube shrinks toward zero as the noise level vanishes, and we are able to determine, in some cases, an upper bound on the convergence rate. For indicators of so-called ‘calibrable’ sets (such as disks or properly eroded squares), this extended support matches the edges, so that discontinuities produced by TV denoising cluster tightly around the edges. In contrast, for indicators of more general shapes or for complicated images, this extended support can be larger. Beside these main results, our paper also proves several intermediate results about fine properties of TV regularization, in particular for indicators of calibrable and convex sets, which are of independent interest.

  8. The Parabolas of Artzt in the Solution of a Geometric Problem of Minimum Length

    ERIC Educational Resources Information Center

    Klaoudatos, Nikos

    2011-01-01

    The article describes the solution of a geometric problem and how this problem was formed. During the investigation process, I discovered that the inscribed parabola in a triangle, known as the parabola of Artzt, a mathematical subject developed almost 120 years ago, was the decisive idea which directed me towards the solution. Moreover, in the…

  9. Solving Geometric Programs Using GRG-Results and Comparisons

    DTIC Science & Technology

    1976-05-01

    optimal value. The resulting point. are sihown in Appendix A. Computational Results Table 3 shows the performance of GRG on the Dembo problems on our...Jain, A., "The Solution of Nonlinear Programs Using the %eneralized Reduced Gradient Method," Technical Report SOL 76-(, Systems Optimization ...34Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Progranming," Technical Report ,OL 76-3, Systems Optimization Laboratory

  10. The Geometric Construction Abilities of Gifted Students in Solving Real-World Problems: A Case from Turkey

    ERIC Educational Resources Information Center

    Yildiz, Avni

    2016-01-01

    Geometric constructions have already been of interest to mathematicians. However, studies on geometric construction are not adequate in the relevant literature. Moreover, these studies generally focus on how secondary school gifted students solve non-routine mathematical problems. The present study aims to examine the geometric construction…

  11. A restricted Steiner tree problem is solved by Geometric Method II

    NASA Astrophysics Data System (ADS)

    Lin, Dazhi; Zhang, Youlin; Lu, Xiaoxu

    2013-03-01

    The minimum Steiner tree problem has wide application background, such as transportation system, communication network, pipeline design and VISL, etc. It is unfortunately that the computational complexity of the problem is NP-hard. People are common to find some special problems to consider. In this paper, we first put forward a restricted Steiner tree problem, which the fixed vertices are in the same side of one line L and we find a vertex on L such the length of the tree is minimal. By the definition and the complexity of the Steiner tree problem, we know that the complexity of this problem is also Np-complete. In the part one, we have considered there are two fixed vertices to find the restricted Steiner tree problem. Naturally, we consider there are three fixed vertices to find the restricted Steiner tree problem. And we also use the geometric method to solve such the problem.

  12. Breathing Problems: An Individualized Program.

    ERIC Educational Resources Information Center

    Vodola, Thomas M.

    As one of the components of the Project ACTIVE (All Children Totally Involved Exercising) Teacher Training Model Kit, the manual is designed to enable the educator to organize, conduct, and evaluate individualized-personalized physical education programs for children (prekindergarten through high school) with breathing problems. An introductory…

  13. A new geometric guidance approach to spacecraft near-distance rendezvous problem

    NASA Astrophysics Data System (ADS)

    Meng, Yunhe; Chen, Qifeng; Ni, Qing

    2016-12-01

    For the near-distance rendezvous problem of spacecraft, the classical guidance methods, such as R-bar and V-bar, are restricted by the initial relative positions and velocities and require a long period of time to rendezvous. In this paper, a new geometric guidance approach based on continuous low-thrust, which avoids the restrictions on initial states and decreases rendezvous time dramatically and has the advantages of robustness, is presented. First, based on the classical differential geometric curve theory, the dynamics equation of near-distance rendezvous is presented and a derivative term of spacecraft velocity is introduced, by which the relative velocity can be adjusted. Then, a spacecraft guidance curvature law is derived and one navigation ratio and two velocity feedback control gains are provided based on the analysis of motion in the normal and tangential directions of line-of-sight. Moreover, a method to improve the geometric guidance by using a modified linear-quadratic regulator, in which the time and the cost for rendezvous may be optimized by adjusting a 'decay factor', is proposed. Finally, numerical simulations about the selection of guidance parameters, about the comparison with the glideslope method, and about the guidance convergence with measurement errors, which prove the validity of the geometric approach for the rendezvous guidance problem of spacecraft, are presented.

  14. Geometrically derived difference formulae for the numerical integration of trajectory problems

    NASA Technical Reports Server (NTRS)

    Mcleod, R. J. Y.; Sanz-Serna, J. M.

    1981-01-01

    The term 'trajectory problem' is taken to include problems that can arise, for instance, in connection with contour plotting, or in the application of continuation methods, or during phase-plane analysis. Geometrical techniques are used to construct difference methods for these problems to produce in turn explicit and implicit circularly exact formulae. Based on these formulae, a predictor-corrector method is derived which, when compared with a closely related standard method, shows improved performance. It is found that this latter method produces spurious limit cycles, and this behavior is partly analyzed. Finally, a simple variable-step algorithm is constructed and tested.

  15. Geometric tools for solving the FDI problem for linear periodic discrete-time systems

    NASA Astrophysics Data System (ADS)

    Longhi, Sauro; Monteriù, Andrea

    2013-07-01

    This paper studies the problem of detecting and isolating faults in linear periodic discrete-time systems. The aim is to design an observer-based residual generator where each residual is sensitive to one fault, whilst remaining insensitive to the other faults that can affect the system. Making use of the geometric tools, and in particular of the outer observable subspace notion, the Fault Detection and Isolation (FDI) problem is formulated and necessary and solvability conditions are given. An algorithmic procedure is described to determine the solution of the FDI problem.

  16. Geometrically derived difference formulae for the numerical integration of trajectory problems

    NASA Technical Reports Server (NTRS)

    Mcleod, R. J. Y.; Sanz-Serna, J. M.

    1982-01-01

    An initial value problem for the autonomous system of ordinary differential equations dy/dt = f(y), where y is a vector, is considered. In a number of practical applications the interest lies in obtaining the curve traced by the solution y. These applications include the computation of trajectories in mechanical problems. The term 'trajectory problem' is employed to refer to these cases. Lambert and McLeod (1979) have introduced a method involving local rotation of the axes in the y-plane for the two-dimensional case. The present investigation continues the study of difference schemes specifically derived for trajectory problems. A simple geometrical way of constructing such methods is presented, and the local accuracy of the schemes is investigated. A circularly exact, fixed-step predictor-corrector algorithm is defined, and a variable-step version of a circularly exact algorithm is presented.

  17. Geometrically derived difference formulae for the numerical integration of trajectory problems

    NASA Technical Reports Server (NTRS)

    Mcleod, R. J. Y.; Sanz-Serna, J. M.

    1982-01-01

    An initial value problem for the autonomous system of ordinary differential equations dy/dt = f(y), where y is a vector, is considered. In a number of practical applications the interest lies in obtaining the curve traced by the solution y. These applications include the computation of trajectories in mechanical problems. The term 'trajectory problem' is employed to refer to these cases. Lambert and McLeod (1979) have introduced a method involving local rotation of the axes in the y-plane for the two-dimensional case. The present investigation continues the study of difference schemes specifically derived for trajectory problems. A simple geometrical way of constructing such methods is presented, and the local accuracy of the schemes is investigated. A circularly exact, fixed-step predictor-corrector algorithm is defined, and a variable-step version of a circularly exact algorithm is presented.

  18. Three-dimensional crack and contact problems with a general geometric configuration

    NASA Astrophysics Data System (ADS)

    Yong, Z.; Hanson, M. T.

    1994-02-01

    A NEW METHOD, based on point set theory and properties of orthogonal functions, is developed for determining exact solutions to three-dimensional crack and contact problems with complicated geometric configurations (e.g. a star-convex domain) in an infinite linear elastic medium. The governing equation is a two-dimensional Fredholm integral equation of the first kind. The central idea of this method is the chain extension of an exact solution from a regular subdomain to an irregular entire domain. Examples are given illustrating how this solution procedure can be used to obtain exact closed form solutions for a general Hertz contact problem and various crack problems in an inhomogeneous isotropic medium with an elastic modulus which is a power function of depth.

  19. Geometrical optics solutions of the inverse problem of focusing laser light into plane regions

    NASA Astrophysics Data System (ADS)

    Kharitonov, Sergey I.

    2017-04-01

    We propose a geometrical optics approach to calculating the eikonal function of a light field on the assumption of generating a desired intensity distribution in a given focal plane region. To solve the focusing problem in a more efficient way, we modify a conforming rectangles method used to design diffractive optical elements (DOE) to focus into plane regions. The novelty consists in a technique for reconstructing the eikonal function based on the known ray mapping relation between the DOE points and focal plane points. Results of focusing into a rhomb are presented. Simulation results show high quality of focusing, also corroborating the efficiency of the proposed method.

  20. On designing geometric motion planners to solve regulating and trajectory tracking problems for robotic locomotion systems.

    PubMed

    Asnafi, Alireza; Mahzoon, Mojtaba

    2011-09-01

    Based on a geometric fiber bundle structure, a generalized method to solve both regulation and trajectory tracking problems for locomotion systems is presented. The method is especially applied to two case studies of robotic locomotion systems; a three link articulated fish-like robot as a prototype of locomotion systems with symmetry, and the snakeboard as a prototype of mixed locomotion systems. Our results show that although these motion planners have an open loop structure, due to their generalities, they can steer case studies with negligible errors for almost any complicated path.

  1. OPEN PROBLEM: Geometric function theory: a modern view of a classical subject

    NASA Astrophysics Data System (ADS)

    Crowdy, Darren

    2008-10-01

    Geometric function theory is a classical subject. Yet it continues to find new applications in an ever-growing variety of areas such as modern mathematical physics, more traditional fields of physics such as fluid dynamics, nonlinear integrable systems theory and the theory of partial differential equations. This paper surveys, with a view to modern applications, open problems and challenges in this subject. Here we advocate an approach based on the use of the Schottky-Klein prime function within a Schottky model of compact Riemann surfaces.

  2. Geometric multigrid to accelerate the solution of the quasi-static electric field problem by tetrahedral finite elements.

    PubMed

    Hollaus, K; Weiss, B; Magele, Ch; Hutten, H

    2004-02-01

    The acceleration of the solution of the quasi-static electric field problem considering anisotropic complex conductivity simulated by tetrahedral finite elements of first order is investigated by geometric multigrid.

  3. A reduced computational and geometrical framework for inverse problems in hemodynamics.

    PubMed

    Lassila, Toni; Manzoni, Andrea; Quarteroni, Alfio; Rozza, Gianluigi

    2013-07-01

    The solution of inverse problems in cardiovascular mathematics is computationally expensive. In this paper, we apply a domain parametrization technique to reduce both the geometrical and computational complexities of the forward problem and replace the finite element solution of the incompressible Navier-Stokes equations by a computationally less-expensive reduced-basis approximation. This greatly reduces the cost of simulating the forward problem. We then consider the solution of inverse problems both in the deterministic sense, by solving a least-squares problem, and in the statistical sense, by using a Bayesian framework for quantifying uncertainty. Two inverse problems arising in hemodynamics modeling are considered: (i) a simplified fluid-structure interaction model problem in a portion of a stenosed artery for quantifying the risk of atherosclerosis by identifying the material parameters of the arterial wall on the basis of pressure measurements; (ii) a simplified femoral bypass graft model for robust shape design under uncertain residual flow in the main arterial branch identified from pressure measurements.

  4. Effects of geometric head model perturbations on the EEG forward and inverse problems.

    PubMed

    von Ellenrieder, Nicolás; Muravchik, Carlos H; Nehorai, Arye

    2006-03-01

    We study the effect of geometric head model perturbations on the electroencephalography (EEG) forward and inverse problems. Small magnitude perturbations of the shape of the head could represent uncertainties in the head model due to errors on images or techniques used to construct the model. They could also represent small scale details of the shape of the surfaces not described in a deterministic model, such as the sulci and fissures of the cortical layer. We perform a first-order perturbation analysis, using a meshless method for computing the sensitivity of the solution of the forward problem to the geometry of the head model. The effect on the forward problem solution is treated as noise in the EEG measurements and the Cramér-Rao bound is computed to quantify the effect on the inverse problem performance. Our results show that, for a dipolar source, the effect of the perturbations on the inverse problem performance is under the level of the uncertainties due to the spontaneous brain activity. Thus, the results suggest that an extremely detailed model of the head may be unnecessary when solving the EEG inverse problem.

  5. A general analytical solution to the geometrical problem of field matching in radiotherapy.

    PubMed

    Hernandez, V; Arenas, M; Pons, F; Sempau, J

    2009-09-01

    Several authors studied the problem of geometrical matching of fields produced by medical linear accelerators. However, a general solution has yet to be published. Currently available solutions are based on parallelism arguments. This study provides a general solution, considering not only parallelism but also field sizes. A fixed field with arbitrary field size, gantry, collimator, and couch angle is considered, and another field with a fixed gantry angle is matched to it. A single reference system attached to the treatment couch is used, and two approaches are followed. In the first approach, fixed field sizes are assumed and parallelism of the adjacent field-side planes is imposed. In the second approach, fixed isocenter positions are considered and both parallelism and coincidence between field-side planes are required. When fixed field sizes are assumed, rotation angles are obtained; however, the isocenters may need to be shifted to make side planes coincident and therefore achieve a proper match. When fixed isocenter positions are considered, solutions for all parameters, including the field size, are obtained and an exact geometrical match is achieved. General expressions to the field-matching problem are found for the two approaches followed, fixed field sizes, and fixed isocenter positions. These results can be applied to any treatment technique and can easily be implemented in modern treatment planning systems.

  6. A general analytical solution to the geometrical problem of field matching in radiotherapy

    SciTech Connect

    Hernandez, V.; Arenas, M.; Pons, F.; Sempau, J.

    2009-09-15

    Purpose: Several authors studied the problem of geometrical matching of fields produced by medical linear accelerators. However, a general solution has yet to be published. Currently available solutions are based on parallelism arguments. This study provides a general solution, considering not only parallelism but also field sizes. Methods: A fixed field with arbitrary field size, gantry, collimator, and couch angle is considered, and another field with a fixed gantry angle is matched to it. A single reference system attached to the treatment couch is used, and two approaches are followed. In the first approach, fixed field sizes are assumed and parallelism of the adjacent field-side planes is imposed. In the second approach, fixed isocenter positions are considered and both parallelism and coincidence between field-side planes are required. Results: When fixed field sizes are assumed, rotation angles are obtained; however, the isocenters may need to be shifted to make side planes coincident and therefore achieve a proper match. When fixed isocenter positions are considered, solutions for all parameters, including the field size, are obtained and an exact geometrical match is achieved. Conclusions: General expressions to the field-matching problem are found for the two approaches followed, fixed field sizes, and fixed isocenter positions. These results can be applied to any treatment technique and can easily be implemented in modern treatment planning systems.

  7. Measurement problem in PROGRAM UNIVERSE

    SciTech Connect

    Noyes, H.P.; Gefwert, C.

    1984-12-01

    We present a discrete theory that meets the measurement problem in a new way. We generate a growing universe of bit strings, labeled by 2/sup 127/ + 136 strings organized by some representation of the closed, four level, combinatorial hierarchy, of bit-length N/sub 139/ greater than or equal to 139. The rest of the strings for each label, which grow in both length and number, are called addresses. The generating algorithm, called PROGRAM UNIVERSE, starts from a random choice between the two symbols ''0'' and ''1'' and grows (a) by discriminating between two randomly chosen strings and adjoining a novel result to the universe, or when the string so generated is not novel, by (b) adjoining a randomly chosen bit at the growing end of each string. We obtain, by appropriate definitions and interpretations, stable ''particles'' which satisfy the usual relativistic kinematics and quantized angular momentum without being localizable in a continuum space-time. The labeling scheme is congruent with the ''standard model'' of quarks and leptons with three generations, but for the problem at hand, the implementation of this aspect of the theory is unimportant. What matters most is that (a) these complicated ''particles'' have the periodicities familiar from relativistic ''deBroglie waves'' and resolve in a discrete way the ''wave-particle dualism'' and (b) can be ''touched'' by our discrete equivalent of ''soft photons'' in such a way as to follow, macroscopically, the usual Rutherford scattering trajectories with the associated bound states. Thus our theory could provide a discrete description of ''measurement'' in a way that allows no conceptual barrier between the ''micro'' and the ''macro'' worlds, if we are willing to base our physics on counting and exclude the ambiguities associated with the unobservable ''continuum''. 27 refs.

  8. The spectrum of the torus profile to a geometric variational problem with long range interaction

    NASA Astrophysics Data System (ADS)

    Ren, Xiaofeng; Wei, Juncheng

    2017-08-01

    The profile problem for the Ohta-Kawasaki diblock copolymer theory is a geometric variational problem. The energy functional is defined on sets in R3 of prescribed volume and the energy of an admissible set is its perimeter plus a long range interaction term related to the Newtonian potential of the set. This problem admits a solution, called a torus profile, that is a set enclosed by an approximate torus of the major radius 1 and the minor radius q. The torus profile is both axially symmetric about the z axis and reflexively symmetric about the xy-plane. There is a way to set up the profile problem in a function space as a partial differential-integro equation. The linearized operator L of the problem at the torus profile is decomposed into a family of linear ordinary differential-integro operators Lm where the index m = 0 , 1 , 2 , … is called a mode. The spectrum of L is the union of the spectra of the Lm's. It is proved that for each m, when q is sufficiently small, Lm is positive definite. (0 is an eigenvalue for both L0 and L1, due to the translation and rotation invariance.) As q tends to 0, more and more Lm's become positive definite. However no matter how small q is, there is always a mode m of which Lm has a negative eigenvalue. This mode grows to infinity like q - 3 / 4 as q → 0.

  9. Application of the geometric immersion method based on the Castigliano variational principle for the axisymmetric problems of elasticity theory

    NASA Astrophysics Data System (ADS)

    Kuznetsova, Y. S.; Vorobyev, N. A.; Trufanov, N. A.

    2017-02-01

    The fundamentals of the geometric immersion stress method for axisymmetric problems of elasticity theory have been stated. The geometric immersion method involves reduction of the initial problem for Clapeyron’s free form elastic body to an iteration sequence of elasticity theory problems on some canonical domain. The iteration procedure for the variational equation of the geometric immersion method has been stated, as well as its discrete analog construction technique suggested with the finite-element stress method for the axisymmetric problem of the elasticity theory in the cylindrical coordinates. A practical application of the method has been demonstrated by a test problem. A reasonably good fit between the stress fields definition and the numerical solution by the traditional finite-element displacement method has been obtained.

  10. Children's Inductive Thinking during Intrinsic and Euclidean Geometrical Activities in a Computer Programming Environment.

    ERIC Educational Resources Information Center

    Kynigos, Chronis

    1993-01-01

    Used 2 12-year-old children to investigate deductive and inductive reasoning in plane geometry. A LOGO microworld was programmed to measure distances and turns relative to points on the plane. Learning environments like this may enhance formation of inductive geometrical understandings. (Contains 44 references.) (LDR)

  11. Mathematical Simulation of the Problem of the Pre-Critical Sandwich Plate Bending in Geometrically Nonlinear One Dimensional Formulation

    NASA Astrophysics Data System (ADS)

    Badriev, I. B.; Banderov, V. V.; Makarov, M. V.

    2017-06-01

    In this paper we consider the geometrically nonlinear problem of determining the equilibrium position of a sandwich plate consisting of two external carrier layers and located between transversely soft core, connected with carrier layer by means of adhesive joint. We investigate the generalized statement of the problem. For its numerical implementation we offer a two-layer iterative process and investigate the convergence of the method. Numerical experiments are carried out for the model problem.

  12. Gauging spacetime symmetries on the worldsheet and the geometric Langlands program

    NASA Astrophysics Data System (ADS)

    Tan, Meng-Chwan

    2008-03-01

    We study the two-dimensional twisted (0, 2) sigma-model on various smooth complex flag manifolds G/B, and explore its relevance to the geometric Langlands program. We find that an equivalence—at the level of the holomorphic chiral algebra—between a bosonic string on G/B and a B-gauged version of itself on G, will imply an isomorphism of classical Script W-algebras and a level relation which underlie a geometric Langlands correspondence for G = SL(N, C). This furnishes an alternative physical interpretation of the geometric Langlands correspondence for G = SL(N, C), to that demonstrated earlier by Kapustin and Witten via an electric-magnetic duality of four-dimensional gauge theory. Likewise, the Hecke operators and Hecke eigensheaves will have an alternative physical interpretation in terms of the correlation functions of local operators in the holomorphic chiral algebra of a quasi-topological sigma-model without boundaries. A forthcoming paper will investigate the interpretation of a ``quantum'' geometric Langlands correspondence for G = SL(N, C) in a similar setting, albeit with fluxes of the sigma-model moduli which induce a ``quantum'' deformation of the relevant classical algebras turned on.

  13. High level implementation of geometric multigrid solvers for finite element problems: Applications in atmospheric modelling

    NASA Astrophysics Data System (ADS)

    Mitchell, Lawrence; Müller, Eike Hermann

    2016-12-01

    The implementation of efficient multigrid preconditioners for elliptic partial differential equations (PDEs) is a challenge due to the complexity of the resulting algorithms and corresponding computer code. For sophisticated (mixed) finite element discretisations on unstructured grids an efficient implementation can be very time consuming and requires the programmer to have in-depth knowledge of the mathematical theory, parallel computing and optimisation techniques on manycore CPUs. In this paper we show how the development of bespoke multigrid preconditioners can be simplified significantly by using a framework which allows the expression of the each component of the algorithm at the correct abstraction level. Our approach (1) allows the expression of the finite element problem in a language which is close to the mathematical formulation of the problem, (2) guarantees the automatic generation and efficient execution of parallel optimised low-level computer code and (3) is flexible enough to support different abstraction levels and give the programmer control over details of the preconditioner. We use the composable abstractions of the Firedrake/PyOP2 package to demonstrate the efficiency of this approach for the solution of strongly anisotropic PDEs in atmospheric modelling. The weak formulation of the PDE is expressed in Unified Form Language (UFL) and the lower PyOP2 abstraction layer allows the manual design of computational kernels for a bespoke geometric multigrid preconditioner. We compare the performance of this preconditioner to a single-level method and hypre's BoomerAMG algorithm. The Firedrake/PyOP2 code is inherently parallel and we present a detailed performance analysis for a single node (24 cores) on the ARCHER supercomputer. Our implementation utilises a significant fraction of the available memory bandwidth and shows very good weak scaling on up to 6,144 compute cores.

  14. How Students Solve Problems in Spatial Geometry while Using a Software Application for Visualizing 3D Geometric Objects

    ERIC Educational Resources Information Center

    Widder, Mirela; Gorsky, Paul

    2013-01-01

    In schools, learning spatial geometry is usually dependent upon a student's ability to visualize three dimensional geometric configurations from two dimensional drawings. Such a process, however, often creates visual obstacles which are unique to spatial geometry. Useful software programs which realistically depict three dimensional geometric…

  15. Problems, Perplexities, and Politics of Program Evaluation.

    ERIC Educational Resources Information Center

    Schneider, Gail Thierbach

    All educational evaluations share common problems, perplexities, and political considerations. Logistic problems include incomplete definition of purpose, unclear timelines and personnel allocations, inadequate support services, and the lack of a program plan. Interpersonal dynamics and conflicts plus unwieldy committee structures are perplexities…

  16. Problem Solving. Workplace Education Program Curriculum.

    ERIC Educational Resources Information Center

    Burkhart, Jennifer

    The BUILD Program (Businesses United to Increase Literacy Development) was conducted from June 1991 through December 1992 as a cooperative workplace literacy program joining Arapahoe Community College and four companies in Littleton, Colorado. This document consists of three modules for the problem-solving and computer learning systems classes of…

  17. Quantum Algorithm for Linear Programming Problems

    NASA Astrophysics Data System (ADS)

    Joag, Pramod; Mehendale, Dhananjay

    The quantum algorithm (PRL 103, 150502, 2009) solves a system of linear equations with exponential speedup over existing classical algorithms. We show that the above algorithm can be readily adopted in the iterative algorithms for solving linear programming (LP) problems. The first iterative algorithm that we suggest for LP problem follows from duality theory. It consists of finding nonnegative solution of the equation forduality condition; forconstraints imposed by the given primal problem and for constraints imposed by its corresponding dual problem. This problem is called the problem of nonnegative least squares, or simply the NNLS problem. We use a well known method for solving the problem of NNLS due to Lawson and Hanson. This algorithm essentially consists of solving in each iterative step a new system of linear equations . The other iterative algorithms that can be used are those based on interior point methods. The same technique can be adopted for solving network flow problems as these problems can be readily formulated as LP problems. The suggested quantum algorithm cansolveLP problems and Network Flow problems of very large size involving millions of variables.

  18. Joint pricing and production management: a geometric programming approach with consideration of cubic production cost function

    NASA Astrophysics Data System (ADS)

    Sadjadi, Seyed Jafar; Hamidi Hesarsorkh, Aghil; Mohammadi, Mehdi; Bonyadi Naeini, Ali

    2014-08-01

    Coordination and harmony between different departments of a company can be an important factor in achieving competitive advantage if the company corrects alignment between strategies of different departments. This paper presents an integrated decision model based on recent advances of geometric programming technique. The demand of a product considers as a power function of factors such as product's price, marketing expenditures, and consumer service expenditures. Furthermore, production cost considers as a cubic power function of outputs. The model will be solved by recent advances in convex optimization tools. Finally, the solution procedure is illustrated by numerical example.

  19. The Obstacle Version of the Geometric Dynamic Programming Principle: Application to the Pricing of American Options Under Constraints

    SciTech Connect

    Bouchard, Bruno Vu, Thanh Nam

    2010-04-15

    We provide an obstacle version of the Geometric Dynamic Programming Principle of Soner and Touzi (J. Eur. Math. Soc. 4:201-236, 2002) for stochastic target problems. This opens the doors to a wide range of applications, particularly in risk control in finance and insurance, in which a controlled stochastic process has to be maintained in a given set on a time interval [0,T]. As an example of application, we show how it can be used to provide a viscosity characterization of the super-hedging cost of American options under portfolio constraints, without appealing to the standard dual formulation from mathematical finance. In particular, we allow for a degenerate volatility, a case which does not seem to have been studied so far in this context.

  20. Novel solutions to low-frequency problems with geometrically designed beam-waveguide systems

    NASA Technical Reports Server (NTRS)

    Imbriale, W. A.; Esquivel, M. S.; Manshadi, F.

    1995-01-01

    The poor low-frequency performance of geometrically designed beam-waveguide (BWG) antennas is shown to be caused by the diffraction phase centers being far from the geometrical optics mirror focus, resulting in substantial spillover and defocusing loss. Two novel solutions are proposed: (1) reposition the mirrors to focus low frequencies and redesign the high frequencies to utilize the new mirror positions, and (2) redesign the input feed system to provide an optimum solution for the low frequency. A novel use of the conjugate phase-matching technique is utilized to design the optimum low-frequency feed system, and the new feed system has been implemented in the JPL research and development BWG as part of a dual S-/X-band (2.3 GHz/8.45 GHz) feed system. The new S-band feed system is shown to perform significantly better than the original geometrically designed system.

  1. Problem-Solving Transfer Among Programming Languages

    DTIC Science & Technology

    1990-06-04

    stable from programming in the first language to in the second. In other words, the transfer on subsequent drafts was mainly manifested as fewer drafts...substantial transfer from solving a problem in the first language (LISP or PROLOG) to solving it in the second language (PROLOG or LISP) in terms of time...transfer a lot of the algorithmic knowledge gained from programming in the first language to in the second. We will refer this type of transfer as

  2. Geometrical attenuation, frequency dependence of Q, and the absorption band problem

    NASA Astrophysics Data System (ADS)

    Morozov, Igor B.

    2008-10-01

    A geometrical attenuation model is proposed as an alternative to the conventional frequency-dependent attenuation law Q(f) = Q0(f/f0)η. The new model provides a straightforward differentiation between the geometrical and effective attenuation (Qe) which incorporates the intrinsic attenuation and small-scale scattering. Unlike the (Q0, η) description, the inversion procedure uses only the spectral amplitude data and does not rely on elaborate theoretical models or restrictive assumptions. Data from over 40 reported studies were transformed to the new parametrization. The levels of geometrical attenuation strongly correlate with crustal tectonic types and decrease with tectonic age. The corrected values of Qe are frequency-independent and generally significantly higher than Q0 and show no significant correlation with tectonic age. Several case studies were revisited in detail, with significant changes in the interpretations. The absorption-band and the `10-Hz transition' are not found in the corrected Qe data, and therefore, these phenomena are interpreted as related to geometrical attenuation. The absorption band could correspond to changes in the dominant mode content of the wavefield as the frequency changes from about 0.1 to 100 Hz. Alternatively, it could also be a pure artefact related to the power-law Q(f) paradigm above. The explicit separation of the geometrical and intrinsic attenuation achieves three goals: (1) it provides an unambiguous, assumption- and model-free description of attenuation, (2) it allows relating the observations to the basic physics and geology and (3) it simplifies the interpretation because of reduced emphasis on the apparent Q(f) dependence. The model also agrees remarkably well with the initial attempts for finite-difference short-period coda waveform modelling. Because of its consistency and direct link to the observations, the approach should also help in building robust and transportable coda magnitudes and in seismic

  3. Program Helps Decompose Complicated Design Problems

    NASA Technical Reports Server (NTRS)

    Rogers, James L., Jr.

    1993-01-01

    Time saved by intelligent decomposition into smaller, interrelated problems. DeMAID is knowledge-based software system for ordering sequence of modules and identifying possible multilevel structure for design problem. Displays modules in N x N matrix format. Requires investment of time to generate and refine list of modules for input, it saves considerable amount of money and time in total design process, particularly new design problems in which ordering of modules has not been defined. Program also implemented to examine assembly-line process or ordering of tasks and milestones.

  4. Employee assistance program treats personal problems.

    PubMed

    Bednarek, R J; Featherston, H J

    1984-03-01

    Though the concept of employee assistance programs (EAPs) is widely accepted throughout business and industry, few hospitals have established similar channels for dealing with workers whose personal problems cause work-related problems. Among the reasons for the health care profession's lack of involvement in this area are: lack of information about costs and benefits of EAPs; the hospital's multidisciplinary environment in which standards of employee competence and behavior are set by persons from many disciplines; hospital working hours; and health care workers' attitudes about their vulnerability to illness. St. Benedict's Hospital, Ogden, UT, however, has confronted the question of how to demonstrate Christian concern for its employees. St. Benedict's EAP, the Helping Hand, which was created in 1979, combines progressive disciplinary action with the opportunity for early intervention in and treatment of employees' personal problems. When a worker with personal problems is referred to the EAP coordinator, he or she is matched with the appropriate community or hospital resource for treatment. Supervisors are trained to identify employee problems and to focus on employee job performance rather than on attempting to diagnose the problem. St. Benedict's records during the program's first three years illustrate the human benefits as well as the cost savings of an EAP. Of 92 hospital employees who took part in the EAP, 72 improved their situations or resolved their problems. The hospital's turnover rates declined from 36 percent to 20 percent, and approximately $40,800 in turnover and replacement costs were saved.

  5. Solvability of boundary value problems in the geometrically and physically nonlinear theory of shallow shells of Timoshenko type

    NASA Astrophysics Data System (ADS)

    Timergaliev, S. N.

    2009-06-01

    This paper deals with the proof of the existence of solutions of a geometrically and physically nonlinear boundary value problem for shallow Timoshenko shells with the transverse shear strains taken into account. The shell edge is assumed to be partly fixed. It is proposed to study the problem by a variational method based on searching the points of minimum of the total energy functional for the shell-load system in the space of generalized displacements. We show that there exists a generalized solution of the problemon which the total energy functional attains its minimum on a weakly closed subset of the space of generalized displacements.

  6. Women in Jail: Problems, Programs and Resources.

    ERIC Educational Resources Information Center

    Roy, Marjorie Brown

    This manual is designed to assist those individuals or groups responsible for developing educational and vocational programs for women in jail. The first section identifies the needs and problems of women in jail, focussing on discrimination against poor women unable to afford bail, the nonviolent nature of women's crimes, and the inequity of jail…

  7. VLSI architectures for geometrical mapping problems in high-definition image processing

    NASA Technical Reports Server (NTRS)

    Kim, K.; Lee, J.

    1991-01-01

    This paper explores a VLSI architecture for geometrical mapping address computation. The geometric transformation is discussed in the context of plane projective geometry, which invokes a set of basic transformations to be implemented for the general image processing. The homogeneous and 2-dimensional cartesian coordinates are employed to represent the transformations, each of which is implemented via an augmented CORDIC as a processing element. A specific scheme for a processor, which utilizes full-pipelining at the macro-level and parallel constant-factor-redundant arithmetic and full-pipelining at the micro-level, is assessed to produce a single VLSI chip for HDTV applications using state-of-art MOS technology.

  8. Menu-Driven Solver Of Linear-Programming Problems

    NASA Technical Reports Server (NTRS)

    Viterna, L. A.; Ferencz, D.

    1992-01-01

    Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).

  9. Extensions to the Multilevel Programming Problem

    DTIC Science & Technology

    1988-05-01

    OVERVIEW 2 CHAPTER 2 LITERATURE SEARCH 4 2.1 INTRODUCTION 4 2.2 RELEVANCE OF THE MODEL 6 2.3 PROBLEM FORMULATION 7 2.4 THE LINEAR BLPP 13 2.5 THE LINEAR...4.2 THE PARAMETRIC FORMULATION OF THE 0-1 BLPP 27 4.3 THE ALGORITHM 30 4.4 EXAMPLES 37 4.5 COMPUTATIONAL EXPERIENCE 43 CHAPTER 5 A BRANCH AND BOUND...ALGORITHM FOR THE BILEVEL PROGRAMMING PROBLEM 48 5.1 DEVELOPMENT OF THE KUHN-TUCKER APPROACH 48 5.2 THE ALGORITHM 52 5.3 OTHER FORMS OF THE BLPP 58 5.4

  10. A Geometric Theory of Natural Oscillation Frequencies in Exterior Scattering Problems.

    DTIC Science & Technology

    1979-09-30

    34 Annals of Physics, Vol. 9, pp. 24-75, 1960. 6. Weinberg, S ., Gravitation and Cosmology , Principles and Applica- tions of the General Theory of...A079 304 ARIZONA UN IV TUCSON ENGINEERING EXPERIMENT STATION F/ S 20/3 A GEOMETRIC THEORY OF NATURAL OSCILLATION FREQUENCIES IN IEXTEROl--ETC(U) SEP...7 MItM 2. GOVT ACCESSION NO. 3. RECIPIENT’S CATALOG NUMBER AFOSR. TR- It 9 - 1 ,0 5 4. TITLE (#Ad Subtitle) S . TYPE OF REPORT & PERIOO COVERED

  11. Stalactite Growth as a Free-Boundary Problem: A Geometric Law and Its Platonic Ideal

    NASA Astrophysics Data System (ADS)

    Short, Martin B.; Baygents, James C.; Beck, J. Warren; Stone, David A.; Toomey, Rickard S.; Goldstein, Raymond E.

    2005-01-01

    The chemical mechanisms underlying the growth of cave formations such as stalactites are well known, yet no theory has yet been proposed which successfully accounts for the dynamic evolution of their shapes. Here we consider the interplay of thin-film fluid dynamics, calcium carbonate chemistry, and CO2 transport in the cave to show that stalactites evolve according to a novel local geometric growth law which exhibits extreme amplification at the tip as a consequence of the locally-varying fluid layer thickness. Studies of this model show that a broad class of initial conditions is attracted to an ideal shape which is strikingly close to a statistical average of natural stalactites.

  12. Competent Geometric Semantic Genetic Programming for Symbolic Regression and Boolean Function Synthesis.

    PubMed

    Pawlak, Tomasz P; Krawiec, Krzysztof

    2017-02-16

    Program semantics is a promising recent research thread in Genetic Programming (GP). Over a dozen of semantic-aware search, selection, and initialization operators for GP have been proposed to date. Some of those operators are designed to exploit the geometric properties of semantic space, while some others focus on making offspring effective, i.e., semantically different from their parents. Only a small fraction of previous works aimed at addressing both these features simultaneously. In this paper, we propose a suite of competent operators that combine effectiveness with geometry for population initialization, mate selection, mutation and crossover. We present a theoretical rationale behind these operators and compare them experimentally to operators known from literature on symbolic regression and Boolean function synthesis benchmarks. We analyze each operator in isolation as well as verify how they fare together in an evolutionary run, concluding that the competent operators are superior on a wide range of performance indicators, including best-of-run fitness, test-set fitness, and program size.

  13. An alternative method on quadratic programming problems

    NASA Astrophysics Data System (ADS)

    Dasril, Y.; Mohd, I. B.; Mustaffa, I.; Aminuddin, MMM.

    2015-05-01

    In this paper we proposed an alternative approach to find the optimum solution of quadratic programming problems (QPP) in its original form without additional information such as slack variable, surplus variable or artificial variable as done in other favourite methods. This approached is based on the violated constraints by the unconstrained optimum. The optimal solution of QPP obtained by searching from initial point to another point alongside of feasible region.

  14. A prefiltered cuckoo search algorithm with geometric operators for solving Sudoku problems.

    PubMed

    Soto, Ricardo; Crawford, Broderick; Galleguillos, Cristian; Monfroy, Eric; Paredes, Fernando

    2014-01-01

    The Sudoku is a famous logic-placement game, originally popularized in Japan and today widely employed as pastime and as testbed for search algorithms. The classic Sudoku consists in filling a 9 × 9 grid, divided into nine 3 × 3 regions, so that each column, row, and region contains different digits from 1 to 9. This game is known to be NP-complete, with existing various complete and incomplete search algorithms able to solve different instances of it. In this paper, we present a new cuckoo search algorithm for solving Sudoku puzzles combining prefiltering phases and geometric operations. The geometric operators allow one to correctly move toward promising regions of the combinatorial space, while the prefiltering phases are able to previously delete from domains the values that do not conduct to any feasible solution. This integration leads to a more efficient domain filtering and as a consequence to a faster solving process. We illustrate encouraging experimental results where our approach noticeably competes with the best approximate methods reported in the literature.

  15. A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems

    PubMed Central

    Crawford, Broderick; Galleguillos, Cristian; Paredes, Fernando

    2014-01-01

    The Sudoku is a famous logic-placement game, originally popularized in Japan and today widely employed as pastime and as testbed for search algorithms. The classic Sudoku consists in filling a 9 × 9 grid, divided into nine 3 × 3 regions, so that each column, row, and region contains different digits from 1 to 9. This game is known to be NP-complete, with existing various complete and incomplete search algorithms able to solve different instances of it. In this paper, we present a new cuckoo search algorithm for solving Sudoku puzzles combining prefiltering phases and geometric operations. The geometric operators allow one to correctly move toward promising regions of the combinatorial space, while the prefiltering phases are able to previously delete from domains the values that do not conduct to any feasible solution. This integration leads to a more efficient domain filtering and as a consequence to a faster solving process. We illustrate encouraging experimental results where our approach noticeably competes with the best approximate methods reported in the literature. PMID:24707205

  16. An Algorithm for Linearly Constrained Nonlinear Programming Programming Problems.

    DTIC Science & Technology

    1980-01-01

    ALGORITHM FOR LINEARLY CONSTRAINED NONLINEAR PROGRAMMING PROBLEMS Mokhtar S. Bazaraa and Jamie J. Goode In this paper an algorithm for solving a linearly...distance pro- gramr.ing, as in the works of Bazaraa and Goode 12], and Wolfe [16 can be used for solving this problem. Special methods that take advantage of...34 Pacific Journal of Mathematics, Volume 16, pp. 1-3, 1966. 2. M. S. Bazaraa and J. j. Goode, "An Algorithm for Finding the Shortest Element of a

  17. On the form problem of embryonic heart loops, its geometrical solutions, and a new biophysical concept of cardiac looping.

    PubMed

    Männer, Jörg

    2013-07-01

    Cardiac looping is an essential process in the morphogenesis of embryonic hearts. Unfortunately, relatively little is known about the form and biophysics of embryonic heart loops. Thompson regarded the form of an object as "a 'diagram of forces' … from it we can … deduce the forces that are acting or have acted upon it." Therefore, the present study was conducted to uncover the best geometrical solution of the form problem of embryonic heart loops. This approach may help to identify the biophysics of cardiac looping. Analysis of the tendrils of climbing plants disclosed striking resemblance between the configurations of embryonic heart loops and a form motif named helical perversion. Helical perversion occurs in helically wound objects where they connect two helical segments of opposite handedness (two-handed helix). Helical perversion evolves in living and non-living filamentary objects such as the tendrils of climbing plants and helical telephone cords. Helical perversion may be the best geometrical solution of the form problem of embryonic heart loops. The dynamics and mechanics of the emergence of helical perversions are relatively well known. The behavior of looping embryonic hearts may be interpreted in light of this knowledge. Copyright © 2013 Elsevier GmbH. All rights reserved.

  18. A geometric method for eigenvalue problems with low-rank perturbations

    PubMed Central

    Anastasio, Thomas J.; Bronski, Jared C.

    2017-01-01

    We consider the problem of finding the spectrum of an operator taking the form of a low-rank (rank one or two) non-normal perturbation of a well-understood operator, motivated by a number of problems of applied interest which take this form. We use the fact that the system is a low-rank perturbation of a solved problem, together with a simple idea of classical differential geometry (the envelope of a family of curves) to completely analyse the spectrum. We use these techniques to analyse three problems of this form: a model of the oculomotor integrator due to Anastasio & Gad (2007 J. Comput. Neurosci. 22, 239–254. (doi:10.1007/s10827-006-0010-x)), a continuum integrator model, and a non-local model of phase separation due to Rubinstein & Sternberg (1992 IMA J. Appl. Math. 48, 249–264. (doi:10.1093/imamat/48.3.249)). PMID:28989749

  19. Tensor3D: A computer graphics program to simulate 3D real-time deformation and visualization of geometric bodies

    NASA Astrophysics Data System (ADS)

    Pallozzi Lavorante, Luca; Dirk Ebert, Hans

    2008-07-01

    Tensor3D is a geometric modeling program with the capacity to simulate and visualize in real-time the deformation, specified through a tensor matrix and applied to triangulated models representing geological bodies. 3D visualization allows the study of deformational processes that are traditionally conducted in 2D, such as simple and pure shears. Besides geometric objects that are immediately available in the program window, the program can read other models from disk, thus being able to import objects created with different open-source or proprietary programs. A strain ellipsoid and a bounding box are simultaneously shown and instantly deformed with the main object. The principal axes of strain are visualized as well to provide graphical information about the orientation of the tensor's normal components. The deformed models can also be saved, retrieved later and deformed again, in order to study different steps of progressive strain, or to make this data available to other programs. The shape of stress ellipsoids and the corresponding Mohr circles defined by any stress tensor can also be represented. The application was written using the Visualization ToolKit, a powerful scientific visualization library in the public domain. This development choice, allied to the use of the Tcl/Tk programming language, which is independent on the host computational platform, makes the program a useful tool for the study of geometric deformations directly in three dimensions in teaching as well as research activities.

  20. Converting general nonlinear programming problems into separable programming problems with feedforward neural networks.

    PubMed

    Lu, Bao-Liang; Ito, Koji

    2003-09-01

    In this paper we present a method for converting general nonlinear programming (NLP) problems into separable programming (SP) problems by using feedforward neural networks (FNNs). The basic idea behind the method is to use two useful features of FNNs: their ability to approximate arbitrary continuous nonlinear functions with a desired degree of accuracy and their ability to express nonlinear functions in terms of parameterized compositions of functions of single variables. According to these two features, any nonseparable objective functions and/or constraints in NLP problems can be approximately expressed as separable functions with FNNs. Therefore, any NLP problems can be converted into SP problems. The proposed method has three prominent features. (a) It is more general than existing transformation techniques; (b) it can be used to formulate optimization problems as SP problems even when their precise analytic objective function and/or constraints are unknown; (c) the SP problems obtained by the proposed method may highly facilitate the selection of grid points for piecewise linear approximation of nonlinear functions. We analyze the computational complexity of the proposed method and compare it with an existing transformation approach. We also present several examples to demonstrate the method and the performance of the simplex method with the restricted basis entry rule for solving SP problems.

  1. Approximations for generalized bilevel programming problem

    SciTech Connect

    Morgan, J.; Lignola, M.B.

    1994-12-31

    The following mathematical programming with variational inequality constraints, also called {open_quotes}Generalized bilevel programming problem{close_quotes}, is considered: minimize f(x, y) subject to x {element_of} U and y {element_of} S(x) where S(x) is the solution set of a parametrized variational inequality; i.e., S(x) = {l_brace}y {element_of} U(x): F(x, y){sup T} (y-z){<=} 0 {forall}z {element_of} U (x){r_brace} with f : R{sup n} {times} R{sup m} {yields} {bar R}, F : R{sup n} {times} R{sup m} - R{sup n} and U(x) = {l_brace}y {element_of} {Gamma}{sup T} c{sub i} (x, y) {<=} 0 for 1 = 1, p{r_brace} with c : R{sup n} {times} R{sup m} {yields} R and U{sub ad}, {Gamma} be compact subsets of R{sup m} and R{sup n} respectively. Approximations will be presented to guarantee not only existence of solutions but also convergence of them under perturbations of the data. Connections with previous results obtained when the lower level problem is an optimization one, will be given.

  2. Fifth SIAM conference on geometric design 97: Final program and abstracts. Final technical report

    SciTech Connect

    1997-12-31

    The meeting was divided into the following sessions: (1) CAD/CAM; (2) Curve/Surface Design; (3) Geometric Algorithms; (4) Multiresolution Methods; (5) Robotics; (6) Solid Modeling; and (7) Visualization. This report contains the abstracts of papers presented at the meeting. Proceding the conference there was a short course entitled ``Wavelets for Geometric Modeling and Computer Graphics``.

  3. AgentGeom: A Multiagent System for Pedagogical Support in Geometric Proof Problems

    ERIC Educational Resources Information Center

    Cobo, Pedro; Fortuny, Josep M.; Puertas, Eloi; Richard, Philippe R.

    2007-01-01

    This paper aims, first, to describe the fundamental characteristics and workings of the AgentGeom artificial tutorial system, which is designed to help students develop knowledge and skills related to problem solving, mathematical proof in geometry, and the use of mathematical language. Following this, we indicate the manner in which a secondary…

  4. Problems and limitations of voluntary cleanup programs

    SciTech Connect

    Johnson, S.F.

    1995-12-31

    At least a dozen states have already implemented voluntary cleanup programs (VCPs). Provisions to promote state VCPs were prominent in the EPA`s 1994 proposed revisions to CERCLA and in current legislative initiatives. Under the VCP, property owners voluntarily enroll to investigate and remediate contaminated sites with the aegis of a state agency and thus avoid involvement with the federal Superfund program. When the state agency is satisfied with the condition of the site, it issues a certificate to the owner. The VCP is meant to mitigate unintended consequences of CERCLA such as the economic abandonment of urban industrial sites in favor of unpolluted suburban sites. The VCP concept has been combined with other reforms including cleanup standards, financial incentives, and independent action. The effectiveness of voluntary cleanup programs is limited by the costs of investigation and cleanup relative to the value of the property in question. It is also limited when property has environmental problems outside the traditional focus of state Superfund agencies on soil and groundwater contamination. VCPs also have potential unintended consequences of their own. The VCP concept is consistent with a 15 year trend of increasing government attention and involvement with sites of diminishing health and environmental significance. VCP may reinforce the perception of liability and unwittingly raise the standard of due diligence in property assessments, especially if combined with generic cleanup standard.

  5. A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation.

    PubMed

    Sit, Atilla; Wu, Zhijun; Yuan, Yaxiang

    2009-11-01

    We propose a new geometric buildup algorithm for the solution of the distance geometry problem in protein modeling, which can prevent the accumulation of the rounding errors in the buildup calculations successfully and also tolerate small errors in given distances. In this algorithm, we use all instead of a subset of available distances for the determination of each unknown atom and obtain the position of the atom by using a least-squares approximation instead of an exact solution to the system of distance equations. We show that the least-squares approximation can be obtained by using a special singular value decomposition method, which not only tolerates and minimizes small distance errors, but also prevents the rounding errors from propagation effectively, especially when the distance data is sparse. We describe the least-squares formulations and their solution methods, and present the test results from applying the new algorithm for the determination of a set of protein structures with varying degrees of availability and accuracy of the distances. We show that the new development of the algorithm increases the modeling ability, and improves stability and robustness of the geometric buildup approach significantly from both theoretical and practical points of view.

  6. A Kalman filter-based approach to reduce the effects of geometric errors and the measurement noise in the inverse ECG problem.

    PubMed

    Aydin, Umit; Dogrusoz, Yesim Serinagaoglu

    2011-09-01

    In this article, we aimed to reduce the effects of geometric errors and measurement noise on the inverse problem of Electrocardiography (ECG) solutions. We used the Kalman filter to solve the inverse problem in terms of epicardial potential distributions. The geometric errors were introduced into the problem via wrong determination of the size and location of the heart in simulations. An error model, which is called the enhanced error model (EEM), was modified to be used in inverse problem of ECG to compensate for the geometric errors. In this model, the geometric errors are modeled as additive Gaussian noise and their noise variance is added to the measurement noise variance. The Kalman filter method includes a process noise component, whose variance should also be estimated along with the measurement noise. To estimate these two noise variances, two different algorithms were used: (1) an algorithm based on residuals, (2) expectation maximization algorithm. The results showed that it is important to use the correct noise variances to obtain accurate results. The geometric errors, if ignored in the inverse solution procedure, yielded incorrect epicardial potential distributions. However, even with a noise model as simple as the EEM, the solutions could be significantly improved.

  7. Geometric Mechanics

    NASA Astrophysics Data System (ADS)

    Talman, Richard

    1999-10-01

    Mechanics for the nonmathematician-a modern approach For physicists, mechanics is quite obviously geometric, yet the classical approach typically emphasizes abstract, mathematical formalism. Setting out to make mechanics both accessible and interesting for nonmathematicians, Richard Talman uses geometric methods to reveal qualitative aspects of the theory. He introduces concepts from differential geometry, differential forms, and tensor analysis, then applies them to areas of classical mechanics as well as other areas of physics, including optics, crystal diffraction, electromagnetism, relativity, and quantum mechanics. For easy reference, Dr. Talman treats separately Lagrangian, Hamiltonian, and Newtonian mechanics-exploring their geometric structure through vector fields, symplectic geometry, and gauge invariance respectively. Practical perturbative methods of approximation are also developed. Geometric Mechanics features illustrative examples and assumes only basic knowledge of Lagrangian mechanics. Of related interest . . . APPLIED DYNAMICS With Applications to Multibody and Mechatronic Systems Francis C. Moon A contemporary look at dynamics at an intermediate level, including nonlinear and chaotic dynamics. 1998 (0-471-13828-2) 504 pp. MATHEMATICAL PHYSICS Applied Mathematics for Scientists and Engineers Bruce Kusse and Erik Westwig A comprehensive treatment of the mathematical methods used to solve practical problems in physics and engineering. 1998 (0-471-15431-8) 680 pp.

  8. Curvature and geodesic instabilities in a geometrical approach to the planar three-body problem

    NASA Astrophysics Data System (ADS)

    Krishnaswami, Govind S.; Senapati, Himalaya

    2016-10-01

    The Maupertuis principle allows us to regard classical trajectories as reparametrized geodesics of the Jacobi-Maupertuis (JM) metric on configuration space. We study this geodesic reformulation of the planar three-body problem with both Newtonian and attractive inverse-square potentials. The associated JM metrics possess translation and rotation isometries in addition to scaling isometries for the inverse-square potential with zero energy E. The geodesic flow on the full configuration space ℂ3 (with collision points excluded) leads to corresponding flows on its Riemannian quotients: the center of mass configuration space ℂ2 and shape space ℝ3 (as well as 𝕊3 and the shape sphere 𝕊2 for the inverse-square potential when E = 0). The corresponding Riemannian submersions are described explicitly in "Hopf" coordinates which are particularly adapted to the isometries. For equal masses subject to inverse-square potentials, Montgomery shows that the zero-energy "pair of pants" JM metric on the shape sphere is geodesically complete and has negative gaussian curvature except at Lagrange points. We extend this to a proof of boundedness and strict negativity of scalar curvatures everywhere on ℂ2, ℝ3, and 𝕊3 with collision points removed. Sectional curvatures are also found to be largely negative, indicating widespread geodesic instabilities. We obtain asymptotic metrics near collisions, show that scalar curvatures have finite limits, and observe that the geodesic reformulation "regularizes" pairwise and triple collisions on ℂ2 and its quotients for arbitrary masses and allowed energies. For the Newtonian potential with equal masses and zero energy, we find that the scalar curvature on ℂ2 is strictly negative though it could have either sign on ℝ3. However, unlike for the inverse-square potential, geodesics can encounter curvature singularities at collisions in finite geodesic time.

  9. A geometrical multi-scale numerical method for coupled hygro-thermo-mechanical problems in photovoltaic laminates.

    PubMed

    Lenarda, P; Paggi, M

    A comprehensive computational framework based on the finite element method for the simulation of coupled hygro-thermo-mechanical problems in photovoltaic laminates is herein proposed. While the thermo-mechanical problem takes place in the three-dimensional space of the laminate, moisture diffusion occurs in a two-dimensional domain represented by the polymeric layers and by the vertical channel cracks in the solar cells. Therefore, a geometrical multi-scale solution strategy is pursued by solving the partial differential equations governing heat transfer and thermo-elasticity in the three-dimensional space, and the partial differential equation for moisture diffusion in the two dimensional domains. By exploiting a staggered scheme, the thermo-mechanical problem is solved first via a fully implicit solution scheme in space and time, with a specific treatment of the polymeric layers as zero-thickness interfaces whose constitutive response is governed by a novel thermo-visco-elastic cohesive zone model based on fractional calculus. Temperature and relative displacements along the domains where moisture diffusion takes place are then projected to the finite element model of diffusion, coupled with the thermo-mechanical problem by the temperature and crack opening dependent diffusion coefficient. The application of the proposed method to photovoltaic modules pinpoints two important physical aspects: (i) moisture diffusion in humidity freeze tests with a temperature dependent diffusivity is a much slower process than in the case of a constant diffusion coefficient; (ii) channel cracks through Silicon solar cells significantly enhance moisture diffusion and electric degradation, as confirmed by experimental tests.

  10. A geometrical multi-scale numerical method for coupled hygro-thermo-mechanical problems in photovoltaic laminates

    NASA Astrophysics Data System (ADS)

    Lenarda, P.; Paggi, M.

    2016-06-01

    A comprehensive computational framework based on the finite element method for the simulation of coupled hygro-thermo-mechanical problems in photovoltaic laminates is herein proposed. While the thermo-mechanical problem takes place in the three-dimensional space of the laminate, moisture diffusion occurs in a two-dimensional domain represented by the polymeric layers and by the vertical channel cracks in the solar cells. Therefore, a geometrical multi-scale solution strategy is pursued by solving the partial differential equations governing heat transfer and thermo-elasticity in the three-dimensional space, and the partial differential equation for moisture diffusion in the two dimensional domains. By exploiting a staggered scheme, the thermo-mechanical problem is solved first via a fully implicit solution scheme in space and time, with a specific treatment of the polymeric layers as zero-thickness interfaces whose constitutive response is governed by a novel thermo-visco-elastic cohesive zone model based on fractional calculus. Temperature and relative displacements along the domains where moisture diffusion takes place are then projected to the finite element model of diffusion, coupled with the thermo-mechanical problem by the temperature and crack opening dependent diffusion coefficient. The application of the proposed method to photovoltaic modules pinpoints two important physical aspects: (i) moisture diffusion in humidity freeze tests with a temperature dependent diffusivity is a much slower process than in the case of a constant diffusion coefficient; (ii) channel cracks through Silicon solar cells significantly enhance moisture diffusion and electric degradation, as confirmed by experimental tests.

  11. Research program with no ''measurement problem''

    SciTech Connect

    Noyes, H.P.; Gefwert, C.; Manthey, M.J.

    1985-07-01

    The ''measurement problem'' of contemporary physics is met by recognizing that the physicist participates when constructing and when applying the theory consisting of the formulated formal and measurement criteria (the expressions and rules) providing the necessary conditions which allow him to compute and measure facts, yet retains objectivity by requiring that these criteria, rules and facts be in corroborative equilibrium. We construct the particulate states of quantum physics by a recursive program which incorporates the non-determinism born of communication between asynchronous processes over a shared memory. Their quantum numbers and coupling constants arise from the construction via the unique 4-level combinatorial hierarchy. The construction defines indivisible quantum events with the requisite supraluminal correlations, yet does not allow supraluminal communication. Measurement criteria incorporate c, h-bar, and m/sub p/ or (not ''and'') G. The resulting theory is discrete throughout, contains no infinities, and, as far as we have developed it, is in agreement with quantum mechanical and cosmological fact.

  12. Correlates of Problem-Solving in Programming.

    ERIC Educational Resources Information Center

    Chung, Choi-man

    1988-01-01

    Examines some correlates of programing ability that can predict the computer programing performance of students. Finds that students who score high on mathematics and spatial tests will score high on programing ability tests. Finds that boys perform significantly better than girls in programing ability, as do those who possess home computers. (KO)

  13. Future Problem Solving--One Program Meeting Many Needs.

    ERIC Educational Resources Information Center

    Hume, Katherine C.

    2002-01-01

    This article describes the Future Problem Solving Program, a year-long curriculum project with competitive and non-competitive options. The international program involves 250,000 students and is designed to help students enlarge, enrich, and make more accurate their images of the future. Team problem solving and individual problem solving…

  14. K-Minimax Stochastic Programming Problems

    NASA Astrophysics Data System (ADS)

    Nedeva, C.

    2007-10-01

    The purpose of this paper is a discussion of a numerical procedure based on the simplex method for stochastic optimization problems with partially known distribution functions. The convergence of this procedure is proved by the condition on dual problems.

  15. Problems in Geometrical Optics

    ERIC Educational Resources Information Center

    Joyce, L. S.

    1973-01-01

    Ten laboratory exercises on optics are described to clarify concepts involving point objects and converging lenses producing real images. Mathematical treatment is kept to a minimum to stress concepts involved. (PS)

  16. Problems in Geometrical Optics

    ERIC Educational Resources Information Center

    Joyce, L. S.

    1973-01-01

    Ten laboratory exercises on optics are described to clarify concepts involving point objects and converging lenses producing real images. Mathematical treatment is kept to a minimum to stress concepts involved. (PS)

  17. I Can Problem Solve: An Interpersonal Cognitive Problem-Solving Program. Intermediate Elementary Grades.

    ERIC Educational Resources Information Center

    Shure, Myrna B.

    Designed for teachers of intermediate elementary grades to enable children to learn how to solve the problems they have with others, the underlying goal of the program is to help children develop problem-solving skills so that they learn how to think, not what to think. The interpersonal cognitive problem-solving (ICPS) program includes both…

  18. Preschool-Based Programs for Externalizing Problems

    ERIC Educational Resources Information Center

    Arnold, David H.; Brown, Sharice A.; Meagher, Susan; Baker, Courtney N.; Dobbs, Jennifer; Doctoroff, Greta L.

    2006-01-01

    Few mental health initiatives for young children have used classroom programs. Preschool-based efforts targeting externalizing behavior could help prevent conduct disorders. Additional benefits may include improved academic achievement and reduced risk for other mental health difficulties. Pro-grams that target multiple developmental domains are…

  19. Problems and Issues Across Institutions and Programs

    Treesearch

    Douglas Powell; Jim Wood

    2006-01-01

    The symposium identified the major barriers to collaboration among institutions and programs. This synthesis, while admittedly drawing from only a sample of the papers presented, provides a synoptic view of the major recurring themes voiced by participants.Several overarching statements were voiced. No one institution or one program in isolation can...

  20. Bilingual Program Management: A Problem Solving Approach.

    ERIC Educational Resources Information Center

    De George, George P., Ed.

    A collection of essays on the management of bilingual education programs is organized in three units: managing in a culturally diverse setting, balancing critical interactions, and special issues. The following papers are included: "Recruiting and Retaining Competent Personnel for Bilingual Education Programs" (Joan E. Friedenberg, Curtis H.…

  1. Preschool-Based Programs for Externalizing Problems

    ERIC Educational Resources Information Center

    Arnold, David H.; Brown, Sharice A.; Meagher, Susan; Baker, Courtney N.; Dobbs, Jennifer; Doctoroff, Greta L.

    2006-01-01

    Few mental health initiatives for young children have used classroom programs. Preschool-based efforts targeting externalizing behavior could help prevent conduct disorders. Additional benefits may include improved academic achievement and reduced risk for other mental health difficulties. Pro-grams that target multiple developmental domains are…

  2. User's manual for GAMNAS: Geometric and Material Nonlinear Analysis of Structures

    NASA Technical Reports Server (NTRS)

    Whitcomb, J. D.; Dattaguru, B.

    1984-01-01

    GAMNAS (Geometric and Material Nonlinear Analysis of Structures) is a two dimensional finite-element stress analysis program. Options include linear, geometric nonlinear, material nonlinear, and combined geometric and material nonlinear analysis. The theory, organization, and use of GAMNAS are described. Required input data and results for several sample problems are included.

  3. New computer program solves wide variety of heat flow problems

    NASA Technical Reports Server (NTRS)

    Almond, J. C.

    1966-01-01

    Boeing Engineering Thermal Analyzer /BETA/ computer program uses numerical methods to provide accurate heat transfer solutions to a wide variety of heat flow problems. The program solves steady-state and transient problems in almost any situation that can be represented by a resistance-capacitance network.

  4. Improve Problem Solving Skills through Adapting Programming Tools

    NASA Technical Reports Server (NTRS)

    Shaykhian, Linda H.; Shaykhian, Gholam Ali

    2007-01-01

    There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.

  5. Improve Problem Solving Skills through Adapting Programming Tools

    NASA Technical Reports Server (NTRS)

    Shaykhian, Linda H.; Shaykhian, Gholam Ali

    2007-01-01

    There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.

  6. DNA computation model to solve 0-1 programming problem.

    PubMed

    Zhang, Fengyue; Yin, Zhixiang; Liu, Bo; Xu, Jin

    2004-01-01

    0-1 programming problem is an important problem in opsearch with very widespread applications. In this paper, a new DNA computation model utilizing solution-based and surface-based methods is presented to solve the 0-1 programming problem. This model contains the major benefits of both solution-based and surface-based methods; including vast parallelism, extraordinary information density and ease of operation. The result, verified by biological experimentation, revealed the potential of DNA computation in solving complex programming problem.

  7. Enhancing Digital Fluency through a Training Program for Creative Problem Solving Using Computer Programming

    ERIC Educational Resources Information Center

    Kim, SugHee; Chung, KwangSik; Yu, HeonChang

    2013-01-01

    The purpose of this paper is to propose a training program for creative problem solving based on computer programming. The proposed program will encourage students to solve real-life problems through a creative thinking spiral related to cognitive skills with computer programming. With the goal of enhancing digital fluency through this proposed…

  8. Enhancing Digital Fluency through a Training Program for Creative Problem Solving Using Computer Programming

    ERIC Educational Resources Information Center

    Kim, SugHee; Chung, KwangSik; Yu, HeonChang

    2013-01-01

    The purpose of this paper is to propose a training program for creative problem solving based on computer programming. The proposed program will encourage students to solve real-life problems through a creative thinking spiral related to cognitive skills with computer programming. With the goal of enhancing digital fluency through this proposed…

  9. Gauging spacetime symmetries on the worldsheet and the geometric Langlands program — II

    NASA Astrophysics Data System (ADS)

    Tan, Meng-Chwan

    2008-09-01

    We generalise the analysis carried out in [1], and find that our previous results can be extended beyond the case of SL (N,C). In particular, we show that an equivalence — at the level of the holomorphic chiral algebra — between a bosonic string on a smooth coset manifold G/B and a B-gauged version of itself on G, will imply an isomorphism of classical Script W-algebras and a level relation which underlie a geometric Langlands correspondence for the simply-laced, complex ADE-groups. In addition, as opposed to line operators and branes of an open topological sigma-model, the Hecke operators and Hecke eigensheaves, can, instead, be physically interpreted in terms of the correlation functions of local operators in the holomorphic chiral algebra of a closed, quasi-topological sigma-model. Our present results thus serve as an alternative physical interpretation — to that of an electric-magnetic duality of four-dimensional gauge theory demonstrated earlier by Kapustin and Witten in [2]—of the geometric Langlands correspondence for complex ADE-groups. The cases with tame and mild ``ramifications'' are also discussed.

  10. Program Planning with Problem Mapping to Better Understand Need

    ERIC Educational Resources Information Center

    Forstadt, Leslie A.; Doore, Brian

    2012-01-01

    This article describes two methods for use in program development and refinement. Problem mapping and forcefield analysis are explained with a real-world example about parenting education. Both methods are visual and consider multiple causes and effects of a problem. The methods are effective for clearly thinking through a problem, identifying…

  11. Program Planning with Problem Mapping to Better Understand Need

    ERIC Educational Resources Information Center

    Forstadt, Leslie A.; Doore, Brian

    2012-01-01

    This article describes two methods for use in program development and refinement. Problem mapping and forcefield analysis are explained with a real-world example about parenting education. Both methods are visual and consider multiple causes and effects of a problem. The methods are effective for clearly thinking through a problem, identifying…

  12. A computer program for the geometrically nonlinear static and dynamic analysis of arbitrarily loaded shells of revolution, theory and users manual

    NASA Technical Reports Server (NTRS)

    Ball, R. E.

    1972-01-01

    A digital computer program known as SATANS (static and transient analysis, nonlinear, shells) for the geometrically nonlinear static and dynamic response of arbitrarily loaded shells of revolution is presented. Instructions for the preparation of the input data cards and other information necessary for the operation of the program are described in detail and two sample problems are included. The governing partial differential equations are based upon Sanders' nonlinear thin shell theory for the conditions of small strains and moderately small rotations. The governing equations are reduced to uncoupled sets of four linear, second order, partial differential equations in the meridional and time coordinates by expanding the dependent variables in a Fourier sine or cosine series in the circumferential coordinate and treating the nonlinear modal coupling terms as pseudo loads. The derivatives with respect to the meridional coordinate are approximated by central finite differences, and the displacement accelerations are approximated by the implicit Houbolt backward difference scheme with a constant time interval. The boundaries of the shell may be closed, free, fixed, or elastically restrained. The program is coded in the FORTRAN 4 language and is dimensioned to allow a maximum of 10 arbitrary Fourier harmonics and a maximum product of the total number of meridional stations and the total number of Fourier harmonics of 200. The program requires 155,000 bytes of core storage.

  13. Opportunities and Problems in Marketing Programs.

    ERIC Educational Resources Information Center

    Coe, Barbara J.; Welch, Joe

    1988-01-01

    A description and discussion of a university market penetration plan looks at problems and opportunities related to market selection, establishment of performance objectives, timing, use of human resources, developing a promotional plan and activities, doing a market survey, garnering alumni support, using the media, and using college-community…

  14. Administrator Preparation Programs: Problems in Evaluating Competence.

    ERIC Educational Resources Information Center

    Kelley, Edgar A.

    Judgments about competence are always relative, tentative, and situation-specific. An effective competency-based program for preparation of school administrators must base judgments about competency development on the same sources that will judge on-the-job administrative competency. The four most common instructional orientations to administrator…

  15. Solving Integer Programming Problems by Using Artificial Bee Colony Algorithm

    NASA Astrophysics Data System (ADS)

    Akay, Bahriye; Karaboga, Dervis

    This paper presents a study that applies the Artificial Bee Colony algorithm to integer programming problems and compares its performance with those of Particle Swarm Optimization algorithm variants and Branch and Bound technique presented to the literature. In order to cope with integer programming problems, in neighbour solution production unit, solutions are truncated to the nearest integer values. The experimental results show that Artificial Bee Colony algorithm can handle integer programming problems efficiently and Artificial Bee Colony algorithm can be considered to be very robust by the statistics calculated such as mean, median, standard deviation.

  16. Promising Parenting Programs for Reducing Adolescent Problem Behaviors.

    PubMed

    Haggerty, Kevin P; McGlynn-Wright, Anne; Klima, Tali

    2013-01-01

    Adolescent problem behaviors (substance use, delinquency, school dropout, pregnancy, and violence) are costly not only for individuals, but for entire communities. Policymakers and practitioners that are interested in preventing these problem behaviors are faced with many programming options. In this review, we discuss two criteria for selecting relevant parenting programs, and provide five examples of such programs. The first criterion for program selection is theory based. Well-supported theories, such as the social development model, have laid out key family-based risk and protective factors for problem behavior. Programs that target these risk and protective factors are more likely to be effective. Second, programs should have demonstrated efficacy; these interventions have been called "evidence-based programs" (EBP). This review highlights the importance of evidence from rigorous research designs, such as randomized clinical trials, in order to establish program efficacy. Nurse-Family Partnership, The Incredible Years, Positive Parenting Program, Strengthening Families 10-14, and Staying Connected with Your Teen are examined. The unique features of each program are briefly presented. Evidence showing impact on family risk and protective factors, as well as long-term problem behaviors, is reviewed. Finally, a measure of cost effectiveness of each program is provided. We propose that not all programs are of equal value, and suggest two simple criteria for selecting a parenting program with a high likelihood for positive outcomes. Furthermore, although this review is not exhaustive, the five examples of EBPs offer a good start for policymakers and practitioners seeking to implement effective programs in their communities. Thus, this paper offers practical suggestions for those grappling with investments in child and adolescent programs on the ground.

  17. Preservice Teachers' Use of Spatio-Visual Elements and their Level of Justification Dealing with a Geometrical Construction Problem

    ERIC Educational Resources Information Center

    Tapan, Menekse Seden; Arslan, Cigdem

    2009-01-01

    The main purpose of this research is to determine to what extent preservice teachers use visual elements and mathematical properties when they are dealing with a geometrical construction activity. The axiomatic structure of the Euclidian geometry forms a coherent field of objects and relations of a theoretical nature; and thus it constitutes a…

  18. Measurement problem in Program Universe. Revision

    SciTech Connect

    Noyes, H.P.; Gefwert, C.; Manthey, M.J.

    1985-07-01

    The ''measurement problem'' of contemporary physics is in our view an artifact of its philosophical and mathematical underpinnings. We describe a new philosophical view of theory formation, rooted in Wittgenstein, and Bishop's and Martin-Loef's constructivity, which obviates such discussions. We present an unfinished, but very encouraging, theory which is compatible with this philosophical framework. The theory is based on the concepts of counting and combinatorics in the framework provided by the combinatorial hierarchy, a unique hierarchy of bit strings which interact by an operation called discrimination. Measurement criteria incorporate c, h-bar and m/sub p/ or (not ''and'') G. The resulting theory is discrete throughout, contains no infinities, and, as far as we have developed it, is in agreement with quantum mechanical and cosmological fact. 15 refs.

  19. Measurement problem in Program Universe. Revision

    NASA Astrophysics Data System (ADS)

    Noyes, H. P.; Gefwert, C.; Manthey, M. J.

    1985-07-01

    The measurement problem of contemporary physics is in our view an artifact of its philosophical and mathematical underpinnings. We describe a new philosophical view of theory formation, rooted in Wittgenstein, and Bishop's and Martin-Loef's constructivity, which obviates such discussions. We present an unfinished, but very encouraging, theory which is compatible with this philosophical framework. The theory is based on the concepts of counting and combinatorics in the framework provided by the combinatorial hierarchy, a unique hierarchy of bit strings which interact by an operation called discrimination. Measurement criteria incorporate c, h-bar and m/sub p/ or (not and) G. The resulting theory is discrete throughout, contains no infinities, and, as far as we have developed it, is in agreement with quantum mechanical and cosmological fact.

  20. Promising Parenting Programs for Reducing Adolescent Problem Behaviors

    PubMed Central

    Haggerty, Kevin P.; McGlynn-Wright, Anne; Klima, Tali

    2013-01-01

    Purpose Adolescent problem behaviors (substance use, delinquency, school dropout, pregnancy, and violence) are costly not only for individuals, but for entire communities. Policymakers and practitioners that are interested in preventing these problem behaviors are faced with many programming options. In this review, we discuss two criteria for selecting relevant parenting programs, and provide five examples of such programs. Design/methodology/approach The first criterion for program selection is theory based. Well-supported theories, such as the social development model, have laid out key family-based risk and protective factors for problem behavior. Programs that target these risk and protective factors are more likely to be effective. Second, programs should have demonstrated efficacy; these interventions have been called “evidence-based programs” (EBP). This review highlights the importance of evidence from rigorous research designs, such as randomized clinical trials, in order to establish program efficacy. Findings Nurse-Family Partnership, The Incredible Years, Positive Parenting Program, Strengthening Families 10–14, and Staying Connected with Your Teen are examined. The unique features of each program are briefly presented. Evidence showing impact on family risk and protective factors, as well as long-term problem behaviors, is reviewed. Finally, a measure of cost effectiveness of each program is provided. Originality/value We propose that not all programs are of equal value, and suggest two simple criteria for selecting a parenting program with a high likelihood for positive outcomes. Furthermore, although this review is not exhaustive, the five examples of EBPs offer a good start for policymakers and practitioners seeking to implement effective programs in their communities. Thus, this paper offers practical suggestions for those grappling with investments in child and adolescent programs on the ground. PMID:24416068

  1. The Environmental Justice Collaborative Problem-Solving Cooperative Agreement Program

    EPA Pesticide Factsheets

    The Environmental Justice Collaborative Problem-Solving (CPS) Cooperative Agreement Program provides financial assistance to eligible organizations working on or planning to work on projects to address local environmental and/or public health issues

  2. Symmetry Groups for Linear Programming Relaxations of Orthogonal Array Problems

    DTIC Science & Technology

    2015-03-26

    Symmetry Groups for Linear Programming Relaxations of Orthogonal Array Problems THESIS MARCH 2015 David M. Arquette, Second Lieutenant, USAF AFIT-ENC...work of the U.S. Government and is not subject to copyright protection in the United States. AFIT-ENC-MS-15-M-003 SYMMETRY GROUPS FOR LINEAR...PUBLIC RELEASE; DISTRIBUTION UNLIMITED. AFIT-ENC-MS-15-M-003 SYMMETRY GROUPS FOR LINEAR PROGRAMMING RELAXATIONS OF ORTHOGONAL ARRAY PROBLEMS David M

  3. Linear Programming and Its Application to Pattern Recognition Problems

    NASA Technical Reports Server (NTRS)

    Omalley, M. J.

    1973-01-01

    Linear programming and linear programming like techniques as applied to pattern recognition problems are discussed. Three relatively recent research articles on such applications are summarized. The main results of each paper are described, indicating the theoretical tools needed to obtain them. A synopsis of the author's comments is presented with regard to the applicability or non-applicability of his methods to particular problems, including computational results wherever given.

  4. Solving linear integer programming problems by a novel neural model.

    PubMed

    Cavalieri, S

    1999-02-01

    The paper deals with integer linear programming problems. As is well known, these are extremely complex problems, even when the number of integer variables is quite low. Literature provides examples of various methods to solve such problems, some of which are of a heuristic nature. This paper proposes an alternative strategy based on the Hopfield neural network. The advantage of the strategy essentially lies in the fact that hardware implementation of the neural model allows for the time required to obtain a solution so as not depend on the size of the problem to be solved. The paper presents a particular class of integer linear programming problems, including well-known problems such as the Travelling Salesman Problem and the Set Covering Problem. After a brief description of this class of problems, it is demonstrated that the original Hopfield model is incapable of supplying valid solutions. This is attributed to the presence of constant bias currents in the dynamic of the neural model. A demonstration of this is given and then a novel neural model is presented which continues to be based on the same architecture as the Hopfield model, but introduces modifications thanks to which the integer linear programming problems presented can be solved. Some numerical examples and concluding remarks highlight the solving capacity of the novel neural model.

  5. Problem Solving Variations in an Online Programming Course

    ERIC Educational Resources Information Center

    Ebrahimi, Alireza

    2007-01-01

    An observation on teaching introductory programming courses on SLN for a period of two terms led me to believe that online students try various ways to solve a problem. In the beginning, I got the impression that some of their approaches for a solution were wrong; but after a little investigation, I found that some of the problem-solving…

  6. Solving quadratic programming problems by delayed projection neural network.

    PubMed

    Yang, Yongqing; Cao, Jinde

    2006-11-01

    In this letter, the delayed projection neural network for solving convex quadratic programming problems is proposed. The neural network is proved to be globally exponentially stable and can converge to an optimal solution of the optimization problem. Three examples show the effectiveness of the proposed network.

  7. Experiences in Rural Mental Health. VIII: Programming and Administrative Problems.

    ERIC Educational Resources Information Center

    Hollister, William G.; And Others

    Based on a North Carolina Feasibility study (1967-73) which focused on development of a pattern for providing comprehensive mental health services to rural people, this guide deals with programming and administrative problems in Vance and Franklin counties. Describing those problems believed to be most likely to occur in rural areas, this booklet…

  8. Changing the Composition Program: A Problem-Solving Approach.

    ERIC Educational Resources Information Center

    Soven, Margot

    Little attention has been paid in composition journals and professional conferences to the practical problems associated with a writing program director's efforts to introduce an innovative composition curriculum within a traditional English department. A collaborative, problem solving approach to curriculum change is a practical way to proceed…

  9. Problems in Choosing Tools and Methods for Teaching Programming

    ERIC Educational Resources Information Center

    Vitkute-Adžgauskiene, Davia; Vidžiunas, Antanas

    2012-01-01

    The paper analyses the problems in selecting and integrating tools for delivering basic programming knowledge at the university level. Discussion and analysis of teaching the programming disciplines, the main principles of study programme design, requirements for teaching tools, methods and corresponding languages is presented, based on literature…

  10. An Interdisciplinary Program in Technical Communications: Problems Encountered.

    ERIC Educational Resources Information Center

    Eckman, Martha

    1979-01-01

    Notes three major types of problems encountered by colleges and universities attempting to establish a program in technical communications: society's increasing need for better communications; industry's reluctance to fund cooperative programs; and difficulties within the academic community involving course selection, intercollegial competition…

  11. Using Problem Solving to Teach a Programming Language.

    ERIC Educational Resources Information Center

    Milbrandt, George

    1995-01-01

    Computer studies courses should incorporate as many computer concepts and programming language experiences as possible. A gradual increase in problem difficulty will help the student to understand various computer concepts, and the programming language's syntax and structure. A sidebar provides two examples of how to establish a learning…

  12. Pupil Personnel Services: A Model. Programs, Trends, Problems.

    ERIC Educational Resources Information Center

    Shumake, Franklin

    As an attempt is made to develop pupil personnel programs throughout the United States, one faces many diverse problems: (1) diversity of background for pupil personnel specialists, (2) professional acceptance of other educators, (3) crystallization of purposes, and (4) need for a model program. The Rockdale County model is discussed in terms of…

  13. Efficient numerical methods for entropy-linear programming problems

    NASA Astrophysics Data System (ADS)

    Gasnikov, A. V.; Gasnikova, E. B.; Nesterov, Yu. E.; Chernov, A. V.

    2016-04-01

    Entropy-linear programming (ELP) problems arise in various applications. They are usually written as the maximization of entropy (minimization of minus entropy) under affine constraints. In this work, new numerical methods for solving ELP problems are proposed. Sharp estimates for the convergence rates of the proposed methods are established. The approach described applies to a broader class of minimization problems for strongly convex functionals with affine constraints.

  14. EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.

    ERIC Educational Resources Information Center

    Jarvis, John J.; And Others

    Designed for student use in solving linear programming problems, the interactive computer program described (EZLP) permits the student to input the linear programming model in exactly the same manner in which it would be written on paper. This report includes a brief review of the development of EZLP; narrative descriptions of program features,…

  15. Linear decomposition approach for a class of nonconvex programming problems.

    PubMed

    Shen, Peiping; Wang, Chunfeng

    2017-01-01

    This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids. It shows that under certain assumptions the original problem can be transformed and decomposed into a polynomial number of equivalent linear programming subproblems. Based on solving a series of liner programming subproblems corresponding to those grid points we can obtain the near-optimal solution of the original problem. Compared to existing results in the literature, the proposed algorithm does not require the assumptions of quasi-concavity and differentiability of the objective function, and it differs significantly giving an interesting approach to solving the problem with a reduced running time.

  16. A Review of Youth Employment Problems, Programs & Policies: Volume 2. Special Needs and Concentrated Problems.

    ERIC Educational Resources Information Center

    Vice President's Task Force on Youth Employment, Washington, DC.

    This series of nine reports reviews available information on the special needs and concentrated problems of youth employment. (It constitutes the second of a three-volume compendium; other volumes examine causes and dimensions of youth employment problems and analyze program experience--see note.) The effects of discrimination on minority youth…

  17. I Can Problem Solve: An Interpersonal Cognitive Problem Solving Program. Kindergarten and Primary Grades.

    ERIC Educational Resources Information Center

    Shure, Myrna B.

    Designed for teachers of kindergarten and the primary grades to enable children to learn how to solve the problems they have with others, the underlying goal of the program is to help children develop problem-solving skills so that they learn how to think, not what to think. The 89 lessons are adaptable for various levels of ability throughout the…

  18. I Can Problem Solve: An Interpersonal Cognitive Problem-Solving Program. Preschool.

    ERIC Educational Resources Information Center

    Shure, Myrna B.

    Designed for teachers of preschool to enable children to learn how to solve the problems they have with others, the underlying goal of the program is to help children develop problem-solving skills so that they learn how to think, not what to think. Originally developed for four-year-old children in a preschool setting, most three-year-old…

  19. Parallel solution of sparse one-dimensional dynamic programming problems

    NASA Technical Reports Server (NTRS)

    Nicol, David M.

    1989-01-01

    Parallel computation offers the potential for quickly solving large computational problems. However, it is often a non-trivial task to effectively use parallel computers. Solution methods must sometimes be reformulated to exploit parallelism; the reformulations are often more complex than their slower serial counterparts. We illustrate these points by studying the parallelization of sparse one-dimensional dynamic programming problems, those which do not obviously admit substantial parallelization. We propose a new method for parallelizing such problems, develop analytic models which help us to identify problems which parallelize well, and compare the performance of our algorithm with existing algorithms on a multiprocessor.

  20. Solving Classification Problems Using Genetic Programming Algorithms on GPUs

    NASA Astrophysics Data System (ADS)

    Cano, Alberto; Zafra, Amelia; Ventura, Sebastián

    Genetic Programming is very efficient in problem solving compared to other proposals but its performance is very slow when the size of the data increases. This paper proposes a model for multi-threaded Genetic Programming classification evaluation using a NVIDIA CUDA GPUs programming model to parallelize the evaluation phase and reduce computational time. Three different well-known Genetic Programming classification algorithms are evaluated using the parallel evaluation model proposed. Experimental results using UCI Machine Learning data sets compare the performance of the three classification algorithms in single and multithreaded Java, C and CUDA GPU code. Results show that our proposal is much more efficient.

  1. Recognition of geometric primitives using logic-program and probabilistic-network reasoning methods

    NASA Astrophysics Data System (ADS)

    Munck-Fairwood, Roger C.

    1992-03-01

    This paper addresses the issue of recognition of 3-D objects from a potentially very large database of categories of objects, assuming the data are provided in the form of the edges available from a single monocular view, which indicate the discontinuities in depth and surface orientation. The work is partly inspired by the `Recognition by Components' approach suggested fairly recently by Irving Biederman using `geons,' chosen for their qualitatively distinguishable nonmetric viewpoint-invariant properties. The work is also inspired by Richard Gregory's model of human visual recognition which involves probabilistic reasoning, and the regarding of perception as hypothesis. Further, the interpretation of some data can influence the expectation of other data. A novel attempt is made here to apply two automatic reasoning tools to a sub-task of the general recognition process, viz., the recognition of isolated geons in an idealized image. The tools are logic programming and `belief networks' (causal probabilistic networks). Both the tools have the important property of allowing propagation of information in both directions, i.e., data to hypotheses, and vice-versa. The results to date show good patterns of reasoning consistent with one's intuition and point to the possibility of appropriately `tuning' some feature detectors according to other data received. Future goals include the recognition of geons from real gray-level image data, the extension of the belief network to composite objects, and the use of a reverse-driven image analysis logic program to generate graphics and thereby identify appropriate model constraints.

  2. Nucleus downscaling in mouse embryos is regulated by cooperative developmental and geometric programs

    PubMed Central

    Tsichlaki, Elina; FitzHarris, Greg

    2016-01-01

    Maintaining appropriate nucleus size is important for cell health, but the mechanisms by which this is achieved are poorly understood. Controlling nucleus size is a particular challenge in early development, where the nucleus must downscale in size with progressive reductive cell divisions. Here we use live and fixed imaging, micromanipulation approaches, and small molecule analyses during preimplantation mouse development to probe the mechanisms by which nucleus size is determined. We find a close correlation between cell and nuclear size at any given developmental stage, and show that experimental cytoplasmic reduction can alter nuclear size, together indicating that cell size helps dictate nuclear proportions. Additionally, however, by creating embryos with over-sized blastomeres we present evidence of a developmental program that drives nuclear downscaling independently of cell size. We show that this developmental program does not correspond with nuclear import rates, but provide evidence that PKC activity may contribute to this mechanism. We propose a model in which nuclear size regulation during early development is a multi-mode process wherein nucleus size is set by cytoplasmic factors, and fine-tuned on a cell-by-cell basis according to cell size. PMID:27320842

  3. Nucleus downscaling in mouse embryos is regulated by cooperative developmental and geometric programs.

    PubMed

    Tsichlaki, Elina; FitzHarris, Greg

    2016-06-20

    Maintaining appropriate nucleus size is important for cell health, but the mechanisms by which this is achieved are poorly understood. Controlling nucleus size is a particular challenge in early development, where the nucleus must downscale in size with progressive reductive cell divisions. Here we use live and fixed imaging, micromanipulation approaches, and small molecule analyses during preimplantation mouse development to probe the mechanisms by which nucleus size is determined. We find a close correlation between cell and nuclear size at any given developmental stage, and show that experimental cytoplasmic reduction can alter nuclear size, together indicating that cell size helps dictate nuclear proportions. Additionally, however, by creating embryos with over-sized blastomeres we present evidence of a developmental program that drives nuclear downscaling independently of cell size. We show that this developmental program does not correspond with nuclear import rates, but provide evidence that PKC activity may contribute to this mechanism. We propose a model in which nuclear size regulation during early development is a multi-mode process wherein nucleus size is set by cytoplasmic factors, and fine-tuned on a cell-by-cell basis according to cell size.

  4. Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution

    SciTech Connect

    Hamadameen, Abdulqader Othman; Zainuddin, Zaitul Marlizawati

    2014-06-19

    This study deals with multiobjective fuzzy stochastic linear programming problems with uncertainty probability distribution which are defined as fuzzy assertions by ambiguous experts. The problem formulation has been presented and the two solutions strategies are; the fuzzy transformation via ranking function and the stochastic transformation when α{sup –}. cut technique and linguistic hedges are used in the uncertainty probability distribution. The development of Sen’s method is employed to find a compromise solution, supported by illustrative numerical example.

  5. Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution

    NASA Astrophysics Data System (ADS)

    Hamadameen, Abdulqader Othman; Zainuddin, Zaitul Marlizawati

    2014-06-01

    This study deals with multiobjective fuzzy stochastic linear programming problems with uncertainty probability distribution which are defined as fuzzy assertions by ambiguous experts. The problem formulation has been presented and the two solutions strategies are; the fuzzy transformation via ranking function and the stochastic transformation when α-. cut technique and linguistic hedges are used in the uncertainty probability distribution. The development of Sen's method is employed to find a compromise solution, supported by illustrative numerical example.

  6. An Expanded Combined Evidence Approach to the Gavialis Problem Using Geometric Morphometric Data from Crocodylian Braincases and Eustachian Systems

    PubMed Central

    Gold, Maria Eugenia Leone; Brochu, Christopher A.; Norell, Mark A.

    2014-01-01

    The phylogenetic position of the Indian gharial (Gavialis gangeticus) is disputed - morphological characters place Gavialis as the sister to all other extant crocodylians, whereas molecular and combined analyses find Gavialis and the false gharial (Tomistoma schlegelii) to be sister taxa. Geometric morphometric techniques have only begun to be applied to this issue, but most of these studies have focused on the exterior of the skull. The braincase has provided useful phylogenetic information for basal crurotarsans, but has not been explored for the crown group. The Eustachian system is thought to vary phylogenetically in Crocodylia, but has not been analytically tested. To determine if gross morphology of the crocodylian braincase proves informative to the relationships of Gavialis and Tomistoma, we used two- and three-dimensional geometric morphometric approaches. Internal braincase images were obtained using high-resolution computerized tomography scans. A principal components analysis identified that the first component axis was primarily associated with size and did not show groupings that divide the specimens by phylogenetic affinity. Sliding semi-landmarks and a relative warp analysis indicate that a unique Eustachian morphology separates Gavialis from other extant members of Crocodylia. Ontogenetic expansion of the braincase results in a more dorsoventrally elongate median Eustachian canal. Changes in the shape of the Eustachian system do provide phylogenetic distinctions between major crocodylian clades. Each morphometric dataset, consisting of continuous morphological characters, was added independently to a combined cladistic analysis of discrete morphological and molecular characters. The braincase data alone produced a clade that included crocodylids and Gavialis, whereas the Eustachian data resulted in Gavialis being considered a basally divergent lineage. When each morphometric dataset was used in a combined analysis with discrete morphological and

  7. Managing problem employees: a model program and practical guide.

    PubMed

    Miller, Laurence

    2010-01-01

    This article presents a model program for managing problem employees that includes a description ofthe basic types of problem employees and employee problems, as well as practical recommendations for. (1) selection and screening, (2) education and training, (3) coaching and counseling, (4) discipline, (5) psychological fitness-for-duty evaluations, (6) mental health services, (7) termination, and (8) leadership and administrative strategies. Throughout, the emphasis on balancing the need for order and productivity in the workplace with fairness and concern for employee health and well-being.

  8. Quantum algorithms for the ordered search problem via semidefinite programming

    SciTech Connect

    Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A.

    2007-03-15

    One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log{sub 2} N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log{sub 605} N{approx_equal}0.433 log{sub 2} N queries, which improves upon the previously best known exact algorithm.

  9. An analytic-geometric model of the effect of spherically distributed injection errors for Galileo and Ulysses spacecraft - The multi-stage problem

    NASA Technical Reports Server (NTRS)

    Longuski, James M.; Mcronald, Angus D.

    1988-01-01

    In previous work the problem of injecting the Galileo and Ulysses spacecraft from low earth orbit into their respective interplanetary trajectories has been discussed for the single stage (Centaur) vehicle. The central issue, in the event of spherically distributed injection errors, is what happens to the vehicle? The difficulties addressed in this paper involve the multi-stage problem since both Galileo and Ulysses will be utilizing the two-stage IUS system. Ulysses will also include a third stage: the PAM-S. The solution is expressed in terms of probabilities for total percentage of escape, orbit decay and reentry trajectories. Analytic solutions are found for Hill's Equations of Relative Motion (more recently called Clohessy-Wiltshire Equations) for multi-stage injections. These solutions are interpreted geometrically on the injection sphere. The analytic-geometric models compare well with numerical solutions, provide insight into the behavior of trajectories mapped on the injection sphere and simplify the numerical two-dimensional search for trajectory families.

  10. EARLY DETECTION AND PROGRAMING FOR CHILDREN WITH SCHOOL ADJUSTMENT PROBLEMS.

    ERIC Educational Resources Information Center

    MCGAHAN, F.E.

    THE GALENA PARK SPECIAL PROGRAM IS AN EFFORT ON THE PART OF THE SCHOOL ADMINISTRATION TO DETECT, AT THE EARLIEST TIME, ANY STUDENT PROBLEM WHICH MAY LEAD TO DIFFICULTIES IN SCHOOL ADJUSTMENT. ALL PHASES OF PUPIL PERSONNEL SERVICES ARE PLACED UNDER ONE COORDINATOR TO EXPEDITE SERVICES TO THE CHILD IN DIFFICULTY. EARLY DETECTION OF POTENTIAL PROBLEM…

  11. Robust semidefinite programming approach to the separability problem

    SciTech Connect

    Brandao, Fernando G.S.L.; Vianna, Reinaldo O.

    2004-12-01

    We express the optimization of entanglement witnesses for arbitrary bipartite states in terms of a class of convex optimization problems known as robust semidefinite programs (RSDPs). We propose, using well known properties of RSDPs, several sufficient tests for separability of mixed states. Our results are then generalized to multipartite density operators.

  12. Approximate proximal point methods for convex programming problems

    SciTech Connect

    Eggermont, P.

    1994-12-31

    We study proximal point methods for the finite dimensional convex programming problem minimize f(x) such that x {element_of} C, where f : dom f {contained_in} RIR is a proper convex function and C {contained_in} R is a closed convex set.

  13. An Interdisciplinary Program in Technical Communications: Problems Encountered.

    ERIC Educational Resources Information Center

    Eckman, Martha

    The need for experts in technical communication is growing significantly while the number of college graduates in the field accounts for less than one percent of the need. Three major types of problems should be considered in trying to establish a technical communication program: those involving society's need for better technical communicators,…

  14. Parent Drug Education Programs: Reasons, Problems, and Implications.

    ERIC Educational Resources Information Center

    Fox, Tricia A.

    1991-01-01

    Presents an overview of parent drug education programs together with information regarding those problems, concerns, and needs faced by parents who are dealing with an offspring drug user/abuser. Emphasizes the unique, individual characteristics of parents and suggests that these influences may be the main determinants of the effectiveness of…

  15. The toxic waste dump problem and a suggested insurance program

    SciTech Connect

    Fisher, A.

    1980-01-01

    The extent of the hazardous waste problem in the U.S. is explored. To emphasize the enormous scope of the problem, several recent cases involving hazardous waste disasters, including the Love Canal incident, are reviewed. Legislation related to toxic waste disposal is discussed. A Nat'l Hazardous Waste Insurance Program, based on the policies of the Nat'l Flood Insurance Program, is proposed. The rationale for government involvement in insurance provision is examined. The cost to taxpayers of this toxic waste insurance program will depend on several factors, including: the types of coverage available/ upper limits on each type of coverage/ the premium rates charged for each type of coverage/ the number and size of potential impact acres/ the number of people who would actually buy the insurance/ the actual incidence of hazardous waste damages/ and the time frame chosen for mapping all potential impact areas. (138 references)

  16. Alaska Problem Resource Manual: Alaska Future Problem Solving Program. Alaska Problem 1985-86.

    ERIC Educational Resources Information Center

    Gorsuch, Marjorie, Ed.

    "Alaska's Image in the Lower 48," is the theme selected by a Blue Ribbon panel of state and national leaders who felt that it was important for students to explore the relationship between Alaska's outside image and the effect of that image on the federal programs/policies that impact Alaska. An overview of Alaska is presented first in…

  17. Alaska Problem Resource Manual: Alaska Future Problem Solving Program. Alaska Problem 1985-86.

    ERIC Educational Resources Information Center

    Gorsuch, Marjorie, Ed.

    "Alaska's Image in the Lower 48," is the theme selected by a Blue Ribbon panel of state and national leaders who felt that it was important for students to explore the relationship between Alaska's outside image and the effect of that image on the federal programs/policies that impact Alaska. An overview of Alaska is presented first in…

  18. Solving seismological problems using sgraph program: II-waveform modeling

    SciTech Connect

    Abdelwahed, Mohamed F.

    2012-09-26

    One of the seismological programs to manipulate seismic data is SGRAPH program. It consists of integrated tools to perform advanced seismological techniques. SGRAPH is considered a new system for maintaining and analyze seismic waveform data in a stand-alone Windows-based application that manipulate a wide range of data formats. SGRAPH was described in detail in the first part of this paper. In this part, I discuss the advanced techniques including in the program and its applications in seismology. Because of the numerous tools included in the program, only SGRAPH is sufficient to perform the basic waveform analysis and to solve advanced seismological problems. In the first part of this paper, the application of the source parameters estimation and hypocentral location was given. Here, I discuss SGRAPH waveform modeling tools. This paper exhibits examples of how to apply the SGRAPH tools to perform waveform modeling for estimating the focal mechanism and crustal structure of local earthquakes.

  19. A convergence theory for a class of nonlinear programming problems.

    NASA Technical Reports Server (NTRS)

    Rauch, S. W.

    1973-01-01

    A recent convergence theory of Elkin concerning methods for unconstrained minimization is extended to a certain class of nonlinear programming problems. As in Elkin's original approach, the analysis of a variety of step-length algorithms is treated entirely separately from that of several direction algorithms. This allows for their combination into many different methods for solving the constrained problem. These include some of the methods of Rosen and Zoutendijk. We also extend the results of Topkis and Veinott to nonconvex sets and drop their requirement of the uniform feasibility of a subsequence of the search directions.

  20. On the Dirichlet and Serrin Problems for the Inhomogeneous Infinity Laplacian in Convex Domains: Regularity and Geometric Results

    NASA Astrophysics Data System (ADS)

    Crasta, Graziano; Fragalà, Ilaria

    2015-12-01

    Given an open bounded subset Ω of {{R}^n}, which is convex and satisfies an interior sphere condition, we consider the pde {-Δ_{∞} u = 1} in Ω, subject to the homogeneous boundary condition u = 0 on ∂Ω. We prove that the unique solution to this Dirichlet problem is power-concave (precisely, 3/4 concave) and it is of class C 1( Ω). We then investigate the overdetermined Serrin-type problem, formerly considered in Buttazzo and Kawohl (Int Math Res Not, pp 237-247, 2011), obtained by adding the extra boundary condition {|nabla u| = a} on ∂Ω; by using a suitable P-function we prove that, if Ω satisfies the same assumptions as above and in addition contains a ball which touches ∂Ω at two diametral points, then the existence of a solution to this Serrin-type problem implies that necessarily the cut locus and the high ridge of Ω coincide. In turn, in dimension n = 2, this entails that Ω must be a stadium-like domain, and in particular it must be a ball in case its boundary is of class C 2.

  1. BRIK, An Interactive, Goal Programming Model for Nuclear Exchange Problems

    DTIC Science & Technology

    1984-03-01

    allocation is achieved through a nonlinear integer progamming algorithm using a branch and bound technique (Ref 21). DAVID, This model allocates a...Because of the complexity of the damage function and the nonlinearity of portions of the constraint set, a Lagrangian solution method is used (Ref 15...the weapon stockpile. The model is complex and requires the solution of a nonlinear programming problem for every target complex. DAY assigns values

  2. A Hybrid Constraint Programming Approach for Nurse Rostering Problems

    NASA Astrophysics Data System (ADS)

    Qu, Rong; He, Fang

    Due to the complexity of nurse rostering problems (NRPs), Constraint Programming (CP) approaches on their own have shown to be ineffective in solving these highly constrained problems. We investigate a two-stage hybrid CP approach on real world benchmark NRPs. In the first stage, a constraint satisfaction model is used to generate weekly rosters consist of high quality shift sequences satisfying a subset of constraints. An iterative forward search is then adapted to extend them to build complete feasible solutions. Variable and value selection heuristics are employed to improve the efficiency. In the second stage, a simple Variable Neighborhood Search is used to quickly improve the solution obtained. The basic idea of the hybrid approach is based on the observations that high quality nurse rosters consist of high quality shift sequences. By decomposing the problems into solvable sub-problems for CP, the search space of the original problems are significantly reduced. The results on benchmark problems demonstrate the efficiency of this hybrid CP approach when compared to the state-of-the-art approaches in the literature.

  3. Multi-choice stochastic bi-level programming problem in cooperative nature via fuzzy programming approach

    NASA Astrophysics Data System (ADS)

    Maiti, Sumit Kumar; Roy, Sankar Kumar

    2016-05-01

    In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general transformation technique with the help of binary variables is used to transform the multi-choice type cost coefficients of the objective functions of Decision Makers(DMs). Then the transformed problem is considered as a deterministic multi-choice bi-level programming problem. Finally, a numerical example is presented to illustrate the usefulness of the paper.

  4. Simplified partial digest problem: enumerative and dynamic programming algorithms.

    PubMed

    Blazewicz, Jacek; Burke, Edmund; Kasprzak, Marta; Kovalev, Alexandr; Kovalyov, Mikhail

    2007-01-01

    We study the Simplified Partial Digest Problem (SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental errors. SPDP is NP-hard in the strong sense. We present an $O(n2;n)$ time enumerative algorithm and an O(n(2q)) time dynamic programming algorithm for the error-free SPDP, where $n$ is the number of restriction sites and n is the number of distinct intersite distances. We also give examples of the problem, in which there are 2(n+2)/(3)-1 non-congruent solutions. These examples partially answer a question recently posed in the literature about the number of solutions of SPDP. We adapt our enumerative algorithm for handling SPDP with imprecise input data. Finally, we describe and discuss the results of the computer experiments with our algorithms.

  5. Neural network for solving convex quadratic bilevel programming problems.

    PubMed

    He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie

    2014-03-01

    In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.

  6. Hierarchical Multiobjective Linear Programming Problems with Fuzzy Domination Structures

    NASA Astrophysics Data System (ADS)

    Yano, Hitoshi

    2010-10-01

    In this paper, we focus on hierarchical multiobjective linear programming problems with fuzzy domination structures where multiple decision makers in a hierarchical organization have their own multiple objective linear functions together with common linear constraints. After introducing decision powers and the solution concept based on the α-level set for the fuzzy convex cone Λ which reflects a fuzzy domination structure, we propose a fuzzy approach to obtain a satisfactory solution which reflects not only the hierarchical relationships between multiple decision makers but also their own preferences for their membership functions. In the proposed method, instead of Pareto optimal concept, a generalized Λ˜α-extreme point concept is introduced. In order to obtain a satisfactory solution from among a generalized Λ˜α-extreme point set, an interactive algorithm based on linear programming is proposed, and an interactive processes are demonstrated by means of an illustrative numerical example.

  7. Solving cyclical nurse scheduling problem using preemptive goal programming

    NASA Astrophysics Data System (ADS)

    Sundari, V. E.; Mardiyati, S.

    2017-07-01

    Nurse scheduling system in a hospital is being modeled as a preemptive goal programming problem that is solved by using LINGO software with the objective function to minimize deviation variable at each goal. The scheduling is done cyclically, so every nurse is treated fairly since they have the same work shift portion with the other nurses. By paying attention to the hospital's rules regarding nursing work shift cyclically, it can be obtained that numbers of nurse needed in every ward are 18 nurses and the numbers of scheduling periods are 18 periods where every period consists of 21 days.

  8. An Algorithm for Solving Interval Linear Programming Problems

    DTIC Science & Technology

    1974-11-01

    34regularized" a lä Chames -Cooper so that infeasibility is determined at optimal solution if that is the case. If I(x*(v)) - 0 then x*(v) is an... Chames and Cooper J3]) may be used to compute the new inverse. Theorem 2 The algorithm described above terminates in a finite number of steps...I J 19- REFERENCES 1) A. Ben-Israel and A. Chames , "An Explicit Solution of A Special Class of Linear Programming Problems", Operations

  9. Dynamic Programming for Structured Continuous Markov Decision Problems

    NASA Technical Reports Server (NTRS)

    Dearden, Richard; Meuleau, Nicholas; Washington, Richard; Feng, Zhengzhu

    2004-01-01

    We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamically partitioned into regions where the value function is the same throughout the region. We first describe the algorithm for piecewise constant representations. We then extend it to piecewise linear representations, using techniques from POMDPs to represent and reason about linear surfaces efficiently. We show that for complex, structured problems, our approach exploits the natural structure so that optimal solutions can be computed efficiently.

  10. Extracting Embedded Generalized Networks from Linear Programming Problems.

    DTIC Science & Technology

    1984-09-01

    E EXTRACTING EMBEDDED GENERALIZED NETWORKS FROM LINEAR PROGRAMMING PROBLEMS by Gerald G. Brown * . ___Richard D. McBride * R. Kevin Wood LcL7...authorized. EA Gerald ’Brown Richar-rD. McBride 46;val Postgrduate School University of Southern California Monterey, California 93943 Los Angeles...REOT UBE . OV S.SF- PERFOING’ CAORG soN UER. 7. AUTNOR(a) S. CONTRACT ON GRANT NUME111() Gerald G. Brown Richard D. McBride S. PERFORMING ORGANIZATION

  11. A recurrent neural network for solving bilevel linear programming problem.

    PubMed

    He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian

    2014-04-01

    In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.

  12. Geometric horizons

    NASA Astrophysics Data System (ADS)

    Coley, Alan A.; McNutt, David D.; Shoom, Andrey A.

    2017-08-01

    We discuss black hole spacetimes with a geometrically defined quasi-local horizon on which the curvature tensor is algebraically special relative to the alignment classification. Based on many examples and analytical results, we conjecture that a spacetime horizon is always more algebraically special (in all of the orders of specialization) than other regions of spacetime. Using recent results in invariant theory, such geometric black hole horizons can be identified by the alignment type II or D discriminant conditions in terms of scalar curvature invariants, which are not dependent on spacetime foliations. The above conjecture is, in fact, a suite of conjectures (isolated vs dynamical horizon; four vs higher dimensions; zeroth order invariants vs higher order differential invariants). However, we are particularly interested in applications in four dimensions and especially the location of a black hole in numerical computations.

  13. Nepal CSM program confronts old problems with new ideas.

    PubMed

    1984-01-01

    Following 2 years of government negotiations, the social marketing banner in Nepal has been passed to a preivate firm, the Nepal Contraceptive Retail Sales (CRS) Company, Limited. With the change comes hope of rebirth for a program that has been plagued by cultural, distributional, and promotional impediments. The rejuvenation began in 1981, when the project acquired 4 jeeps, easing mobility and promotional problems. Then, the government rescinded a ban on brand name contraceptive radio advertisements. CRS now sells 5 contraceptive products: Dhaal and Suki Dhaal condoms, Gulaf and a low dose Nilocon pill, and Kamal foaming spermicidal tablets. In October, CRS began sales of its 1st noncontraceptive product, oral rehydration salts. CRS also plans to introduce a high priced colored condom this year and its exploring the possibility of marketing other drugs in a push toward self sufficiency. For the present, the Agency for International Development (AID) will continue supplying about 98% of CRS' budget, with product sales accounting for the remaining income. AID has pledged approximately $1.8 million for December 1982 to September 1985. Moreover, CRS may earn profits on its newest contraceptive products. From the new CRS vantage point, it is evident some old problems persist. Nepalese districts now carry CRS products, but the number of distribution outlets must be increased. James Messick, former Westinghouse field representative, believes the social marketing program's new independent status will help it meet such challenges. CRS now sells 43% of Nepal's condoms and 16% of the country's oral contraceptives.

  14. An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach

    NASA Astrophysics Data System (ADS)

    Kassa, Semu Mitiku; Tsegay, Teklay Hailay

    2017-08-01

    Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of problems. In this paper, we investigate a tri-level programming problem with quadratic fractional objective functions at each of the three levels. A solution algorithm has been proposed by applying fuzzy goal programming approach and by reformulating the fractional constraints to equivalent but non-fractional non-linear constraints. Based on the transformed formulation, an iterative procedure is developed that can yield a satisfactory solution to the tri-level problem. The numerical results on various illustrative examples demonstrated that the proposed algorithm is very much promising and it can also be used to solve larger-sized as well as n-level problems of similar structure.

  15. Administrative Problem-Solving for Writing Programs and Writing Centers: Scenarios in Effective Program Management.

    ERIC Educational Resources Information Center

    Myers-Breslin, Linda

    Addressing the issues and problems faced by writing program administrators (WPAs) and writing center directors (WCDs), and how they can most effectively resolve the political, pedagogical, and financial questions that arise, this book presents essays from experienced WPAs and WCDs at a wide variety of institutions that offer scenarios and case…

  16. Solving Fractional Programming Problems based on Swarm Intelligence

    NASA Astrophysics Data System (ADS)

    Raouf, Osama Abdel; Hezam, Ibrahim M.

    2014-04-01

    This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to solve any type of FPPs. The solution results employing the SI algorithms are compared with a number of exact and metaheuristic solution methods used for handling FPPs. Swarm Intelligence can be denoted as an effective technique for solving linear or nonlinear, non-differentiable fractional objective functions. Problems with an optimal solution at a finite point and an unbounded constraint set, can be solved using the proposed approach. Numerical examples are given to show the feasibility, effectiveness, and robustness of the proposed algorithm. The results obtained using the two SI algorithms revealed the superiority of the proposed technique among others in computational time. A better accuracy was remarkably observed in the solution results of the industrial application problems.

  17. Solving deterministic non-linear programming problem using Hopfield artificial neural network and genetic programming techniques

    NASA Astrophysics Data System (ADS)

    Vasant, P.; Ganesan, T.; Elamvazuthi, I.

    2012-11-01

    A fairly reasonable result was obtained for non-linear engineering problems using the optimization techniques such as neural network, genetic algorithms, and fuzzy logic independently in the past. Increasingly, hybrid techniques are being used to solve the non-linear problems to obtain better output. This paper discusses the use of neuro-genetic hybrid technique to optimize the geological structure mapping which is known as seismic survey. It involves the minimization of objective function subject to the requirement of geophysical and operational constraints. In this work, the optimization was initially performed using genetic programming, and followed by hybrid neuro-genetic programming approaches. Comparative studies and analysis were then carried out on the optimized results. The results indicate that the hybrid neuro-genetic hybrid technique produced better results compared to the stand-alone genetic programming method.

  18. Problem Solving with an Icon Oriented Programming Tool: A Case Study in Technology Education.

    ERIC Educational Resources Information Center

    Lavonen, Jari M.; Lattu, Matti; Meisalo, Veijo P.

    2001-01-01

    Finnish eighth graders used computer control software to find creative solutions to technological problems. The learning environment encouraged problem-centered and creative approaches. More systematic teaching of programming skills before problem solving was recommended. (Contains 32 references.) (SK)

  19. Generalization of Social Skills: Strategies and Results of a Training Program in Problem Solving Skills.

    ERIC Educational Resources Information Center

    Paraschiv, Irina; Olley, J. Gregory

    This paper describes the "Problem Solving for Life" training program which trains adolescents and adults with mental retardation in skills for solving social problems. The program requires group participants to solve social problems by practicing two prerequisite skills (relaxation and positive self-statements) and four problem solving steps: (1)…

  20. Solving the problem of overloading for the CMSL programming languages

    SciTech Connect

    Khalil, M.A.M.

    1989-01-01

    One of the most important, not yet achieved, goals in the computer science field is to design a language that approximates natural languages. In any natural language the same word can have more than one meaning. The distinction between the different meanings of a word comes from its context of use in different sentences. This is the problem in the widest view, but some of the prominent computer programming languages have adopted the concept of overloading, each in different way. Ada allows operator, enumeration, and subprogram name overloading but it does not allow variable name overloading within the same scope. Modula and Pascal allow a restricted form of overloading on literals and operators but then do not allow overloading for subprogram and variable names. Modcap allows operator and variable name overloading, but it does not allow subprogram name overloading. C allows a restricted form of overloading on operators, but it does not allow subprogram, variable, and literal name overloading. Fortran allows a restricted form of overloading on operators, but it does not allow subprogram, variable, and literal name overloading. Smalltalk allows subprogram (method) name overloading as far as they belong to different classes, but it does not allow literal or variable name overloading. CMSL (Contour Model Source Language) is a new language which has some novel semantic properties. The author develops an algorithm which solves the problem of overloading in the CMSL language, and which could be exploited by other languages.

  1. The Impact of Teacher Training on Creative Writing and Problem-Solving Using Futuristic Scenarios for Creative Problem Solving and Creative Problem Solving Programs

    ERIC Educational Resources Information Center

    Hayel Al-Srour, Nadia; Al-Ali, Safa M.; Al-Oweidi, Alia

    2016-01-01

    The present study aims to detect the impact of teacher training on creative writing and problem-solving using both Futuristic scenarios program to solve problems creatively, and creative problem solving. To achieve the objectives of the study, the sample was divided into two groups, the first consist of 20 teachers, and 23 teachers to second…

  2. Computing Health: Programing Problem 3, Computing Peak Blood Alcohol Levels.

    ERIC Educational Resources Information Center

    Gold, Robert S.

    1985-01-01

    The Alcohol Metabolism Program, a computer program used to compute peak blood alcohol levels, is expanded upon to include a cover page, brief introduction, and techniques for generalizing the program to calculate peak levels for any number of drinks. (DF)

  3. Memetic algorithms for the unconstrained binary quadratic programming problem.

    PubMed

    Merz, Peter; Katayama, Kengo

    2004-12-01

    This paper presents a memetic algorithm, a highly effective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic programming problem (BQP). To justify the approach, a fitness landscape analysis is conducted experimentally for several instances of the BQP. The results of the analysis show that recombination-based variation operators are well suited for the evolutionary algorithms with local search. Therefore, the proposed approach includes--besides a highly effective randomized k-opt local search--a new variation operator that has been tailored specially for the application in the hybrid evolutionary framework. The operator is called innovative variation and is fundamentally different from traditional crossover operators, since new genetic material is included in the offspring which is not contained in one of the parents. The evolutionary heuristic is tested on 35 publicly available BQP instances, and it is shown experimentally that the algorithm is capable of finding best-known solutions to large BQPs in a short time and with a high frequency. In comparison to other approaches for the BQP, the approach appears to be much more effective, particularly for large instances of 1000 or 2500 binary variables.

  4. Symbolic programming language in molecular multicenter integral problem

    NASA Astrophysics Data System (ADS)

    Safouhi, Hassan; Bouferguene, Ahmed

    It is well known that in any ab initio molecular orbital (MO) calculation, the major task involves the computation of molecular integrals, among which the computation of three-center nuclear attraction and Coulomb integrals is the most frequently encountered. As the molecular system becomes larger, computation of these integrals becomes one of the most laborious and time-consuming steps in molecular systems calculation. Improvement of the computational methods of molecular integrals would be indispensable to further development in computational studies of large molecular systems. To develop fast and accurate algorithms for the numerical evaluation of these integrals over B functions, we used nonlinear transformations for improving convergence of highly oscillatory integrals. These methods form the basis of new methods for solving various problems that were unsolvable otherwise and have many applications as well. To apply these nonlinear transformations, the integrands should satisfy linear differential equations with coefficients having asymptotic power series in the sense of Poincaré, which in their turn should satisfy some limit conditions. These differential equations are very difficult to obtain explicitly. In the case of molecular integrals, we used a symbolic programming language (MAPLE) to demonstrate that all the conditions required to apply these nonlinear transformation methods are satisfied. Differential equations are obtained explicitly, allowing us to demonstrate that the limit conditions are also satisfied.

  5. Teaching Introductory Programming to IS Students: Java Problems and Pitfalls

    ERIC Educational Resources Information Center

    Pendergast, Mark O.

    2006-01-01

    This paper examines the impact the use of the Java programming language has had on the way our students learn to program and the success they achieve. The importance of a properly constructed first course in programming cannot be overstated. A course well experienced will leave students with good programming habits, the ability to learn on their…

  6. Teaching Introductory Programming to IS Students: Java Problems and Pitfalls

    ERIC Educational Resources Information Center

    Pendergast, Mark O.

    2006-01-01

    This paper examines the impact the use of the Java programming language has had on the way our students learn to program and the success they achieve. The importance of a properly constructed first course in programming cannot be overstated. A course well experienced will leave students with good programming habits, the ability to learn on their…

  7. Finding Trustworthy Experts to Help Problem Solving on the Programming Learning Forum

    ERIC Educational Resources Information Center

    Tseng, Shian-Shyong; Weng, Jui-Feng

    2010-01-01

    The most important thing for learners in Programming Language subject is problem solving. During the practical programming project, various problems may occur and learners usually need consultation from the senior programmers (i.e. the experts) to assist them in solving the problems. Thus, the inquiry-based learning with learning forum is applied…

  8. Finding Trustworthy Experts to Help Problem Solving on the Programming Learning Forum

    ERIC Educational Resources Information Center

    Tseng, Shian-Shyong; Weng, Jui-Feng

    2010-01-01

    The most important thing for learners in Programming Language subject is problem solving. During the practical programming project, various problems may occur and learners usually need consultation from the senior programmers (i.e. the experts) to assist them in solving the problems. Thus, the inquiry-based learning with learning forum is applied…

  9. COYOTE: a finite-element computer program for nonlinear heat-conduction problems

    SciTech Connect

    Gartling, D.K.

    1982-10-01

    COYOTE is a finite element computer program designed for the solution of two-dimensional, nonlinear heat conduction problems. The theoretical and mathematical basis used to develop the code is described. Program capabilities and complete user instructions are presented. Several example problems are described in detail to demonstrate the use of the program.

  10. Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.

    PubMed

    Zörnig, Peter

    2015-08-01

    We present integer programming models for some variants of the farthest string problem. The number of variables and constraints is substantially less than that of the integer linear programming models known in the literature. Moreover, the solution of the linear programming-relaxation contains only a small proportion of noninteger values, which considerably simplifies the rounding process. Numerical tests have shown excellent results, especially when a small set of long sequences is given.

  11. METLIN-PC: An applications-program package for problems of mathematical programming

    SciTech Connect

    Pshenichnyi, B.N.; Sobolenko, L.A.; Sosnovskii, A.A.; Aleksandrova, V.M.; Shul`zhenko, Yu.V.

    1994-05-01

    The METLIN-PC applications-program package (APP) was developed at the V.M. Glushkov Institute of Cybernetics of the Academy of Sciences of Ukraine on IBM PC XT and AT computers. The present version of the package was written in Turbo Pascal and Fortran-77. The METLIN-PC is chiefly designed for the solution of smooth problems of mathematical programming and is a further development of the METLIN prototype, which was created earlier on a BESM-6 computer. The principal property of the previous package is retained - the applications modules employ a single approach based on the linearization method of B.N. Pschenichnyi. Hence the name {open_quotes}METLIN.{close_quotes}

  12. A Group Process Model for Problem Identification and Program Planning

    ERIC Educational Resources Information Center

    Delbecq, Andre L.; Van De Ven, Andrew H.

    1971-01-01

    This article sets forth a group process approach useful for practicing administrators charged with a program development task. Meeting formats are suggested for involving critical reference groups in successive phases of program Development. (Author)

  13. Problems In, and Strategies For, Evaluating Preschool Programs

    ERIC Educational Resources Information Center

    Vane, Julia R.

    1976-01-01

    Discusses the difficulty of documenting the effectiveness of preschool programs and relates this to measuring instruments used and the type of design selected. Methods are provided to assist psychologists and educators to evaluate preschool programs. Three studies of preschool programs using different designs which involve published…

  14. Identification of Student Misconceptions in Genetics Problem Solving via Computer Program.

    ERIC Educational Resources Information Center

    Browning, Mark E.; Lehman, James D.

    1988-01-01

    Describes a computer program presenting four genetics problems to monitor the problem solving process of college students. Identifies three main areas of difficulty: computational skills; determination of gametes; and application of previous learning to new situations. (Author/YP)

  15. Program Administrator's Handbook. Strategies for Preventing Alcohol and Other Drug Problems. The College Series.

    ERIC Educational Resources Information Center

    CSR, Inc., Washington, DC.

    This handbook is for administrators of programs in higher education settings which deal with alcohol and other drug (AOD) related problems. Chapter 1, "Defining the Problem, Issues, and Trends" examines the problem from various perspectives and presents the latest statistics on the extent of AOD use on campuses, specific problems affecting…

  16. An efficient method for generalized linear multiplicative programming problem with multiplicative constraints.

    PubMed

    Zhao, Yingfeng; Liu, Sanyang

    2016-01-01

    We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.

  17. Effects of Language Features, Templates, and Procedural Skills on Problem-Solving In Programming.

    ERIC Educational Resources Information Center

    Kong, Siu Cheung; Chung, Choi Man

    1989-01-01

    Presents a study that investigates the knowledge and skills that relate to computer programing. Finds that knowledge and procedural skills are related to computer programing. Recommends that since instruction in computer programing facilitates problem-solving, computer programing courses should be augmented to include teaching template and…

  18. The Current Often Implemented Fitness Tests in Physical Education Programs: Problems and Future Directions

    ERIC Educational Resources Information Center

    Keating, Xiaofen Deng

    2003-01-01

    This paper aims to examine current nationwide youth fitness test programs, address problems embedded in the programs, and possible solutions. The current Fitnessgram, President's Challenge, and YMCA youth fitness test programs were selected to represent nationwide youth fitness test programs. Sponsors of the nationwide youth fitness test programs…

  19. Committee of the Undergraduate Program in Mathematics Geometry Conference, Part III: Geometric Transformation Groups and Other Topics.

    ERIC Educational Resources Information Center

    Durst, Lincoln K., Ed.

    This is Part III of the first volume of the proceedings of the Committee on the Undergraduate Program in Mathematics (CUPM) Geometry Conference, held at Santa Barbara in June, 1967. The purpose of the conference was to consider the status of geometry in colleges at the undergraduate level. The conference, attended by undergraduate mathematics…

  20. Deadlock and fictitiousness problem in parallel program specifications

    SciTech Connect

    Panfilenko, V.P.

    1995-05-01

    One of the directions of modern programming based on algebraic methods takes its origin in V.M. Glushkov`s theory of systems of algorithmic algebras (SAA). The SAA apparatus with appropriately interpreted operations is used for program design and allows compact structured representation of program schemas in the form of algebraic formulas. Modified systems of algorithmic algebras (SAA-M) additionally represent parallelism description tools.

  1. An Algorithm for Structured, Large-Scale Quadratic Programming Problems.

    DTIC Science & Technology

    1981-09-01

    of the Madison Academic Computing Center of the University of Wisconsin-Madison. In the program we set the stopping criterio as follows. -4l = 10 - 4...for Large Systems, Macmillan. Madison Academic Computing Center (MACC, 1976), Nonlinear programming routines, reference manual . Madison Academic...Computing Center (MACC, 1978), Random number routines, reference manual . Mangasarian, 0. L. (1969), Nonlinear Programming, McGraw-Hill. Rockafellar, R. T

  2. Modern Problems: Sociology Units. An Experimental Program for Grade 12.

    ERIC Educational Resources Information Center

    Carlson, Marshall; Fennig, Lois

    GRADES OR AGES: Grade 12. SUBJECT MATTER: Sociology; modern problems. ORGANIZATION AND PHYSICAL APPEARANCE: The guide contains two units, one on the problems of minority groups and the other on social pathology. Sub-sections of unit 2 include crime and criminals, criminal investigation, gun control, U.S. criminal law, criminal procedure,…

  3. Virtually Successful: Defeating the Dropout Problem through Online School Programs

    ERIC Educational Resources Information Center

    Roblyer, M. D.

    2006-01-01

    Although dropout rates in virtual school courses are typically quite high, some virtual programs have very low course dropout and failure rates and better passing rates on key criterion tests (e.g., AP tests) than do traditional school programs. Directors of five successful virtual schools agreed to share their "formulas for success" in…

  4. Virtually Successful: Defeating the Dropout Problem through Online School Programs

    ERIC Educational Resources Information Center

    Roblyer, M. D.

    2006-01-01

    Although dropout rates in virtual school courses are typically quite high, some virtual programs have very low course dropout and failure rates and better passing rates on key criterion tests (e.g., AP tests) than do traditional school programs. Directors of five successful virtual schools agreed to share their "formulas for success" in…

  5. Special Concretes and Field Problems; Instructor's Guide; Pilot Program Edition.

    ERIC Educational Resources Information Center

    Portland Cement Association, Cleveland, OH.

    This guide, prepared for a 2-year program in junior colleges and technical institutes, is designed for a national program to train persons for employment as technicians in the cement and concrete industries. Included are 48 session oultines divided into four units of study. Each unit contains session objectives and outlines, presentation outlines,…

  6. Geometric reasoning

    NASA Technical Reports Server (NTRS)

    Woodbury, R. F.; Oppenheim, I. J.

    1987-01-01

    Cognitive robot systems are ones in which sensing and representation occur, from which task plans and tactics are determined. Such a robot system accomplishes a task after being told what to do, but determines for itself how to do it. Cognition is required when the work environment is uncontrolled, when contingencies are prevalent, or when task complexity is large; it is useful in any robotic mission. A number of distinguishing features can be associated with cognitive robotics, and one emphasized here is the role of artificial intelligence in knowledge representation and in planning. While space telerobotics may elude some of the problems driving cognitive robotics, it shares many of the same demands, and it can be assumed that capabilities developed for cognitive robotics can be employed advantageously for telerobotics in general. The top level problem is task planning, and it is appropriate to introduce a hierarchical view of control. Presented with certain mission objectives, the system must generate plans (typically) at the strategic, tactical, and reflexive levels. The structure by which knowledge is used to construct and update these plans endows the system with its cognitive attributes, and with the ability to deal with contingencies, changes, unknowns, and so on. Issues of representation and reasoning which are absolutely fundamental to robot manipulation, decisions based upon geometry, are discussed here, not AI task planning per se.

  7. Robust Programming Problems Based on the Mean-Variance Model Including Uncertainty Factors

    NASA Astrophysics Data System (ADS)

    Hasuike, Takashi; Ishii, Hiroaki

    2009-01-01

    This paper considers robust programming problems based on the mean-variance model including uncertainty sets and fuzzy factors. Since these problems are not well-defined problems due to fuzzy factors, it is hard to solve them directly. Therefore, introducing chance constraints, fuzzy goals and possibility measures, the proposed models are transformed into the deterministic equivalent problems. Furthermore, in order to solve these equivalent problems efficiently, the solution method is constructed introducing the mean-absolute deviation and doing the equivalent transformations.

  8. Stacked Deck: An Effective, School-Based Program for the Prevention of Problem Gambling

    ERIC Educational Resources Information Center

    Williams, Robert J.; Wood, Robert T.; Currie, Shawn R.

    2010-01-01

    School-based prevention programs are an important component of problem gambling prevention, but empirically effective programs are lacking. Stacked Deck is a set of 5-6 interactive lessons that teach about the history of gambling; the true odds and "house edge"; gambling fallacies; signs, risk factors, and causes of problem gambling; and…

  9. Stacked Deck: An Effective, School-Based Program for the Prevention of Problem Gambling

    ERIC Educational Resources Information Center

    Williams, Robert J.; Wood, Robert T.; Currie, Shawn R.

    2010-01-01

    School-based prevention programs are an important component of problem gambling prevention, but empirically effective programs are lacking. Stacked Deck is a set of 5-6 interactive lessons that teach about the history of gambling; the true odds and "house edge"; gambling fallacies; signs, risk factors, and causes of problem gambling; and…

  10. Developing Student Programming and Problem-Solving Skills with Visual Basic

    ERIC Educational Resources Information Center

    Siegle, Del

    2009-01-01

    Although most computer users will never need to write a computer program, many students enjoy the challenge of creating one. Computer programming enhances students' problem solving by forcing students to break a problem into its component pieces and reassemble it in a generic format that can be understood by a nonsentient entity. It promotes…

  11. Designing a Family Problem Solving Training Program with an Adolescent Diabetic.

    ERIC Educational Resources Information Center

    Kieren, Dianne K.; And Others

    An educational program was developed to assist family groups with adolescent diabetics to improve their problem-solving skills. The program is based on theoretical assumptions and research findings from a study of family problem-solving, which involved nine intact, well-functioning families (five families with a diabetic adolescent and four…

  12. Studies of Verbal Problem Solving: I. Two Performance-Aiding Programs. Technical Report No. 83.

    ERIC Educational Resources Information Center

    Bond, Nicholas A., Jr.; And Others

    This booklet describes two computer programs that were written to provide on-line aid to problem solvers. Both programs were designed for "membership" problems, or those in which there are several English sentences and implicit relationships. The task was to infer a membership structure that is compatible with all the logical constraints.…

  13. Fundamental solution of the problem of linear programming and method of its determination

    NASA Technical Reports Server (NTRS)

    Petrunin, S. V.

    1978-01-01

    The idea of a fundamental solution to a problem in linear programming is introduced. A method of determining the fundamental solution and of applying this method to the solution of a problem in linear programming is proposed. Numerical examples are cited.

  14. Creating a Brighter Future: An Update on the Future Problem Solving Program.

    ERIC Educational Resources Information Center

    Crabbe, Anne Borland

    1982-01-01

    The Future Problem Solving Program is intended to help gifted students (grades 4 through 12) develop richer images of the future and increase creativity, communication, teamwork, research, and problem-solving skills. Procedures for participating in the program and securing materials are explained. (CL)

  15. LINOPT: A FORTRAN Routine for Solving Linear Programming Problems,

    DTIC Science & Technology

    1981-10-09

    MD 20910 2R44EA501 I I. CONTROLLING OFFICE NAME ANO AOORESS 12. REPORT DATE 9 October 1981 ’I. NUMBER OF PAGES 46 11. MONITORING AGENCY NAME...block /XXXLP/, which must accordingly be a common block in the calling program. ROUNDOFF CONTROL In the program there are three input variables which...can be used to control roundoff error accummulations. EPS is a tolerance used in checking constraint violations. H is also used to zero out

  16. The "Problems Behind the Problems:" Systems Engineering and Program Management Risk Factors in Acquisition Programs

    DTIC Science & Technology

    2004-08-01

    Acquisition, Technology, and Logistics), Office of Enterprise Development in the Office of Systems Engineering . The publication of this IDA document does not...Defense (Acquisition, Technology, and Logistics), Office of Enterprise Development in the Office of Systems Engineering (SE). This paper responds to... development process, and open systems.6 2. Category II: Systems Engineering and Program Management Process Risk Factors Systems engineering and program

  17. Molecular solutions to the binary integer programming problem based on DNA computation.

    PubMed

    Yeh, Chung-Wei; Chu, Chih-Ping; Wu, Kee-Rong

    2006-01-01

    Binary optimization is a widely investigated topic in integer linear programming. This study proposes a DNA-based computing algorithm for solving the significantly large binary integer programming (BIP) problem. The proposed approach is based upon Adleman and Lipton's DNA operations to solve the BIP problem. The potential of DNA computation for the BIP problem is promising given the operational time complexity of O(nxk).

  18. A new neural network model for solving random interval linear programming problems.

    PubMed

    Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza

    2017-05-01

    This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique.

  19. LP Relaxation of the Potts Labeling Problem Is as Hard as any Linear Program.

    PubMed

    Prusa, Daniel; Werner, Tomas

    2016-06-20

    In our recent work, we showed that solving the LP relaxation of the pairwise min-sum labeling problem (also known as MAP inference in graphical models or discrete energy minimization) is not much easier than solving any linear program. Precisely, the general linear program reduces in linear time (assuming the Turing model of computation) to the LP relaxation of the min-sum labeling problem. The reduction is possible, though in quadratic time, even to the min-sum labeling problem with planar structure. Here we prove similar results for the pairwise minsum labeling problem with attractive Potts interactions (also known as the uniform metric labeling problem).

  20. Documentation as Problem Solving for Literacy Outreach Programs

    SciTech Connect

    Girill, T R

    2004-07-06

    Age-appropriate technical writing lessons for underperforming high-school students can offer them an innovative, ''authentic'' way to improve how they read and write. Thus the techniques and principles of effective technical communication routinely applied at work also provide a positive response to one of today's great educational challenges. This workshop shows participants how to (1) introduce English and science teachers to the value of technical writing as a response to school literacy problems, (2) prepare plausible practice exercises to help students improve their basic literacy, and (3) recognize and respond to known literacy outreach pitfalls. Every effective literacy outreach project based on technical writing needs to address four key problems.

  1. Transfer Problems in Outdoor Management Development Programs and How to Overcome Them.

    ERIC Educational Resources Information Center

    McGraw, Peter

    This paper examines the issues and problems that arise in the transfer process in outdoor management development (OMD) programs. The transfer of learning from the outdoors back to the workplace is a crucial element of OMD. A review of general transfer problems and management development demonstrates that many of the transfer problems associated…

  2. CHEMEX; Understanding and Solving Problems in Chemistry. A Computer-Assisted Instruction Program for General Chemistry.

    ERIC Educational Resources Information Center

    Lower, Stephen K.

    A brief overview of CHEMEX--a problem-solving, tutorial style computer-assisted instructional course--is provided and sample problems are offered. In CHEMEX, students receive problems in advance and attempt to solve them before moving through the computer program, which assists them in overcoming difficulties and serves as a review mechanism.…

  3. Solving mixed integer nonlinear programming problems using spiral dynamics optimization algorithm

    NASA Astrophysics Data System (ADS)

    Kania, Adhe; Sidarto, Kuntjoro Adji

    2016-02-01

    Many engineering and practical problem can be modeled by mixed integer nonlinear programming. This paper proposes to solve the problem with modified spiral dynamics inspired optimization method of Tamura and Yasuda. Four test cases have been examined, including problem in engineering and sport. This method succeeds in obtaining the optimal result in all test cases.

  4. Problem Solving in Mathematics. An ESEA Title IV-C Instructional Program.

    ERIC Educational Resources Information Center

    Schaaf, Oscar; Brannan, Richard

    1981-01-01

    Problem solving is viewed as an ability required throughout life, and how we function is seen to be directly related to how well we solve problems. In this document, the issue of a steady decline in students' abilities in the area of mathematical problem solving is confronted and a program designed to teach students the necessary skills in this…

  5. Higher order sensitivity of solutions to convex programming problems without strict complementarity

    NASA Technical Reports Server (NTRS)

    Malanowski, Kazimierz

    1988-01-01

    Consideration is given to a family of convex programming problems which depend on a vector parameter. It is shown that the solutions of the problems and the associated Lagrange multipliers are arbitrarily many times directionally differentiable functions of the parameter, provided that the data of the problems are sufficiently regular. The characterizations of the respective derivatives are given.

  6. Proof test of the computer program BUCKY for plasticity problems

    NASA Astrophysics Data System (ADS)

    Smith, James P.

    1994-01-01

    A theoretical equation describing the elastic-plastic deformation of a cantilever beam subject to a constant pressure is developed. The theoretical result is compared numerically to the computer program BUCKY for the case of an elastic-perfectly plastic specimen. It is shown that the theoretical and numerical results compare favorably in the plastic range. Comparisons are made to another research code to further validate the BUCKY results. This paper serves as a quality test for the computer program BUCKY developed at NASA Johnson Space Center.

  7. Admission to Teacher Education Programs: The Problem and Two Approaches to Addressing It

    ERIC Educational Resources Information Center

    Falkenberg, Thomas

    2010-01-01

    What qualities should admission criteria identify in applicants to teacher education programs in order to select those that should be admitted into the program from those applying? One approach to addressing this selection problem is to link the desired qualities of applicants to the desired qualities with which students in the program are to…

  8. 34 CFR 356.11 - What types of problems may be researched under the fellowship program?

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... fellowship program? 356.11 Section 356.11 Education Regulations of the Offices of the Department of Education... REHABILITATION RESEARCH: RESEARCH FELLOWSHIPS What Kinds of Activities Does the Department Support Under This Program? § 356.11 What types of problems may be researched under the fellowship program?...

  9. 34 CFR 356.11 - What types of problems may be researched under the fellowship program?

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... fellowship program? 356.11 Section 356.11 Education Regulations of the Offices of the Department of Education... REHABILITATION RESEARCH: RESEARCH FELLOWSHIPS What Kinds of Activities Does the Department Support Under This Program? § 356.11 What types of problems may be researched under the fellowship program?...

  10. 34 CFR 356.11 - What types of problems may be researched under the fellowship program?

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... fellowship program? 356.11 Section 356.11 Education Regulations of the Offices of the Department of Education... REHABILITATION RESEARCH: RESEARCH FELLOWSHIPS What Kinds of Activities Does the Department Support Under This Program? § 356.11 What types of problems may be researched under the fellowship program?...

  11. How Does Early Feedback in an Online Programming Course Change Problem Solving?

    ERIC Educational Resources Information Center

    Ebrahimi, Alireza

    2012-01-01

    How does early feedback change the programming problem solving in an online environment and help students choose correct approaches? This study was conducted in a sample of students learning programming in an online course entitled Introduction to C++ and OOP (Object Oriented Programming) using the ANGEL learning management system platform. My…

  12. The Child Development Program: Preventing and Remediating Learning Problems (with Appendix).

    ERIC Educational Resources Information Center

    Levine, Suzanne Sosna

    The Child Development Program at John Adams School in North Brunswick, New Jersey, was designed to be an immediate intervention for children with learning problems in the early elementary grades. This two-volume guide describes the work done in the program and how the program can be replicated. The first book details characteristics of the…

  13. A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem

    NASA Astrophysics Data System (ADS)

    Zhadan, V. G.

    2016-07-01

    The linear semidefinite programming problem is considered. The dual affine scaling method in which all current iterations belong to the feasible set is proposed for its solution. Moreover, the boundaries of the feasible set may be reached. This method is a generalization of a version of the affine scaling method that was earlier developed for linear programs to the case of semidefinite programming.

  14. How Does Early Feedback in an Online Programming Course Change Problem Solving?

    ERIC Educational Resources Information Center

    Ebrahimi, Alireza

    2012-01-01

    How does early feedback change the programming problem solving in an online environment and help students choose correct approaches? This study was conducted in a sample of students learning programming in an online course entitled Introduction to C++ and OOP (Object Oriented Programming) using the ANGEL learning management system platform. My…

  15. Personalized Computer-Assisted Mathematics Problem-Solving Program and Its Impact on Taiwanese Students

    ERIC Educational Resources Information Center

    Chen, Chiu-Jung; Liu, Pei-Lin

    2007-01-01

    This study evaluated the effects of a personalized computer-assisted mathematics problem-solving program on the performance and attitude of Taiwanese fourth grade students. The purpose of this study was to determine whether the personalized computer-assisted program improved student performance and attitude over the nonpersonalized program.…

  16. A Computer Program for the Management of Prescription-Based Problems.

    ERIC Educational Resources Information Center

    Cotter, Patricia M.; Gumtow, Robert H.

    1991-01-01

    The Prescription Management Program, a software program using Apple's HyperCard on a MacIntosh, was developed to simplify the creation, storage, modification, and general management of prescription-based problems. Pharmacy instructors may customize the program to serve their individual teaching needs. (Author/DB)

  17. Modern Problems Economic Units. A Program for Grade Twelve.

    ERIC Educational Resources Information Center

    Carlson, Marshall; Hutton, Joseph

    GRADES OR AGES: Grade 12. SUBJECT MATTER: Modern problems, economic units. ORGANIZATION AND PHYSICAL APPEARANCE: The introductory material includes an outline of the Bloomington school philosophy, identification of main areas of modern economics, basic objectives, and techniques for evaluating objectives. The guide covers six units: a) importance…

  18. Solving Bilevel Programming Problems Using a Neural Network Approach and Its Application to Power System Environment

    NASA Astrophysics Data System (ADS)

    Yaakob, Shamshul Bahar; Watada, Junzo

    In this paper, a hybrid neural network approach to solve mixed integer quadratic bilevel programming problems is proposed. Bilevel programming problems arise when one optimization problem, the upper problem, is constrained by another optimization, the lower problem. The mixed integer quadratic bilevel programming problem is transformed into a double-layered neural network. The combination of a genetic algorithm (GA) and a meta-controlled Boltzmann machine (BM) enables us to formulate a hybrid neural network approach to solving bilevel programming problems. The GA is used to generate the feasible partial solutions of the upper level and to provide the parameters for the lower level. The meta-controlled BM is employed to cope with the lower level problem. The lower level solution is transmitted to the upper level. This procedure enables us to obtain the whole upper level solution. The iterative processes can converge on the complete solution of this problem to generate an optimal one. The proposed method leads the mixed integer quadratic bilevel programming problem to a global optimal solution. Finally, a numerical example is used to illustrate the application of the method in a power system environment, which shows that the algorithm is feasible and advantageous.

  19. Reconstructing Program Theories: Methods Available and Problems To Be Solved.

    ERIC Educational Resources Information Center

    Leeuw, Frans L.

    2003-01-01

    Discusses methods for reconstructing theories underlying programs and policies, focusing on three approaches: (1) an empirical approach that focuses on interviews, documents, and argumentational analysis; (2) an approach based on strategic assessment, group dynamics, and dialogue; and (3) an approach based on cognitive and organizational…

  20. PROGRAMED INSTRUCTION AND FOREIGN LANGUAGE LEARNING--PROBLEMS AND PROSPECTS.

    ERIC Educational Resources Information Center

    VALDMAN, ALBERT

    THE RESULTS OF INVESTIGATIONS CONDUCTED DURING THE PAST 6 YEARS IN SELF-INSTRUCTION IN FOREIGN LANGUAGES HAVE LED RESEARCHERS TO CONCLUDE THAT TOTAL PROGRAMED INSTRUCTION SEEMS PRODUCTIVE ONLY IN CASES WHERE THE TERMINAL BEHAVIOR TO BE ACHIEVED IS VERY LIMITED. EXPERIMENTS HAVE SHOWN THAT IT IS MOST USEFUL IN MODULES AT EARLY LEVELS FOR TEACHING…

  1. Prevention of ADHD Related Problems: A Universal Preschool Program

    ERIC Educational Resources Information Center

    Christiansen, Hanna; Hirsch, Oliver; König, Anika; Steinmayr, Ricarda; Roehrle, Bernd

    2015-01-01

    Purpose: Early onset of behavioral disorders is predictive of long term adverse outcomes. There are some indicated and selective early prevention programs for attention deficit/hyperactivity disorder (ADHD), one of the most common behavioral disorders in childhood and adolescence. The purpose of this paper is to present a universal preschool…

  2. Deviant Peer Influences in Programs for Youth Problems and Solutions

    ERIC Educational Resources Information Center

    Dodge, Kenneth A., Ed.; Dishion, Thomas J., Ed.; Lansford, Jennifer E., Ed.

    2006-01-01

    Most interventions for at-risk youth are group based. Yet, emerging research indicates that young people often learn to become deviant by interacting with deviant peers. In this important volume, leading intervention and prevention experts from psychology, education, criminology, and related fields analyze how, and to what extent, programs that…

  3. Prevention of ADHD Related Problems: A Universal Preschool Program

    ERIC Educational Resources Information Center

    Christiansen, Hanna; Hirsch, Oliver; König, Anika; Steinmayr, Ricarda; Roehrle, Bernd

    2015-01-01

    Purpose: Early onset of behavioral disorders is predictive of long term adverse outcomes. There are some indicated and selective early prevention programs for attention deficit/hyperactivity disorder (ADHD), one of the most common behavioral disorders in childhood and adolescence. The purpose of this paper is to present a universal preschool…

  4. Deviant Peer Influences in Programs for Youth Problems and Solutions

    ERIC Educational Resources Information Center

    Dodge, Kenneth A., Ed.; Dishion, Thomas J., Ed.; Lansford, Jennifer E., Ed.

    2006-01-01

    Most interventions for at-risk youth are group based. Yet, emerging research indicates that young people often learn to become deviant by interacting with deviant peers. In this important volume, leading intervention and prevention experts from psychology, education, criminology, and related fields analyze how, and to what extent, programs that…

  5. Step and Hip, Humanistic Programs for Problem Secondary Students.

    ERIC Educational Resources Information Center

    Utah Univ., Salt Lake City. Graduate School of Education.

    Alternative programs in open education for student teachers in both the Department and the Graduate School of Education at the University of Utah are making substantial contributions to promoting growth in education students; genuine interpersonal relationships between themselves and their students; and humanistic values, attitudes, and behaviors.…

  6. Geometrical pattern learning

    SciTech Connect

    Goldberg, P.W.

    1993-04-01

    In this paper we consider the problem of learning the positions of spheres in metric spaces, given as data randomly drawn points classified according to whether they are internal or external to an unknown sphere. The particular metrics under consideration are geometrical shape metrics, and the results are intended to be applicable to the problem of learning to identify a shape from related shapes classified according to whether they resemble it visually. While it is typically NP-hard to locate a central point for a hypothesis sphere, we find that it is however often possible to obtain a non-spherical hypothesis which can accurately predict whether further random points lie within the unknown sphere. We exhibit algorithms which achieve this, and in the process indicate useful general techniques for computational learning. Finally we exhibit a natural shape metric and show that it defines a class of spheres not predictable in this sense, subject to standard cryptographic assumptions.

  7. Problems Impacting Extension Program Quality at the County Level: Results from an Analysis of County Program Reviews Conducted in Florida

    ERIC Educational Resources Information Center

    Harder, Amy; Moore, Austen; Mazurkewicz, Melissa; Benge, Matt

    2013-01-01

    Needs assessments are an important tool for informing organizational development efforts in Extension. The purpose of the study reported here was to identify problems faced by county units within UF/IFAS Extension during county program reviews. The findings were drawn from the reports created after five county units experienced program reviews in…

  8. A Program for Solving the Brain Ischemia Problem

    PubMed Central

    DeGracia, Donald J.

    2013-01-01

    Our recently described nonlinear dynamical model of cell injury is here applied to the problems of brain ischemia and neuroprotection. We discuss measurement of global brain ischemia injury dynamics by time course analysis. Solutions to proposed experiments are simulated using hypothetical values for the model parameters. The solutions solve the global brain ischemia problem in terms of “master bifurcation diagrams” that show all possible outcomes for arbitrary durations of all lethal cerebral blood flow (CBF) decrements. The global ischemia master bifurcation diagrams: (1) can map to a single focal ischemia insult, and (2) reveal all CBF decrements susceptible to neuroprotection. We simulate measuring a neuroprotectant by time course analysis, which revealed emergent nonlinear effects that set dynamical limits on neuroprotection. Using over-simplified stroke geometry, we calculate a theoretical maximum protection of approximately 50% recovery. We also calculate what is likely to be obtained in practice and obtain 38% recovery; a number close to that often reported in the literature. The hypothetical examples studied here illustrate the use of the nonlinear cell injury model as a fresh avenue of approach that has the potential, not only to solve the brain ischemia problem, but also to advance the technology of neuroprotection. PMID:24961411

  9. On Solving Linear Complementarity Problems as Linear Programs.

    DTIC Science & Technology

    1976-03-01

    obtainedb, •,. b ,.,. the linear program minimize rTv . subject to q + Yv > 0, Xv > 0 19 ,., for any positive vector r Rn Letting x Xv, we see that x is...1.21 1.6 3352 .81 1.7 2353 .65 .8 1490 .50 1.9 664 .37 ti TABLE 4 ,43 i Inputs: n1 7. qT (,-1, -4, 6, -5, 3, -2) starting iterate x y 0 ; original

  10. Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

    SciTech Connect

    Pham, Huyên Wei, Xiaoli

    2016-12-15

    We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

  11. Genetic programming over context-free languages with linear constraints for the knapsack problem: first results.

    PubMed

    Bruhn, Peter; Geyer-Schulz, Andreas

    2002-01-01

    In this paper, we introduce genetic programming over context-free languages with linear constraints for combinatorial optimization, apply this method to several variants of the multidimensional knapsack problem, and discuss its performance relative to Michalewicz's genetic algorithm with penalty functions. With respect to Michalewicz's approach, we demonstrate that genetic programming over context-free languages with linear constraints improves convergence. A final result is that genetic programming over context-free languages with linear constraints is ideally suited to modeling complementarities between items in a knapsack problem: The more complementarities in the problem, the stronger the performance in comparison to its competitors.

  12. Application of Dynamic Programming to Solving K Postmen Chinese Postmen Problem

    NASA Astrophysics Data System (ADS)

    Fei, Rong; Cui, Duwu; Zhang, Yikun; Wang, Chaoxue

    In this paper, Dynamic Programming is used to solve K postmen Chinese postmen problem for the first time. And a novel model for decision- making of KPCPP and the computation models for solving the whole problem are proposed. The arcs of G are changed into the points of G' by CAPA, and the model is converted into another one, which applies to Multistep Decision Process, by MDPMCA. On the base of these two programs, Dynamic Programming algorithm KMPDPA can finally solve the NPC problem-KPCPP. An illustrative example is given to clarify concepts and methods. The accuracy of these algorithms and the relative theories are verified by mathematical language.

  13. Challenge problems focusing on equality and combinatory logic: Evaluating automated theorem-proving programs

    SciTech Connect

    Wos, L.; McCune, W.

    1988-01-01

    In this paper, we offer a set of problems for evaluating the power of automated theorem-proving programs and the potential of new ideas. Since the problems published in the proceedings of the first CADE conference proved to be so useful, and since researchers are now far more disposed to implementing and testing their ideas, a new set of problems to complement those that have been widely studied is in order. In general, the new problems provide a far greater challenge for an automated theorem-proving program than those in the first set do. Indeed, to our knowledge, five of the six problems we propose for study have never been proved with a theorem-proving program. For each problem, we give a set of statements that can easily be translated into a standard set of clauses. We also state each problem in its mathematical and logical form. In many cases, we also provide a proof of the theorem from which a problem is taken so that one can measure a program's progress in its attempt to solve the problem. Two of the theorems we discuss are of especial interest in that they answer questions that had been open concerning the constructibility of two types of combinator. We also include a brief description of a new strategy for restricting the application of paramodulation. All of the problems we propose for study emphasize the role of equality. This paper is tutorial in nature.

  14. Bellingham Bay action program: Initial data summaries and problem identification

    SciTech Connect

    Decker, D.S.; Sonnerup, R.; Greene, J.J.

    1989-08-01

    The report provides a synthesis of information describing the geographic extent and severity of estuarine contamination in Bellingham Bay within Puget Sound in Washington State. Summaries of existing data are provided for chemical contamination of sediment and biota, microbial contamination, eutrophication and contaminant sources. Original, summarized, tabulated, and mapped data are presented. The objective of the report is to provide a mechanism for comprehensively evaluating pollution problems in the more urbanized embayments and for providing a basis for prioritizing corrective actions. A decision making framework is presented for evaluating and prioritizing both sub-areas within Bellingham Bay and specific contaminant sources.

  15. Helping solve Georgia's water problems - the USGS Cooperative Water Program

    USGS Publications Warehouse

    Clarke, John S.

    2006-01-01

    The U.S. Geological Survey (USGS) addresses a wide variety of water issues in the State of Georgia through the Cooperative Water Program (CWP). As the primary Federal science agency for water-resource information, the USGS monitors the quantity and quality of water in the Nation's rivers and aquifers, assesses the sources and fate of contaminants in aquatic systems, collects and analyzes data on aquatic ecosystems, develops tools to improve the application of hydrologic information, and ensures that its information and tools are available to all potential users. This broad, diverse mission cannot be accomplished effectively without the contributions of the CWP.

  16. Nonlinear Programming Problems Associated with Closed Range Operators

    SciTech Connect

    Aizicovici, S.; Motreanu, D.; Pavel, N. H.

    1999-09-15

    Necessary conditions for the optimality of a pair (y-bar, u-bar) with respect to a locally Lipschitz cost functional L(y,u) , subject to Ay + F(y) = Cu + B(u) , are given in terms of generalized gradients. Here A and C are densely defined, closed, linear operators on some Banach spaces, while F and B are (Frechet) differentiable maps, which are suitably related to A and C . Various examples and potential applications to nonlinear programming models and nonlinear optimal control of partial differential equations are also discussed.

  17. Carbon dioxide problem: DOE program and a general assessment

    SciTech Connect

    Abarbanel, H.; Chamberlain, J.; Foley, H.; MacDonald, G.; Nierenberg, W.; Ruderman, M.

    1980-10-01

    From the view of a potential national or international policy on CO/sub 2/, progress towards these goals is reported along with suggestions for additions to and implementation of the present work. After the introduction, conclusions and recommendations are presented. The third and fourth sections contain discussions of the present research programs on the carbon cycle and on climate modeling. The fifth section considers physical effects of CO/sub 2/-induced climate change that may be of social or economic importance. The last section considers some early warning signals for climate changes due to increased atmospheric CO/sub 2/.

  18. COYOTE II - a finite element computer program for nonlinear heat conduction problems. Part I - theoretical background

    SciTech Connect

    Gartling, D.K.; Hogan, R.E.

    1994-10-01

    The theoretical and numerical background for the finite element computer program, COYOTE II, is presented in detail. COYOTE II is designed for the multi-dimensional analysis of nonlinear heat conduction problems and other types of diffusion problems. A general description of the boundary value problems treated by the program is presented. The finite element formulation and the associated numerical methods used in COYOTE II are also outlined. Instructions for use of the code are documented in SAND94-1179; examples of problems analyzed with the code are provided in SAND94-1180.

  19. A New Bound for the Ration Between the 2-Matching Problem and Its Linear Programming Relaxation

    SciTech Connect

    Boyd, Sylvia; Carr, Robert

    1999-07-28

    Consider the 2-matching problem defined on the complete graph, with edge costs which satisfy the triangle inequality. We prove that the value of a minimum cost 2-matching is bounded above by 4/3 times the value of its linear programming relaxation, the fractional 2-matching problem. This lends credibility to a long-standing conjecture that the optimal value for the traveling salesman problem is bounded above by 4/3 times the value of its linear programming relaxation, the subtour elimination problem.

  20. The general form of 0-1 programming problem based on DNA computing.

    PubMed

    ZhiXiang, Yin; Fengyue, Zhang; Jin, Xu

    2003-06-01

    DNA computing is a novel method of solving a class of intractable computational problems, in which the computing speeds up exponentially with the problem size. Up to now, many accomplishments have been made to improve its performance and increase its reliability. In this paper, we solved the general form of 0-1 programming problem with fluorescence labeling techniques based on surface chemistry by attempting to apply DNA computing to a programming problem. Our method has some significant advantages such as simple encoding, low cost, and short operating time.

  1. A hybrid approach to protein folding problem integrating constraint programming with local search

    PubMed Central

    2010-01-01

    Background The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy function have been proposed to ease the computational hardness of this optimization problem. Heuristic search algorithms and constraint programming are two common techniques to approach this problem. The present study introduces a novel hybrid approach to simulate the protein folding problem using constraint programming technique integrated within local search. Results Using the face-centered-cubic lattice model and 20 amino acid pairwise interactions energy function for the protein folding problem, a constraint programming technique has been applied to generate the neighbourhood conformations that are to be used in generic local search procedure. Experiments have been conducted for a few small and medium sized proteins. Results have been compared with both pure constraint programming approach and local search using well-established local move set. Substantial improvements have been observed in terms of final energy values within acceptable runtime using the hybrid approach. Conclusion Constraint programming approaches usually provide optimal results but become slow as the problem size grows. Local search approaches are usually faster but do not guarantee optimal solutions and tend to stuck in local minima. The encouraging results obtained on the small proteins show that these two approaches can be combined efficiently to obtain better quality solutions within acceptable time. It also encourages future researchers on adopting hybrid techniques to solve other hard optimization problems. PMID:20122212

  2. Student Behaviour Problems: Context, Initiatives and Programs. Selected Papers from the National Conference on Student Behaviour Problems: Context, Initiatives and Programs (3rd, Brisbane, Queensland, Australia, October 1991).

    ERIC Educational Resources Information Center

    Elkins, John, Ed.; Izard, John, Ed.

    The conference papers in this collection are grouped under the following topics: behavior problems in context; interpersonal relationships; initiatives by systems and schools; and programs in special settings. Papers included are: (1) National Trends in Discipline Policy Development (Roger Slee); (2) Balancing: The Protocols of Discipline (William…

  3. Student Behaviour Problems: Context, Initiatives and Programs. Selected Papers from the National Conference on Student Behaviour Problems: Context, Initiatives and Programs (3rd, Brisbane, Queensland, Australia, October 1991).

    ERIC Educational Resources Information Center

    Elkins, John, Ed.; Izard, John, Ed.

    The conference papers in this collection are grouped under the following topics: behavior problems in context; interpersonal relationships; initiatives by systems and schools; and programs in special settings. Papers included are: (1) National Trends in Discipline Policy Development (Roger Slee); (2) Balancing: The Protocols of Discipline (William…

  4. Nonlinear programming for classification problems in machine learning

    NASA Astrophysics Data System (ADS)

    Astorino, Annabella; Fuduli, Antonio; Gaudioso, Manlio

    2016-10-01

    We survey some nonlinear models for classification problems arising in machine learning. In the last years this field has become more and more relevant due to a lot of practical applications, such as text and web classification, object recognition in machine vision, gene expression profile analysis, DNA and protein analysis, medical diagnosis, customer profiling etc. Classification deals with separation of sets by means of appropriate separation surfaces, which is generally obtained by solving a numerical optimization model. While linear separability is the basis of the most popular approach to classification, the Support Vector Machine (SVM), in the recent years using nonlinear separating surfaces has received some attention. The objective of this work is to recall some of such proposals, mainly in terms of the numerical optimization models. In particular we tackle the polyhedral, ellipsoidal, spherical and conical separation approaches and, for some of them, we also consider the semisupervised versions.

  5. Vocal problems among teachers: evaluation of a preventive voice program.

    PubMed

    Bovo, Roberto; Galceran, Marta; Petruccelli, Joseph; Hatzopoulos, Stavros

    2007-11-01

    Vocal education programs for teachers may prevent the emergence of vocal disorders; however, only a few studies have tried to evaluate the effectiveness of these preventive programs, particularly in the long term. Two hundred and sixty-four subjects, mostly kindergarten and primary school female teachers, participated in a course on voice care, including a theoretical seminar (120 minutes) and a short voice group therapy (180 minutes, small groups of 20 subjects). For 3 months, they had to either attend the vocal ergonomics norms and, as psychological reinforcement, they had to make out a daily report of vocal abuse, or to follow the given exercises for a more efficient vocal technique, reporting on whether the time scheduled was respected or not. The effectiveness of the course was assessed in a group of 21 female teachers through a randomized controlled study. Evaluation comprehended stroboscopy, perceptual and electro-acoustical voice analysis, Voice Handicap Index, and a course benefit questionnaire. A group of 20 teachers matched for age, working years, hoarseness grade, and vocal demand served as a control group. At 3 months evaluation, participants demonstrated amelioration in the global dysphonia rates (P=0.0003), jitter (P=0.0001), shimmer (P=0.0001), MPT (P=0.0001), and VHI (P=0.0001). Twelve months after the course, the positive effects remained, although they were slightly reduced. In conclusion, a course inclusive of two lectures, a short group voice therapy, home-controlled voice exercises, and hygiene, represents a feasible and cost-effective primary prevention of voice disorders in a homogeneous and well-motivated population of teachers.

  6. A high-performance feedback neural network for solving convex nonlinear programming problems.

    PubMed

    Leung, Yee; Chen, Kai-Zhou; Gao, Xing-Bao

    2003-01-01

    Based on a new idea of successive approximation, this paper proposes a high-performance feedback neural network model for solving convex nonlinear programming problems. Differing from existing neural network optimization models, no dual variables, penalty parameters, or Lagrange multipliers are involved in the proposed network. It has the least number of state variables and is very simple in structure. In particular, the proposed network has better asymptotic stability. For an arbitrarily given initial point, the trajectory of the network converges to an optimal solution of the convex nonlinear programming problem under no more than the standard assumptions. In addition, the network can also solve linear programming and convex quadratic programming problems, and the new idea of a feedback network may be used to solve other optimization problems. Feasibility and efficiency are also substantiated by simulation examples.

  7. Geometric scaling as traveling waves.

    PubMed

    Munier, S; Peschanski, R

    2003-12-05

    We show the relevance of the nonlinear Fisher and Kolmogorov-Petrovsky-Piscounov (KPP) equation to the problem of high energy evolution of the QCD amplitudes. We explain how the traveling wave solutions of this equation are related to geometric scaling, a phenomenon observed in deep-inelastic scattering experiments. Geometric scaling is for the first time shown to result from an exact solution of nonlinear QCD evolution equations. Using general results on the KPP equation, we compute the velocity of the wave front, which gives the full high energy dependence of the saturation scale.

  8. A Framework for Analyzing Geometric Pattern Tasks

    ERIC Educational Resources Information Center

    Friel, Susan N.; Markworth, Kimberly A.

    2009-01-01

    Teachers can use geometric patterns to promote students' understanding of functional relationships. In this article, the authors first look at a problem-solving process that supports the use of figural reasoning to explore and interpret geometric pattern tasks and generalize function rules. Second, the authors discuss a framework for…

  9. Geometric Approaches to Quadratic Equations from Other Times and Places.

    ERIC Educational Resources Information Center

    Allaire, Patricia R.; Bradley, Robert E.

    2001-01-01

    Focuses on geometric solutions of quadratic problems. Presents a collection of geometric techniques from ancient Babylonia, classical Greece, medieval Arabia, and early modern Europe to enhance the quadratic equation portion of an algebra course. (KHR)

  10. Geometric Approaches to Quadratic Equations from Other Times and Places.

    ERIC Educational Resources Information Center

    Allaire, Patricia R.; Bradley, Robert E.

    2001-01-01

    Focuses on geometric solutions of quadratic problems. Presents a collection of geometric techniques from ancient Babylonia, classical Greece, medieval Arabia, and early modern Europe to enhance the quadratic equation portion of an algebra course. (KHR)

  11. A quasi-Newton approach to optimization problems with probability density constraints. [problem solving in mathematical programming

    NASA Technical Reports Server (NTRS)

    Tapia, R. A.; Vanrooy, D. L.

    1976-01-01

    A quasi-Newton method is presented for minimizing a nonlinear function while constraining the variables to be nonnegative and sum to one. The nonnegativity constraints were eliminated by working with the squares of the variables and the resulting problem was solved using Tapia's general theory of quasi-Newton methods for constrained optimization. A user's guide for a computer program implementing this algorithm is provided.

  12. From problem to success: feline weight loss programs that work.

    PubMed

    Michel, Kathryn; Scherk, Margie

    2012-05-01

    Obesity is the most common unhealthy nutritional condition that is recognized in cats. Documented associated health risks include diabetes mellitus, lameness, non-allergic skin disease, feline lower urinary tract disease and idiopathic hepatic lipidosis. Simply recommending a diet designed for weight loss fails, in most cases, to result in successful weight loss in the obese or overweight cat. A more in-depth approach that centers on communication and commitment, alongside a program of feeding a predetermined amount of a specific diet plus exercise and enrichment of the cat's life, offers a chance for a healthy result. It has been reported in some developed countries that as much as 40-50% of the feline population may be overweight or obese, with middle-aged cats, male cats, mixed-breed cats and neutered cats being at greatest risk. This review of what is currently known about the health risks, predisposing factors and treatment of excessive weight gain in cats is aimed at all veterinary health professionals. The information reported in the review is drawn from the current scientific literature as well as from the clinical experience of the authors.

  13. A case study in programming a quantum annealer for hard operational planning problems

    NASA Astrophysics Data System (ADS)

    Rieffel, Eleanor G.; Venturelli, Davide; O'Gorman, Bryan; Do, Minh B.; Prystay, Elicia M.; Smelyanskiy, Vadim N.

    2015-01-01

    We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the performance of quantum annealers on problems native to their architecture, and others have examined performance of select problems stemming from an application area, ours is one of the first studies of a quantum annealer's performance on parametrized families of hard problems from a practical domain. We explore two different general mappings of planning problems to quadratic unconstrained binary optimization (QUBO) problems, and apply them to two parametrized families of planning problems, navigation-type and scheduling-type. We also examine two more compact, but problem-type specific, mappings to QUBO, one for the navigation-type planning problems and one for the scheduling-type planning problems. We study embedding properties and parameter setting and examine their effect on the efficiency with which the quantum annealer solves these problems. From these results, we derive insights useful for the programming and design of future quantum annealers: problem choice, the mapping used, the properties of the embedding, and the annealing profile all matter, each significantly affecting the performance.

  14. Stacked Deck: an effective, school-based program for the prevention of problem gambling.

    PubMed

    Williams, Robert J; Wood, Robert T; Currie, Shawn R

    2010-06-01

    School-based prevention programs are an important component of problem gambling prevention, but empirically effective programs are lacking. Stacked Deck is a set of 5-6 interactive lessons that teach about the history of gambling; the true odds and "house edge"; gambling fallacies; signs, risk factors, and causes of problem gambling; and skills for good decision making and problem solving. An overriding theme of the program is to approach life as a "smart gambler" by determining the odds and weighing the pros versus cons of your actions. A total of 949 grade 9-12 students in 10 schools throughout southern Alberta received the program and completed baseline and follow-up measures. These students were compared to 291 students in 4 control schools. Four months after receiving the program, students in the intervention group had significantly more negative attitudes toward gambling, improved knowledge about gambling and problem gambling, improved resistance to gambling fallacies, improved decision making and problem solving, decreased gambling frequency, and decreased rates of problem gambling. There was no change in involvement in high risk activities or money lost gambling. These results indicate that Stacked Deck is a promising curriculum for the prevention of problem gambling.

  15. Small Special Education Teacher Preparation Programs: Innovative Programming and Solutions to Problems in Higher Education.

    ERIC Educational Resources Information Center

    Reid, Barbara J., Ed.

    This monograph presents nine articles that describe innovative programs within small special education teacher education programs at a variety of institutions of higher education. The papers are: (1) "Furman University: A Field-Based Model for Small Liberal Arts Teacher Education Programs" (Shirley A. Ritter and Lesley A. Quast); (2) "Providing a…

  16. Evaluation of a Multicomponent, Behaviorally Oriented, Problem-Based "Summer School" Program for Adolescents with Diabetes.

    ERIC Educational Resources Information Center

    Schlundt, David G.; Flannery, Mary Ellen; Davis, Dianne L.; Kinzer, Charles K.; Pichert, James W.

    1999-01-01

    Examines a two-week summer program using problem-based learning and behavior therapy to help adolescents with insulin-dependent diabetes improve their ability to cope with obstacles to dietary management. Improvements were observed in self-efficacy, problem-solving skills, and self-reported coping strategies. No significant changes were observed…

  17. Problem Video Gaming Among Children Enrolled in Tertiary Weight Management Programs.

    PubMed

    Stubblefield, Sam; Datto, George; Phan, Thao-Ly T; Werk, Lloyd N; Stackpole, Kristin; Siegel, Robert; Stratbucker, William; Tucker, Jared M; Christison, Amy L; Hossain, Jobayer; Gentile, Douglas A

    2017-02-01

    Prior studies show seven percent to nine percent of children demonstrate gaming behaviors that affect a child's ability to function (e.g., problem gaming), but none have examined the association between problem gaming and weight status. The objective of this study was to determine the prevalence of problem gaming among children enrolled in tertiary weight management programs. We administered a computer-based survey to a convenience sample of children aged 11-17 years enrolled in five geographically diverse pediatric weight management (PWM) programs in the COMPASS (Childhood Obesity Multi-Program Analysis and Study System) network. The survey included demographics, gaming characteristics, and a problem gaming assessment. The survey had 454 respondents representing a diverse cohort (53 percent females, 27 percent black, 24 percent Hispanic, 41 percent white) with mean age of 13.7 years. A total of 8.2 percent of respondents met criteria for problem gaming. Problem gamers were more likely to be white, male, play mature-rated games, and report daily play. Children in PWM programs reported problem gaming at the same rate as other pediatric populations. Screening for problem gaming provides an opportunity for pediatricians to address gaming behaviors that may affect the health of children with obesity who already are at risk for worsened health and quality of life.

  18. Prevention and Reduction of Behavioural Problems in School: An Evaluation of the Respect Program

    ERIC Educational Resources Information Center

    Ertesvag, Sigrun K.; Vaaland, Grete Sorensen

    2007-01-01

    Disobedient pupils, off-task behaviour, and bullying are common problems in schools in many countries; they interfere with teaching, create an unsafe learning environment, and challenge the staff. Effective programs involving entire schools to prevent and reduce such problems have already been designed and implemented. However, most interventions…

  19. Evaluation of a Multicomponent, Behaviorally Oriented, Problem-Based "Summer School" Program for Adolescents with Diabetes.

    ERIC Educational Resources Information Center

    Schlundt, David G.; Flannery, Mary Ellen; Davis, Dianne L.; Kinzer, Charles K.; Pichert, James W.

    1999-01-01

    Examines a two-week summer program using problem-based learning and behavior therapy to help adolescents with insulin-dependent diabetes improve their ability to cope with obstacles to dietary management. Improvements were observed in self-efficacy, problem-solving skills, and self-reported coping strategies. No significant changes were observed…

  20. Learning Problem-Solving through Making Games at the Game Design and Learning Summer Program

    ERIC Educational Resources Information Center

    Akcaoglu, Mete

    2014-01-01

    Today's complex and fast-evolving world necessitates young students to possess design and problem-solving skills more than ever. One alternative method of teaching children problem-solving or thinking skills has been using computer programming, and more recently, game-design tasks. In this pre-experimental study, a group of middle school…

  1. Adventure Camp Programs, Self-Concept, and Their Effects on Behavioral Problem Adolescents

    ERIC Educational Resources Information Center

    Larson, Bruce A.

    2007-01-01

    The purpose of this study was to examine the effects of an adventure camp program on the self-concept of adolescents with behavioral problems. Subjects in the study included 61 randomly selected male and female adolescents ranging in age from 9 to 17 years with behavioral problems. The treatment group of 31 adolescents was randomly selected from a…

  2. Learning Problem-Solving through Making Games at the Game Design and Learning Summer Program

    ERIC Educational Resources Information Center

    Akcaoglu, Mete

    2014-01-01

    Today's complex and fast-evolving world necessitates young students to possess design and problem-solving skills more than ever. One alternative method of teaching children problem-solving or thinking skills has been using computer programming, and more recently, game-design tasks. In this pre-experimental study, a group of middle school…

  3. The solar heating and cooling commercial demonstration program: Some early problems and results

    NASA Technical Reports Server (NTRS)

    Middleton, R. L.

    1978-01-01

    The activities of the Marshall Space Flight Center of the National Aeronautics and Space Administration in the technical evaluation of proposals, contracts definitions, and program management details are defined and discussed. The significant problems were summarized in both technical and management aspects of the program. It was concluded that the program has significantly stimulated additional solar effort by the program participants. It was also concluded that the use of conventional construction industry organization with design/competitive bid procedures and standards has maintained a cost effective program.

  4. A Pilot Study of a Self-Voicing Computer Program for Prealgebra Math Problems

    ERIC Educational Resources Information Center

    Beal, Carole R.; Rosenblum, L. Penny; Smith, Derrick W.

    2011-01-01

    Fourteen students with visual impairments in Grades 5-12 participated in the field-testing of AnimalWatch-VI-Beta. This computer program delivered 12 prealgebra math problems and hints through a self-voicing audio feature. The students provided feedback about how the computer program can be improved and expanded to make it accessible to all users.…

  5. Challenging the Gifted through Problem Solving Experiences: Design and Evaluation of the COMET Program.

    ERIC Educational Resources Information Center

    Feldhusen, John F.; And Others

    1992-01-01

    The COMET summer residential program at Purdue University (Indiana) offers gifted and talented youth in grades 4-6 a week of intensive study in a single content area. Courses stress specific problem-solving skills and development of a rich knowledge base. Extensive program evaluation by students, teachers, counselors, and parents was highly…

  6. An Achievement Degree Analysis Approach to Identifying Learning Problems in Object-Oriented Programming

    ERIC Educational Resources Information Center

    Allinjawi, Arwa A.; Al-Nuaim, Hana A.; Krause, Paul

    2014-01-01

    Students often face difficulties while learning object-oriented programming (OOP) concepts. Many papers have presented various assessment methods for diagnosing learning problems to improve the teaching of programming in computer science (CS) higher education. The research presented in this article illustrates that although max-min composition is…

  7. Problems in the Management of the National School Lunch Program in Washington School Districts. Bulletin 817.

    ERIC Educational Resources Information Center

    Price, David W.; And Others

    To find major problems with the National School Lunch Program, a study was conducted with 1,015 students, their parents, and 16 school lunch supervisors in 18 Washington school districts. When interviewed, only 2% of the students said the lunch program did not need any changes. The needed changes most often mentioned were for "different kinds…

  8. Using the Same Problem with Different Techniques in Programming Assignments: An Empirical Study of Its Effectiveness

    ERIC Educational Resources Information Center

    Newby, Michael; Nguyen, ThuyUyen H.

    2010-01-01

    This paper examines the effectiveness of a technique that first appeared as a Teaching Tip in the Journal of Information Systems Education. In this approach the same problem is used in every programming assignment within a course, but the students are required to use different programming techniques. This approach was used in an intermediate C++…

  9. Analysis of Learning Behavior in a Flipped Programing Classroom Adopting Problem-Solving Strategies

    ERIC Educational Resources Information Center

    Chiang, Tosti Hsu-Cheng

    2017-01-01

    Programing is difficult for beginners because they need to learn the new language of computers. Developing software, especially complex software, is bound to result in problems, frustration, and the need to think in new ways. Identifying the learning behavior behind programing by way of empirical studies can help beginners learn more easily. In…

  10. A Pilot Group Cognitive Behavioural Therapy Program for Problem Gamblers in a Rural Australian Setting

    ERIC Educational Resources Information Center

    Oakes, Jane; Gardiner, Paula; McLaughlin, Kristin; Battersby, Malcolm

    2012-01-01

    An innovative pilot treatment program was developed for problem gamblers living in rural areas of Australia using cognitive behaviour therapy (CBT) modified from an established specialist therapy service. The standard 12 weekly group program was delivered on site by adapting it to two 1 week blocks with daily group sessions and 1 week of patient…

  11. Developing a Pedagogical Problem Solving View for Mathematics Teachers with Two Reflection Programs

    ERIC Educational Resources Information Center

    Kramarski, Bracha

    2009-01-01

    The study investigated the effects of two reflection support programs on elementary school mathematics teachers' pedagogical problem solving view. Sixty-two teachers participated in a professional development program. Thirty teachers were assigned to the self-questioning (S_Q) training and thirty two teachers were assigned to the reflection…

  12. Challenging the Gifted through Problem Solving Experiences: Design and Evaluation of the COMET Program.

    ERIC Educational Resources Information Center

    Feldhusen, John F.; And Others

    1992-01-01

    The COMET summer residential program at Purdue University (Indiana) offers gifted and talented youth in grades 4-6 a week of intensive study in a single content area. Courses stress specific problem-solving skills and development of a rich knowledge base. Extensive program evaluation by students, teachers, counselors, and parents was highly…

  13. A Pilot Study of a Self-Voicing Computer Program for Prealgebra Math Problems

    ERIC Educational Resources Information Center

    Beal, Carole R.; Rosenblum, L. Penny; Smith, Derrick W.

    2011-01-01

    Fourteen students with visual impairments in Grades 5-12 participated in the field-testing of AnimalWatch-VI-Beta. This computer program delivered 12 prealgebra math problems and hints through a self-voicing audio feature. The students provided feedback about how the computer program can be improved and expanded to make it accessible to all users.…

  14. Applying EXCEL Solver to a watershed management goal-programming problem

    Treesearch

    J. E. de Steiguer

    2000-01-01

    This article demonstrates the application of EXCEL® spreadsheet linear programming (LP) solver to a watershed management multiple use goal programming (GP) problem. The data used to demonstrate the application are from a published study for a watershed in northern Colorado. GP has been used by natural resource managers for many years. However, the GP solution by means...

  15. An Achievement Degree Analysis Approach to Identifying Learning Problems in Object-Oriented Programming

    ERIC Educational Resources Information Center

    Allinjawi, Arwa A.; Al-Nuaim, Hana A.; Krause, Paul

    2014-01-01

    Students often face difficulties while learning object-oriented programming (OOP) concepts. Many papers have presented various assessment methods for diagnosing learning problems to improve the teaching of programming in computer science (CS) higher education. The research presented in this article illustrates that although max-min composition is…

  16. Airborne Linear Array Image Geometric Rectification Method Based on Unequal Segmentation

    NASA Astrophysics Data System (ADS)

    Li, J. M.; Li, C. R.; Zhou, M.; Hu, J.; Yang, C. M.

    2016-06-01

    As the linear array sensor such as multispectral and hyperspectral sensor has great potential in disaster monitoring and geological survey, the quality of the image geometric rectification should be guaranteed. Different from the geometric rectification of airborne planar array images or multi linear array images, exterior orientation elements need to be determined for each scan line of single linear array images. Internal distortion persists after applying GPS/IMU data directly to geometrical rectification. Straight lines may be curving and jagged. Straight line feature -based geometrical rectification algorithm was applied to solve this problem, whereby the exterior orientation elements were fitted by piecewise polynomial and evaluated with the straight line feature as constraint. However, atmospheric turbulence during the flight is unstable, equal piecewise can hardly provide good fitting, resulting in limited precision improvement of geometric rectification or, in a worse case, the iteration cannot converge. To solve this problem, drawing on dynamic programming ideas, unequal segmentation of line feature-based geometric rectification method is developed. The angle elements fitting error is minimized to determine the optimum boundary. Then the exterior orientation elements of each segment are fitted and evaluated with the straight line feature as constraint. The result indicates that the algorithm is effective in improving the precision of geometric rectification.

  17. MARIAH: A finite-element computer program for incompressible porous flow problems. Theoretical background

    NASA Astrophysics Data System (ADS)

    Gartling, D. K.; Hickox, C. E.

    1982-10-01

    The theoretical background for the finite element computer program MARIAH is presented. The MARIAH code is designed for the analysis of incompressible fluid flow and heat transfer in saturated porous media. A description of the fluid/thermal boundary value problem treated by the program is presented and the finite element method and associated numerical methods used in MARIAH are discussed. Instructions for use of the program are documented in the Sandia National Laboratories report, SAND79-1623.

  18. Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control

    SciTech Connect

    Gaitsgory, Vladimir; Rossomakhine, Sergey

    2015-04-15

    The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples.

  19. Four Decades of Creative Vision: Insights from an Evaluation of the Future Problem Solving Program International (FPSPI)

    ERIC Educational Resources Information Center

    Treffinger, Donald J.; Solomon, Marianne; Woythal, Deb

    2012-01-01

    E. Paul Torrance, a pioneer in creative education, and his associates founded the Future Problem Solving Program (now FPSPI, or Future Problem Solving Program International) in the mid-1970s as a competitive, interscholastic program and as a curriculum project integrating creative problem-solving and future studies. Since its founding, the program…

  20. Four Decades of Creative Vision: Insights from an Evaluation of the Future Problem Solving Program International (FPSPI)

    ERIC Educational Resources Information Center

    Treffinger, Donald J.; Solomon, Marianne; Woythal, Deb

    2012-01-01

    E. Paul Torrance, a pioneer in creative education, and his associates founded the Future Problem Solving Program (now FPSPI, or Future Problem Solving Program International) in the mid-1970s as a competitive, interscholastic program and as a curriculum project integrating creative problem-solving and future studies. Since its founding, the program…

  1. Application of program generation technology in solving heat and flow problems

    NASA Astrophysics Data System (ADS)

    Wan, Shui; Wu, Bangxian; Chen, Ningning

    2007-05-01

    Based on a new DIY concept for software development, an automatic program-generating technology attached on a software system called as Finite Element Program Generator (FEPG) provides a platform of developing programs, through which a scientific researcher can submit his special physico-mathematical problem to the system in a more direct and convenient way for solution. For solving flow and heat problems by using finite element method, the stabilization technologies and fraction-step methods are adopted to overcome the numerical difficulties caused mainly due to the dominated convection. A couple of benchmark problems are given in this paper as examples to illustrate the usage and the superiority of the automatic program generation technique, including the flow in a lid-driven cavity, the starting flow in a circular pipe, the natural convection in a square cavity, and the flow past a circular cylinder, etc. They are also shown as the verification of the algorithms.

  2. An application of a linear programing technique to nonlinear minimax problems

    NASA Technical Reports Server (NTRS)

    Schiess, J. R.

    1973-01-01

    A differential correction technique for solving nonlinear minimax problems is presented. The basis of the technique is a linear programing algorithm which solves the linear minimax problem. By linearizing the original nonlinear equations about a nominal solution, both nonlinear approximation and estimation problems using the minimax norm may be solved iteratively. Some consideration is also given to improving convergence and to the treatment of problems with more than one measured quantity. A sample problem is treated with this technique and with the least-squares differential correction method to illustrate the properties of the minimax solution. The results indicate that for the sample approximation problem, the minimax technique provides better estimates than the least-squares method if a sufficient amount of data is used. For the sample estimation problem, the minimax estimates are better if the mathematical model is incomplete.

  3. Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems

    NASA Astrophysics Data System (ADS)

    Kuterin, F. A.; Sumin, M. I.

    2017-01-01

    A convex programming problem in a Hilbert space with an operator equality constraint and a finite number of functional inequality constraints is considered. All constraints involve parameters. The close relation of the instability of this problem and, hence, the instability of the classical Lagrange principle for it to its regularity properties and the subdifferentiability of the value function in the problem is discussed. An iterative nondifferential Lagrange principle with a stopping rule is proved for the indicated problem. The principle is stable with respect to errors in the initial data and covers the normal, regular, and abnormal cases of the problem and the case where the classical Lagrange principle does not hold. The possibility of using the stable sequential Lagrange principle for directly solving unstable optimization problems is discussed. The capabilities of this principle are illustrated by numerically solving the classical ill-posed problem of finding the normal solution of a Fredholm integral equation of the first kind.

  4. Family-centered program deters substance use, conduct problems, and depressive symptoms in black adolescents.

    PubMed

    Brody, Gene H; Chen, Yi-fu; Kogan, Steven M; Yu, Tianyi; Molgaard, Virginia K; DiClemente, Ralph J; Wingood, Gina M

    2012-01-01

    The present research addressed the following important question in pediatric medicine: Can participation in a new family-centered preventive intervention, the Strong African American Families-Teen (SAAF-T) program, deter conduct problems, substance use, substance use problems, and depressive symptoms among rural black adolescents across 22 months? Data were collected from 502 black families in rural Georgia, assigned randomly to SAAF-T or an attention control condition. The prevention condition consisted of 5 consecutive meetings at community facilities with separate, concurrent sessions for caregivers and adolescents followed by a caregiver-adolescent session in which families practiced skills they learned in the separate sessions. Adolescents self-reported conduct problem behaviors, substance use, substance use problems, and depressive symptoms at ages 16 years (pretest) and 17 years 10 months (long-term assessment). Adolescents who participated in SAAF-T evinced lower increases in conduct problem behavior, substance use, substance use problems, and depressive symptom frequencies than did adolescents in the attention control condition across the 22 months between pretest and long-term assessment. This is the first study to demonstrate efficacy in a prevention program designed to deter conduct problems, substance use, substance use problems, and depressive symptoms among rural black adolescents. Because SAAF-T is a manualized, structured program, it can be easily disseminated to public health agencies, schools, churches, boys' and girls' clubs, and other community organizations.

  5. A PROGRAMED PRIMER ON PROGRAMING. VOLUME II, PRACTICAL PROBLEMS. SECOND EDITION.

    ERIC Educational Resources Information Center

    MARKLE, SUSAN MEYER

    KEY CONCEPTS, TERMS, AND TECHNIQUES IN PROGRAMED INSTRUCTION ARE PRESENTED IN THIS PROGRAMED PRIMER, WHICH BEGINS BY DEMONSTRATING THE USE OF FORMAL AND THEMATIC PROMPTS IN THE UTILIZATION OF A STUDENT'S REPERTOIRE. NEW RESPONSES ARE INTRODUCED INTO THIS REPERTOIRE BY THE USE OF COPYING FRAMES, EMPHASIS PROMPTS, AND PANELS. THE DESIGN OF SEQUENCES…

  6. A PROGRAMED PRIMER ON PROGRAMING. VOLUME II, PRACTICAL PROBLEMS. SECOND EDITION.

    ERIC Educational Resources Information Center

    MARKLE, SUSAN MEYER

    KEY CONCEPTS, TERMS, AND TECHNIQUES IN PROGRAMED INSTRUCTION ARE PRESENTED IN THIS PROGRAMED PRIMER, WHICH BEGINS BY DEMONSTRATING THE USE OF FORMAL AND THEMATIC PROMPTS IN THE UTILIZATION OF A STUDENT'S REPERTOIRE. NEW RESPONSES ARE INTRODUCED INTO THIS REPERTOIRE BY THE USE OF COPYING FRAMES, EMPHASIS PROMPTS, AND PANELS. THE DESIGN OF SEQUENCES…

  7. The solution of singular optimal control problems using direct collocation and nonlinear programming

    NASA Astrophysics Data System (ADS)

    Downey, James R.; Conway, Bruce A.

    1992-08-01

    This paper describes work on the determination of optimal rocket trajectories which may include singular arcs. In recent years direct collocation and nonlinear programming has proven to be a powerful method for solving optimal control problems. Difficulties in the application of this method can occur if the problem is singular. Techniques exist for solving singular problems indirectly using the associated adjoint formulation. Unfortunately, the adjoints are not a part of the direct formulation. It is shown how adjoint information can be obtained from the direct method to allow the solution of singular problems.

  8. A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis

    NASA Astrophysics Data System (ADS)

    Konno, Hiroshi; Gotoh, Jun-Ya; Uno, Takeaki; Yuki, Atsushi

    2002-09-01

    We will propose a new cutting plane algorithm for solving a class of semi-definite programming problems (SDP) with a small number of variables and a large number of constraints. Problems of this type appear when we try to classify a large number of multi-dimensional data into two groups by a hyper-ellipsoidal surface. Among such examples are cancer diagnosis, failure discrimination of enterprises. Also, a certain class of option pricing problems can be formulated as this type of problem. We will show that the cutting plane algorithm is much more efficient than the standard interior point algorithms for solving SDP.

  9. IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS

    NASA Technical Reports Server (NTRS)

    Fogle, F. R.

    1994-01-01

    IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.

  10. IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS

    NASA Technical Reports Server (NTRS)

    Fogle, F. R.

    1994-01-01

    IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.

  11. The Problem-Solving Approach to program evaluation: Development and application in a mathematics context

    NASA Astrophysics Data System (ADS)

    Costner, Kelly Mitchell

    This study developed and piloted the Problem-Solving Approach to program evaluation, which involves the direct application of the problem-solving process as a metaphor for program evaluation. A rationale for a mathematics-specific approach is presented, and relevant literature in both program evaluation and mathematics education is reviewed. The Problem-Solving Approach was piloted with a high-school level integrated course in mathematics and science that used graphing calculators and data collection devices with the goal of helping students to gain better understanding of relationships between mathematics and science. Twelve students participated in the course, which was co-taught by a mathematics teacher and a science teacher. Data collection for the evaluation included observations, a pre- and posttest, student questionnaires, student interviews, teacher interviews, principal interviews, and a focus group that involved both students and their teachers. Results of the evaluation of the course are presented as an evaluation report. Students showed improvement in their understandings of mathematics-science relationships, but also showed growth in terms of self-confidence, independence, and various social factors that were not expected outcomes. The teachers experienced a unique form of professional development by learning and relearning concepts in each other's respective fields and by gaining insights into each other's teaching strengths. Both the results of the evaluation and the evaluation process itself are discussed in light of the proposed problem-solving approach. The use of problem solving and of specific problem-solving strategies was found to be prevalent among the students and the teachers, as well as in the activities of the evaluator. Specific problem-solving strategies are highlighted for their potential value in program evaluation situations. The resulting Problem-Solving Approach, revised through the pilot application, employs problem solving as a

  12. Influence of the Monitored Youth Mentoring Program for adolescents with behavioural problems and behavioural disorders.

    PubMed

    Boras, Sofija; Zuckerman, Zora Itković

    2008-09-01

    This aimed to measure the influence of the Monitored Youth Mentoring Program (MYMP) for adolescents with behavioural problems and behavioural disorders. The MYMP commenced in 1997 and was completed in 2003. The model of the program was for one university student of Pedagogy to mentor one pupil between the ages of 13 and 17 years, demonstrating risk seeking behaviours for a whole school year. The specimen group was made up of 141 pupils, approximately 20 pupils from each year level. The short-term goal was to influence positive change in participants demonstrating risk seeking behaviour. The long-term goal was to enhance the respective school's programs to enable preventative approaches to lessen negative and risk seeking behaviours amongst pupils with behavioural problems and behavioural disorders. The research results demonstrate statistically significant success of the applied program in two measured variables. Firstly, learning success (p < 0.05), and secondly a decrease in truancy and disciplinary misdemeanours (p < 0.05). Both of which were observed in participants with behavioural problems. The program was not as successful for participants with behavioural disorders, but not without some effect. Although the program can be generally described as achieving a medium level of success, the fact that there was a lack of progressive worsening in participant's behaviour is a substantial bi-product of the program. The mentors involved in the program made it extremely clear by their feedback that, MYMP positively enhanced their formal Pedagogy training, through hands-on practise that they otherwise would not have received through their academic programs. They were provided with vital exposure to a preventative program and managed to gain insight into the possibilities of introducing early intervention and prevention into Croatian schools.

  13. Geometric crossovers for multiway graph partitioning.

    PubMed

    Moraglio, Alberto; Kim, Yong-Hyuk; Yoon, Yourim; Moon, Byung-Ro

    2007-01-01

    Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as a basis for geometric crossover, one can design new crossovers for any representation. Using a distance tailored to the problem at hand, the formal definition of geometric crossover allows us to design new problem-specific crossovers that embed problem-knowledge in the search. The standard encoding for multiway graph partitioning is highly redundant: each solution has a number of representations, one for each way of labeling the represented partition. Traditional crossover does not perform well on redundant encodings. We propose a new geometric crossover for graph partitioning based on a labeling-independent distance that filters out the redundancy of the encoding. A correlation analysis of the fitness landscape based on this distance shows that it is well suited to graph partitioning. A second difficulty with designing a crossover for multiway graph partitioning is that of feasibility: in general recombining feasible partitions does not lead to feasible offspring partitions. We design a new geometric crossover for permutations with repetitions that naturally suits partition problems and we test it on the graph partitioning problem. We then combine it with the labeling-independent crossover and obtain a much superior geometric crossover inheriting both advantages.

  14. A strictly improving linear programming alorithm based on a series of Phase 1 problems

    SciTech Connect

    Leichner, S.A.; Dantzig, G.B.; Davis, J.W.

    1992-04-01

    When used on degenerate problems, the simplex method often takes a number of degenerate steps at a particular vertex before moving to the next. In theory (although rarely in practice), the simplex method can actually cycle at such a degenerate point. Instead of trying to modify the simplex method to avoid degenerate steps, we have developed a new linear programming algorithm that is completely impervious to degeneracy. This new method solves the Phase II problem of finding an optimal solution by solving a series of Phase I feasibility problems. Strict improvement is attained at each iteration in the Phase I algorithm, and the Phase II sequence of feasibility problems has linear convergence in the number of Phase I problems. When tested on the 30 smallest NETLIB linear programming test problems, the computational results for the new Phase II algorithm were over 15% faster than the simplex method; on some problems, it was almost two times faster, and on one problem it was four times faster.

  15. HEAP: Heat Energy Analysis Program, a computer model simulating solar receivers. [solving the heat transfer problem

    NASA Technical Reports Server (NTRS)

    Lansing, F. L.

    1979-01-01

    A computer program which can distinguish between different receiver designs, and predict transient performance under variable solar flux, or ambient temperatures, etc. has a basic structure that fits a general heat transfer problem, but with specific features that are custom-made for solar receivers. The code is written in MBASIC computer language. The methodology followed in solving the heat transfer problem is explained. A program flow chart, an explanation of input and output tables, and an example of the simulation of a cavity-type solar receiver are included.

  16. Setting goals, solving problems, and seeking social support: developing adolescents' abilities through a life skills program.

    PubMed

    Forneris, Tanya; Danish, Steven J; Scott, David L

    2007-01-01

    The Going for the Goal (GOAL) program is designed to teach adolescents life skills. There have been few efforts to assess whether the skills that GOAL is designed to teach are being learned by adolescents involved in the program. The purpose of this study was to examine the impact of GOAL on the acquisition of skills in the areas of setting goals, solving problems, and seeking social support. Interviews were conducted with twenty adolescents. Those who participated in GOAL reported that they had learned how to set goals, to solve problems effectively, and to seek the appropriate type of social support.

  17. Solution of Mixed-Integer Programming Problems on the XT5

    SciTech Connect

    Hartman-Baker, Rebecca J; Busch, Ingrid Karin; Hilliard, Michael R; Middleton, Richard S; Schultze, Michael

    2009-01-01

    In this paper, we describe our experience with solving difficult mixed-integer linear programming problems (MILPs) on the petaflop Cray XT5 system at the National Center for Computational Sciences at Oak Ridge National Laboratory. We describe the algorithmic, software, and hardware needs for solving MILPs and present the results of using PICO, an open-source, parallel, mixed-integer linear programming solver developed at Sandia National Laboratories, to solve canonical MILPs as well as problems of interest arising from the logistics and supply chain management field.

  18. A novel approach based on preference-based index for interval bilevel linear programming problem.

    PubMed

    Ren, Aihong; Wang, Yuping; Xue, Xingsi

    2017-01-01

    This paper proposes a new methodology for solving the interval bilevel linear programming problem in which all coefficients of both objective functions and constraints are considered as interval numbers. In order to keep as much uncertainty of the original constraint region as possible, the original problem is first converted into an interval bilevel programming problem with interval coefficients in both objective functions only through normal variation of interval number and chance-constrained programming. With the consideration of different preferences of different decision makers, the concept of the preference level that the interval objective function is preferred to a target interval is defined based on the preference-based index. Then a preference-based deterministic bilevel programming problem is constructed in terms of the preference level and the order relation [Formula: see text]. Furthermore, the concept of a preference δ-optimal solution is given. Subsequently, the constructed deterministic nonlinear bilevel problem is solved with the help of estimation of distribution algorithm. Finally, several numerical examples are provided to demonstrate the effectiveness of the proposed approach.

  19. Shell Development Computer Aided Lofting - Is There a Problem or Not? (The National Shipbuilding Research Program)

    DTIC Science & Technology

    1993-11-01

    such complex shell plates. Also, the amount of stock should be at least 100 millimeters to cuver the greatest differences. STUDY CONCLUSIONS AND...1993 Ship Production Symposium Paper No. 9: Shell Development Computer Aided Lofting - Is There a Problem or Not? U.S. DEPARTMENT OF THE NAVY...Research Program, 1993 Ship Production Symposium Paper No. 9: Shell Development Computer Aided Lofting - Is There a Problem or Not? 5a. CONTRACT NUMBER 5b

  20. Digital program for solving the linear stochastic optimal control and estimation problem

    NASA Technical Reports Server (NTRS)

    Geyser, L. C.; Lehtinen, B.

    1975-01-01

    A computer program is described which solves the linear stochastic optimal control and estimation (LSOCE) problem by using a time-domain formulation. The LSOCE problem is defined as that of designing controls for a linear time-invariant system which is disturbed by white noise in such a way as to minimize a performance index which is quadratic in state and control variables. The LSOCE problem and solution are outlined; brief descriptions are given of the solution algorithms, and complete descriptions of each subroutine, including usage information and digital listings, are provided. A test case is included, as well as information on the IBM 7090-7094 DCS time and storage requirements.

  1. Treating Conduct Problems and Strengthening Social and Emotional Competence in Young Children: The Dina Dinosaur Treatment Program.

    ERIC Educational Resources Information Center

    Webster-Stratton, Carolyn; Reid, M. Jamila

    2003-01-01

    This article describes the Dina Dinosaur Social, Emotional and Problem Solving Child Training Program for young children with conduct problems. The program emphasizes training children in skills such as emotional literacy, empathy or perspective taking, friendship and communication skills, anger management, interpersonal problem solving, and…

  2. Treating Conduct Problems and Strengthening Social and Emotional Competence in Young Children: The Dina Dinosaur Treatment Program.

    ERIC Educational Resources Information Center

    Webster-Stratton, Carolyn; Reid, M. Jamila

    2003-01-01

    This article describes the Dina Dinosaur Social, Emotional and Problem Solving Child Training Program for young children with conduct problems. The program emphasizes training children in skills such as emotional literacy, empathy or perspective taking, friendship and communication skills, anger management, interpersonal problem solving, and…

  3. Interactive program for analysis and design problems in advanced composites technology

    NASA Technical Reports Server (NTRS)

    Cruse, T. A.; Swedlow, J. L.

    1971-01-01

    During the past year an experimental program in the fracture of advanced fiber composites has been completed. The experimental program has given direction to additional experimental and theoretical work. A synthesis program for designing low weight multifastener joints in composites is proposed, based on extensive analytical background. A number of failed joints have been thoroughly analyzed to evaluate the failure hypothesis used in the synthesis procedure. Finally, a new solution is reported for isotropic and anisotropic laminates using the boundary-integral method. The solution method offers significant savings of computer core and time for important problems.

  4. Facing the PA team growth problem in space programs: The Hermes approach

    NASA Astrophysics Data System (ADS)

    Bernede, G.

    1991-08-01

    The increasing need for product assurance (PA) in space programs makes finding skilled and trained engineers willing to work in the PA field a top level difficulty. Few engineers are available and exchanging them from one project to another is not a solution. No reservoir of talent exists for the time being in Europe. Educational efforts have started in several countries to have product assurance techniques become part of basic engineering knowledge. These efforts will bring strong improvement compared to today's situation but not in time for programs such as Hermes. Peculiar solutions must be developed. Approaches used to solve this problem within the Hermes program are outlined.

  5. An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems

    SciTech Connect

    Zhang Jianzhong; Zhang Liwei

    2010-02-15

    We consider an inverse quadratic programming (QP) problem in which the parameters in the objective function of a given QP problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with a positive semidefinite cone constraint and its dual is a linearly constrained semismoothly differentiable (SC{sup 1}) convex programming problem with fewer variables than the original one. We demonstrate the global convergence of the augmented Lagrangian method for the dual problem and prove that the convergence rate of primal iterates, generated by the augmented Lagrange method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/{radical}r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC{sup 1} function involving the projection operator onto the cone of symmetrically semi-definite matrices, the analysis requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and properties of the projection operator in the symmetric-matrix space. Furthermore, the semismooth Newton method with Armijo line search is applied to solve the subproblems in the augmented Lagrange approach, which is proven to have global convergence and local quadratic rate. Finally numerical results, implemented by the augmented Lagrangian method, are reported.

  6. Exploring New Geometric Worlds

    ERIC Educational Resources Information Center

    Nirode, Wayne

    2015-01-01

    When students work with a non-Euclidean distance formula, geometric objects such as circles and segment bisectors can look very different from their Euclidean counterparts. Students and even teachers can experience the thrill of creative discovery when investigating these differences among geometric worlds. In this article, the author describes a…

  7. Exploring New Geometric Worlds

    ERIC Educational Resources Information Center

    Nirode, Wayne

    2015-01-01

    When students work with a non-Euclidean distance formula, geometric objects such as circles and segment bisectors can look very different from their Euclidean counterparts. Students and even teachers can experience the thrill of creative discovery when investigating these differences among geometric worlds. In this article, the author describes a…

  8. Research Utilizing Problem Solving: Outcome Evaluation Report. Improving Teaching Competencies Program.

    ERIC Educational Resources Information Center

    Murray, Stephen L.; And Others

    This report presents data collected about the impact of the Research Utilizing Problem Solving (RUPS) instructional system on the classrooms of teachers trained in two RUPS workshops, which were part of the Improving Teaching Competencies Program at the Northwest Regional Educational Laboratory. The report is divided into four chapters, the first…

  9. A Cooperative Training Program for Students with Severe Behavior Problems: Description and Comparative Evaluation.

    ERIC Educational Resources Information Center

    Reganick, Karol A.

    The Cooperative Training Program was implemented with 20 students having severe behavior problems, to augment a classroom employability curriculum. Educators and business managers at a local Perkins restaurant worked cooperatively to design a new curriculum and recruitment procedure to benefit both students and the business. A continuous and…

  10. Universal algorithms and programs for calculating the motion parameters in the two-body problem

    NASA Technical Reports Server (NTRS)

    Bakhshiyan, B. T.; Sukhanov, A. A.

    1979-01-01

    The algorithms and FORTRAN programs for computing positions and velocities, orbital elements and first and second partial derivatives in the two-body problem are presented. The algorithms are applicable for any value of eccentricity and are convenient for computing various navigation parameters.

  11. SPECIAL PROBLEMS REPORT, ADULT EDUCATION PROGRAMS FOR RURAL POPULATION IN PAKISTAN AND SUGGESTIONS FOR THEIR IMPROVEMENT.

    ERIC Educational Resources Information Center

    ALI KHAN, ANSAR

    THE AUTHOR DISCUSSES THE NEED FOR FUNCTIONAL, SEQUENTIAL PROGRAMS OF LITERACY, VOCATIONAL, LIBERAL, POLITICAL, AND HUMAN RELATIONS EDUCATION IN RURAL AREAS OF PAKISTAN. PROBLEMS AND CHALLENGES ARE SEEN IN THE OCCUPATIONAL CASTE SYSTEM, FAMILY STRUCTURES, ATTITUDES TOWARD THE EDUCATION OF BOYS AND GIRLS, POOR MEANS OF TRANSPORTATION AND…

  12. The Special Caretakers Program: A Hospital's Solution to the Boarder Baby Problem.

    ERIC Educational Resources Information Center

    Gentry, Linda R.

    1993-01-01

    Describes Special Caretakers Program, project in which employees of Hahnemann University Hospital in Philadelphia (Pennsylvania) became foster parents for hospital's boarder babies, newborns and children medically ready for discharge who often waited weeks or months for appropriate foster home. Discusses problems and solutions encountered in the…

  13. Problems in Recruiting Students into Agricultural Education Programs: A Delphi Study of Agriculture Teacher Perceptions.

    ERIC Educational Resources Information Center

    Dyer, James E.; Breja, Lisa M.

    2003-01-01

    In a four-round Delphi study, 18 secondary agriculture teachers identified and rated student recruitment problems. Consensus was reached on these items: scheduling difficulties, finding time to recruit, student involvement in other activities, access to students, competition from other programs, lack of counselor support, increased graduation…

  14. Keeping Fit with Asta O'Donnell. An Exercise Program for Problem Backs.

    ERIC Educational Resources Information Center

    O'Donnell, Asta

    An estimated 75 million people in the United States suffer from some type of back problem. Most are caused by muscle strain and improper posture. This book describes an exercise program designed to relieve muscle strain, improve and correct posture, and reduce stress and tension. The book is divided into four sections: "Warm…

  15. The Effectiveness of a CBI Program for Teaching Problem Solving Skills to Middle Level Students.

    ERIC Educational Resources Information Center

    Langholz, Judith; Smaldino, Sharon E.

    This study focuses on the effectiveness of "Solutions Unlimited," a computer software program developed to teach problem solving to middle level students. Fifty-one fourth, fifth, and sixth graders (21 girls and 30 boys) attending a private school in a small mid-west community were the subjects for this experiment; none had received…

  16. Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis

    ERIC Educational Resources Information Center

    Brusco, Michael J.; Kohn, Hans-Friedrich; Stahl, Stephanie

    2008-01-01

    Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30x30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation…

  17. Effects of a Multifocused Prevention Program on Preschool Children's Competencies and Behavior Problems

    ERIC Educational Resources Information Center

    Stefan, Catrinel A.; Miclea, Mircea

    2013-01-01

    This study was designed to assess the effectiveness of a multifocused (child-, teacher- and parent-focused) prevention program for Romanian preschoolers, targeting social--emotional competence development, as well as reduction of behavior problems. Fourteen classrooms were randomly assigned to the intervention and control conditions. Subsequent…

  18. Problems and Methods of Implementing a Treatment Program for a Security Unit

    ERIC Educational Resources Information Center

    Mell, Lowry W.; Knotts, Ralph

    1976-01-01

    Available from: EC 090 474. The Security Unit School--an educational and residential treatment model in Pennsylvania for 24 juvenile offenders (15-18 years old)--is described in terms of problems encountered in assimilating students into the program, planning a curriculum, developing effective instructional materials, and providing treatment. (SBH)

  19. Preventing Boys' Problems in Schools through Psychoeducational Programming: A Call to Action

    ERIC Educational Resources Information Center

    O'Neil, James M.; Lujan, Melissa L.

    2009-01-01

    Controversy currently exists on whether boys are in crises and, if so, what to do about it. Research is reviewed that indicates that boys have problems that affect their emotional and interpersonal functioning. Psychoeducational and preventive programs for boys are recommended as a call to action in schools. Thematic areas for boys' programming…

  20. Visual, Algebraic and Mixed Strategies in Visually Presented Linear Programming Problems.

    ERIC Educational Resources Information Center

    Shama, Gilli; Dreyfus, Tommy

    1994-01-01

    Identified and classified solution strategies of (n=49) 10th-grade students who were presented with linear programming problems in a predominantly visual setting in the form of a computerized game. Visual strategies were developed more frequently than either algebraic or mixed strategies. Appendix includes questionnaires. (Contains 11 references.)…

  1. Comparison of Cursive Handwriting Instruction Programs among Students without Identified Problems

    ERIC Educational Resources Information Center

    Shimel, Kristin; Candler, Catherine; Neville-Smith, Marsha

    2009-01-01

    The purpose of this study was to compare the effects of cursive handwriting programs in improving letter legibility and form in third-grade students without identified handwriting problems. Four months into the school year, cursive handwriting was assessed for a sample of convenience of 50 third-grade students. Subsequently, students received…

  2. Problems and Methods of Implementing a Treatment Program for a Security Unit

    ERIC Educational Resources Information Center

    Mell, Lowry W.; Knotts, Ralph

    1976-01-01

    Available from: EC 090 474. The Security Unit School--an educational and residential treatment model in Pennsylvania for 24 juvenile offenders (15-18 years old)--is described in terms of problems encountered in assimilating students into the program, planning a curriculum, developing effective instructional materials, and providing treatment. (SBH)

  3. The Effects of Teaching Programming via Scratch on Problem Solving Skills: A Discussion from Learners' Perspective

    ERIC Educational Resources Information Center

    Kalelioglu, Filiz; Gülbahar, Yasemin

    2014-01-01

    Computer programming is perceived as an important competence for the development of problem solving skills in addition to logical reasoning. Hence, its integration throughout all educational levels, as well as the early ages, is considered valuable and research studies are carried out to explore the phenomenon in more detail. In light of these…

  4. SPECIAL PROBLEMS REPORT, ADULT EDUCATION PROGRAMS FOR RURAL POPULATION IN PAKISTAN AND SUGGESTIONS FOR THEIR IMPROVEMENT.

    ERIC Educational Resources Information Center

    ALI KHAN, ANSAR

    THE AUTHOR DISCUSSES THE NEED FOR FUNCTIONAL, SEQUENTIAL PROGRAMS OF LITERACY, VOCATIONAL, LIBERAL, POLITICAL, AND HUMAN RELATIONS EDUCATION IN RURAL AREAS OF PAKISTAN. PROBLEMS AND CHALLENGES ARE SEEN IN THE OCCUPATIONAL CASTE SYSTEM, FAMILY STRUCTURES, ATTITUDES TOWARD THE EDUCATION OF BOYS AND GIRLS, POOR MEANS OF TRANSPORTATION AND…

  5. Keeping Fit with Asta O'Donnell. An Exercise Program for Problem Backs.

    ERIC Educational Resources Information Center

    O'Donnell, Asta

    An estimated 75 million people in the United States suffer from some type of back problem. Most are caused by muscle strain and improper posture. This book describes an exercise program designed to relieve muscle strain, improve and correct posture, and reduce stress and tension. The book is divided into four sections: "Warm…

  6. Students' Usability Evaluation of a Web-Based Tutorial Program for College Biology Problem Solving

    ERIC Educational Resources Information Center

    Kim, H. S.; Prevost, L.; Lemons, P. P.

    2015-01-01

    The understanding of core concepts and processes of science in solving problems is important to successful learning in biology. We have designed and developed a Web-based, self-directed tutorial program, "SOLVEIT," that provides various scaffolds (e.g., prompts, expert models, visual guidance) to help college students enhance their…

  7. Enhancing Problem-Solving Capabilities Using Object-Oriented Programming Language

    ERIC Educational Resources Information Center

    Unuakhalu, Mike F.

    2009-01-01

    This study integrated object-oriented programming instruction with transfer training activities in everyday tasks, which might provide a mechanism that can be used for efficient problem solving. Specifically, a Visual BASIC embedded with everyday tasks group was compared to another group exposed to Visual BASIC instruction only. Subjects were 40…

  8. Students' Usability Evaluation of a Web-Based Tutorial Program for College Biology Problem Solving

    ERIC Educational Resources Information Center

    Kim, H. S.; Prevost, L.; Lemons, P. P.

    2015-01-01

    The understanding of core concepts and processes of science in solving problems is important to successful learning in biology. We have designed and developed a Web-based, self-directed tutorial program, "SOLVEIT," that provides various scaffolds (e.g., prompts, expert models, visual guidance) to help college students enhance their…

  9. Problem-Based Learning in a Physical Therapy Program and Subsequent Clinical Practice: The Practitioners' Perspectives.

    ERIC Educational Resources Information Center

    Wilson, Stanley H.; Gallagher, Jo D.; Elbaum, Leonard; Smith, Douglas H.

    This study examined the perspectives of three graduates of a problem-based learning (PBL) physical therapy (PT) program about their clinical practice. Researchers used qualitative methods of observation, interview, and journaling to gather the data. Three sessions of audiotaped interviews and two observation sessions were conducted with the three…

  10. The Effectiveness of a CBI Program for Teaching Problem Solving Skills to Middle Level Students.

    ERIC Educational Resources Information Center

    Langholz, Judith; Smaldino, Sharon E.

    This study focuses on the effectiveness of "Solutions Unlimited," a computer software program developed to teach problem solving to middle level students. Fifty-one fourth, fifth, and sixth graders (21 girls and 30 boys) attending a private school in a small mid-west community were the subjects for this experiment; none had received…

  11. A new gradient-based neural network for solving linear and quadratic programming problems.

    PubMed

    Leung, Y; Chen, K Z; Jiao, Y C; Gao, X B; Leung, K S

    2001-01-01

    A new gradient-based neural network is constructed on the basis of the duality theory, optimization theory, convex analysis theory, Lyapunov stability theory, and LaSalle invariance principle to solve linear and quadratic programming problems. In particular, a new function F(x, y) is introduced into the energy function E(x, y) such that the function E(x, y) is convex and differentiable, and the resulting network is more efficient. This network involves all the relevant necessary and sufficient optimality conditions for convex quadratic programming problems. For linear programming and quadratic programming (QP) problems with unique and infinite number of solutions, we have proven strictly that for any initial point, every trajectory of the neural network converges to an optimal solution of the QP and its dual problem. The proposed network is different from the existing networks which use the penalty method or Lagrange method, and the inequality constraints are properly handled. The simulation results show that the proposed neural network is feasible and efficient.

  12. Formulating a stand-growth model for mathematical programming problems in Appalachian forests

    Treesearch

    Gary W. Miller; Jay Sullivan

    1993-01-01

    Some growth and yield simulators applicable to central hardwood forests can be formulated for use in mathematical programming models that are designed to optimize multi-stand, multi-resource management problems. Once in the required format, growth equations serve as model constraints, defining the dynamics of stand development brought about by harvesting decisions. In...

  13. 34 CFR 356.11 - What types of problems may be researched under the fellowship program?

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 34 Education 2 2010-07-01 2010-07-01 false What types of problems may be researched under the fellowship program? 356.11 Section 356.11 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF SPECIAL EDUCATION AND REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION DISABILITY AND...

  14. 34 CFR 356.11 - What types of problems may be researched under the fellowship program?

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 34 Education 2 2011-07-01 2010-07-01 true What types of problems may be researched under the fellowship program? 356.11 Section 356.11 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF SPECIAL EDUCATION AND REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION DISABILITY AND...

  15. Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis

    ERIC Educational Resources Information Center

    Brusco, Michael J.; Kohn, Hans-Friedrich; Stahl, Stephanie

    2008-01-01

    Dynamic programming methods for matrix permutation problems in combinatorial data analysis can produce globally-optimal solutions for matrices up to size 30x30, but are computationally infeasible for larger matrices because of enormous computer memory requirements. Branch-and-bound methods also guarantee globally-optimal solutions, but computation…

  16. Enhancing Problem-Solving Capabilities Using Object-Oriented Programming Language

    ERIC Educational Resources Information Center

    Unuakhalu, Mike F.

    2009-01-01

    This study integrated object-oriented programming instruction with transfer training activities in everyday tasks, which might provide a mechanism that can be used for efficient problem solving. Specifically, a Visual BASIC embedded with everyday tasks group was compared to another group exposed to Visual BASIC instruction only. Subjects were 40…

  17. Effects of a Multifocused Prevention Program on Preschool Children's Competencies and Behavior Problems

    ERIC Educational Resources Information Center

    Stefan, Catrinel A.; Miclea, Mircea

    2013-01-01

    This study was designed to assess the effectiveness of a multifocused (child-, teacher- and parent-focused) prevention program for Romanian preschoolers, targeting social--emotional competence development, as well as reduction of behavior problems. Fourteen classrooms were randomly assigned to the intervention and control conditions. Subsequent…

  18. Interactive computerized learning program exposes veterinary students to challenging international animal-health problems.

    PubMed

    Conrad, Patricia A; Hird, Dave; Arzt, Jonathan; Hayes, Rick H; Magliano, Dave; Kasper, Janine; Morfin, Saul; Pinney, Stephen

    2007-01-01

    This article describes a computerized case-based CD-ROM (CD) on international animal health that was developed to give veterinary students an opportunity to "virtually" work alongside veterinarians and other veterinary students as they try to solve challenging disease problems relating to tuberculosis in South African wildlife, bovine abortion in Mexico, and neurologic disease in horses in Rapa Nui, Chile. Each of the three case modules presents, in a highly interactive format, a problem or mystery that must be solved by the learner. As well as acquiring information via video clips and text about the specific health problem, learners obtain information about the different countries, animal-management practices, diagnostic methods, related disease-control issues, economic factors, and the opinions of local experts. After assimilating this information, the learner must define the problem and formulate an action plan or make a recommendation or diagnosis. The computerized program invokes three principles of adult education: active learning, learner-centered education, and experiential learning. A medium that invokes these principles is a potentially efficient learning tool and template for developing other case-based problem-solving computerized programs. The program is accessible on the World Wide Web at . A broadband Internet connection is recommended, since the modules make extensive use of embedded video and audio clips. Information on how to obtain the CD is also provided.

  19. Exposure therapy for problem gambling in rural communities: a program model and early outcomes.

    PubMed

    Riley, Ben; Smith, David; Oakes, Jane

    2011-06-01

    Rural South Australia contains a higher share of electronic gaming machines and gambling expenditure per capita than metropolitan areas, raising concerns about the risk of problem gambling in these communities. This paper describes the implementation and outcomes of an outreach behavioural psychotherapy (exposure therapy) program for problem gambling in rural South Australia. A retrospective cohort study design was used for 551 adult treatment-seeking problem gamblers who presented to the Statewide Gambling Therapy Service in South Australia. Fifty-one gamblers were from rural areas and participated in the outreach program. Outcomes were compared between gamblers who participated in either the metropolitan-based or rural outreach program. Outcome measures used: South Oaks Gambling Screen, Kessler Psychological Distress Scale, Work and Social Adjustment Scale, and hours gambled the previous month. Sixty-one per cent of clients (n = 551) completed treatment. There was no significant association between service location and number of treatment completers. Significant improvements were recorded across all outcome measures for both groups with small to large effect sizes, and there were no significant differences in outcomes at post-treatment between the groups while controlling for baseline scores. Both metropolitan and rural clients reported significant clinical improvement. Given the risk of problem gambling in rural communities, these early outcomes are encouraging. These findings will inform future treatment planning and service delivery for rural clients, and guide further research into the effectiveness of exposure therapy for problem gambling. © 2011 The Authors. Australian Journal of Rural Health © National Rural Health Alliance Inc.

  20. A fuzzy goal programming model for the simple U-line balancing problem with multiple objectives

    NASA Astrophysics Data System (ADS)

    Toklu, Bilal; Ozcan, Uğur

    2008-03-01

    A fuzzy goal programming model for the simple U-line balancing (SULB) problem with multiple objectives is presented. In real life applications of the SULB problem with multiple objectives, it is difficult for the decision-maker(s) to determine the goal value of each objective precisely as the goal values are imprecise, vague, or uncertain. Therefore a fuzzy goal programming model is developed for this purpose. The proposed model is the first fuzzy multi-objective decision-making approach to the SULB problem with multiple objectives which aims at simultaneously optimizing several conflicting goals. The proposed model is illustrated using an example. A computational study is conducted by solving a large number of test problems to investigate the relationship between the fuzzy goals and to compare them with the goal programming model proposed by Gokcen and Ağpak (Gokcen, H. and Ağpak, K., European Journal of Operational Research, 171, 577-585, 2006). The results of the computational study show that the proposed model is more realistic than the existing models for the SULB problem with multiple objectives and also provides increased flexibility for the decision-maker(s) to determine different alternatives.

  1. Second-quantized formulation of geometric phases

    SciTech Connect

    Deguchi, Shinichi; Fujikawa, Kazuo

    2005-07-15

    The level crossing problem and associated geometric terms are neatly formulated by the second-quantized formulation. This formulation exhibits a hidden local gauge symmetry related to the arbitrariness of the phase choice of the complete orthonormal basis set. By using this second-quantized formulation, which does not assume adiabatic approximation, a convenient exact formula for the geometric terms including off-diagonal geometric terms is derived. The analysis of geometric phases is then reduced to a simple diagonalization of the Hamiltonian, and it is analyzed both in the operator and path-integral formulations. If one diagonalizes the geometric terms in the infinitesimal neighborhood of level crossing, the geometric phases become trivial (and thus no monopole singularity) for arbitrarily large but finite time interval T. The integrability of Schroedinger equation and the appearance of the seemingly nonintegrable phases are thus consistent. The topological proof of the Longuet-Higgins' phase-change rule, for example, fails in the practical Born-Oppenheimer approximation where a large but finite ratio of two time scales is involved and T is identified with the period of the slower system. The difference and similarity between the geometric phases associated with level crossing and the exact topological object such as the Aharonov-Bohm phase become clear in the present formulation. A crucial difference between the quantum anomaly and the geometric phases is also noted.

  2. Solving and analyzing side-chain positioning problems using linear and integer programming.

    PubMed

    Kingsford, Carleton L; Chazelle, Bernard; Singh, Mona

    2005-04-01

    Side-chain positioning is a central component of homology modeling and protein design. In a common formulation of the problem, the backbone is fixed, side-chain conformations come from a rotamer library, and a pairwise energy function is optimized. It is NP-complete to find even a reasonable approximate solution to this problem. We seek to put this hardness result into practical context. We present an integer linear programming (ILP) formulation of side-chain positioning that allows us to tackle large problem sizes. We relax the integrality constraint to give a polynomial-time linear programming (LP) heuristic. We apply LP to position side chains on native and homologous backbones and to choose side chains for protein design. Surprisingly, when positioning side chains on native and homologous backbones, optimal solutions using a simple, biologically relevant energy function can usually be found using LP. On the other hand, the design problem often cannot be solved using LP directly; however, optimal solutions for large instances can still be found using the computationally more expensive ILP procedure. While different energy functions also affect the difficulty of the problem, the LP/ILP approach is able to find optimal solutions. Our analysis is the first large-scale demonstration that LP-based approaches are highly effective in finding optimal (and successive near-optimal) solutions for the side-chain positioning problem.

  3. Convergence of neural networks for programming problems via a nonsmooth Lojasiewicz inequality.

    PubMed

    Forti, Mauro; Nistri, Paolo; Quincampoix, Marc

    2006-11-01

    This paper considers a class of neural networks (NNs) for solving linear programming (LP) problems, convex quadratic programming (QP) problems, and nonconvex QP problems where an indefinite quadratic objective function is subject to a set of affine constraints. The NNs are characterized by constraint neurons modeled by ideal diodes with vertical segments in their characteristic, which enable to implement an exact penalty method. A new method is exploited to address convergence of trajectories, which is based on a nonsmooth Lojasiewicz inequality for the generalized gradient vector field describing the NN dynamics. The method permits to prove that each forward trajectory of the NN has finite length, and as a consequence it converges toward a singleton. Furthermore, by means of a quantitative evaluation of the Lojasiewicz exponent at the equilibrium points, the following results on convergence rate of trajectories are established: (1) for nonconvex QP problems, each trajectory is either exponentially convergent, or convergent in finite time, toward a singleton belonging to the set of constrained critical points; (2) for convex QP problems, the same result as in (1) holds; moreover, the singleton belongs to the set of global minimizers; and (3) for LP problems, each trajectory converges in finite time to a singleton belonging to the set of global minimizers. These results, which improve previous results obtained via the Lyapunov approach, are true independently of the nature of the set of equilibrium points, and in particular they hold even when the NN possesses infinitely many nonisolated equilibrium points.

  4. The Strengthening Families Program 10–14: influence on parent and youth problem-solving skill

    PubMed Central

    Semeniuk, Y.; Brown, R. L.; Riesch, S.K.; Zywicki, M.; Hopper, J.; Henriques, J.B.

    2011-01-01

    The aim of this paper is to report the results of a preliminary examination of the efficacy of the Strengthening Families Program (SFP) 10–14 in improving parent and youth problem-solving skill. The Hypotheses in this paper include: (1) youth and parents who participated in SFP would have lower mean scores immediately (T2) and 6 months (T3) post intervention on indicators of hostile and negative problem-solving strategies; (2) higher mean scores on positive problem-solving strategies; and (3) youth who participated in SFP would have higher mean scores at T2 and at T3 on indicators of individual problem solving and problem-solving efficacy than youth in the comparison group. The dyads were recruited from elementary schools that had been stratified for race and assigned randomly to intervention or comparison conditions. Mean age of youth was 11 years (SD = 1.04). Fifty-seven dyads (34-intervention & 23-control) were videotaped discussing a frequently occurring problem. The videotapes were analysed using the Iowa Family Interaction Rating Scale (IFIRS) and data were analysed using Dyadic Assessment Intervention Model. Most mean scores on the IFIRS did not change. One score changed as predicted: youth hostility decreased at T3. Two scores changed contrary to prediction: parent hostility increased T3 and parent positive problem solving decreased at T2. SFP demonstrated questionable efficacy for problem-solving skill in this study. PMID:20584236

  5. The Strengthening Families Program 10-14: influence on parent and youth problem-solving skill.

    PubMed

    Semeniuk, Y; Brown, R L; Riesch, S K; Zywicki, M; Hopper, J; Henriques, J B

    2010-06-01

    The aim of this paper is to report the results of a preliminary examination of the efficacy of the Strengthening Families Program (SFP) 10-14 in improving parent and youth problem-solving skill. The Hypotheses in this paper include: (1) youth and parents who participated in SFP would have lower mean scores immediately (T2) and 6 months (T3) post intervention on indicators of hostile and negative problem-solving strategies; (2) higher mean scores on positive problem-solving strategies; and (3) youth who participated in SFP would have higher mean scores at T2 and at T3 on indicators of individual problem solving and problem-solving efficacy than youth in the comparison group. The dyads were recruited from elementary schools that had been stratified for race and assigned randomly to intervention or comparison conditions. Mean age of youth was 11 years (SD = 1.04). Fifty-seven dyads (34-intervention&23-control) were videotaped discussing a frequently occurring problem. The videotapes were analysed using the Iowa Family Interaction Rating Scale (IFIRS) and data were analysed using Dyadic Assessment Intervention Model. Most mean scores on the IFIRS did not change. One score changed as predicted: youth hostility decreased at T3. Two scores changed contrary to prediction: parent hostility increased T3 and parent positive problem solving decreased at T2. SFP demonstrated questionable efficacy for problem-solving skill in this study.

  6. Calculators and Strategies for Problem Solving in Grade Seven: An Implementation Program and Study. Report No. 83:3.

    ERIC Educational Resources Information Center

    Szetela, W.; Super, D.

    A problem-solving program supplemented by calculators in one treatment group was conducted in 63 grade 7 classes with about 1350 students. Teachers were provided with problems correlated with textbooks, and instruction for teaching problem-solving strategies. School districts provided calculators and problem-solving materials. Pretest scores…

  7. Understanding change among multi-problem families: Learnings from a formative program assessment.

    PubMed

    Millett, Lina Sapokaite; Ben-David, Vered; Jonson-Reid, Melissa; Echele, Greg; Moussette, Pam; Atkins, Valerie

    2016-10-01

    This paper describes the implementation of a long-term voluntary intervention to prevent chronic maltreatment among multi-problem families with histories of child welfare involvement. A small formative evaluation included a limited number of interviews with program participants during the first year of program implementation (n=10), a retrospective case file review (n=17) of closed cases following the first three years of implementation, and notes from ongoing meetings and discussion with program staff. Findings regarding client engagement, long-term interaction between risk and services, and program refinement are discussed. Despite the program's voluntary nature, positive comments from families, and extensive engagement strategies, only about 22% of families remained engaged for the full two-year program. Material hardship was one of the most persistent risk factors from baseline to termination. In many cases, unforeseen negative events occurred that, at least partly, derailed progress. In all cases, progress made was not reflective of a consistent linear process used in the design of most child welfare programs. Implications for program theory and design are discussed.

  8. On the Performance of Different Genetic Programming Approaches for the SORTING Problem.

    PubMed

    Wagner, Markus; Neumann, Frank; Urli, Tommaso

    2015-01-01

    In genetic programming, the size of a solution is typically not specified in advance, and solutions of larger size may have a larger benefit. The flexibility often comes at the cost of the so-called bloat problem: individuals grow without providing additional benefit to the quality of solutions, and the additional elements can block the optimization process. Consequently, problems that are relatively easy to optimize cannot be handled by variable-length evolutionary algorithms. In this article, we analyze different single- and multiobjective algorithms on the sorting problem, a problem that typically lacks independent and additive fitness structures. We complement the theoretical results with comprehensive experiments to indicate the tightness of existing bounds, and to indicate bounds where theoretical results are missing.

  9. Impossible Geometric Constructions: A Calculus Writing Project

    ERIC Educational Resources Information Center

    Awtrey, Chad

    2013-01-01

    This article discusses a writing project that offers students the opportunity to solve one of the most famous geometric problems of Greek antiquity; namely, the impossibility of trisecting the angle [pi]/3. Along the way, students study the history of Greek geometry problems as well as the life and achievements of Carl Friedrich Gauss. Included is…

  10. Impossible Geometric Constructions: A Calculus Writing Project

    ERIC Educational Resources Information Center

    Awtrey, Chad

    2013-01-01

    This article discusses a writing project that offers students the opportunity to solve one of the most famous geometric problems of Greek antiquity; namely, the impossibility of trisecting the angle [pi]/3. Along the way, students study the history of Greek geometry problems as well as the life and achievements of Carl Friedrich Gauss. Included is…

  11. Stable computation of search directions for near-degenerate linear programming problems

    SciTech Connect

    Hough, P.D.

    1997-03-01

    In this paper, we examine stability issues that arise when computing search directions ({delta}x, {delta}y, {delta} s) for a primal-dual path-following interior point method for linear programming. The dual step {delta}y can be obtained by solving a weighted least-squares problem for which the weight matrix becomes extremely il conditioned near the boundary of the feasible region. Hough and Vavisis proposed using a type of complete orthogonal decomposition (the COD algorithm) to solve such a problem and presented stability results. The work presented here addresses the stable computation of the primal step {delta}x and the change in the dual slacks {delta}s. These directions can be obtained in a straight-forward manner, but near-degeneracy in the linear programming instance introduces ill-conditioning which can cause numerical problems in this approach. Therefore, we propose a new method of computing {delta}x and {delta}s. More specifically, this paper describes and orthogonal projection algorithm that extends the COD method. Unlike other algorithms, this method is stable for interior point methods without assuming nondegeneracy in the linear programming instance. Thus, it is more general than other algorithms on near-degenerate problems.

  12. Solitons in geometric potentials

    NASA Astrophysics Data System (ADS)

    Kartashov, Yaroslav V.; Szameit, Alexander; Keil, Robert; Vysloukh, Victor A.; Torner, Lluis

    2011-09-01

    We show that the geometrically induced potential existing in undulated slab waveguides dramatically affects the properties of solitons. In particular, whereas solitons residing in the potential maxima do not feature power thresholds and are stable, their counterparts residing in the potential minima are unstable and may exhibit a power threshold for their existence. Additionally, the geometric potential is shown to support stable multipole solitons that cannot be supported by straight waveguides. Finally, the geometric potential results in the appearance of the effective barriers that prevent transverse soliton motion.

  13. Enrollment and attendance in a parent training prevention program for conduct problems.

    PubMed

    Baker, Courtney N; Arnold, David H; Meagher, Susan

    2011-06-01

    Low levels of enrollment and attendance in parent training programs present major problems for researchers and clinicians. The literature on enrollment and attendance in prevention programs is especially limited, and these constructs may be particularly difficult to address in this context. Further, most previous research has not made the distinction between enrollment and attendance. This study describes predictors of enrollment and attendance in a behavioral parent training program intended to prevent conduct problems in preschoolers. Information was gathered from 106 preschoolers, their parents, and their teachers. Parent socioeconomic status (SES), single parent status, ethnicity, child externalizing behavior, parent depressive symptoms, and parent social support were investigated as possible predictors of families' enrollment and attendance. Only 48% of the families that had already provided informed consent and completed demographic questionnaires actually enrolled in the parent training program; parents with lower incomes and lower levels of social support were less likely to enroll. In addition, African-American and Puerto Rican families were less likely to enroll than Caucasian families. The average attendance rate for enrolled parents was 61%; dual parents and parents with children evidencing externalizing behavior problems attended more parent training sessions. Parent depression was not associated with enrollment or attendance. Significant relationships were maintained when controlling for other predictors including SES and when accounting for center-level variance. In addition, three distinct patterns of attendance were observed, which may have practical implications related to retention strategies.

  14. Long-term effects of the strong African American families program on youths' conduct problems.

    PubMed

    Brody, Gene H; Kogan, Steven M; Chen, Yi-fu; McBride Murry, Velma

    2008-11-01

    The Strong African American Families program, a universal intervention to deter alcohol use among rural African American preadolescents, was evaluated to determine whether it also prevented conduct problems across the 29 months separating the pretest and long-term follow-up assessments. The program is based on a contextual model in which intervention effects on parental behavior and youth protective factors are hypothesized to lead to behavior changes. African American 11-year-olds (N = 667) and their primary caregivers were randomly selected from public school lists of fifth-grade students and randomly assigned to an intervention (n = 369) or control (n = 298) condition. Intervention families participated in a 7-week family skills training program designed to deter alcohol use. Each meeting included separate, concurrent sessions for parents and children, followed by a joint parent-child session during which the families practiced the skills they learned in their separate sessions. Control families were mailed leaflets regarding early adolescent development, stress management, and exercise. All families completed in-home pretest, posttest, and long-term follow-up interviews during which parent-report and self-report data regarding conduct problems, low self-control, deviance-prone peer affiliations, parenting, and youth protective processes were gathered. Intent-to-treat analyses indicated that prevention-group youth were less involved than control-group youth in conduct problems across time. As hypothesized, prevention effects were stronger for youth at greater risk of developing conduct problems. Intervention targeted parenting and youth factors partially accounted for intervention effects among high risk youth. Although the Strong African American Families program was designed to deter underage drinking, it is also effective in preventing the development of conduct problems.

  15. Long-Term Effects of the Strong African American Families Program on Youths’ Conduct Problems

    PubMed Central

    Brody, Gene H.; Kogan, Steven M.; Chen, Yi-fu; Murry, Velma McBride

    2008-01-01

    Purpose The Strong African American Families program, a universal intervention to deter alcohol use among rural African American preadolescents, was evaluated to determine whether it also prevented conduct problems across the 29 months separating the pretest and long-term follow-up assessments. The program is based on a contextual model in which intervention effects on parental behavior and youth protective factors are hypothesized to lead to behavior changes. Methods African American 11-year-olds (N = 667) and their primary caregivers were randomly selected from public school lists of 5th-grade students and randomly assigned to an intervention (n = 369) or control (n = 298) condition. Intervention families participated in a 7-week family skills training program designed to deter alcohol use. Each meeting included separate, concurrent sessions for parents and children, followed by a joint parent-child session during which the families practiced the skills they learned in their separate sessions. Control families were mailed leaflets regarding early adolescent development, stress management, and exercise. All families completed in-home pretest, posttest, and long-term follow-up interviews during which parent-report and self-report data regarding conduct problems, low self-control, deviance-prone peer affiliations, parenting, and youth protective processes were gathered. Results Intent-to-treat analyses indicated that prevention-group youth were less involved than control-group youth in conduct problems across time. As hypothesized, prevention effects were stronger for youth at greater risk of developing conduct problems. Intervention targeted parenting and youth factors partially accounted for intervention effects among high risk youth. Conclusions Although the Strong African American Families program was designed to deter underage drinking, it is also effective in preventing the development of conduct problems. PMID:18848676

  16. COYOTE : a finite element computer program for nonlinear heat conduction problems. Part I, theoretical background.

    SciTech Connect

    Glass, Micheal W.; Hogan, Roy E., Jr.; Gartling, David K.

    2010-03-01

    The need for the engineering analysis of systems in which the transport of thermal energy occurs primarily through a conduction process is a common situation. For all but the simplest geometries and boundary conditions, analytic solutions to heat conduction problems are unavailable, thus forcing the analyst to call upon some type of approximate numerical procedure. A wide variety of numerical packages currently exist for such applications, ranging in sophistication from the large, general purpose, commercial codes, such as COMSOL, COSMOSWorks, ABAQUS and TSS to codes written by individuals for specific problem applications. The original purpose for developing the finite element code described here, COYOTE, was to bridge the gap between the complex commercial codes and the more simplistic, individual application programs. COYOTE was designed to treat most of the standard conduction problems of interest with a user-oriented input structure and format that was easily learned and remembered. Because of its architecture, the code has also proved useful for research in numerical algorithms and development of thermal analysis capabilities. This general philosophy has been retained in the current version of the program, COYOTE, Version 5.0, though the capabilities of the code have been significantly expanded. A major change in the code is its availability on parallel computer architectures and the increase in problem complexity and size that this implies. The present document describes the theoretical and numerical background for the COYOTE program. This volume is intended as a background document for the user's manual. Potential users of COYOTE are encouraged to become familiar with the present report and the simple example analyses reported in before using the program. The theoretical and numerical background for the finite element computer program, COYOTE, is presented in detail. COYOTE is designed for the multi-dimensional analysis of nonlinear heat conduction problems

  17. Effects of a conditional cash transfer program on children's behavior problems.

    PubMed

    Ozer, Emily J; Fernald, Lia C H; Manley, James G; Gertler, Paul J

    2009-04-01

    Governments are increasingly using conditional cash transfer programs to reduce the negative effects of poverty on children's development. These programs have demonstrated benefits for children's nutrition and physical development, but the effect of conditional cash transfers on children's behaviors has not been systematically evaluated. The objective of this study was to evaluate the effects of a conditional cash transfer on children's behavior by using a quasi-experimental design. In 1997, the Mexican government initiated a large-scale conditional cash transfer (Oportunidades) in 506 very poor rural communities. Oportunidades provided cash transfers that were contingent on visits to medical practitioners, consumption of nutritional supplementation, and school enrollment. In 2003, an assessment of 4- to 6-year-old children in these households was conducted, and outcomes were compared with children from 152 additional poor rural communities who had been recruited by using rigorous matching procedures. The primary outcome measure for this analysis was maternal report of behavior problems in terms of anxiety/depressive and aggressive/oppositional symptoms. Analyses reported here compared 778 children from beneficiary households who had received 3.5 to 5.0 years of exposure to the program and a comparison group of 263 children who had received no exposure to the program at the time of assessment but whose families later enrolled in the program. Participation in Oportunidades was associated with a 10% decrement in aggressive/oppositional symptoms but was not associated with significant decrements in anxiety/depressive symptoms or total problem behaviors while controlling for covariates. Effects of treatment did not differ by children's gender or ethnicity. Although this large-scale conditional cash transfer program for poor Mexican families did not directly address children's behavior problems, it found evidence of indirect effects on children's behavior. Results

  18. Observations on the linear programming formulation of the single reflector design problem.

    PubMed

    Canavesi, Cristina; Cassarly, William J; Rolland, Jannick P

    2012-02-13

    We implemented the linear programming approach proposed by Oliker and by Wang to solve the single reflector problem for a point source and a far-field target. The algorithm was shown to produce solutions that aim the input rays at the intersections between neighboring reflectors. This feature makes it possible to obtain the same reflector with a low number of rays - of the order of the number of targets - as with a high number of rays, greatly reducing the computation complexity of the problem.

  19. Program for the solution of multipoint boundary value problems of quasilinear differential equations

    NASA Technical Reports Server (NTRS)

    1973-01-01

    Linear equations are solved by a method of superposition of solutions of a sequence of initial value problems. For nonlinear equations and/or boundary conditions, the solution is iterative and in each iteration a problem like the linear case is solved. A simple Taylor series expansion is used for the linearization of both nonlinear equations and nonlinear boundary conditions. The perturbation method of solution is used in preference to quasilinearization because of programming ease, and smaller storage requirements; and experiments indicate that the desired convergence properties exist although no proof or convergence is given.

  20. Solution of radio-electronic circuit design problems by means of logic programming methods

    NASA Astrophysics Data System (ADS)

    Norenkov, I. P.; Fedoruk, V. G.; Chermoshentsev, S. F.

    1989-02-01

    It is shown that circuit-design problems involving the solution of systems of logic equations can be treated by logic programming methods using PROLOG or analogous systems executing a specific search strategy. The adaptation of the system to the problem to be solved is realized not only by the appropriate choice of the representation of the input data in the forms of facts or rules, but also by an appropriate choice of the sequence of the computation of the facts in the data base and conjunctions in the body of the rule.

  1. Multilevel adaptive solution procedure for material nonlinear problems in visual programming environment

    SciTech Connect

    Kim, D.; Ghanem, R.

    1994-12-31

    Multigrid solution technique to solve a material nonlinear problem in a visual programming environment using the finite element method is discussed. The nonlinear equation of equilibrium is linearized to incremental form using Newton-Rapson technique, then multigrid solution technique is used to solve linear equations at each Newton-Rapson step. In the process, adaptive mesh refinement, which is based on the bisection of a pair of triangles, is used to form grid hierarchy for multigrid iteration. The solution process is implemented in a visual programming environment with distributed computing capability, which enables more intuitive understanding of solution process, and more effective use of resources.

  2. Evaluating minority retention programs: problems encountered and lessons learned from the Ohio science and engineering alliance.

    PubMed

    White, Jeffry L; Altschuld, James W; Lee, Yi-Fang

    2008-08-01

    The retention rates for African-Americans, Hispanics, and Native-Americans in science, technology, engineering, and mathematics (STEM) are lower than those of White or Asian college students. In response, the National Science Foundation formed statewide partnerships of universities to develop programs to address this disparity. The deliberations and experiences in evaluating one such partnership are retrospectively reviewed. Problems and issues encountered during conceptualization and implementation are presented. Lessons learned from this endeavor should generalize to similar situations and provide guidance for others new to or interested in evaluating STEM retention programs as well as those evaluating collaborative endeavors.

  3. NASA/Drexel program. [research effort in large-scale technical programs management for application to urban problems

    NASA Technical Reports Server (NTRS)

    1973-01-01

    The results are reported of the NASA/Drexel research effort which was conducted in two separate phases. The initial phase stressed exploration of the problem from the point of view of three primary research areas and the building of a multidisciplinary team. The final phase consisted of a clinical demonstration program in which the research associates consulted with the County Executive of New Castle County, Delaware, to aid in solving actual problems confronting the County Government. The three primary research areas of the initial phase are identified as technology, management science, and behavioral science. Five specific projects which made up the research effort are treated separately. A final section contains the conclusions drawn from total research effort as well as from the specific projects.

  4. NASA/Drexel program. [research effort in large-scale technical programs management for application to urban problems

    NASA Technical Reports Server (NTRS)

    1973-01-01

    The results are reported of the NASA/Drexel research effort which was conducted in two separate phases. The initial phase stressed exploration of the problem from the point of view of three primary research areas and the building of a multidisciplinary team. The final phase consisted of a clinical demonstration program in which the research associates consulted with the County Executive of New Castle County, Delaware, to aid in solving actual problems confronting the County Government. The three primary research areas of the initial phase are identified as technology, management science, and behavioral science. Five specific projects which made up the research effort are treated separately. A final section contains the conclusions drawn from total research effort as well as from the specific projects.

  5. Geometrical method of decoupling

    NASA Astrophysics Data System (ADS)

    Baumgarten, C.

    2012-12-01

    The computation of tunes and matched beam distributions are essential steps in the analysis of circular accelerators. If certain symmetries—like midplane symmetry—are present, then it is possible to treat the betatron motion in the horizontal, the vertical plane, and (under certain circumstances) the longitudinal motion separately using the well-known Courant-Snyder theory, or to apply transformations that have been described previously as, for instance, the method of Teng and Edwards. In a preceding paper, it has been shown that this method requires a modification for the treatment of isochronous cyclotrons with non-negligible space charge forces. Unfortunately, the modification was numerically not as stable as desired and it was still unclear, if the extension would work for all conceivable cases. Hence, a systematic derivation of a more general treatment seemed advisable. In a second paper, the author suggested the use of real Dirac matrices as basic tools for coupled linear optics and gave a straightforward recipe to decouple positive definite Hamiltonians with imaginary eigenvalues. In this article this method is generalized and simplified in order to formulate a straightforward method to decouple Hamiltonian matrices with eigenvalues on the real and the imaginary axis. The decoupling of symplectic matrices which are exponentials of such Hamiltonian matrices can be deduced from this in a few steps. It is shown that this algebraic decoupling is closely related to a geometric “decoupling” by the orthogonalization of the vectors E→, B→, and P→, which were introduced with the so-called “electromechanical equivalence.” A mathematical analysis of the problem can be traced down to the task of finding a structure-preserving block diagonalization of symplectic or Hamiltonian matrices. Structure preservation means in this context that the (sequence of) transformations must be symplectic and hence canonical. When used iteratively, the decoupling

  6. An integer programming approach to a real-world recyclable waste collection problem in Argentina.

    PubMed

    Braier, Gustavo; Durán, Guillermo; Marenco, Javier; Wesner, Francisco

    2017-05-01

    This article reports on the use of mathematical programming techniques to optimise the routes of a recyclable waste collection system servicing Morón, a large municipality outside Buenos Aires, Argentina. The truck routing problem posed by the system is a particular case of the generalised directed open rural postman problem. An integer programming model is developed with a solving procedure built around a subtour-merging algorithm and the addition of subtour elimination constraints. The route solutions generated by the proposed methodology perform significantly better than the previously used, manually designed routes, the main improvement being that coverage of blocks within the municipality with the model solutions is 100% by construction, whereas with the manual routes as much as 16% of the blocks went unserviced. The model-generated routes were adopted by the municipality in 2014 and the national government is planning to introduce the methodology elsewhere in the country.

  7. Swimming training program for children with cerebral palsy: body perceptions, problem behaviour, and competence.

    PubMed

    Ozer, Dilara; Nalbant, Sibel; Aktop, Abdurrahman; Duman, Ozgür; Keleş, Inan; Toraman, N Füsun

    2007-12-01

    The aim of this study was to assess the effects of a 14-week swimming training program on the competence, problem behaviour, and body awareness in 13 children with cerebral palsy aged 5 to 10 years, compared with 10 subjects in a comparison group. Both of the groups continued a traditional rehabilitation program. The outcome measures were Child Behaviour Check List (CBCL) and Body Awareness. The parent forms were evaluated before and after training and also at 6 months followup. Teacher forms and body awareness were evaluated before and after training. The results showed that swimming training produced significant gain on body awareness in the Swimming Group, whereas no significant group differences were evident in competence and problem behaviours on parent or teacher forms of the CBCL.

  8. Creativity and Motivation for Geometric Tasks Designing in Education

    ERIC Educational Resources Information Center

    Rumanová, Lucia; Smiešková, Edita

    2015-01-01

    In this paper we focus on creativity needed for geometric tasks designing, visualization of geometric problems and use of ICT. We present some examples of various problems related to tessellations. Altogether 21 students--pre-service teachers participated in our activity within a geometry course at CPU in Nitra, Slovakia. Our attempt was to…

  9. Mixed-integer programming methods for transportation and power generation problems

    NASA Astrophysics Data System (ADS)

    Damci Kurt, Pelin

    This dissertation conducts theoretical and computational research to solve challenging problems in application areas such as supply chain and power systems. The first part of the dissertation studies a transportation problem with market choice (TPMC) which is a variant of the classical transportation problem in which suppliers with limited capacities have a choice of which demands (markets) to satisfy. We show that TPMC is strongly NP-complete. We consider a version of the problem with a service level constraint on the maximum number of markets that can be rejected and show that if the original problem is polynomial, its cardinality-constrained version is also polynomial. We propose valid inequalities for mixed-integer cover and knapsack sets with variable upper bound constraints, which appear as substructures of TPMC and use them in a branch-and-cut algorithm to solve this problem. The second part of this dissertation studies a unit commitment (UC) problem in which the goal is to minimize the operational cost of power generators over a time period subject to physical constraints while satisfying demand. We provide several exponential classes of multi-period ramping and multi-period variable upper bound inequalities. We prove the strength of these inequalities and describe polynomial-time separation algorithms. Computational results show the effectiveness of the proposed inequalities when used as cuts in a branch-and-cut algorithm to solve the UC problem. The last part of this dissertation investigates the effects of uncertain wind power on the UC problem. A two-stage robust model and a three-stage stochastic program are compared.

  10. On some geometric problems from general relativity

    NASA Astrophysics Data System (ADS)

    Tsui, Mao-Pei

    2001-06-01

    In part I of this thesis, we first study spacelike constant mean curvature (SCMC) hypersurfaces in Minkowski space. Given a Lipschitz continuous function f on Sn-1, two families of hyperboloids are used as barriers to construct constant mean curvature hypersurfaces which satisfy the asymptotic boundary values defined by Lu(q) :=limr-->∞ u(rq)- r=f( q),where q∈Sn- 1. Moreover, we use the barriers to estimate the gradient of the u. This enables us to show that the SCMC hypersurfaces constructed are quasi-conformal to Hyperbolic space. In part II of the thesis, we study the Penrose inequality in asymptotically hyperbolic manifolds. In particular, we consider a class of manifolds which admit a quasi- spherical foliation. We observe that a Hawking mass like quantity is increasing and bounded along the foliation. This establishes the Penrose inequality in the case of certain quasi-spherical manifolds. In part III of this thesis, we will study the Penrose inequality in asymptotically flat manifold without the restriction of nonnegative scalar curvature. We will make use of the manifold constructed by Schoen and Yau in their proof of the Positive Mass Theorem. We can think of their manifold as a deformation of the original manifold with the property that the apparent horizons evolve into minimal surfaces in the cylindrical end. One nice property is that the scalar curvature plus the divergence of a vector field is nonnegative. We will make use of this vector field to deform minimal surfaces to the spacelike infinity. We also prove the monotonicity of a Hawking mass like quantity along the flow. This can be used to study the Penrose inequality.

  11. Geometrical aspects on the dark matter problem

    NASA Astrophysics Data System (ADS)

    Capistrano, A. J. S.; Cabral, L. A.

    2014-09-01

    In the present paper we apply Nash's theory of perturbative geometry to the study of dark matter gravity in a higher-dimensional space-time. It is shown that the dark matter gravitational perturbations at local scale can be explained by the extrinsic curvature of the standard cosmology. In order to test our model, we use a spherically symmetric metric embedded in a five-dimensional bulk. As a result, considering a sample of 10 low surface brightness and 6 high surface brightness galaxies, we find a very good agreement with the observed rotation curves of smooth hybrid alpha-HI measurements.

  12. The solution of the optimization problem of small energy complexes using linear programming methods

    NASA Astrophysics Data System (ADS)

    Ivanin, O. A.; Director, L. B.

    2016-11-01

    Linear programming methods were used for solving the optimization problem of schemes and operation modes of distributed generation energy complexes. Applicability conditions of simplex method, applied to energy complexes, including installations of renewable energy (solar, wind), diesel-generators and energy storage, considered. The analysis of decomposition algorithms for various schemes of energy complexes was made. The results of optimization calculations for energy complexes, operated autonomously and as a part of distribution grid, are presented.

  13. Descriptive Geometry and Geometric Modeling.

    ERIC Educational Resources Information Center

    Adams, J. Alan

    1988-01-01

    Describes experiences for engineering students to develop spatial awareness and reasoning capability. Describes geometric modeling, basic geometric concepts, operations, surface modeling, and conclusions. (YP)

  14. Lagrange Programming Neural Network for Nondifferentiable Optimization Problems in Sparse Approximation.

    PubMed

    Feng, Ruibin; Leung, Chi-Sing; Constantinides, Anthony G; Zeng, Wen-Jun

    2016-07-27

    The major limitation of the Lagrange programming neural network (LPNN) approach is that the objective function and the constraints should be twice differentiable. Since sparse approximation involves nondifferentiable functions, the original LPNN approach is not suitable for recovering sparse signals. This paper proposes a new formulation of the LPNN approach based on the concept of the locally competitive algorithm (LCA). Unlike the classical LCA approach which is able to solve unconstrained optimization problems only, the proposed LPNN approach is able to solve the constrained optimization problems. Two problems in sparse approximation are considered. They are basis pursuit (BP) and constrained BP denoise (CBPDN). We propose two LPNN models, namely, BP-LPNN and CBPDN-LPNN, to solve these two problems. For these two models, we show that the equilibrium points of the models are the optimal solutions of the two problems, and that the optimal solutions of the two problems are the equilibrium points of the two models. Besides, the equilibrium points are stable. Simulations are carried out to verify the effectiveness of these two LPNN models.

  15. The Effect of Hints and Model Answers in a Student-Controlled Problem-Solving Program for Secondary Physics Education

    ERIC Educational Resources Information Center

    Pol, Henk J.; Harskamp, Egbert G.; Suhre, Cor J. M.; Goedhart, Martin J.

    2008-01-01

    Many students experience difficulties in solving applied physics problems. Most programs that want students to improve problem-solving skills are concerned with the development of content knowledge. Physhint is an example of a student-controlled computer program that supports students in developing their strategic knowledge in combination with…

  16. Effectiveness of the Triple P Positive Parenting Program on Behavioral Problems in Children: A Meta-Analysis

    ERIC Educational Resources Information Center

    de Graaf, Ireen; Speetjens, Paula; Smit, Filip; de Wolff, Marianne; Tavecchio, Louis

    2008-01-01

    The Triple P Positive Parenting Program is a multilevel parenting program to prevent and offer treatment for severe behavioral, emotional, and developmental problems in children. The aim of this meta-analysis is to assess the effectiveness of Triple P Level 4 interventions in the management of behavioral problems in children by pooling the…

  17. The Effect of Hints and Model Answers in a Student-Controlled Problem-Solving Program for Secondary Physics Education

    ERIC Educational Resources Information Center

    Pol, Henk J.; Harskamp, Egbert G.; Suhre, Cor J. M.; Goedhart, Martin J.

    2008-01-01

    Many students experience difficulties in solving applied physics problems. Most programs that want students to improve problem-solving skills are concerned with the development of content knowledge. Physhint is an example of a student-controlled computer program that supports students in developing their strategic knowledge in combination with…

  18. Preventing Alcohol Problems Through a Student Assistance Program: A Manual for Implementation Based on the Westchester County, New York Model.

    ERIC Educational Resources Information Center

    Snyder, Gerald; And Others

    This manual was designed to provide school administrators, counselors, teachers, parent groups, and community members with a comprehensive school-based program for preventing alcohol problems. Detection and intervention before the onset of alcohol and drug problems is stressed. Modeled after employees' assistance programs used to identify and aid…

  19. A Toolbox for Geometric Grain Boundary Characterization

    NASA Astrophysics Data System (ADS)

    Glowinski, Krzysztof; Morawiec, Adam

    Properties of polycrystalline materials are affected by grain boundary networks. The most basic aspect of boundary analysis is boundary geometry. This paper describes a package of computer programs for geometric boundary characterization based on macroscopic boundary parameters. The program allows for determination whether a boundary can be classified as near-tilt, -twist, -symmetric et cetera. Since calculations on experimental, i.e., error affected data are assumed, the program also provides distances to the nearest geometrically characteristic boundaries. The software has a number of other functions helpful in grain boundary analysis. One of them is the determination of planes of all characteristic boundaries for a given misorientation. The resulting diagrams of geometrically characteristic boundaries can be linked to experimentally determined grain boundary distributions. In computations, all symmetrically equivalent representations of boundaries are taken into account. Cubic and hexagonal holohedral crystal symmetries are allowed.

  20. A simulation based research on chance constrained programming in robust facility location problem

    NASA Astrophysics Data System (ADS)

    Kaijun, Leng; Wen, Shi; Guanghua, Song; Lin, Pan

    2017-03-01

    Since facility location decisions problem include long-term character and potential parameter variations, it is important to consider uncertainty in its modeling. This paper examines robust facility location problem considering supply uncertainty, in which we assume the supply of the facility in the actual operation is not equal to the supply initially established, the supply is subject to random fluctuation. The chance constraints are introduced when formulating the robust facility location model to make sure the system operate properly with a certain probability while the supply fluctuates. The chance constraints are approximated safely by using Hoeffding's inequality and the problem is transformed to a general deterministic linear programming. Furthermore, how the facility location cost change with confidence level is investigated through a numerical example. The sensitivity analysis is conducted for important parameters of the model and we get the main factors that affect the facility location cost.

  1. Empirical support for a treatment program for families of young children with externalizing problems.

    PubMed

    Feinfield, Kristin Abbott; Baker, Bruce L

    2004-03-01

    We evaluated the efficacy of a manualized multimodal treatment program for young externalizing children. Families were assigned randomly to an immediate 12-week parent and child treatment condition (n = 24) or to a delayed-treatment condition (n = 23). Parents had high attendance, high satisfaction with treatment, and increased knowledge of behavior management principles. Relative to the waitlist condition, treatment parents reported statistically and clinically significant reductions in child behavior problems, improved parenting practices (i.e., increased consistency, decreased power assertive techniques), an increased sense of efficacy, and reduced parenting stress. There was a trend toward parents improving their attitudes toward their children. In considering the process of change, we found evidence that improved parenting practices mediated reductions in child behavior problems and that child improvements mediated changes in parent attitudes and stress. Five months following treatment, teachers reported significant improvements in child behaviors, whereas parents reported that reductions in child behavior problems and parenting stress were maintained.

  2. Solving seismological problems using SGRAPH program: I-source parameters and hypocentral location

    SciTech Connect

    Abdelwahed, Mohamed F.

    2012-09-26

    SGRAPH program is considered one of the seismological programs that maintain seismic data. SGRAPH is considered unique for being able to read a wide range of data formats and manipulate complementary tools in different seismological subjects in a stand-alone Windows-based application. SGRAPH efficiently performs the basic waveform analysis and solves advanced seismological problems. The graphical user interface (GUI) utilities and the Windows facilities such as, dialog boxes, menus, and toolbars simplified the user interaction with data. SGRAPH supported the common data formats like, SAC, SEED, GSE, ASCII, and Nanometrics Y-format, and others. It provides the facilities to solve many seismological problems with the built-in inversion and modeling tools. In this paper, I discuss some of the inversion tools built-in SGRAPH related to source parameters and hypocentral location estimation. Firstly, a description of the SGRAPH program is given discussing some of its features. Secondly, the inversion tools are applied to some selected events of the Dahshour earthquakes as an example of estimating the spectral and source parameters of local earthquakes. In addition, the hypocentral location of these events are estimated using the Hypoinverse 2000 program operated by SGRAPH.

  3. Applying Genetic Programming with Substructure Discovery to a Traffic Signal Control Problem

    NASA Astrophysics Data System (ADS)

    Kumagai, Juncichi; Ojima, Yasuo; Takashige, Souichi; Kameya, Yoshitaka; Sato, Taisuke

    Nowadays the increase of traffic causes numerous serious traffic jams, and traffic signals are desired to work adaptively for dynamic traffic flows. In this paper, we view such a problem of traffic signal control as a multi-agent problem where each signal has a controlling agent, and aim to make the agents work cooperatively depending on the traffic status. To build such an agent program automatically, we introduce genetic programming (GP), an evolutionary method for program construction. In GP, it is known as important to encapsulate the substructures of a program which leads to higher fitness to the environment, and we propose a new encapsulation method using an efficient technique for discovering frequent substructures, which has been recently proposed in the data mining field. We also conducted a simulation with a real traffic data, and confirmed that GP with our encapsulation method outperforms the normal GP. It is also observed that the best individual has a communication part that chooses an appropriate communication area and adapts to the traffic status.

  4. The implementation of problem-based learning in health service management training programs.

    PubMed

    Stankunas, Mindaugas; Czabanowska, Katarzyna; Avery, Mark; Kalediene, Ramune; Babich, Suzanne Marie

    2016-10-03

    Purpose Strengthening management capacity within the health care sector could have a significant impact on population health. However, many training programs in this area are still delivered using a classic lecture-based approach. The purpose of this paper is to evaluate and better understand the feasibility of using a problem-based learning (PBL) approach in health services management training programs. Design/methodology/approach A PBL teaching approach (based on the Maastricht University model) was tested with second-year postgraduate students from the Master in Public Health Management program at the Lithuanian University of Health Sciences. Students' opinions about PBL were investigated using a questionnaire with eight open-ended questions. Thematic content analysis was chosen to reflect the search for patterns across the data. Findings Respondents stated that the main advantage of PBL was that it was a more interesting and effective way of learning: "It is easier to remember, when you study by yourself and discuss with all peers". In addition, it was mentioned that PBL initiated a rapid exchange of ideas and sharing of personal experience. Students stressed that PBL was a good tool for developing other skills as well, such as "public speaking, communication, logic thinking". All students recommended delivering all other courses in the health services management program using PBL methodologies. Originality/value Findings from our study suggest that PBL may be an effective approach to teaching health services management. Potential problems in implementation are noted.

  5. College and university environmental programs as a policy problem (part 2): strategies for improvement.

    PubMed

    Clark, Susan G; Rutherford, Murray B; Auer, Matthew R; Cherney, David N; Wallace, Richard L; Mattson, David J; Clark, Douglas A; Foote, Lee; Krogman, Naomi; Wilshusen, Peter; Steelman, Toddi

    2011-05-01

    Environmental studies and environmental sciences programs in American and Canadian colleges and universities seek to ameliorate environmental problems through empirical enquiry and analytic judgment. In a companion article (Part 1) we describe the environmental program movement (EPM) and discuss factors that have hindered its performance. Here, we complete our analysis by proposing strategies for improvement. We recommend that environmental programs re-organize around three principles. First, adopt as an overriding goal the concept of human dignity-defined as freedom and social justice in healthy, sustainable environments. This clear higher-order goal captures the human and environmental aspirations of the EPM and would provide a more coherent direction for the efforts of diverse participants. Second, employ an explicit, genuinely interdisciplinary analytical framework that facilitates the use of multiple methods to investigate and address environmental and social problems in context. Third, develop educational programs and applied experiences that provide students with the technical knowledge, powers of observation, critical thinking skills and management acumen required for them to become effective professionals and leaders. Organizing around these three principles would build unity in the EPM while at the same time capitalizing on the strengths of the many disciplines and diverse local conditions involved.

  6. College and university environmental programs as a policy problem (Part 2): Strategies for improvement

    USGS Publications Warehouse

    Clark, S.G.; Rutherford, M.B.; Auer, M.R.; Cherney, D.N.; Wallace, R.L.; Mattson, D.J.; Clark, D.A.; Foote, L.; Krogman, N.; Wilshusen, P.; Steelman, T.

    2011-01-01

    Environmental studies and environmental sciences programs in American and Canadian colleges and universities seek to ameliorate environmental problems through empirical enquiry and analytic judgment. In a companion article (Part 1) we describe the environmental program movement (EPM) and discuss factors that have hindered its performance. Here, we complete our analysis by proposing strategies for improvement. We recommend that environmental programs re-organize around three principles. First, adopt as an overriding goal the concept of human dignity-defined as freedom and social justice in healthy, sustainable environments. This clear higher-order goal captures the human and environmental aspirations of the EPM and would provide a more coherent direction for the efforts of diverse participants. Second, employ an explicit, genuinely interdisciplinary analytical framework that facilitates the use of multiple methods to investigate and address environmental and social problems in context. Third, develop educational programs and applied experiences that provide students with the technical knowledge, powers of observation, critical thinking skills and management acumen required for them to become effective professionals and leaders. Organizing around these three principles would build unity in the EPM while at the same time capitalizing on the strengths of the many disciplines and diverse local conditions involved. ?? 2011 Springer Science+Business Media, LLC.

  7. College and University Environmental Programs as a Policy Problem (Part 2): Strategies for Improvement

    NASA Astrophysics Data System (ADS)

    Clark, Susan G.; Rutherford, Murray B.; Auer, Matthew R.; Cherney, David N.; Wallace, Richard L.; Mattson, David J.; Clark, Douglas A.; Foote, Lee; Krogman, Naomi; Wilshusen, Peter; Steelman, Toddi

    2011-05-01

    Environmental studies and environmental sciences programs in American and Canadian colleges and universities seek to ameliorate environmental problems through empirical enquiry and analytic judgment. In a companion article (Part 1) we describe the environmental program movement (EPM) and discuss factors that have hindered its performance. Here, we complete our analysis by proposing strategies for improvement. We recommend that environmental programs re-organize around three principles. First, adopt as an overriding goal the concept of human dignity—defined as freedom and social justice in healthy, sustainable environments. This clear higher-order goal captures the human and environmental aspirations of the EPM and would provide a more coherent direction for the efforts of diverse participants. Second, employ an explicit, genuinely interdisciplinary analytical framework that facilitates the use of multiple methods to investigate and address environmental and social problems in context. Third, develop educational programs and applied experiences that provide students with the technical knowledge, powers of observation, critical thinking skills and management acumen required for them to become effective professionals and leaders. Organizing around these three principles would build unity in the EPM while at the same time capitalizing on the strengths of the many disciplines and diverse local conditions involved.

  8. Solving seismological problems using SGRAPH program: I-source parameters and hypocentral location

    NASA Astrophysics Data System (ADS)

    Abdelwahed, Mohamed F.

    2012-09-01

    SGRAPH program [1] is considered one of the seismological programs that maintain seismic data. SGRAPH is considered unique for being able to read a wide range of data formats and manipulate complementary tools in different seismological subjects in a stand-alone Windows-based application. SGRAPH efficiently performs the basic waveform analysis and solves advanced seismological problems. The graphical user interface (GUI) utilities and the Windows facilities such as, dialog boxes, menus, and toolbars simplified the user interaction with data. SGRAPH supported the common data formats like, SAC, SEED, GSE, ASCII, and Nanometrics Y-format, and others. It provides the facilities to solve many seismological problems with the built-in inversion and modeling tools. In this paper, I discuss some of the inversion tools built-in SGRAPH related to source parameters and hypocentral location estimation. Firstly, a description of the SGRAPH program is given discussing some of its features. Secondly, the inversion tools are applied to some selected events of the Dahshour earthquakes as an example of estimating the spectral and source parameters of local earthquakes. In addition, the hypocentral location of these events are estimated using the Hypoinverse 2000 program [2] operated by SGRAPH.

  9. Assessment of the NASA Space Shuttle Program's Problem Reporting and Corrective Action System

    NASA Technical Reports Server (NTRS)

    Korsmeryer, D. J.; Schreiner, J. A.; Norvig, Peter (Technical Monitor)

    2001-01-01

    This paper documents the general findings and recommendations of the Design for Safety Programs Study of the Space Shuttle Programs (SSP) Problem Reporting and Corrective Action (PRACA) System. The goals of this Study were: to evaluate and quantify the technical aspects of the SSP's PRACA systems, and to recommend enhancements addressing specific deficiencies in preparation for future system upgrades. The Study determined that the extant SSP PRACA systems accomplished a project level support capability through the use of a large pool of domain experts and a variety of distributed formal and informal database systems. This operational model is vulnerable to staff turnover and loss of the vast corporate knowledge that is not currently being captured by the PRACA system. A need for a Program-level PRACA system providing improved insight, unification, knowledge capture, and collaborative tools was defined in this study.

  10. An optimal approach for the critical node problem using semidefinite programming

    NASA Astrophysics Data System (ADS)

    Jiang, Cheng; Liu, Zhonghua; Wang, Juyun; Yu, Hua; Guo, Xiaoling

    2017-04-01

    Detecting critical nodes in complex networks (CNP) has great theoretical and practical significance in many disciplines. The existing formulations for CNP are mostly, as we know, based on the integer linear programming model. However, we observed that, these formulations only considered the sizes but neglected the cohesiveness properties of the connected components in the induced network. To solve the problem and improve the performance of CNP solutions, we construct a novel nonconvex quadratically constrained quadratic programming (QCQP) model and derive its approximation solutions via semidefinite programming (SDP) technique and heuristic algorithms. Various types of synthesized and real-world networks, in the context of different connectivity patterns, are used to validate and verify the effectiveness of the proposed model and algorithm. Experimental results show that our method improved the state of the art of the CNP.

  11. Assessment of the NASA Space Shuttle Program's problem reporting and corrective action system

    NASA Astrophysics Data System (ADS)

    Korsmeyer, David J.; Schreiner, John A.

    2001-07-01

    This paper documents the general findings and recommendations of the Design for Safety Program's Study of the Space Shuttle Program's (SSP) Problem Reporting and Corrective Action (PRACA) System. The goals of this Study were; to evaluate and quantify the technical aspects of the SSP's PRACA systems, and to recommend enhancements addressing specific deficiencies in preparation for future system upgrades. The Study determined that the extant SSP PRACA systems accomplished a project level support capability through the use of a large pool of domain experts and a variety of distributed formal and informal database systems. This operational model is vulnerable to staff turnover and loss of the vast corporate knowledge that is not currently being captured by the PRACA system. A need for a Program-level PRACA system providing improved insight, unification, knowledge capture, and collaborative tools was defined is this study.

  12. A hybrid computer program for rapidly solving flowing or static chemical kinetic problems involving many chemical species

    NASA Technical Reports Server (NTRS)

    Mclain, A. G.; Rao, C. S. R.

    1976-01-01

    A hybrid chemical kinetic computer program was assembled which provides a rapid solution to problems involving flowing or static, chemically reacting, gas mixtures. The computer program uses existing subroutines for problem setup, initialization, and preliminary calculations and incorporates a stiff ordinary differential equation solution technique. A number of check cases were recomputed with the hybrid program and the results were almost identical to those previously obtained. The computational time saving was demonstrated with a propane-oxygen-argon shock tube combustion problem involving 31 chemical species and 64 reactions. Information is presented to enable potential users to prepare an input data deck for the calculation of a problem.

  13. Geometric systematic prostate biopsy.

    PubMed

    Chang, Doyoung; Chong, Xue; Kim, Chunwoo; Jun, Changhan; Petrisor, Doru; Han, Misop; Stoianovici, Dan

    2017-04-01

    The common sextant prostate biopsy schema lacks a three-dimensional (3D) geometric definition. The study objective was to determine the influence of the geometric distribution of the cores on the detection probability of prostate cancer (PCa). The detection probability of significant (>0.5 cm(3)) and insignificant (<0.2 cm(3)) tumors was quantified based on a novel 3D capsule model of the biopsy sample. The geometric distribution of the cores was optimized to maximize the probability of detecting significant cancer for various prostate sizes (20-100cm(3)), number of biopsy cores (6-40 cores) and biopsy core lengths (14-40 mm) for transrectal and transperineal biopsies. The detection of significant cancer can be improved by geometric optimization. With the current sextant biopsy, up to 20% of tumors may be missed at biopsy in a 20 cm(3) prostate due to the schema. Higher number and longer biopsy cores are required to sample with an equal detection probability in larger prostates. Higher number of cores increases both significant and insignificant tumor detection probability, but predominantly increases the detection of insignificant tumors. The study demonstrates mathematically that the geometric biopsy schema plays an important clinical role, and that increasing the number of biopsy cores is not necessarily helpful.

  14. Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming.

    PubMed

    Wu, Z; Zhang, Y

    2008-01-01

    The double digestion problem for DNA restriction mapping has been proved to be NP-complete and intractable if the numbers of the DNA fragments become large. Several approaches to the problem have been tested and proved to be effective only for small problems. In this paper, we formulate the problem as a mixed-integer linear program (MIP) by following (Waterman, 1995) in a slightly different form. With this formulation and using state-of-the-art integer programming techniques, we can solve randomly generated problems whose search space sizes are many-magnitude larger than previously reported testing sizes.

  15. A Maximin Approach for the Bi-criteria 0-1 Random Fuzzy Programming Problem Based on the Necessity Measure

    SciTech Connect

    Hasuike, Takashi; Ishii, Hiroaki; Katagiri, Hideki

    2009-10-08

    This paper considers a bi-criteria general 0-1 random fuzzy programming problem based on the degree of necessity which include some previous 0-1 stochastic and fuzzy programming problems. The proposal problem is not well-defined due to including randomness and fuzziness. Therefore, by introducing chance constraint and fuzzy goals for objectives, and considering the maximization of the aspiration level for total profit and the degree of necessity that the objective function's value satisfies the fuzzy goal, the main problem is transformed into a deterministic equivalent problem. Furthermore, by using the assumption that each random variable is distributed according to a normal distribution, the problem is equivalently transformed into a basic 0-1 programming problem, and the efficient strict solution method to find an optimal solution is constructed.

  16. UPDATED USER-FRIENDLY COMPUTER PROGRAMS FOR SOLVING SAMPLING AND STATISTICAL PROBLEMS (FOR MICROCOMPUTERS) (DATE OF COVERAGE: 1993). - SOFTWARE.

    EPA Science Inventory

    The product contains user-friendly computer programs for solving sampling and related statistical problems. All have been updated as well and more programs have been added. Specific, detailed written instructions and examples built into the programs are provided so that the user ...

  17. Preventing Internalizing Problems in 6–8 Year Old Children: A Universal School-Based Program

    PubMed Central

    Pophillat, Eugenie; Rooney, Rosanna M.; Nesa, Monique; Davis, Melissa C.; Baughman, Natalie; Hassan, Sharinaz; Kane, Robert T.

    2016-01-01

    The Aussie Optimism Program: Feelings and Friends (AOP-FF) is a 10 week, universal mental health promotion program based on social/emotional and cognitive and behavioral strategies. The aim of the current study was to evaluate the efficacy of a universal Cognitive Behavioral Therapy based program in preventing and reducing internalizing problems in 6–8 year olds (Years 1–3 in Australia). Year 1–3 students from a low SES primary school (N = 206) were randomly assigned in classes to either an intervention or a control group and assessed at baseline and post-test. Results showed a significant (p = 0.009) and small to moderate (partial eta-squared = 0.034) pre-post decrease in parent-reported anxiety symptoms for the intervention group, in conjunction with a non-significant (p = 0.708) and negligible (partial eta-squared = 0.001) pre-post increase for the control group. A larger randomized controlled trial assessing longer term effects is needed. In addition the program needs to be simplified for year 1–2 students with a separate more developmentally appropriate program for year 3 students. PMID:28018267

  18. Inflation from geometrical tachyons

    SciTech Connect

    Thomas, Steven; Ward, John

    2005-10-15

    We propose an alternative formulation of tachyon inflation using the geometrical tachyon arising from the time dependent motion of a BPS D3-brane in the background geometry due to k parallel NS5-branes arranged around a ring of radius R. Because of the fact that the mass of this geometrical tachyon field is {radical}(2/k) times smaller than the corresponding open-string tachyon mass, we find that the slow-roll conditions for inflation and the number of e-foldings can be satisfied in a manner that is consistent with an effective 4-dimensional model and with a perturbative string coupling. We also show that the metric perturbations produced at the end of inflation can be sufficiently small and do not lead to the inconsistencies that plague the open-string tachyon models. Finally we argue for the existence of a minimum of the geometrical tachyon potential which could give rise to a traditional reheating mechanism.

  19. Geometrical optical illusionists.

    PubMed

    Wade, Nicholas J

    2014-01-01

    Geometrical optical illusions were given this title by Oppel in 1855. Variants on such small distortions of visual space were illustrated thereafter, many of which bear the names of those who first described them. Some original forms of the geometrical optical illusions are shown together with 'perceptual portraits' of those who described them. These include: Roget, Chevreul, Fick, Zöllner, Poggendorff, Hering, Kundt, Delboeuf Mach, Helmholtz, Hermann, von Bezold, Müller-Lyer, Lipps, Thiéry, Wundt, Münsterberg, Ebbinghaus, Titchener, Ponzo, Luckiesh, Sander, Ehrenstein, Gregory, Heard, White, Shepard, and. Lingelbach. The illusions are grouped under the headings of orientation, size, the combination of size and orientation, and contrast. Early theories of illusions, before geometrical optical illusions were so named, are mentioned briefly.

  20. Optimization approach for the evaluation of geometric errors in computer-aided inspection

    NASA Astrophysics Data System (ADS)

    Jiang, Guohua

    Geometric dimensioning and tolerancing (GD&T) is a set of standards that defines a clear and concise mathematical language for communicating product definition. A design based on GD&T clearly reflects the functional requirements of a product, provides unique definition of a drawing among design, manufacturing and inspection engineers and conveys the design intention clearly without any ambiguity. The latest version of this standard is ASME Y14.5M-1994. Traditional methods for the inspection of geometric tolerances have been mostly with the use of functional gages and Coordinate Measuring Machines (CMM). Function gages are very expensive and only provide a yes/no result. CMMs have embedded algorithms to verify geometric tolerances according to the design specification. However, it has been shown that these embedded algorithms neither provide accurate evaluation of geometric errors nor do they conform to the ASME standards. High accuracy requirements in the manufacture of precision parts with complex geometries have made accurate evaluation and verification of geometric tolerances very critical. Over the years, researchers have developed many algorithms to evaluate some of the geometric errors. However, there is still a significant lack of evaluation procedures for complex geometric errors. In this dissertation, mathematical models have been built for the evaluation of a certain set of complex geometric characteristics. The concentration has been on the evaluation of 3D feature relating positional error, cylindricity error and straightness error of spatial line. Research has been carried out to understand the mathematical natures of these problems. Based on the research results, efficient solution methodologies have been developed according to the ASME standards. A robust and efficient procedure has also been developed for the identification of candidate datum sets. The proposed procedures have been implemented using the C++ or C programming language. Experimental

  1. Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems.

    PubMed

    Takabe, Satoshi; Hukushima, Koji

    2016-05-01

    Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α-uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α=2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c=e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c=1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α≥3, minimum vertex covers on α-uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c=e/(α-1) where the replica symmetry is broken.

  2. Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems

    NASA Astrophysics Data System (ADS)

    Takabe, Satoshi; Hukushima, Koji

    2016-05-01

    Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α -uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α =2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c =e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c =1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α ≥3 , minimum vertex covers on α -uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c =e /(α -1 ) where the replica symmetry is broken.

  3. A Fuzzy Goal Programming for a Multi-Depot Distribution Problem

    NASA Astrophysics Data System (ADS)

    Nunkaew, Wuttinan; Phruksaphanrat, Busaba

    2010-10-01

    A fuzzy goal programming model for solving a Multi-Depot Distribution Problem (MDDP) is proposed in this research. This effective proposed model is applied for solving in the first step of Assignment First-Routing Second (AFRS) approach. Practically, a basic transportation model is firstly chosen to solve this kind of problem in the assignment step. After that the Vehicle Routing Problem (VRP) model is used to compute the delivery cost in the routing step. However, in the basic transportation model, only depot to customer relationship is concerned. In addition, the consideration of customer to customer relationship should also be considered since this relationship exists in the routing step. Both considerations of relationships are solved using Preemptive Fuzzy Goal Programming (P-FGP). The first fuzzy goal is set by a total transportation cost and the second fuzzy goal is set by a satisfactory level of the overall independence value. A case study is used for describing the effectiveness of the proposed model. Results from the proposed model are compared with the basic transportation model that has previously been used in this company. The proposed model can reduce the actual delivery cost in the routing step owing to the better result in the assignment step. Defining fuzzy goals by membership functions are more realistic than crisps. Furthermore, flexibility to adjust goals and an acceptable satisfactory level for decision maker can also be increased and the optimal solution can be obtained.

  4. [Operations research in group feeding programs: techniques for the identification and analysis of management problems].

    PubMed

    Montealegre, J; Fuentes, F; Mata, A; Cuevas, R

    1989-09-01

    The operations of the group feeding programs (PAG--"Programas de Alimentación a Grupos"--) can be viewed as a sequence of decisions and activities that according to their direction, order, relationship and dependency, will influence the quality and quantity of the service's delivery. While searching for the essential characteristics of a PAG: components, relationship, variables, pertinent parameters, restrictions, underlying criteria and objective functions, operations research can be useful for its analysis, the identification of its management problems, and to develop, evaluate and finally, implement solutions. Various operation research techniques are presented in this article, which are geared towards responding to those knowledge needs of the national technicians and program managers, in order to give a solid foundation to solutions for the management problems identified in a PAG. Failures of different quantitative models had been due, mainly, to the tendency to formulate models or investigate problems without users being prepared to implement the solutions. The techniques presented herein take into consideration the interaction between specialists and users.

  5. Applicability of the flow-net program to solution of Space Station fluid dynamics problems

    NASA Astrophysics Data System (ADS)

    Navickas, J.; Rivard, W. C.

    The Space Station design encompasses a variety of fluid systems that require extensive flow and combined flow-thermal analyses. The types of problems encountered range from two-phase cryogenic to high-pressure gaseous systems. Design of such systems requires the most advanced analytical tools. Because Space Station applications are a new area for existing two-phase flow programs, typically developed for nuclear safety applications, a careful evaluation of their capabilities to treat generic Space Station flows is appropriate. The results from an assessment of one particular program, FLOW-NET, developed by Flow Science, In., are presented. Three typical problems are analyzed: (1) fill of a hyperbaric module with gaseous nitrogen from a high-pressure supply system, (2) response of a liquid ammonia line to a rapid pressure decrease, and (3) performance of a basic two-phase, thermal control network. The three problems were solved successfully. Comparison of the results with those obtained by analytical methods supports the FLOW-NET calculations.

  6. Chiral models: Geometrical aspects

    NASA Astrophysics Data System (ADS)

    Perelomov, A. M.

    1987-02-01

    Two-dimensional classical chiral models of field theory are considered, the main attention being paid on geometrical aspects of such theories. A characteristic feature of these models is that the interaction is inserted not by adding the interaction Lagrangian to the free field Lagrangian, but has a purely geometrical origin and is related to the inner curvature of the manifold. These models are in many respects analogous to non-Abelian gauge theories and as became clear recently, they are also important for the superstring theory which nowadays is the most probable candidate for a truly unified theory of all interactions including gravitation.

  7. Improved Evolutionary Programming with Various Crossover Techniques for Optimal Power Flow Problem

    NASA Astrophysics Data System (ADS)

    Tangpatiphan, Kritsana; Yokoyama, Akihiko

    This paper presents an Improved Evolutionary Programming (IEP) for solving the Optimal Power Flow (OPF) problem, which is considered as a non-linear, non-smooth, and multimodal optimization problem in power system operation. The total generator fuel cost is regarded as an objective function to be minimized. The proposed method is an Evolutionary Programming (EP)-based algorithm with making use of various crossover techniques, normally applied in Real Coded Genetic Algorithm (RCGA). The effectiveness of the proposed approach is investigated on the IEEE 30-bus system with three different types of fuel cost functions; namely the quadratic cost curve, the piecewise quadratic cost curve, and the quadratic cost curve superimposed by sine component. These three cost curves represent the generator fuel cost functions with a simplified model and more accurate models of a combined-cycle generating unit and a thermal unit with value-point loading effect respectively. The OPF solutions by the proposed method and Pure Evolutionary Programming (PEP) are observed and compared. The simulation results indicate that IEP requires less computing time than PEP with better solutions in some cases. Moreover, the influences of important IEP parameters on the OPF solution are described in details.

  8. A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems.

    PubMed

    Sabar, Nasser R; Ayob, Masri; Kendall, Graham; Qu, Rong

    2015-02-01

    Hyper-heuristics are search methodologies that aim to provide high-quality solutions across a wide variety of problem domains, rather than developing tailor-made methodologies for each problem instance/domain. A traditional hyper-heuristic framework has two levels, namely, the high level strategy (heuristic selection mechanism and the acceptance criterion) and low level heuristics (a set of problem specific heuristics). Due to the different landscape structures of different problem instances, the high level strategy plays an important role in the design of a hyper-heuristic framework. In this paper, we propose a new high level strategy for a hyper-heuristic framework. The proposed high-level strategy utilizes a dynamic multiarmed bandit-extreme value-based reward as an online heuristic selection mechanism to select the appropriate heuristic to be applied at each iteration. In addition, we propose a gene expression programming framework to automatically generate the acceptance criterion for each problem instance, instead of using human-designed criteria. Two well-known, and very different, combinatorial optimization problems, one static (exam timetabling) and one dynamic (dynamic vehicle routing) are used to demonstrate the generality of the proposed framework. Compared with state-of-the-art hyper-heuristics and other bespoke methods, empirical results demonstrate that the proposed framework is able to generalize well across both domains. We obtain competitive, if not better results, when compared to the best known results obtained from other methods that have been presented in the scientific literature. We also compare our approach against the recently released hyper-heuristic competition test suite. We again demonstrate the generality of our approach when we compare against other methods that have utilized the same six benchmark datasets from this test suite.

  9. Models of performance of evolutionary program induction algorithms based on indicators of problem difficulty.

    PubMed

    Graff, Mario; Poli, Riccardo; Flores, Juan J

    2013-01-01

    Modeling the behavior of algorithms is the realm of evolutionary algorithm theory. From a practitioner's point of view, theory must provide some guidelines regarding which algorithm/parameters to use in order to solve a particular problem. Unfortunately, most theoretical models of evolutionary algorithms are difficult to apply to realistic situations. However, in recent work (Graff and Poli, 2008, 2010), where we developed a method to practically estimate the performance of evolutionary program-induction algorithms (EPAs), we started addressing this issue. The method was quite general; however, it suffered from some limitations: it required the identification of a set of reference problems, it required hand picking a distance measure in each particular domain, and the resulting models were opaque, typically being linear combinations of 100 features or more. In this paper, we propose a significant improvement of this technique that overcomes the three limitations of our previous method. We achieve this through the use of a novel set of features for assessing problem difficulty for EPAs which are very general, essentially based on the notion of finite difference. To show the capabilities or our technique and to compare it with our previous performance models, we create models for the same two important classes of problems-symbolic regression on rational functions and Boolean function induction-used in our previous work. We model a variety of EPAs. The comparison showed that for the majority of the algorithms and problem classes, the new method produced much simpler and more accurate models than before. To further illustrate the practicality of the technique and its generality (beyond EPAs), we have also used it to predict the performance of both autoregressive models and EPAs on the problem of wind speed forecasting, obtaining simpler and more accurate models that outperform in all cases our previous performance models.

  10. SEMI-DEFINITE PROGRAMMING TECHNIQUES FOR STRUCTURED QUADRATIC INVERSE EIGENVALUE PROBLEMS

    PubMed Central

    LIN, MATTHEW M.; DONG, BO; CHU, MOODY T.

    2014-01-01

    In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovative application of SDP techniques to quadratic inverse eigenvalue problems (QIEPs). The notion of QIEPs is of fundamental importance because its ultimate goal of constructing or updating a vibration system from some observed or desirable dynamical behaviors while respecting some inherent feasibility constraints well suits many engineering applications. Thus far, however, QIEPs have remained challenging both theoretically and computationally due to the great variations of structural constraints that must be addressed. Of notable interest and significance are the uniformity and the simplicity in the SDP formulation that solves effectively many otherwise very difficult QIEPs. PMID:25392603

  11. Error bounds of adaptive dynamic programming algorithms for solving undiscounted optimal control problems.

    PubMed

    Liu, Derong; Li, Hongliang; Wang, Ding

    2015-06-01

    In this paper, we establish error bounds of adaptive dynamic programming algorithms for solving undiscounted infinite-horizon optimal control problems of discrete-time deterministic nonlinear systems. We consider approximation errors in the update equations of both value function and control policy. We utilize a new assumption instead of the contraction assumption in discounted optimal control problems. We establish the error bounds for approximate value iteration based on a new error condition. Furthermore, we also establish the error bounds for approximate policy iteration and approximate optimistic policy iteration algorithms. It is shown that the iterative approximate value function can converge to a finite neighborhood of the optimal value function under some conditions. To implement the developed algorithms, critic and action neural networks are used to approximate the value function and control policy, respectively. Finally, a simulation example is given to demonstrate the effectiveness of the developed algorithms.

  12. PREFACE: Geometrically frustrated magnetism Geometrically frustrated magnetism

    NASA Astrophysics Data System (ADS)

    Gardner, Jason S.

    2011-04-01

    Frustrated magnetism is an exciting and diverse field in condensed matter physics that has grown tremendously over the past 20 years. This special issue aims to capture some of that excitement in the field of geometrically frustrated magnets and is inspired by the 2010 Highly Frustrated Magnetism (HFM 2010) meeting in Baltimore, MD, USA. Geometric frustration is a broad phenomenon that results from an intrinsic incompatibility between some fundamental interactions and the underlying lattice geometry based on triangles and tetrahedra. Most studies have centred around the kagomé and pyrochlore based magnets but recent work has looked at other structures including the delafossite, langasites, hyper-kagomé, garnets and Laves phase materials to name a few. Personally, I hope this issue serves as a great reference to scientist both new and old to this field, and that we all continue to have fun in this very frustrated playground. Finally, I want to thank the HFM 2010 organizers and all the sponsors whose contributions were an essential part of the success of the meeting in Baltimore. Geometrically frustrated magnetism contents Spangolite: an s = 1/2 maple leaf lattice antiferromagnet? T Fennell, J O Piatek, R A Stephenson, G J Nilsen and H M Rønnow Two-dimensional magnetism and spin-size effect in the S = 1 triangular antiferromagnet NiGa2S4 Yusuke Nambu and Satoru Nakatsuji Short range ordering in the modified honeycomb lattice compound SrHo2O4 S Ghosh, H D Zhou, L Balicas, S Hill, J S Gardner, Y Qi and C R Wiebe Heavy fermion compounds on the geometrically frustrated Shastry-Sutherland lattice M S Kim and M C Aronson A neutron polarization analysis study of moment correlations in (Dy0.4Y0.6)T2 (T = Mn, Al) J R Stewart, J M Hillier, P Manuel and R Cywinski Elemental analysis and magnetism of hydronium jarosites—model kagome antiferromagnets and topological spin glasses A S Wills and W G Bisson The Herbertsmithite Hamiltonian: μSR measurements on single crystals

  13. A dynamic programming-based particle swarm optimization algorithm for an inventory management problem under uncertainty

    NASA Astrophysics Data System (ADS)

    Xu, Jiuping; Zeng, Ziqiang; Han, Bernard; Lei, Xiao

    2013-07-01

    This article presents a dynamic programming-based particle swarm optimization (DP-based PSO) algorithm for solving an inventory management problem for large-scale construction projects under a fuzzy random environment. By taking into account the purchasing behaviour and strategy under rules of international bidding, a multi-objective fuzzy random dynamic programming model is constructed. To deal with the uncertainties, a hybrid crisp approach is used to transform fuzzy random parameters into fuzzy variables that are subsequently defuzzified by using an expected value operator with optimistic-pessimistic index. The iterative nature of the authors' model motivates them to develop a DP-based PSO algorithm. More specifically, their approach treats the state variables as hidden parameters. This in turn eliminates many redundant feasibility checks during initialization and particle updates at each iteration. Results and sensitivity analysis are presented to highlight the performance of the authors' optimization method, which is very effective as compared to the standard PSO algorithm.

  14. Lessons Learned for Cx PRACA. Constellation Program Problem Reporting, Analysis and Corrective Action Process and System

    NASA Technical Reports Server (NTRS)

    Kelle, Pido I.; Ratterman, Christian; Gibbs, Cecil

    2009-01-01

    This slide presentation reviews the Constellation Program Problem Reporting, Analysis and Corrective Action Process and System (Cx PRACA). The goal of the Cx PRACA is to incorporate Lessons learned from the Shuttle, ISS, and Orbiter programs by creating a single tool for managing the PRACA process, that clearly defines the scope of PRACA applicability and what must be reported, and defines the ownership and responsibility for managing the PRACA process including disposition approval authority. CxP PRACA is a process, supported by a single information gathering data module which will be integrated with a single CxP Information System, providing interoperability, import and export capability making the CxP PRACA a more effective and user friendly technical and management tool.

  15. Wildlife and oil shale: a problem analysis and research program: volume 2, appendix and bibliography

    USGS Publications Warehouse

    Burke, Hubert D.

    1975-01-01

    This appendix is designed to apply to the program of studies recommended in the problem analysis and research program Volume I. It has two purposes: (1) to provide reference that may be used in the preparation of requests for proposals or for studies, and (2) to suggest a core group of references for a reference library for research. The references that follow are listed taxonomically as follows: A. Aquatic Ecosystems B. Water Quality C. Terrestrial Ecosystems D. Industrial Impacts on Wildlife E. Reptiles and Amphibians F. Blood-sucking Arthropods and Disease Vectors This bibliography is not integrated because it was believed that it would be more useful with the sources separate. It also does not attempt to cover the entire field. It is, however, a listing that will be most useful in the description of the region and its environmental processes.

  16. Water-related problems of central Asia: some results of the (GIWA) International Water Assessment Program.

    PubMed

    Severskiy, Igor Vasilievich

    2004-02-01

    This paper presents results of the research under the program Global International Waters Assessment (GIWA) for the Aral Sea basin (Subregion 24 of the GIWA program). These results show that the detemining factor for the region is freshwater shortage and the main issue is modification of stream flow. According to GIWA assessment estimations, freshwater shortage is responsible for about 70% of the developmental problems in the region. The current economy is developing under conditions of increasing water deficiency. In spite of increasing efforts by the governments of the countries in the region, and by the international community, the situation in regard to water supply and economic objectives in the countries of central Asia remains tense and shows clear tendencies towards aggravation and conflict. The main causes for this sharpening of ecological and socioeconomic conditions in the region are analyzed, and measures to mitigate stress in transboundary water-resources use are presented.

  17. A sensory integration therapy program on sensory problems for children with autism.

    PubMed

    Fazlioğlu, Yeşim; Baran, Gulen

    2008-04-01

    The study was planned to investigate the effect of a sensory integration therapy program on sensory problems of children with autism. This study was conducted at the Trakya University Training and Research Center for Mentally and Physically Handicapped Children in Turkey. The children were separated into two groups, each comprising 15 children between 7 and 11 years of age with autism, according to DSM-IV criteria. The children in each group were assessed initially on a checklist, Sensory Evaluation Form for Children with Autism, developed to evaluate sensory characteristics of children with autism, and at the end of the study, participants were assessed again on the checklist. Statistically significant differences between groups indicated that the sensory integration therapy program positively affected treated children.

  18. Dynamic Programming on Reduced Models and Its Evaluation through Its Application to Elevator Operation Problems

    NASA Astrophysics Data System (ADS)

    Inamoto, Tsutomu; Tamaki, Hisashi; Murao, Hajime

    In this paper, we present a modified dynamic programming (DP) method. The method is basically the same as the value iteration method (VI), a representative DP method, except the preprocess of a system's state transition model for reducing its complexity, and is called the dynamic programming on reduced models (DPRM). That reduction is achieved by imaginarily considering causes of the probabilistic behavior of a system, and then cutting off some causes with low occurring probabilities. In computational illustrations, VI, DPRM, and the real-time Q-learning method (RTQ) are applied to elevator operation problems, which can be modeled by using Markov decision processes. The results show that DPRM can compute quasi-optimal value functions which bring more effective allocations of elevators than value functions by RTQ in less computational times than VI. This characteristic is notable when the traffic pattern is complicated.

  19. On large-scale nonlinear programming techniques for solving optimal control problems

    SciTech Connect

    Faco, J.L.D.

    1994-12-31

    The formulation of decision problems by Optimal Control Theory allows the consideration of their dynamic structure and parameters estimation. This paper deals with techniques for choosing directions in the iterative solution of discrete-time optimal control problems. A unified formulation incorporates nonlinear performance criteria and dynamic equations, time delays, bounded state and control variables, free planning horizon and variable initial state vector. In general they are characterized by a large number of variables, mostly when arising from discretization of continuous-time optimal control or calculus of variations problems. In a GRG context the staircase structure of the jacobian matrix of the dynamic equations is exploited in the choice of basic and super basic variables and when changes of basis occur along the process. The search directions of the bound constrained nonlinear programming problem in the reduced space of the super basic variables are computed by large-scale NLP techniques. A modified Polak-Ribiere conjugate gradient method and a limited storage quasi-Newton BFGS method are analyzed and modifications to deal with the bounds on the variables are suggested based on projected gradient devices with specific linesearches. Some practical models are presented for electric generation planning and fishery management, and the application of the code GRECO - Gradient REduit pour la Commande Optimale - is discussed.

  20. A Fuzzy Goal Programming Procedure for Solving Multiobjective Load Flow Problems via Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Biswas, Papun; Chakraborti, Debjani

    2010-10-01

    This paper describes how the genetic algorithms (GAs) can be efficiently used to fuzzy goal programming (FGP) formulation of optimal power flow problems having multiple objectives. In the proposed approach, the different constraints, various relationships of optimal power flow calculations are fuzzily described. In the model formulation of the problem, the membership functions of the defined fuzzy goals are characterized first for measuring the degree of achievement of the aspiration levels of the goals specified in the decision making context. Then, the achievement function for minimizing the regret for under-deviations from the highest membership value (unity) of the defined membership goals to the extent possible on the basis of priorities is constructed for optimal power flow problems. In the solution process, the GA method is employed to the FGP formulation of the problem for achievement of the highest membership value (unity) of the defined membership functions to the extent possible in the decision making environment. In the GA based solution search process, the conventional Roulette wheel selection scheme, arithmetic crossover and random mutation are taken into consideration to reach a satisfactory decision. The developed method has been tested on IEEE 6-generator 30-bus System. Numerical results show that this method is promising for handling uncertain constraints in practical power systems.

  1. "Tuning into Kids": reducing young children's behavior problems using an emotion coaching parenting program.

    PubMed

    Havighurst, Sophie S; Wilson, Katherine R; Harley, Ann E; Kehoe, Christiane; Efron, Daryl; Prior, Margot R

    2013-04-01

    This study evaluated a 6-session group parenting program, Tuning into Kids (TIK), as treatment for young children (aged 4.0-5.11 years) with behavior problems. TIK targets parent emotion socialization (parent emotion awareness, regulation and emotion coaching skills). Fifty-four parents, recruited via a child behavior clinic, were randomized into intervention (TIK) or waitlist (clinical treatment as usual). Parents reported emotion awareness/regulation, emotion coaching, empathy and child behavior (pre-intervention, post-intervention, 6-month follow-up); teachers reported child behavior and observers rated parent-child emotion coaching and child emotion knowledge (pre-intervention, follow-up). Data were analyzed using growth curve modeling and ANCOVA. Parents in both conditions reported less emotional dismissiveness and reduced child behavior problems; in the intervention group, parents also reported greater empathy and had improved observed emotion coaching skills; their children had greater emotion knowledge and reduced teacher-reported behavior problems. TIK appears to be a promising addition to treatment for child behavior problems.

  2. The Burden of Psychosocial Stressors and Urgent Mental Health Problems in a Pediatric Weight Management Program.

    PubMed

    Zenlea, Ian S; Burton, E Thomaseo; Askins, Nissa; Pluhar, Emily Israel; Rhodes, Erinn T

    2015-11-01

    To systematically screen for behavioral and mental health problems and psychosocial stressors (PS) in newly referred patients and adult caregivers (PACs) in a pediatric weight management program. We used the Strengths and Difficulties Questionnaire (SDQ), the Center for Epidemiologic Studies Depression Scale (CES-D) for caregivers and patients ≥18 years, and assessed urgent mental health concerns and psychosocial stressors. A total of 243 PACs were screened; data were unavailable for 6. Compared with US normative data for the SDQ-Parent Proxy Version, the proportion of patients in our sample with borderline/abnormal total difficulties and conduct problems scores was greater for all age groups. Among adult caregivers with complete CES-D, 18.4% were at risk for depression. Eleven percent of patients screened positive for urgent mental health problems. Overall, 43% of patients and 57.4% of caregivers had PS. Systematic screening identified untreated symptoms and significant PS. Addressing these complex problems likely requires collaborative approaches with community providers. © The Author(s) 2015.

  3. 2-D pressurized water reactor whole core benchmark problem development and MOCUM program verification

    NASA Astrophysics Data System (ADS)

    Oredeko, Ayoola Emmanuel

    The need to solve larger-scale and highly heterogeneous reactor problems is urgent nowadays; different computational codes are being developed to meet this demand. Method of characteristics unstructured meshing (MOCUM) is a transport theory code based on the method of characteristic as the flux solver with an advanced general geometry processor. The objective of this research was to use the MOCUM program to solve the whole core, highly heterogeneous pressurized water reactor (PWR) benchmark problem, to determine its efficiency in solving complicated benchmarks, the large scale full-core PWR benchmark problem presented in this work was modeled for high heterogeneity at the core and assembly level, and depicts a realistic reactor design. The design of the core is a 15x15 assembly arrangement and each assembly is based on the C5G7 assembly design, i.e, 17x17 fuel pins. The problem was simplified for faster computation time by using the 1/4 symmetry of the core. MATLAB is used for the visualization of the neutron flux for each group, and the fission rate. MOCUM result shows good agreement with monte carlo N-particles (MCNP6) solution with a -0.025% difference in eigenvalue (keff). The pin and assembly power calculated with MOCUM, shows good agreement with that of MCNP6; the maximum relative difference for pin and assembly power was -2.53% and -1.79% respectively. The power profiles from these two computational codes were compared and used to validate the MOCUM solutions.

  4. Problem Solving

    ERIC Educational Resources Information Center

    Kinsella, John J.

    1970-01-01

    Discussed are the nature of a mathematical problem, problem solving in the traditional and modern mathematics programs, problem solving and psychology, research related to problem solving, and teaching problem solving in algebra and geometry. (CT)

  5. Untangling Geometric Ideas

    ERIC Educational Resources Information Center

    Burgess, Claudia R.

    2014-01-01

    Designed for a broad audience, including educators, camp directors, afterschool coordinators, and preservice teachers, this investigation aims to help individuals experience mathematics in unconventional and exciting ways by engaging them in the physical activity of building geometric shapes using ropes. Through this engagement, the author…

  6. A Geometric Scavenger Hunt

    ERIC Educational Resources Information Center

    Smart, Julie; Marshall, Jeff

    2007-01-01

    Children possess a genuine curiosity for exploring the natural world around them. One third grade teacher capitalized on this inherent trait by leading her students on "A Geometric Scavenger Hunt." The four-lesson inquiry investigation described in this article integrates mathematics and science. Among the students' discoveries was the fact that…

  7. Geometric Series via Probability

    ERIC Educational Resources Information Center

    Tesman, Barry

    2012-01-01

    Infinite series is a challenging topic in the undergraduate mathematics curriculum for many students. In fact, there is a vast literature in mathematics education research on convergence issues. One of the most important types of infinite series is the geometric series. Their beauty lies in the fact that they can be evaluated explicitly and that…

  8. A Geometric Scavenger Hunt

    ERIC Educational Resources Information Center

    Smart, Julie; Marshall, Jeff

    2007-01-01

    Children possess a genuine curiosity for exploring the natural world around them. One third grade teacher capitalized on this inherent trait by leading her students on "A Geometric Scavenger Hunt." The four-lesson inquiry investigation described in this article integrates mathematics and science. Among the students' discoveries was the fact that…

  9. Untangling Geometric Ideas

    ERIC Educational Resources Information Center

    Burgess, Claudia R.

    2014-01-01

    Designed for a broad audience, including educators, camp directors, afterschool coordinators, and preservice teachers, this investigation aims to help individuals experience mathematics in unconventional and exciting ways by engaging them in the physical activity of building geometric shapes using ropes. Through this engagement, the author…

  10. Levels of Geometric Understanding.

    ERIC Educational Resources Information Center

    Pegg, John; Davey, Geoff

    1991-01-01

    Three activities are presented to assess the level of students' geometric understanding according to van Hiele learning model. The activities--Descriptions, Minimum Properties, and Class Inclusion--are applied to the example of classifying quadrilaterals as squares, rectangles, rhombi, or parallelograms. Implications of this assessment are…

  11. Geometric grid generation

    NASA Technical Reports Server (NTRS)

    Ives, David

    1995-01-01

    This paper presents a highly automated hexahedral grid generator based on extensive geometrical and solid modeling operations developed in response to a vision of a designer-driven one day turnaround CFD process which implies a designer-driven one hour grid generation process.

  12. Evaluation of a school-based educational program to prevent adolescents’ problem behaviors

    PubMed Central

    Eslami, Ahmad Ali; Ghofranipour, Fazlollah; Bonab, Bagher Ghobari; Zadeh, Davood Shojaei; Shokravi, Farkhondeh Amin; Tabatabaie, Mahmoud Ghazi

    2015-01-01

    Background: Many researchers believe that adolescents’ problem behaviors are indicators of a deficiency in social skills. This study was aimed to evaluate the effectiveness of a prevention program on reducing problem behaviors in male adolescents. Materials and Methods: In a preposttest design with randomized control group, 49 students received social skills training (SST). Follow-up assessment of outcomes took place 5 months post baseline. The SST program was administered over the course of 10 weeks (10 sessions of 1 h). The main tools were multiple problem behaviors index (MPBI) and Social Skills Rating System – student form (SSRS-S). The control group (57 students) did not receive any intervention. Intervention effects were evaluated with t-test, univariate ANCOVA, and repeated measures ANOVA. Results: Significant difference between groups founded on SSRS at posttest (t = 2.5, P = 0.014) by univariate ANCOVA. In addition, the findings indicated that variation trend of mean scores of SSRS in the intervention group was significant (F = 225.3, P < 0.0001). The intervention group reported Lower levels of MPBI at posttest and follow-up compared to the control group. Significant difference between the two groups did not achieved on MPBI scores in the posttest after adjusting for the pretest scores; however, this difference was significant at the follow up (F = 5.3, P = 0.020). Conclusion: The results suggest that SST was effective in improving social competence and preventing problem behaviors among male adolescent. Future researches must be examined the role of peer and family. PMID:25884000

  13. A revised version of Graphic Normative Analysis Program (GNAP) with examples of petrologic problem solving

    USGS Publications Warehouse

    Stuckless, J.S.; VanTrump, G.

    1979-01-01

    A revised version of Graphic Normative Analysis Program (GNAP) has been developed to allow maximum flexibility in the evaluation of chemical data by the occasional computer user. GNAP calculates ClPW norms, Thornton and Tuttle's differentiation index, Barth's cations, Niggli values and values for variables defined by the user. Calculated values can be displayed graphically in X-Y plots or ternary diagrams. Plotting can be done on a line printer or Calcomp plotter with either weight percent or mole percent data. Modifications in the original program give the user some control over normative calculations for each sample. The number of user-defined variables that can be created from the data has been increased from ten to fifteen. Plotting and calculations can be based on the original data, data adjusted to sum to 100 percent, or data adjusted to sum to 100 percent without water. Analyses for which norms were previously not computable are now computed with footnotes that show excesses or deficiencies in oxides (or volatiles) not accounted for by the norm. This report contains a listing of the computer program, an explanation of the use of the program, and the two sample problems.

  14. Pragmatic geometric model evaluation

    NASA Astrophysics Data System (ADS)

    Pamer, Robert

    2015-04-01

    Quantification of subsurface model reliability is mathematically and technically demanding as there are many different sources of uncertainty and some of the factors can be assessed merely in a subjective way. For many practical applications in industry or risk assessment (e. g. geothermal drilling) a quantitative estimation of possible geometric variations in depth unit is preferred over relative numbers because of cost calculations for different scenarios. The talk gives an overview of several factors that affect the geometry of structural subsurface models that are based upon typical geological survey organization (GSO) data like geological maps, borehole data and conceptually driven construction of subsurface elements (e. g. fault network). Within the context of the trans-European project "GeoMol" uncertainty analysis has to be very pragmatic also because of different data rights, data policies and modelling software between the project partners. In a case study a two-step evaluation methodology for geometric subsurface model uncertainty is being developed. In a first step several models of the same volume of interest have been calculated by omitting successively more and more input data types (seismic constraints, fault network, outcrop data). The positions of the various horizon surfaces are then compared. The procedure is equivalent to comparing data of various levels of detail and therefore structural complexity. This gives a measure of the structural significance of each data set in space and as a consequence areas of geometric complexity are identified. These areas are usually very data sensitive hence geometric variability in between individual data points in these areas is higher than in areas of low structural complexity. Instead of calculating a multitude of different models by varying some input data or parameters as it is done by Monte-Carlo-simulations, the aim of the second step of the evaluation procedure (which is part of the ongoing work) is to

  15. Implementing a comprehensive program for the prevention of conduct problems in rural communities: the Fast Track experience. The Conduct Problems Prevention Research Group.

    PubMed

    Bierman, K L

    1997-08-01

    Childhood conduct problems are predictive of a number of serious long-term difficulties (e.g., school failure, delinquent behavior, and mental health problems), making the design of effective prevention programs a priority. The Fast Track Program is a demonstration project currently underway in four demographically diverse areas of the United States, testing the feasibility and effectiveness of a comprehensive, multicomponent prevention program targeting children at risk for conduct disorders. This paper describes some lessons learned about the implementation of this program in a rural area. Although there are many areas of commonality in terms of program needs, program design, and implementation issues in rural and urban sites, rural areas differ from urban areas along the dimensions of geographical dispersion and regionalism, and community stability and insularity. Rural programs must cover a broad geographical area and must be sensitive to the multiple, small and regional communities that constitute their service area. Small schools, homogeneous populations, traditional values, limited recreational, educational and mental health services, and politically conservative climates are all more likely to emerge as characteristics of rural rather than urban sites (Sherman, 1992). These characteristics may both pose particular challenges to the implementation of prevention programs in rural areas, as well as offer particular benefits. Three aspects of program implementation are described in detail: (a) community entry and program initiation in rural areas, (b) the adaptation of program components and service delivery to meet the needs of rural families and schools, and (c) issues in administrative organization of a broadly dispersed tricounty rural prevention program.

  16. Geometric Models for Collaborative Search and Filtering

    ERIC Educational Resources Information Center

    Bitton, Ephrat

    2011-01-01

    This dissertation explores the use of geometric and graphical models for a variety of information search and filtering applications. These models serve to provide an intuitive understanding of the problem domains and as well as computational efficiencies to our solution approaches. We begin by considering a search and rescue scenario where both…

  17. Geometric Models for Collaborative Search and Filtering

    ERIC Educational Resources Information Center

    Bitton, Ephrat

    2011-01-01

    This dissertation explores the use of geometric and graphical models for a variety of information search and filtering applications. These models serve to provide an intuitive understanding of the problem domains and as well as computational efficiencies to our solution approaches. We begin by considering a search and rescue scenario where both…

  18. Deformable Subreflector Computed by Geometric Optics

    NASA Technical Reports Server (NTRS)

    Williams, W. F.

    1986-01-01

    Distorted antenna surfaces forced to produce a uniform wave front. SUBFORMING employs geometric optics in determining subreflector coordinates to match main reflector surface with known distortions. Antenna with distorted paraboloidal reflecting surface forced to produce uniform wave front by using a Cassegrainian geometry with path-length-compensating subreflector. Program written in FORTRAN V for batch execution.

  19. Approximate dynamic programming recurrence relations for a hybrid optimal control problem

    NASA Astrophysics Data System (ADS)

    Lu, W.; Ferrari, S.; Fierro, R.; Wettergren, T. A.

    2012-06-01

    This paper presents a hybrid approximate dynamic programming (ADP) method for a hybrid dynamic system (HDS) optimal control problem, that occurs in many complex unmanned systems which are implemented via a hybrid architecture, regarding robot modes or the complex environment. The HDS considered in this paper is characterized by a well-known three-layer hybrid framework, which includes a discrete event controller layer, a discrete-continuous interface layer, and a continuous state layer. The hybrid optimal control problem (HOCP) is to nd the optimal discrete event decisions and the optimal continuous controls subject to a deterministic minimization of a scalar function regarding the system state and control over time. Due to the uncertainty of environment and complexity of the HOCP, the cost-to-go cannot be evaluated before the HDS explores the entire system state space; as a result, the optimal control, neither continuous nor discrete, is not available ahead of time. Therefore, ADP is adopted to learn the optimal control while the HDS is exploring the environment, because of the online advantage of ADP method. Furthermore, ADP can break the curses of dimensionality which other optimizing methods, such as dynamic programming (DP) and Markov decision process (MDP), are facing due to the high dimensions of HOCP.

  20. Problem-Based Learning in a Programming Context-Planning and Executing a Pilot Survey on Database Access in a Programming Language

    NASA Astrophysics Data System (ADS)

    Bellström, Peter; Kilbrink, Nina

    In this chapter we describe a pilot survey on applying problem-based learning (PBL) in an undergraduate programming course. During the course the students have applied PBL as a complement to traditional teaching and learning techniques. The PBL problem in this survey combines both knowledge about programming and knowledge about databases. We argue that to handle programming the students have to learn programming according to the deep approach to learning in order to be able to apply their knowledge in new programming situations and contexts. The result from this pilot survey indicates from both a tutor and a student perspective that PBL could be one method to reach a deeper understanding on how to access databases in a programming language.

  1. Study of Induction Programs for Beginning Teachers. Volume II. The Problems of Beginning Teachers: A Digest of Helping Programs.

    ERIC Educational Resources Information Center

    Elias, Patricia; And Others

    The Digest of Helping Programs presented in this volume describes exemplary support programs for beginning teachers in the United States. Twenty-four programs are included, of which four are described in considerable detail. Comprehensive descriptions are given of the following programs: (1) The Stanford University Intern Program; (2) The Resident…

  2. Building Interactivity in Higher Education to Support Student Engagement in Spatial Problem Solving and Programming

    NASA Astrophysics Data System (ADS)

    Gulland, E.-K.; Veenendaal, B.; Schut, A. G. T.

    2012-07-01

    Problem-solving knowledge and skills are an important attribute of spatial sciences graduates. The challenge of higher education is to build a teaching and learning environment that enables students to acquire these skills in relevant and authentic applications. This study investigates the effectiveness of traditional face-to-face teaching and online learning technologies in supporting the student learning of problem-solving and computer programming skills, techniques and solutions. The student cohort considered for this study involves students in the surveying as well as geographic information science (GISc) disciplines. Also, students studying across a range of learning modes including on-campus, distance and blended, are considered in this study. Student feedback and past studies reveal a lack of student interest and engagement in problem solving and computer programming. Many students do not see such skills as directly relevant and applicable to their perceptions of what future spatial careers hold. A range of teaching and learning methods for both face-to-face teaching and distance learning were introduced to address some of the perceived weaknesses of the learning environment. These included initiating greater student interaction in lectures, modifying assessments to provide greater feedback and student accountability, and the provision of more interactive and engaging online learning resources. The paper presents and evaluates the teaching methods used to support the student learning environment. Responses of students in relation to their learning experiences were collected via two anonymous, online surveys and these results were analysed with respect to student pass and retention rates. The study found a clear distinction between expectations and engagement of surveying students in comparison to GISc students. A further outcome revealed that students who were already engaged in their learning benefited the most from the interactive learning resources and

  3. Problem based learning - 'Bringing everything together' - A strategy for Graduate Nurse Programs.

    PubMed

    Vittrup, Ann-Charlotte; Davey, Anna

    2010-03-01

    This article discusses a case study that was initiated by a Graduate Nurse Coordinator of an acute care inpatient hospital in Australia. It outlines the conceptualisation and creative implementation of a structured group problem based learning activity which was a component of a Graduate Nurse Program. The learning activity was based on the beliefs that knowledge acquisition today is an active process and should focus on the learner developing strategies to obtain, review and manage information. The learning activity implemented in this case study was valuable as it recognised the benefits that can be gained for the Graduate Nurse by ensuring the context of their teaching and learning activities is grounded in practical experiences. The learning activity aimed to prepare Graduate Nurses to cope with the multiple challenges faced as they enter the nursing profession by enhancing their skills of inquiry, problem solving and reasoning. The evaluation of this case study found that the incorporation of structured group problem based learning did promote the achievement of these educational outcomes with Graduate Nurses displaying critical thinking, clinical judgment and knowledge acquisition skills. An unexpected benefit of this activity for Graduate Nurses was the enhancement of clinical practice behaviours, such as communication and interactive skills. This case study describes the positive outcomes not only for Graduates Nurses in the application of their learning but also the wider benefits which can be gained for the organisation, patient care standards and the health care team. It is anticipated that this article will be an inspiration to others who are interested in implementing innovative teaching strategies into Graduate Nurse Programs.

  4. Geometric effects in tomographic reconstruction

    SciTech Connect

    Barnes, F.L.; Azevedo, S.G.; Martz, H.E. Jr.; Roberson, G.P.; Schneberk, D.J.; Skeate, M.F.

    1990-01-08

    In x-ray and ion-beam computerized tomography, there are a number of reconstruction effects, manifested as artifacts, that can be attributed to the geometry of the experimental setup and of the object being scanned. In this work, we will examine four geometric effects that are common to first-and third-generation (parallel beam, 180 degree) computerized tomography (CT) scanners and suggest solutions for each problem. The geometric effects focused on in this paper are: X-pattern'' artifacts (believed to be caused by several errors), edge-generated ringing artifacts (due to improper choice of the reconstruction filter and cutoff frequency), circular-ring artifacts (caused by employing uncalibrated detectors), and tuning-fork artifacts (generated by an incorrectly specified center-of-rotation). Examples of four effects are presented. The X-pattern and edge-generated ringing artifacts are presented with actual experimental data introducing the artifact. given the source of the artifact, we present simulated data designed to replicate the artifact. Finally, we suggest ways to reduce or completely remove these artifacts. The circular-ring and tuning-fork artifacts are introduced with actual experimental data as well, while digital signal processing solutions are employed to remove the artifacts from the data. 15 refs., 12 figs.

  5. On the location selection problem using analytic hierarchy process and multi-choice goal programming

    NASA Astrophysics Data System (ADS)

    Ho, Hui-Ping; Chang, Ching-Ter; Ku, Cheng-Yuan

    2013-01-01

    Location selection is a crucial decision in cost/benefit analysis of restaurants, coffee shops and others. However, it is difficult to be solved because there are many conflicting multiple goals in the problem of location selection. In order to solve the problem, this study integrates analytic hierarchy process (AHP) and multi-choice goal programming (MCGP) as a decision aid to obtain an appropriate house from many alternative locations that better suit the preferences of renters under their needs. This study obtains weights from AHP and implements it upon each goal using MCGP for the location selection problem. According to the function of multi-aspiration provided by MCGP, decision makers can set multi-aspiration for each location goal to rank the candidate locations. Compared to the unaided selection processes, the integrated approach of AHP and MCGP is a better scientific and efficient method than traditional methods in finding a suitable location for buying or renting a house for business, especially under multiple qualitative and quantitative criteria within a shorter evaluation time. In addition, a real case is provided to demonstrate the usefulness of the proposed method. The results show that the proposed method is able to provide better quality decision than normal manual methods.

  6. An integer programming formulation of the parsimonious loss of heterozygosity problem.

    PubMed

    Catanzaro, Daniele; Labbé, Martine; Halldórsson, Bjarni V

    2013-01-01

    A loss of heterozygosity (LOH) event occurs when, by the laws of Mendelian inheritance, an individual should be heterozygote at a given site but, due to a deletion polymorphism, is not. Deletions play an important role in human disease and their detection could provide fundamental insights for the development of new diagnostics and treatments. In this paper, we investigate the parsimonious loss of heterozygosity problem (PLOHP), i.e., the problem of partitioning suspected polymorphisms from a set of individuals into a minimum number of deletion areas. Specifically, we generalize Halldórsson et al.'s work by providing a more general formulation of the PLOHP and by showing how one can incorporate different recombination rates and prior knowledge about the locations of deletions. Moreover, we show that the PLOHP can be formulated as a specific version of the clique partition problem in a particular class of graphs called undirected catch-point interval graphs and we prove its general $({\\cal NP})$-hardness. Finally, we provide a state-of-the-art integer programming (IP) formulation and strengthening valid inequalities to exactly solve real instances of the PLOHP containing up to 9,000 individuals and 3,000 SNPs. Our results give perspectives on the mathematics of the PLOHP and suggest new directions on the development of future efficient exact solution approaches.

  7. An improved exploratory search technique for pure integer linear programming problems

    NASA Technical Reports Server (NTRS)

    Fogle, F. R.

    1990-01-01

    The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

  8. Geometric continuum regularization of quantum field theory

    SciTech Connect

    Halpern, M.B. . Dept. of Physics)

    1989-11-08

    An overview of the continuum regularization program is given. The program is traced from its roots in stochastic quantization, with emphasis on the examples of regularized gauge theory, the regularized general nonlinear sigma model and regularized quantum gravity. In its coordinate-invariant form, the regularization is seen as entirely geometric: only the supermetric on field deformations is regularized, and the prescription provides universal nonperturbative invariant continuum regularization across all quantum field theory. 54 refs.

  9. Geometric Integration of Weakly Dissipative Systems

    NASA Astrophysics Data System (ADS)

    Modin, K.; Führer, C.; Soöderlind, G.

    2009-09-01

    Some problems in mechanics, e.g. in bearing simulation, contain subsystems that are conservative as well as weakly dissipative subsystems. Our experience is that geometric integration methods are often superior for such systems, as long as the dissipation is weak. Here we develop adaptive methods for dissipative perturbations of Hamiltonian systems. The methods are "geometric" in the sense that the form of the dissipative perturbation is preserved. The methods are linearly explicit, i.e., they require the solution of a linear subsystem. We sketch an analysis in terms of backward error analysis and numerical comparisons with a conventional RK method of the same order is given.

  10. CAM - Geometric systems integration

    NASA Astrophysics Data System (ADS)

    Dunlap, G. C.

    The integration of geometric and nongeometric information for efficient use of CAM is examined. Requirements for engineering drawings requested by management are noted to involve large volumes of nongeometric data to define the materials and quantity variables which impinge on the required design, so that the actual design may be the last and smaller step in the CAM process. Geometric classification and coding are noted to offer an alpha/numeric identifier for integrating the engineering design, manufacturing, and quality assurance functions. An example is provided of a turbine gear part coding in terms of polycode and monocode displays, showing a possible covering of more than 10 trillion features. Software is stressed as the key to integration of company-wide data.

  11. Teen Suicide in Nevada: The Problem, Effective Intervention & Prevention Programs, Status of Programs in Nevada Schools, Exemplary Programs, [and] Guidelines for Nevada School Programs.

    ERIC Educational Resources Information Center

    Smaby, Marlow H.; Downing, Jerry

    The purpose of this paper is twofold: it reviews current national research on adolescent suicide and successful intervention/prevention programs and it surveys the 17 Nevada school districts to determine the presence of successful suicide intervention/prevention programs in the state. Findings include the following: (1) the popular…

  12. A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems

    NASA Astrophysics Data System (ADS)

    Ebrahimnejad, Ali

    2015-08-01

    There are several methods, in the literature, for solving fuzzy variable linear programming problems (fuzzy linear programming in which the right-hand-side vectors and decision variables are represented by trapezoidal fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings a new method based on the bounded dual simplex method is proposed to determine the fuzzy optimal solution of that kind of fuzzy variable linear programming problems in which some or all variables are restricted to lie within lower and upper bounds. To illustrate the proposed method, an application example is solved and the obtained results are given. The advantages of the proposed method over existing methods are discussed. Also, one application of this algorithm in solving bounded transportation problems with fuzzy supplies and demands is dealt with. The proposed method is easy to understand and to apply for determining the fuzzy optimal solution of bounded fuzzy variable linear programming problems occurring in real-life situations.

  13. Analyzing the Effects of a Mathematics Problem-Solving Program, Exemplars, on Mathematics Problem-Solving Scores with Deaf and Hard-of-Hearing Students

    ERIC Educational Resources Information Center

    Chilvers, Amanda Leigh

    2013-01-01

    Researchers have noted that mathematics achievement for deaf and hard-of-hearing (d/hh) students has been a concern for many years, including the ability to problem solve. This quasi-experimental study investigates the use of the Exemplars mathematics program with students in grades 2-8 in a school for the deaf that utilizes American Sign Language…

  14. Analyzing the Effects of a Mathematics Problem-Solving Program, Exemplars, on Mathematics Problem-Solving Scores with Deaf and Hard-of-Hearing Students

    ERIC Educational Resources Information Center

    Chilvers, Amanda Leigh

    2013-01-01

    Researchers have noted that mathematics achievement for deaf and hard-of-hearing (d/hh) students has been a concern for many years, including the ability to problem solve. This quasi-experimental study investigates the use of the Exemplars mathematics program with students in grades 2-8 in a school for the deaf that utilizes American Sign Language…

  15. Geometric measures of entanglement

    SciTech Connect

    Uyanik, K.; Turgut, S.

    2010-03-15

    The geometric measure of entanglement, which expresses the minimum distance to product states, has been generalized to distances to sets that remain invariant under the stochastic reducibility relation. For each such set, an associated entanglement monotone can be defined. The explicit analytical forms of these measures are obtained for bipartite entangled states. Moreover, the three-qubit case is discussed and it is argued that the distance to the W states is a new monotone.

  16. Geometrical deuteron stripping revisited

    SciTech Connect

    Neoh, Y. S.; Yap, S. L.

    2014-03-05

    We investigate the reality of the idea of geometrical deuteron stripping originally envisioned by Serber. By taking into account of realistic deuteron wavefunction, nuclear density, and nucleon stopping mean free path, we are able to estimate inclusive deuteron stripping cross section for deuteron energy up to before pion production. Our semiclassical model contains only one global parameter constant for all nuclei which can be approximated by Woods-Saxon or any other spherically symmetric density distribution.

  17. Perspective: Geometrically frustrated assemblies

    NASA Astrophysics Data System (ADS)

    Grason, Gregory M.

    2016-09-01

    This perspective will overview an emerging paradigm for self-organized soft materials, geometrically frustrated assemblies, where interactions between self-assembling elements (e.g., particles, macromolecules, proteins) favor local packing motifs that are incompatible with uniform global order in the assembly. This classification applies to a broad range of material assemblies including self-twisting protein filament bundles, amyloid fibers, chiral smectics and membranes, particle-coated droplets, curved protein shells, and phase-separated lipid vesicles. In assemblies, geometric frustration leads to a host of anomalous structural and thermodynamic properties, including heterogeneous and internally stressed equilibrium structures, self-limiting assembly, and topological defects in the equilibrium assembly structures. The purpose of this perspective is to (1) highlight the unifying principles and consequences of geometric frustration in soft matter assemblies; (2) classify the known distinct modes of frustration and review corresponding experimental examples; and (3) describe outstanding questions not yet addressed about the unique properties and behaviors of this broad class of systems.

  18. An Investigation of the Impact of Function of Problem Behavior on Effectiveness of the Behavior Education Program (BEP)

    ERIC Educational Resources Information Center

    Hawken, Leanne S.; O'Neill, Robert E.; MacLeod, K. Sandra

    2011-01-01

    The Behavior Education Program (BEP) is a check-in, check-out intervention implemented with students who are at-risk for engaging in more severe problem behavior. Previous research with middle and elementary school students found that the BEP was more effective with students who had adult attention maintained problem behavior. The purposes of this…

  19. Program, Planning, Budgeting Systems for Educators. Volume II: A Case Problem. Final Report. Leadership Series No. 19.

    ERIC Educational Resources Information Center

    McGivney, Joseph H.; Nelson, William C.

    This case problem is designed for use by planning, budgeting, or administrative personnel in state or regional vocational educational organizations. The problem involves planning, programming, and budgeting which is best accomplished in small group settings. Each small group should ideally consist of persons with a variety of duties and…

  20. An Investigation of the Impact of Function of Problem Behavior on Effectiveness of the Behavior Education Program (BEP)

    ERIC Educational Resources Information Center

    Hawken, Leanne S.; O'Neill, Robert E.; MacLeod, K. Sandra

    2011-01-01

    The Behavior Education Program (BEP) is a check-in, check-out intervention implemented with students who are at-risk for engaging in more severe problem behavior. Previous research with middle and elementary school students found that the BEP was more effective with students who had adult attention maintained problem behavior. The purposes of this…