#### Sample records for geometric programming problem

1. Geometric Programming Approach to an Interactive Fuzzy Inventory Problem

Directory of Open Access Journals (Sweden)

Nirmal Kumar Mandal

2011-01-01

Full Text Available An interactive multiobjective fuzzy inventory problem with two resource constraints is presented in this paper. The cost parameters and index parameters, the storage space, the budgetary cost, and the objective and constraint goals are imprecise in nature. These parameters and objective goals are quantified by linear/nonlinear membership functions. A compromise solution is obtained by geometric programming method. If the decision maker is not satisfied with this result, he/she may try to update the current solution to his/her satisfactory solution. In this way we implement man-machine interactive procedure to solve the problem through geometric programming method.

2. A Note on the Dual of an Unconstrained (Generalized) Geometric Programming Problem

NARCIS (Netherlands)

J.B.G. Frenk (Hans); G.J. Still

2005-01-01

textabstractIn this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian duality result. Contrary to [1] we also consider the case that the set C is compact and

3. A Geometric Dissection Problem

Home; Journals; Resonance – Journal of Science Education; Volume 7; Issue 7. A Geometric Dissection Problem. M N Deshpande. Think It Over Volume 7 Issue 7 July 2002 pp 91-91. Fulltext. Click here to view fulltext PDF. Permanent link: https://www.ias.ac.in/article/fulltext/reso/007/07/0091-0091. Author Affiliations.

4. MM Algorithms for Geometric and Signomial Programming.

Science.gov (United States)

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.

5. Optimization of biotechnological systems through geometric programming

Directory of Open Access Journals (Sweden)

Torres Nestor V

2007-09-01

Full Text Available Abstract 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

6. Two solvable problems of planar geometrical optics.

Science.gov (United States)

Borghero, Francesco; Bozis, George

2006-12-01

In the framework of geometrical optics we consider a two-dimensional transparent inhomogeneous isotropic medium (dispersive or not). We show that (i) for any family belonging to a certain class of planar monoparametric families of monochromatic light rays given in the form f(x,y)=c of any definite color and satisfying a differential condition, all the refractive index profiles n=n(x,y) allowing for the creation of the given family can be found analytically (inverse problem) and that (ii) for any member of a class of two-dimensional refractive index profiles n=n(x,y) satisfying a differential condition, all the compatible families of light rays can be found analytically (direct problem). We present appropriate examples.

7. Monomial geometric programming with an arbitrary fuzzy relational inequality

Directory of Open Access Journals (Sweden)

E. Shivanian

2015-11-01

Full Text Available In this paper, an optimization model with geometric objective function is presented. Geometric programming is widely used; many objective functions in optimization problems can be analyzed by geometric programming. We often encounter these in resource allocation and structure optimization and technology management, etc. On the other hand, fuzzy relation equalities and inequalities are also used in many areas. We here present a geometric programming model with a monomial objective function subject to the fuzzy relation inequality constraints with an arbitrary function. The feasible solution set is determined and compared with some common results in the literature. A necessary and sufficient condition and three other necessary conditions are presented to conceptualize the feasibility of the problem. In general a lower bound is always attainable for the optimal objective value by removing the components having no effect on the solution process. By separating problem to non-decreasing and non-increasing function to prove the optimal solution, we simplify operations to accelerate the resolution of the problem.

8. Universal geometrical module for MARS program

International Nuclear Information System (INIS)

Talanov, V.V.

1992-01-01

Geometrical program module for modeling hadron and electromagnetic cascades, which accomplishes comparison of physical coordinates with the particle current state of one of the auxilliary cells, is described. The whole medium wherein the particles are tracked, is divided into a certain number of auxilliary cells. The identification algorithm of the cell, through which the particle trajectory passes, is considered in detail. The described algorithm for cell identification was developed for the MARS program and realized in form of a set of subprograms written in the FORTRAN language. 4 refs., 1 tab

9. Remarks on the geometric quantization of the Kepler problem

International Nuclear Information System (INIS)

Gaeta, G.; Spera, M.

1988-01-01

The geometric quantization of the (three-dimensional) Kepler problem is readily obtained from the one of the harmonic oscillator using a Segre map. The physical meaning of the latter is discussed. (orig.)

10. Geometric modeling in the problem of ball bearing accuracy

Science.gov (United States)

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.

11. Renormgroup symmetries in problems of nonlinear geometrical optics

International Nuclear Information System (INIS)

Kovalev, V.F.

1996-01-01

Utilization and further development of the previously announced approach [1,2] enables one to construct renormgroup symmetries for a boundary value problem for the system of equations which describes propagation of a powerful radiation in a nonlinear medium in geometrical optics approximation. With the help of renormgroup symmetries new rigorous and approximate analytical solutions of nonlinear geometrical optics equations are obtained. Explicit analytical expressions are presented that characterize spatial evolution of laser beam which has an arbitrary intensity dependence at the boundary of the nonlinear medium. (author)

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

Science.gov (United States)

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.

13. Implementation of the geometrical problem in CNC metal cutting machine

Directory of Open Access Journals (Sweden)

Erokhin V.V.

2017-06-01

Full Text Available The article deals with the tasks of managing the production process (technological process and technological equip-ment, the most detailed analysis of the implementation of the geometric problem in CNC machines. The influence of the solution of the geometric CNC problem on the accuracy of workpiece machining is analyzed by implementing a certain interpolation algorithm and the values of the discreteness of the movements of the working bodies of the CNC machine. The technique of forming a given trajectory of motion of the machine's executive organ is given, by means of which it is required to ensure the coordinated movement of the shaping coordinates according to a certain law, depend-ing on the specified trajectory of the cutting edge of the tool. The advantages and disadvantages of the implementation of interpolation in CNC systems by various methods are considered, and particular attention is paid to combined meth-ods of realizing interpolation.

14. Geometrical themes inspired by the n-body problem

CERN Document Server

Herrera, Haydeé; Herrera, Rafael

2018-01-01

Presenting a selection of recent developments in geometrical problems inspired by the N-body problem, these lecture notes offer a variety of approaches to study them, ranging from variational to dynamical, while developing new insights, making geometrical and topological detours, and providing historical references. A. Guillot’s notes aim to describe differential equations in the complex domain, motivated by the evolution of N particles moving on the plane subject to the influence of a magnetic field. Guillot studies such differential equations using different geometric structures on complex curves (in the sense of W. Thurston) in order to find isochronicity conditions.   R. Montgomery’s notes deal with a version of the planar Newtonian three-body equation. Namely, he investigates the problem of whether every free homotopy class is realized by a periodic geodesic. The solution involves geometry, dynamical systems, and the McGehee blow-up. A novelty of the approach is the use of energy-balance in order t...

15. Geometric differential evolution for combinatorial and programs spaces.

Science.gov (United States)

Moraglio, A; Togelius, J; Silva, S

2013-01-01

Geometric differential evolution (GDE) is a recently introduced formal generalization of traditional differential evolution (DE) that can be used to derive specific differential evolution algorithms for both continuous and combinatorial spaces retaining the same geometric interpretation of the dynamics of the DE search across representations. In this article, we first review the theory behind the GDE algorithm, then, we use this framework to formally derive specific GDE for search spaces associated with binary strings, permutations, vectors of permutations and genetic programs. The resulting algorithms are representation-specific differential evolution algorithms searching the target spaces by acting directly on their underlying representations. We present experimental results for each of the new algorithms on a number of well-known problems comprising NK-landscapes, TSP, and Sudoku, for binary strings, permutations, and vectors of permutations. We also present results for the regression, artificial ant, parity, and multiplexer problems within the genetic programming domain. Experiments show that overall the new DE algorithms are competitive with well-tuned standard search algorithms.

16. The problem 7 forming triangular geometric line field

Directory of Open Access Journals (Sweden)

2016-01-01

Full Text Available Investigated a method of formation of triangular networks in the field. Delivered conditions the problem of locating a triangular network in the area. The criterion for assessing the effectiveness of the solution of the problem is the minimum number of sizes of the dome elements, the possibility of pre-assembly and pre-stressing. The solution of the problem of one embodiment of a triangular network of accommodation in a compatible spherical triangle and, accordingly, on the sphere. Optimization of triangular geometric network on a sphere on the criterion of minimum sizes of elements can be solved by placing the system in an irregular hexagon inscribed in a circle of minimal size, maximum regular hexagons.

17. The problem 4 of placement triangular geometric line field

Directory of Open Access Journals (Sweden)

2016-01-01

Full Text Available One of the a method of formation of triangular networks in the field is investigated. Conditions the problem of locating a triangular network in the area are delivered. The criterion for assessing the effectiveness of the solution of the problem is the minimum number of sizes of the dome elements, the possibility of pre-assembly and pre-stressing. The solution of the problem of one embodiment of a triangular network of accommodation in a compatible spherical triangle and, accordingly, on the sphere. Optimization of triangular geometric network on a sphere on the criterion of minimum sizes of elements can be solved by placing the system in an irregular hexagon inscribed in a circle of minimal size, maximum regular hexagons.

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

International Nuclear Information System (INIS)

Anglin, J.R.; Schmiedmayer, J.

2004-01-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 3 singularity which is an artifact of the adiabatic approximation

19. Neutrosophic Integer Programming Problem

Directory of Open Access Journals (Sweden)

Mai Mohamed

2017-02-01

Full Text Available In this paper, we introduce the integer programming in neutrosophic environment, by considering coffecients of problem as a triangulare neutrosophic numbers. The degrees of acceptance, indeterminacy and rejection of objectives are simultaneously considered.

20. Constant-work-space algorithms for geometric problems

Directory of Open Access Journals (Sweden)

Tetsuo Asano

2011-07-01

Full Text Available Constant-work-space algorithms may use only constantly many cells of storage in addition to their input, which is provided as a read-only array. We show how to construct several geometric structures efficiently in the constant-work-space model. Traditional algorithms process the input into a suitable data structure (like a doubly-connected edge list that allows efficient traversal of the structure at hand. In the constant-work-space setting, however, we cannot afford to do this. Instead, we provide operations that compute the desired features on the fly by accessing the input with no extra space. The whole geometric structure can be obtained by using these operations to enumerate all the features. Of course, we must pay for the space savings by slower running times. While the standard data structure allows us to implement traversal operations in constant time, our schemes typically take linear time to read the input data in each step.We begin with two simple problems: triangulating a planar point set and finding the trapezoidal decomposition of a simple polygon. In both cases adjacent features can be enumerated in linear time per step, resulting in total quadratic running time to output the whole structure. Actually, we show that the former result carries over to the Delaunay triangulation, and hence the Voronoi diagram. This also means that we can compute the largest empty circle of a planar point set in quadratic time and constant work-space. As another application, we demonstrate how to enumerate the features of an Euclidean minimum spanning tree (EMST in quadratic time per step, so that the whole EMST can be found in cubic time using constant work-space.Finally, we describe how to compute a shortest geodesic path between two points in a simple polygon. Although the shortest path problem in general graphs is NL-complete (Jakoby and Tantau 2003, this constrained problem can be solved in quadratic time using only constant work-space.

1. Geometric Semantic Genetic Programming Algorithm and Slump Prediction

OpenAIRE

Xu, Juncai; Shen, Zhenzhong; Ren, Qingwen; Xie, Xin; Yang, Zhengyu

2017-01-01

Research on the performance of recycled concrete as building material in the current world is an important subject. Given the complex composition of recycled concrete, conventional methods for forecasting slump scarcely obtain satisfactory results. Based on theory of nonlinear prediction method, we propose a recycled concrete slump prediction model based on geometric semantic genetic programming (GSGP) and combined it with recycled concrete features. Tests show that the model can accurately p...

2. Variability of worked examples and transfer of geometrical problem-solving skills : a cognitive-load approach

NARCIS (Netherlands)

Paas, Fred G.W.C.; van Merrienboer, Jeroen J.G.; van Merrienboer, J.J.G.

1994-01-01

Four computer-based training strategies for geometrical problem solving in the domain of computer numerically controlled machinery programming were studied with regard to their effects on training performance, transfer performance, and cognitive load. A low- and a high-variability conventional

3. Functional geometric method for solving free boundary problems for harmonic functions

Energy Technology Data Exchange (ETDEWEB)

Demidov, Aleksander S [M. V. Lomonosov Moscow State University, Moscow (Russian Federation)

2010-01-01

A survey is given of results and approaches for a broad spectrum of free boundary problems for harmonic functions of two variables. The main results are obtained by the functional geometric method. The core of these methods is an interrelated analysis of the functional and geometric characteristics of the problems under consideration and of the corresponding non-linear Riemann-Hilbert problems. An extensive list of open questions is presented. Bibliography: 124 titles.

4. Growing geometric reasoning in solving problems of analytical geometry through the mathematical communication problems to state Islamic university students

Science.gov (United States)

Mujiasih; Waluya, S. B.; Kartono; Mariani

2018-03-01

Skills in working on the geometry problems great needs of the competence of Geometric Reasoning. As a teacher candidate, State Islamic University (UIN) students need to have the competence of this Geometric Reasoning. When the geometric reasoning in solving of geometry problems has grown well, it is expected the students are able to write their ideas to be communicative for the reader. The ability of a student's mathematical communication is supposed to be used as a marker of the growth of their Geometric Reasoning. Thus, the search for the growth of geometric reasoning in solving of analytic geometry problems will be characterized by the growth of mathematical communication abilities whose work is complete, correct and sequential, especially in writing. Preceded with qualitative research, this article was the result of a study that explores the problem: Was the search for the growth of geometric reasoning in solving analytic geometry problems could be characterized by the growth of mathematical communication abilities? The main activities in this research were done through a series of activities: (1) Lecturer trains the students to work on analytic geometry problems that were not routine and algorithmic process but many problems that the process requires high reasoning and divergent/open ended. (2) Students were asked to do the problems independently, in detail, complete, order, and correct. (3) Student answers were then corrected each its stage. (4) Then taken 6 students as the subject of this research. (5) Research subjects were interviewed and researchers conducted triangulation. The results of this research, (1) Mathematics Education student of UIN Semarang, had adequate the mathematical communication ability, (2) the ability of this mathematical communication, could be a marker of the geometric reasoning in solving of problems, and (3) the geometric reasoning of UIN students had grown in a category that tends to be good.

5. The Geometric Construction Abilities Of Gifted Students In Solving Real - World Problems: A Case From Turkey

Directory of Open Access Journals (Sweden)

Avni YILDIZ

2016-10-01

Full Text Available 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 abilities of ninth-grade (15 years old gifted students in solving real-world geometry problems; thus a case study was conducted. Six gifted students participated in the study. The data consisted of voice records, solutions, and models made by the students on the GeoGebra screen. Results indicate that gifted students use their previous knowledge effectively during the process of geometric construction. They modeled the situations available in the problems through using mathematical concepts and the software in coordination. Therefore, it is evident that gifted students think more creatively while solving problems using GeoGebra.

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

Science.gov (United States)

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…

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

Science.gov (United States)

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.

8. A Geometric Problem and the Hopf Lemma. Ⅱ

Institute of Scientific and Technical Information of China (English)

YanYan LI; Louis NIRENBERG

2006-01-01

A classical result of A. D. Alexandrov states that a connected compact smooth n-dimensional manifold without boundary, embedded in Rn+1, and such that its mean curvature is constant, is a sphere. Here we study the problem of symmetry of M in a hyperplane Xn+1 =constant in case M satisfies: for any two points (X′, Xn+1), (X′, ^Xn+1)on M, with Xn+1 ＞ ^Hn+1, the mean curvature at the first is not greater than that at the second. Symmetry need not always hold, but in this paper, we establish it under some additional conditions. Some variations of the Hopf Lemma are also presented. Several open problems are described. Part Ⅰ dealt with corresponding one dimensional problems.

9. Using the Van Hiele theory to analyze primary school teachers' written work on geometrical proof problems

Science.gov (United States)

Jupri, A.

2018-05-01

The lack of ability of primary school teachers in deductive thinking, such as doing geometrical proof, is an indispensable issue to be dealt with. In this paper, we report on results of a three-step of the field document study. The study was part of a pilot study for improving deductive thinking ability of primary school teachers. First, we designed geometrical proof problems adapted from literature. Second, we administered an individual written test involving nine master students of primary education program, in which they are having experiences as primary school mathematics teachers. Finally, we analyzed the written work from the view of the Van Hiele theory. The results revealed that even if about the half of the teachers show ability in doing formal proof, still the rest provides inappropriate proving. For further investigation, we wonder whether primary school teachers would show better deductive thinking if the teaching of geometry is designed in a systematic and appropriate manner according to the Van Hiele theory.

10. Some geometrical problems related to the rotation camera. Pt. 1

International Nuclear Information System (INIS)

Taupin, D.

1985-01-01

An algorithm for a safe generation of the table of expected reflections in the Arndt-Wonnacott rotation camera is given. It relies upon classic quadratic matrixalgebra. Some mathematical theorems are recalled. This algorithm is part of a series of programs developed at Orsay for the treatment of rotation-camera photographs. (orig.)

11. Geometric Generalisation of Surrogate Model-Based Optimisation to Combinatorial and Program Spaces

Directory of Open Access Journals (Sweden)

Yong-Hyuk Kim

2014-01-01

Full Text Available Surrogate models (SMs can profitably be employed, often in conjunction with evolutionary algorithms, in optimisation in which it is expensive to test candidate solutions. The spatial intuition behind SMs makes them naturally suited to continuous problems, and the only combinatorial problems that have been previously addressed are those with solutions that can be encoded as integer vectors. We show how radial basis functions can provide a generalised SM for combinatorial problems which have a geometric solution representation, through the conversion of that representation to a different metric space. This approach allows an SM to be cast in a natural way for the problem at hand, without ad hoc adaptation to a specific representation. We test this adaptation process on problems involving binary strings, permutations, and tree-based genetic programs.

12. The Creativity of Reflective and Impulsive Selected Students in Solving Geometric Problems

Science.gov (United States)

Shoimah, R. N.; Lukito, A.; Siswono, T. Y. E.

2018-01-01

This research purposed to describe the elementary students’ creativity with reflective and impulsive cognitive style in solving geometric problems. This research used qualitative research methods. The data was collected by written tests and task-based interviews. The subjects consisted of two 5th grade students that were measured by MFFT (Matching Familiar Figures Test). The data were analyzed based on the three main components of creativity; that is fluency, flexibility, and novelty. This results showed that subject with reflective cognitive style in solving geometric problems met all components of creativity (fluency; subject generated more than three different right-ideas in solving problems, flexibility; subject generated more than two different ways to get problem solved, and novelty; subject generated new ideas and new ways that original and has never been used before). While subject with impulsive cognitive style in solving geometric problems met two components of creativity (fluency; subject generated more than three different right-ideas in solving problems, flexibility; subject generated two different ways to get problem solved). Thus, it could be concluded that reflective students are more creative in solving geometric problems. The results of this research can also be used as a guideline in the future assessment of creativity based on cognitive style.

13. Lyapunov vs. geometrical stability analysis of the Kepler and the restricted three body problems

International Nuclear Information System (INIS)

Yahalom, A.; Levitan, J.; Lewkowicz, M.; Horwitz, L.

2011-01-01

In this Letter we show that although the application of standard Lyapunov analysis predicts that completely integrable Kepler motion is unstable, the geometrical analysis of Horwitz et al. predicts the observed stability. This seems to us to provide evidence for both the incompleteness of the standard Lyapunov analysis and the strength of the geometrical analysis. Moreover, we apply this approach to the three body problem in which the third body is restricted to move on a circle of large radius which induces an adiabatic time dependent potential on the second body. This causes the second body to move in a very interesting and intricate but periodic trajectory; however, the standard Lyapunov analysis, as well as methods based on the parametric variation of curvature associated with the Jacobi metric, incorrectly predict chaotic behavior. The geometric approach predicts the correct stable motion in this case as well. - Highlights: → Lyapunov analysis predicts Kepler motion to be unstable. → Geometrical analysis predicts the observed stability. → Lyapunov analysis predicts chaotic behavior in restricted three body problem. → The geometric approach predicts the correct stable motion in restricted three body problem.

14. Using Priors to Compensate Geometrical Problems in Head-Mounted Eye Trackers

DEFF Research Database (Denmark)

Batista Narcizo, Fabricio; Ahmed, Zaheer; Hansen, Dan Witzner

The use of additional information (a.k.a. priors) to help the eye tracking process is presented as an alternative to compensate classical geometrical problems in head-mounted eye trackers. Priors can be obtained from several distinct sources, such as: sensors to collect information related...... estimation specially for uncalibrated head-mounted setups....

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

Science.gov (United States)

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.

16. Numerical nonlinear complex geometrical optics algorithm for the 3D Calderón problem

DEFF Research Database (Denmark)

Delbary, Fabrice; Knudsen, Kim

2014-01-01

to the generalized Laplace equation. The 3D problem was solved in theory in late 1980s using complex geometrical optics solutions and a scattering transform. Several approximations to the reconstruction method have been suggested and implemented numerically in the literature, but here, for the first time, a complete...... computer implementation of the full nonlinear algorithm is given. First a boundary integral equation is solved by a Nystrom method for the traces of the complex geometrical optics solutions, second the scattering transform is computed and inverted using fast Fourier transform, and finally a boundary value...

17. Development of Geometrical Quality Control Real-time Analysis Program using an Electronic Portal Imaging

International Nuclear Information System (INIS)

Lee, Sang Rok; Jung, Kyung Yong; Jang, Min Sun; Lee, Byung Gu; Kwon, Young Ho

2012-01-01

To develop a geometrical quality control real-time analysis program using an electronic portal imaging to replace film evaluation method. A geometrical quality control item was established with the Eclipse treatment planning system (Version 8.1, Varian, USA) after the Electronic Portal Imaging Device (EPID) took care of the problems occurring from the fixed substructure of the linear accelerator (CL-iX, Varian, USA). Electronic portal image (single exposure before plan) was created at the treatment room's 4DTC (Version 10.2, Varian, USA) and a beam was irradiated in accordance with each item. The gaining the entire electronic portal imaging at the Off-line review and was evaluated by a self-developed geometrical quality control real-time analysis program. As for evaluation methods, the intra-fraction error was analyzed by executing 5 times in a row under identical conditions and procedures on the same day, and in order to confirm the infer-fraction error, it was executed for 10 days under identical conditions of all procedures and was compared with the film evaluation method using an Iso-align quality control device. Measurement and analysis time was measured by sorting the time into from the device setup to data achievement and the time amount after the time until the completion of analysis and the convenience of the users and execution processes were compared. The intra-fraction error values for each average 0.1, 0.2, 0.3, 0.2 mm at light-radiation field coincidence, collimator rotation axis, couch rotation axis and gantry rotation axis. By checking the infer-fraction error through 10 days of continuous quality control, the error values obtained were average 1.7, 1.4, 0.7, 1.1 mm for each item. Also, the measurement times were average 36 minutes, 15 minutes for the film evaluation method and electronic portal imaging system, and the analysis times were average 30 minutes, 22 minutes. When conducting a geometrical quality control using an electronic portal imaging

18. Boundary Element Solution of Geometrical Inverse Heat Conduction Problems for Development of IR CAT Scan

International Nuclear Information System (INIS)

Choi, C. Y.; Park, C. T.; Kim, T. H.; Han, K. N.; Choe, S. H.

1995-01-01

A geometrical inverse heat conduction problem is solved for the development of Infrared Computerized-Axial-Tomography (IR CAT) Scan by using a boundary element method in conjunction with regularization procedure. In this problem, an overspecified temperature condition by infrared scanning is provided on the surface, and is used together with other conditions to solve the position of an unknown boundary (cavity). An auxiliary problem is introduced in the solution of this problem. By defining a hypothetical inner boundary for the auxiliary problem domain, the cavity is located interior to the domain and its position is determined by solving a potential problem. Boundary element method with regularization procedure is used to solve this problem, and the effects of regularization on the inverse solution method are investigated by means of numerical analysis

19. Adolescent Assertiveness: Problems and Programs.

Science.gov (United States)

Reece, Randi S.; Wilborn, Bobbie L.

1980-01-01

Assertiveness training programs in the school setting provide a method to work with students with behavior problems. When students can manage their environments more effectively, they view the educational experience more positively and find that their present world and their transition to the adult world proceeds more productively. (Author)

20. The problem of assessing landmark error in geometric morphometrics: theory, methods, and modifications.

Science.gov (United States)

von Cramon-Taubadel, Noreen; Frazier, Brenda C; Lahr, Marta Mirazón

2007-09-01

Geometric morphometric methods rely on the accurate identification and quantification of landmarks on biological specimens. As in any empirical analysis, the assessment of inter- and intra-observer error is desirable. A review of methods currently being employed to assess measurement error in geometric morphometrics was conducted and three general approaches to the problem were identified. One such approach employs Generalized Procrustes Analysis to superimpose repeatedly digitized landmark configurations, thereby establishing whether repeat measures fall within an acceptable range of variation. The potential problem of this error assessment method (the "Pinocchio effect") is demonstrated and its effect on error studies discussed. An alternative approach involves employing Euclidean distances between the configuration centroid and repeat measures of a landmark to assess the relative repeatability of individual landmarks. This method is also potentially problematic as the inherent geometric properties of the specimen can result in misleading estimates of measurement error. A third approach involved the repeated digitization of landmarks with the specimen held in a constant orientation to assess individual landmark precision. This latter approach is an ideal method for assessing individual landmark precision, but is restrictive in that it does not allow for the incorporation of instrumentally defined or Type III landmarks. Hence, a revised method for assessing landmark error is proposed and described with the aid of worked empirical examples. (c) 2007 Wiley-Liss, Inc.

1. Investigating Pre-service Mathematics Teachers’ Geometric Problem Solving Process in Dynamic Geometry Environment

Directory of Open Access Journals (Sweden)

Deniz Özen

2013-03-01

Full Text Available The aim of this study is to investigate pre-service elementary mathematics teachers’ open geometric problem solving process in a Dynamic Geometry Environment. With its qualitative inquiry based research design employed, the participants of the study are three pre-service teachers from 4th graders of the Department of Elementary Mathematics Teaching. In this study, clinical interviews, screencaptures of the problem solving process in the Cabri Geomery Environment, and worksheets included 2 open geometry problems have been used to collect the data. It has been investigated that all the participants passed through similar recursive phases as construction, exploration, conjecture, validate, and justification in the problem solving process. It has been thought that this study provide a new point of view to curriculum developers, teachers and researchers

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

International Nuclear Information System (INIS)

Asnafi, Alireza; Mahzoon, Mojtaba

2011-01-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.

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

Energy Technology Data Exchange (ETDEWEB)

Asnafi, Alireza [Hydro-Aeronautical Research Center, Shiraz University, Shiraz, 71348-13668 (Iran, Islamic Republic of); Mahzoon, Mojtaba [Department of Mechanical Engineering, School of Engineering, Shiraz University, Shiraz, 71348-13668 (Iran, Islamic Republic of)

2011-09-15

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.

4. Generalization of the geometric optical series approach for nonadiabatic scattering problems

International Nuclear Information System (INIS)

Herman, M.F.

1982-01-01

The geometric optical series approach of Bremmer is generalized for multisurface nonadiabatic scattering problems. This method yields the formal solution of the Schroedinger equation as an infinite series of multiple integrals. The zeroth order term corresponds to WKB propagation on a single adiabatic surface, while the general Nth order term involves N reflections and/or transitions between surfaces accompanied by ''free,'' single surface semiclassical propagation between the points of reflection and transition. Each term is integrated over all possible transition and reflection points. The adiabatic and diabatic limits of this expression are discussed. Numerical results, in which all reflections are ignored, are presented for curve crossing and noncrossing problems. These results are compared to exact quantum results and are shown to be highly accurate

5. Geometrical Modification of Learning Vector Quantization Method for Solving Classification Problems

Directory of Open Access Journals (Sweden)

Korhan GÜNEL

2016-09-01

Full Text Available In this paper, a geometrical scheme is presented to show how to overcome an encountered problem arising from the use of generalized delta learning rule within competitive learning model. It is introduced a theoretical methodology for describing the quantization of data via rotating prototype vectors on hyper-spheres.The proposed learning algorithm is tested and verified on different multidimensional datasets including a binary class dataset and two multiclass datasets from the UCI repository, and a multiclass dataset constructed by us. The proposed method is compared with some baseline learning vector quantization variants in literature for all domains. Large number of experiments verify the performance of our proposed algorithm with acceptable accuracy and macro f1 scores.

6. Geometric characterization for the least Lagrangian action of n-body problems

Institute of Scientific and Technical Information of China (English)

ZHANG; Shiqing

2001-01-01

［1］Manev, G., La gravitation et l'énergie au zéro, Comptes Rendus, 924, 78: 259.［2］Diacu, F. N., Near-collision dynamics for particle systems with quasihomogeneous potentials, J. of Diff. Equ., 996, 28: 58.［3］Ambrosetti, A., Coti Zelati, V., Periodic Solutions of Singular Lagrangian Systems, Basel: Birkhuser, 993.［4］Arnold, V., Kozlov, V., Neishtadt, A., Dynamical Systems (iii): Mathematical Aspects of Classical and Celestial Mechanics, Berlin: Springer-Verlag, 988.［5］Chenciner, A., Desolneux, N., Minima de l'intégrale d'action et équilibres relatifs de n corps, C R Acad. Sci. Paris, serie I, 998, 326: 209.［6］Coti Zelati, V., The periodic solutions of n-body type problems, Ann IHP Anal nonlinéaire, 990, 7: 477.［7］Euler, L., De motu rectilineo trium corprum se mutuo attrahentium, Novi. Comm. Acad. Sci. Imp. Petropll, 767: 45.［8］Gordon, W., A minimizing property of Keplerian orbits, Amer. J. Math., 977, 99: 96.［9］Lagrange, J., Essai sur le problé me des trois corps, 772, Ouvres, 783, 3: 229.［10］Long, Y., Zhang, S. Q., Geometric characterization for variational minimization solutions of the 3-body problem, Chinese Science Bulletin, 999, 44(8): 653.［11］Long, Y., Zhang, S. Q., Geometric characterization for variational minimization solutions of the 3-body problem with fixed energy, J. of Diff. Equ., 2000, 60: 422.［12］Meyer, K., Hall, G., Introduction to Hamiltonian systems and the n-body problems, Berlin: Springer-Verlag,992.［13］Serra, E., Terracini, S., Collisionless periodic solutions to some three-body problems, Arch. Rational Mech. Anal., 992, 20: 305.［14］Siegle, C., Moser, J., Lectures on Celestial Mechanics, Berlin: Springer-Verlag, 97.［15］Wintner, A., Analytical Foundations of Celestial Mechanics, Princeton: Princeton University Press, 94.［16］Hardy, G., Littlewood, J., Pólya, G., Inequalities, 2nd ed., Cambridge: Combridge University Press, 952.

7. Measurement problem in PROGRAM UNIVERSE

International Nuclear Information System (INIS)

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 127 + 136 strings organized by some representation of the closed, four level, combinatorial hierarchy, of bit-length N 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 Novel Attempt for Finding Minimum Solution in Fuzzy Neutrosophic Relational Geometric Programming (FNRGP with (max,min Composition

Directory of Open Access Journals (Sweden)

Huda E. Khalid

2016-08-01

Full Text Available This article sheds light on the possibility of finding the minimum solution set of neutrosophic relational geometric programming with (max, min composition. This work examines the privacy enjoyed by both neutrosophic logic and geometric programming, and how it affects the minimum solutions.

9. Bivium as a Mixed Integer Programming Problem

DEFF Research Database (Denmark)

Borghoff, Julia; Knudsen, Lars Ramkilde; Stolpe, Mathias

2009-01-01

over $GF(2)$ into a combinatorial optimization problem. We convert the Boolean equation system into an equation system over $\\mathbb{R}$ and formulate the problem of finding a $0$-$1$-valued solution for the system as a mixed-integer programming problem. This enables us to make use of several...

10. Geometric programming facilities of EusLisp and assembly goal planner

International Nuclear Information System (INIS)

Matsui, Toshihiro; Sakane, Shigeyuki; Hirukawa, Hirohisa

1994-01-01

For robots in power plants to accomplish intelligent tasks such as maintenance, inspection, and assembly, the robots must have planning capabilities based on shape models of the environment. Such shape models are defined and manipulated by a program called a geometric modeler or a solid modeler. Although there are commercial solid modelers in the market, they are not always suitable for robotics research, since it is hard to integrate higher level planning functions which frequently access internal model representation. In order to accelerate advanced robotics research, we need a generic, extensible, efficient, and integration-oriented geometric modeler. After reviewing available modelers, we concluded that the object-oriented Lisp can be the best implementation language for solid modeling. The next section introduces the programming language, 'EusLisp', tuned for implementing a solid modeler for intelligent robot programming. The design philosophy and the structure and functions of EusLisp are stated. In the following sections, EusLisp's applications, i.e., viewpoint and light-source location planning, derivation of motion constraint, and assembly goal planning, are discussed. (J.P.N.)

11. Geometric correction of radiographic images using general purpose image processing program

International Nuclear Information System (INIS)

Kim, Eun Kyung; Cheong, Ji Seong; Lee, Sang Hoon

1994-01-01

The present study was undertaken to compare geometric corrected image by general-purpose image processing program for the Apple Macintosh II computer (NIH Image, Adobe Photoshop) with standardized image by individualized custom fabricated alignment instrument. Two non-standardized periapical films with XCP film holder only were taken at the lower molar portion of 19 volunteers. Two standardized periapical films with customized XCP film holder with impression material on the bite-block were taken for each person. Geometric correction was performed with Adobe Photoshop and NIH Image program. Specially, arbitrary image rotation function of 'Adobe Photoshop' and subtraction with transparency function of 'NIH Image' were utilized. The standard deviations of grey values of subtracted images were used to measure image similarity. Average standard deviation of grey values of subtracted images if standardized group was slightly lower than that of corrected group. However, the difference was found to be statistically insignificant (p>0.05). It is considered that we can use 'NIH Image' and 'Adobe Photoshop' program for correction of nonstandardized film, taken with XCP film holder at lower molar portion.

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

Science.gov (United States)

2015-06-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.

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

International Nuclear Information System (INIS)

Bouchard, Bruno; Vu, Thanh Nam

2010-01-01

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.

14. Methods of geometric function theory in classical and modern problems for polynomials

International Nuclear Information System (INIS)

2012-01-01

This paper gives a survey of classical and modern theorems on polynomials, proved using methods of geometric function theory. Most of the paper is devoted to results of the author and his students, established by applying majorization principles for holomorphic functions, the theory of univalent functions, the theory of capacities, and symmetrization. Auxiliary results and the proofs of some of the theorems are presented. Bibliography: 124 titles.

15. Enhancing creative problem solving in an integrated visual art and geometry program: A pilot study

NARCIS (Netherlands)

Schoevers, E.M.; Kroesbergen, E.H.; Pitta-Pantazi, D.

2017-01-01

This article describes a new pedagogical method, an integrated visual art and geometry program, which has the aim to increase primary school students' creative problem solving and geometrical ability. This paper presents the rationale for integrating visual art and geometry education. Furthermore

16. Geometric analysis

CERN Document Server

Bray, Hubert L; Mazzeo, Rafe; Sesum, Natasa

2015-01-01

This volume includes expanded versions of the lectures delivered in the Graduate Minicourse portion of the 2013 Park City Mathematics Institute session on Geometric Analysis. The papers give excellent high-level introductions, suitable for graduate students wishing to enter the field and experienced researchers alike, to a range of the most important areas of geometric analysis. These include: the general issue of geometric evolution, with more detailed lectures on Ricci flow and Kähler-Ricci flow, new progress on the analytic aspects of the Willmore equation as well as an introduction to the recent proof of the Willmore conjecture and new directions in min-max theory for geometric variational problems, the current state of the art regarding minimal surfaces in R^3, the role of critical metrics in Riemannian geometry, and the modern perspective on the study of eigenfunctions and eigenvalues for Laplace-Beltrami operators.

17. Geometrical properties of rough metallic surfaces and their implication in electromagnetic problems

International Nuclear Information System (INIS)

Hernandez, A.; Chicon, R.; Ortuno, M.; Abellan, J.

1987-01-01

We analyze the geometrical properties and their implications in the effective surface resistance and wall losses of rough metallic surfaces. The power spectrum and the autocorrelation function are calculated for a simple model that adequately represent the rough surface. The roughness parameters are obtained through average values of the roughness and its derivative. We calculate the density profile, directly related to the depth-dependent effective conductivity. The data from the profilometer are corrected to take into account the finite size of the tip. (author)

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

Directory of Open Access Journals (Sweden)

Ricardo Soto

2014-01-01

Full Text Available 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.

19. Employee assistance program treats personal problems.

Science.gov (United States)

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. 20. θ-convex nonlinear programming problems International Nuclear Information System (INIS) Emam, T. 2008-01-01 A class of sets and a class of functions called θ-convex sets and θ-convex functions are introduced by relaxing the definitions of convex sets and operator θ on the sets and domain of definition of the functions. The optimally results for θ-convex programming problems are established. 1. Three-dimensional inverse problem of geometrical optics: a mathematical comparison between Fermat's principle and the eikonal equation. Science.gov (United States) Borghero, Francesco; Demontis, Francesco 2016-09-01 In the framework of geometrical optics, we consider the following inverse problem: given a two-parameter family of curves (congruence) (i.e., f(x,y,z)=c1,g(x,y,z)=c2), construct the refractive-index distribution function n=n(x,y,z) of a 3D continuous transparent inhomogeneous isotropic medium, allowing for the creation of the given congruence as a family of monochromatic light rays. We solve this problem by following two different procedures: 1. By applying Fermat's principle, we establish a system of two first-order linear nonhomogeneous PDEs in the unique unknown function n=n(x,y,z) relating the assigned congruence of rays with all possible refractive-index profiles compatible with this family. Moreover, we furnish analytical proof that the family of rays must be a normal congruence. 2. By applying the eikonal equation, we establish a second system of two first-order linear homogeneous PDEs whose solutions give the equation S(x,y,z)=const. of the geometric wavefronts and, consequently, all pertinent refractive-index distribution functions n=n(x,y,z). Finally, we make a comparison between the two procedures described above, discussing appropriate examples having exact solutions. 2. Creating geometrically robust designs for highly sensitive problems using topology optimization: Acoustic cavity design DEFF Research Database (Denmark) Christiansen, Rasmus E.; Lazarov, Boyan S.; Jensen, Jakob S. 2015-01-01 Resonance and wave-propagation problems are known to be highly sensitive towards parameter variations. This paper discusses topology optimization formulations for creating designs that perform robustly under spatial variations for acoustic cavity problems. For several structural problems, robust...... and limitations are discussed. In addition, a known explicit penalization approach is considered for comparison. For near-uniform spatial variations it is shown that highly robust designs can be obtained using the double filter approach. It is finally demonstrated that taking non-uniform variations into account...... further improves the robustness of the designs.... 3. Geometrical foundations and results on a problem suggested in a paper by Anderson et al International Nuclear Information System (INIS) Gonzalez Gascon, F.; Moreno Insertis, F.; Rodriguez Camino, E. 1978-01-01 A global treatment is given to the problem proposed by Anderson et al. of finding second order differential equations not admitting pointlike transformations of symmetry but admitting families of local symmetries of non-pointlike character 4. Menu-Driven Solver Of Linear-Programming Problems Science.gov (United States) 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). 5. Programming languages for business problem solving CERN Document Server Wang, Shouhong 2007-01-01 It has become crucial for managers to be computer literate in today's business environment. It is also important that those entering the field acquire the fundamental theories of information systems, the essential practical skills in computer applications, and the desire for life-long learning in information technology. Programming Languages for Business Problem Solving presents a working knowledge of the major programming languages, including COBOL, C++, Java, HTML, JavaScript, VB.NET, VBA, ASP.NET, Perl, PHP, XML, and SQL, used in the current business computing environment. The book examin 6. Primal and Dual Penalty Methods for Contact Problems with Geometrical Non-linearities Czech Academy of Sciences Publication Activity Database Vondrák, V.; Dostál, Z.; Dobiáš, Jiří; Pták, Svatopluk -, č. 5 (2005), s. 449-450 ISSN 1617-7061. [GAMM Annual Meeting 2005. Luxembourg, 28.03.2005-01.04.2005] R&D Projects: GA ČR(CZ) GA101/05/0423 Institutional research plan: CEZ:AV0Z20760514 Keywords : primal penalty * dual penalty * contact problem Subject RIV: BA - General Mathematics 7. Fifth SIAM conference on geometric design 97: Final program and abstracts. Final technical report Energy Technology Data Exchange (ETDEWEB) NONE 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. 8. Continuous reformulations for zero-one programming problems OpenAIRE Marianna De Santis; Francesco Rinaldi 2010-01-01 In this work, we study continuous reformulations of zero-one programming problems. We prove that, under suitable conditions, the optimal solutions of a zero-one programming problem can be obtained by solving a specific continuous problem. 9. Heuristic geometric ''eigenvalue universality'' in a one-dimensional neutron transport problem with anisotropic scattering International Nuclear Information System (INIS) Goncalves, G.A.; Vilhena, M.T. de; Bodmann, B.E.J. 2010-01-01 In the present work we propose a heuristic construction of a transport equation for neutrons with anisotropic scattering considering only the radial cylinder dimension. The eigenvalues of the solutions of the equation correspond to the positive values for the one dimensional case. The central idea of the procedure is the application of the S N method for the discretisation of the angular variable followed by the application of the zero order Hankel transformation. The basis the construction of the scattering terms in form of an integro-differential equation for stationary transport resides in the hypothesis that the eigenvalues that compose the elementary solutions are independent of geometry for a homogeneous medium. We compare the solutions for the cartesian one dimensional problem for an infinite cylinder with azimuthal symmetry and linear anisotropic scattering for two cases. (orig.) 10. Method of Geometric Connected Disk Cover Problem for UAV realy network deployment Directory of Open Access Journals (Sweden) Chuang Liu 2017-01-01 Full Text Available Aiming at the problem of the effective connectivity of a large number of mobile combat units in the future aeronautic swarm operation, this paper proposes an idea of using UAV(Unmanned Aerial Vehicle to build, and studies the deployment of the network. User coverage and network connectivity are important for a relay network planning which are studied separately in traditional ways. In order to effectively combine these two factors while the network’s survivability is taken into account. Firstly, the concept of node aggregation degree is proposed. Secondly, a performance evaluation parameter for UAV relay network is proposed based on node aggregation degree, then analyzes the lack of deterministic deployment and presents one a PSO (VFA-PSO deployment algorithm based on virtual force. Finally, compared with the existing algorithms, the validity and stability of the algorithm are verified. The experimental results show that the VFA-PSO algorithm can effectively improve the network coverage and the survivability of the network under the premise of ensuring the network connectivity, and has better deployment effect. 11. A geometrical multi-scale numerical method for coupled hygro-thermo-mechanical problems in photovoltaic laminates. Science.gov (United States) 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. 12. Geometric chaos indicators and computations of the spherical hypertube manifolds of the spatial circular restricted three-body problem Science.gov (United States) Guzzo, Massimiliano; Lega, Elena 2018-06-01 The circular restricted three-body problem has five relative equilibria L1 ,L2, . . . ,L5. The invariant stable-unstable manifolds of the center manifolds originating at the partially hyperbolic equilibria L1 ,L2 have been identified as the separatrices for the motions which transit between the regions of the phase-space which are internal or external with respect to the two massive bodies. While the stable and unstable manifolds of the planar problem have been extensively studied both theoretically and numerically, the spatial case has not been as deeply investigated. This paper is devoted to the global computation of these manifolds in the spatial case with a suitable finite time chaos indicator. The definition of the chaos indicator is not trivial, since the mandatory use of the regularizing Kustaanheimo-Stiefel variables may introduce discontinuities in the finite time chaos indicators. From the study of such discontinuities, we define geometric chaos indicators which are globally defined and smooth, and whose ridges sharply approximate the stable and unstable manifolds of the center manifolds of L1 ,L2. We illustrate the method for the Sun-Jupiter mass ratio, and represent the topology of the asymptotic manifolds using sections and three-dimensional representations. 13. Problems in Geometrical Optics Science.gov (United States) 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) 14. Multi-objective convex programming problem arising in multivariate ... African Journals Online (AJOL) user Multi-objective convex programming problem arising in ... However, although the consideration of multiple objectives may seem a novel concept, virtually any nontrivial ..... Solving multiobjective programming problems by discrete optimization. 15. Research program with no ''measurement problem'' International Nuclear Information System (INIS) 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 16. Contribution of Fuzzy Minimal Cost Flow Problem by Possibility Programming OpenAIRE S. Fanati Rashidi; A. A. Noora 2010-01-01 Using the concept of possibility proposed by zadeh, luhandjula ([4,8]) and buckley ([1]) have proposed the possibility programming. The formulation of buckley results in nonlinear programming problems. Negi [6]re-formulated the approach of Buckley by the use of trapezoidal fuzzy numbers and reduced the problem into fuzzy linear programming problem. Shih and Lee ([7]) used the Negi approach to solve a minimum cost flow problem, whit fuzzy costs and the upper and lower bound. ... 17. Multiparametric programming based algorithms for pure integer and mixed-integer bilevel programming problems KAUST Repository Domí nguez, Luis F.; Pistikopoulos, Efstratios N. 2010-01-01 continuous multiparametric programming algorithm is then used to solve the reformulated convex inner problem. The second algorithm addresses the mixed-integer case of the bilevel programming problem where integer and continuous variables of the outer problem 18. Library of problem-oriented programs for solving problems of atomic and nuclear physics International Nuclear Information System (INIS) Kharitonov, Yu.I. 1976-01-01 The Data Centre of the Leningrad Institute of Nuclear Physics (LIYaF) is working on the establishment of a library of problem-oriented computer programs for solving problems of atomic and nuclear physics. This paper lists and describes briefly the programs presently available to the Data Centre. The descriptions include the program code numbers, the program language, the translator for which the program is designed, and the program scope 19. A Dynamic Programming Algorithm for the k-Haplotyping Problem Institute of Scientific and Technical Information of China (English) Zhen-ping Li; Ling-yun Wu; Yu-ying Zhao; Xiang-sun Zhang 2006-01-01 The Minimum Fragments Removal (MFR) problem is one of the haplotyping problems: given a set of fragments, remove the minimum number of fragments so that the resulting fragments can be partitioned into k classes of non-conflicting subsets. In this paper, we formulate the k-MFR problem as an integer linear programming problem, and develop a dynamic programming approach to solve the k-MFR problem for both the gapless and gap cases. 20. K-Minimax Stochastic Programming Problems Science.gov (United States) 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. 1. Bilevel programming problems theory, algorithms and applications to energy networks CERN Document Server Dempe, Stephan; Pérez-Valdés, Gerardo A; Kalashnykova, Nataliya; Kalashnikova, Nataliya 2015-01-01 This book describes recent theoretical findings relevant to bilevel programming in general, and in mixed-integer bilevel programming in particular. It describes recent applications in energy problems, such as the stochastic bilevel optimization approaches used in the natural gas industry. New algorithms for solving linear and mixed-integer bilevel programming problems are presented and explained. 2. DETERMINING THE COMPOSITION OF HIGH TEMPERATURE COMBUSTION PRODUCTS OF FOSSIL FUEL BASED ON VARIATIONAL PRINCIPLES AND GEOMETRIC PROGRAMMING Directory of Open Access Journals (Sweden) Velibor V Vujović 2011-01-01 Full Text Available This paper presents the algorithm and results of a computer program for calculation of complex equilibrium composition for the high temperature fossil fuel combustion products. The method of determining the composition of high temperatures combustion products at the temperatures appearing in the open cycle MHD power generation is given. The determination of combustion product composition is based on minimization of the Gibbs free energy. The number of equations to be solved is reduced by using variational principles and a method of geometric programming and is equal to the sum of the numbers of elements and phases. A short description of the computer program for the calculation of the composition and an example of the results are also given. 3. A METHOD FOR SOLVING LINEAR PROGRAMMING PROBLEMS WITH FUZZY PARAMETERS BASED ON MULTIOBJECTIVE LINEAR PROGRAMMING TECHNIQUE OpenAIRE M. ZANGIABADI; H. R. MALEKI 2007-01-01 In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters based on those for multiobjective linear programming problems. Then by using the concept of comparison of fuzzy numbers, we transform a linear programming problem with fuzzy parameters to a multiobjective linear programming problem. To this end, w... 4. Contribution of Fuzzy Minimal Cost Flow Problem by Possibility Programming Directory of Open Access Journals (Sweden) S. Fanati Rashidi 2010-06-01 Full Text Available Using the concept of possibility proposed by zadeh, luhandjula ([4,8] and buckley ([1] have proposed the possibility programming. The formulation of buckley results in nonlinear programming problems. Negi [6]re-formulated the approach of Buckley by the use of trapezoidal fuzzy numbers and reduced the problem into fuzzy linear programming problem. Shih and Lee ([7] used the Negi approach to solve a minimum cost flow problem, whit fuzzy costs and the upper and lower bound. In this paper we shall consider the general form of this problem where all of the parameters and variables are fuzzy and also a model for solving is proposed 5. Language Program Evaluation: Decisions, Problems, and Solutions. Science.gov (United States) Brown, James Dean 1995-01-01 Discusses the evaluation of second and foreign language programs, focusing on whether such evaluations should be summative or formative; use outside experts or program staff; emphasize qualitative or quantitative data; and concentrate on the process or the product. An annotated bibliography discusses six important works in the field. (78… 6. Geometric Computing for Freeform Architecture KAUST Repository Wallner, J.; Pottmann, Helmut 2011-01-01 Geometric computing has recently found a new field of applications, namely the various geometric problems which lie at the heart of rationalization and construction-aware design processes of freeform architecture. We report on our work in this area 7. Constraint-based scheduling applying constraint programming to scheduling problems CERN Document Server Baptiste, Philippe; Nuijten, Wim 2001-01-01 Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl... 8. Improve Problem Solving Skills through Adapting Programming Tools Science.gov (United States) 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. 9. PROGRAMMING OF METHODS FOR THE NEEDS OF LOGISTICS DISTRIBUTION SOLVING PROBLEMS Directory of Open Access Journals (Sweden) Andrea Štangová 2014-06-01 Full Text Available Logistics has become one of the dominant factors which is affecting the successful management, competitiveness and mentality of the global economy. Distribution logistics materializes the connesciton of production and consumer marke. It uses different methodology and methods of multicriterial evaluation and allocation. This thesis adresses the problem of the costs of securing the distribution of product. It was therefore relevant to design a software product thet would be helpful in solvin the problems related to distribution logistics. Elodis – electronic distribution logistics program was designed on the basis of theoretical analysis of the issue of distribution logistics and on the analysis of the software products market. The program uses a multicriterial evaluation methods to deremine the appropriate type and mathematical and geometrical method to determine an appropriate allocation of the distribution center, warehouse and company. 10. Three-dimensional labeling program for elucidation of the geometric properties of biological particles in three-dimensional space. Science.gov (United States) Nomura, A; Yamazaki, Y; Tsuji, T; Kawasaki, Y; Tanaka, S 1996-09-15 For all biological particles such as cells or cellular organelles, there are three-dimensional coordinates representing the centroid or center of gravity. These coordinates and other numerical parameters such as volume, fluorescence intensity, surface area, and shape are referred to in this paper as geometric properties, which may provide critical information for the clarification of in situ mechanisms of molecular and cellular functions in living organisms. We have established a method for the elucidation of these properties, designated the three-dimensional labeling program (3DLP). Algorithms of 3DLP are so simple that this method can be carried out through the use of software combinations in image analysis on a personal computer. To evaluate 3DLP, it was applied to a 32-cell-stage sea urchin embryo, double stained with FITC for cellular protein of blastomeres and propidium iodide for nuclear DNA. A stack of optical serial section images was obtained by confocal laser scanning microscopy. The method was found effective for determining geometric properties and should prove applicable to the study of many different kinds of biological particles in three-dimensional space. 11. Refinement from a control problem to program DEFF Research Database (Denmark) Schenke, Michael; Ravn, Anders P. 1996-01-01 The distinguishing feature of the presented refinement approach is that it links formalisms from a top level requirements notation down to programs together in a mathematically coherent development trajectory. The approach uses Duration Calculus, a real-time interval logic, to specifyrequirements... 12. An Approach for Solving Linear Fractional Programming Problems OpenAIRE Andrew Oyakhobo Odior 2012-01-01 Linear fractional programming problems are useful tools in production planning, financial and corporate planning, health care and hospital planning and as such have attracted considerable research interest. The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebr... 13. Problem solving and Program design using the TI-92 NARCIS (Netherlands) Ir.ing. Ton Marée; ir Martijn van Dongen 2000-01-01 This textbook is intended for a basic course in problem solving and program design needed by scientists and engineers using the TI-92. The TI-92 is an extremely powerful problem solving tool that can help you manage complicated problems quickly. We assume no prior knowledge of computers or 14. WHO Polio Eradication Program: Problems and Solutions Directory of Open Access Journals (Sweden) S. M. Kharit 2016-01-01 Full Text Available In 2013 WHO re-evaluated its main goals of the polio eradication program. A modernization program was accepted with regard to the National vaccination calendars worldwide which includes a step-by-step refusal from the living polio vaccine (OPV and a total transition to the inactivated polio vaccine (IPV starting in 2019. Because of the total eradication of the polio type 2 virus, as an intermediate step the 3-valence OPV was substituted with the 2-valence OPV, which does not contain the type 2 polio virus, in April 2016. The aim of the article is to present the history of polio prevention and to state the reasons for the adoption of 3rd edition of the Global Polio Eradication Initiative. The new approaches were defined for eradication of wild polio virus type 1 and vaccine related strains. A new strategy for global switch to inactivated polio vaccine by 2019 was suggested. 15. THE TRAVELLING SALESMAN PROBLEM IN THE ENGINEERING EDUCATION PROGRAMMING CURRICULUM OpenAIRE Yevgeny Gayev; Vadim Kalmikov 2017-01-01 Objective: To make students familiar with the famous Traveling Salesman Problem (TSP) and suggest the latter to become a common exercise in engineering programming curriculum provided the students master computer science in the easy programming environment MATLAB. Methods: easy programming in MATLAB makes true such modern educational approach as “discovery based” methodology. Results: a MATLAB TSP-program oriented to Ukrainian map is suggested that allows to pictorially demonstrate the proces... 16. Measurement problem in Program Universe. Revision International Nuclear Information System (INIS) 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 17. Measurement problem in Program Universe. Revision Science.gov (United States) 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. 18. The geometric effect and programming current reduction in cylindrical-shaped phase change memory International Nuclear Information System (INIS) Li Yiming; Hwang, C-H; Li, T-Y; Cheng, H-W 2009-01-01 This study conducts a three-dimensional electro-thermal time-domain simulation for numerical analysis of cylindrical-shaped phase change memories (PCMs). The influence of chalcogenide material, germanium antimony telluride (GeSbTe or GST), structure on PCM operation is explored. GST with vertical structure exhibits promising characteristics. The bottom electrode contact (BEC) is advanced to improve the operation of PCMs, where a 25% reduction of the required programming current is achieved at a cost of 26% reduced resistance ratio. The position of the BEC is then shifted to further improve the performance of PCMs. The required programming current is reduced by a factor of 11, where the resistance ratio is only decreased by 6.9%. However, the PCMs with a larger shift of BEC are sensitive to process variation. To design PCMs with less than 10% programming current variation, PCMs with shifted BEC, where the shifted distance is equal to 1.5 times the BEC's radius, is worth considering. This study quantitatively estimates the structure effect on the phase transition of PCMs and physically provides an insight into the design and technology of PCMs. 19. THE TRAVELLING SALESMAN PROBLEM IN THE ENGINEERING EDUCATION PROGRAMMING CURRICULUM Directory of Open Access Journals (Sweden) Yevgeny Gayev 2017-11-01 Full Text Available Objective: To make students familiar with the famous Traveling Salesman Problem (TSP and suggest the latter to become a common exercise in engineering programming curriculum provided the students master computer science in the easy programming environment MATLAB. Methods: easy programming in MATLAB makes true such modern educational approach as “discovery based” methodology. Results: a MATLAB TSP-program oriented to Ukrainian map is suggested that allows to pictorially demonstrate the process of optimal route search with an option to decelerate or accelerate the demonstration. The program is guessed to be useful both for learning the TSP as one of fundamental logistics problems and as an intriguing programming curriculum excersize. Several sub-programs according to key stone Computer Science Curriculum have also been suggested. This lies in line with recent “discovery based” learning methodology. Discussion: we explain how to create this program for visual discrete optimization, suggest required subprograms belonging to key stone programming algorithms including rather modern graphical user interface (GUI, how to use this MATLAB TSP-program for demonstration the drastical grows of solution time required. Conclusions: easy programming being realized in MATLAB makes dificult curriculum problems attractive to students; it focuses them to main problem’ features, laws and algorithms implementing the “discovery based” methodology in such a way. 20. Formulated linear programming problems from game theory and its ... African Journals Online (AJOL) Formulated linear programming problems from game theory and its computer implementation using Tora package. ... Game theory, a branch of operations research examines the various concepts of decision ... AJOL African Journals Online. 1. Linear Programming and Its Application to Pattern Recognition Problems Science.gov (United States) 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. 2. Dynamic Programming Approaches for the Traveling Salesman Problem with Drone OpenAIRE Bouman, Paul; Agatz, Niels; Schmidt, Marie 2017-01-01 markdownabstractA promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a drone and a truck gives rise to a new planning problem that is known as the Traveling Salesman Problem with Drone (TSP-D). This paper presents an exact solution approach for the TSP-D based on dynamic programming and present experimental results of different dynamic programming based heuristics. Our numerical experiments show that our a... 3. Emotion Oriented Programming: Computational Abstractions for AI Problem Solving OpenAIRE Darty , Kevin; Sabouret , Nicolas 2012-01-01 International audience; In this paper, we present a programming paradigm for AI problem solving based on computational concepts drawn from Affective Computing. It is believed that emotions participate in human adaptability and reactivity, in behaviour selection and in complex and dynamic environments. We propose to define a mechanism inspired from this observation for general AI problem solving. To this purpose, we synthesize emotions as programming abstractions that represent the perception ... 4. Logo Programming, Problem Solving, and Knowledge-Based Instruction. Science.gov (United States) Swan, Karen; Black, John B. The research reported in this paper was designed to investigate the hypothesis that computer programming may support the teaching and learning of problem solving, but that to do so, problem solving must be explicitly taught. Three studies involved students in several grades: 4th, 6th, 8th, 11th, and 12th. Findings collectively show that five… 5. An approach for solving linear fractional programming problems ... African Journals Online (AJOL) The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebraically using the concept of duality ... 6. Fixed geometric formation structure in formation control problem for group of robots with dynamically changing number of robots in the group Directory of Open Access Journals (Sweden) N. S. Morozova 2015-01-01 Full Text Available The article considers a problem of the decentralization-based approach to formation control of a group of agents, which simulate mobile autonomous robots. The agents use only local information limited by the covering range of their sensors. The agents have to build and maintain the formation, which fits to the defined target geometric formation structure with desired accuracy during the movement to the target point. At any point in time the number of agents in the group can change unexpectedly (for example, as a result of the agent failure or if a new agent joins the group.The aim of the article is to provide the base control rule, which solves the formation control problem, and to develop its modifications, which provide the correct behavior in case the agent number in the group is not equal to the size of the target geometric formation structure. The proposed base control rule, developed by the author, uses the method of involving virtual leaders. The coordinates of the virtual leaders and also the priority to follow the specific leader are calculated by each agent itself according to specific rules.The following results are presented in the article: the base control rule for solving the formation control problem, its modifications for the cases when the number of agents is greater/less than the size of the target geometric formation structure and also the computer modeling results proving the efficiency of the modified control rules. The specific feature of the control rule, developed by the author, is that each agent itself calculates the virtual leaders and each agent performs dynamic choice of the place within the formation (there is no predefined one-to-one relation between agents and places within the geometric formation structure. The results, provided in this article, can be used in robotics for developing control algorithms for the tasks, which require preserving specific relational positions among the agents while moving. One of the 7. Some Competition Programming Problems as the Beginning of Artificial Intelligence OpenAIRE Boris MELNIKOV; Elena MELNIKOVA 2007-01-01 We consider in this paper some programming competition problems (which are near to some problems of ACM competitions) of the following subjects: we can make their solution using both Prolog and a classical procedure-oriented language. Moreover, the considered problems are selected that their solution in Prolog and in a classical procedure-oriented language are similar - i.e., in other words, they use the same working mechanism, the same approach to constructing recursive functions etc. Howeve... 8. Using Problem Solving to Teach a Programming Language. Science.gov (United States) 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… 9. Geometrical parton Energy Technology Data Exchange (ETDEWEB) Ebata, T [Tohoku Univ., Sendai (Japan). Coll. of General Education 1976-06-01 The geometrical distribution inferred from the inelastic cross section is assumed to be proportional to the partial waves. The precocious scaling and the Q/sup 2/-dependence of various quantities are treated from the geometrical point of view. It is shown that the approximate conservation of the orbital angular momentum may be a very practical rule to understand the helicity structure of various hadronic and electromagnetic reactions. The rule can be applied to inclusive reactions as well. The model is also applied to large angle processes. Through the discussion, it is suggested that many peculiar properties of the quark-parton can be ascribed to the geometrical effects. 10. Geometric statistical inference International Nuclear Information System (INIS) Periwal, Vipul 1999-01-01 A reparametrization-covariant formulation of the inverse problem of probability is explicitly solved for finite sample sizes. The inferred distribution is explicitly continuous for finite sample size. A geometric solution of the statistical inference problem in higher dimensions is outlined 11. Linear decomposition approach for a class of nonconvex programming problems. Science.gov (United States) 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. 12. A "feasible direction" search for Lineal Programming problem solving Directory of Open Access Journals (Sweden) Jaime U Malpica Angarita 2003-07-01 Full Text Available The study presents an approach to solve linear programming problems with no artificial variables. A primal linear minimization problem is standard form and its associated dual linear maximization problem are used. Initially, the dual (or a partial dual program is solved by a "feasible direction" search, where the Karush-Kuhn-Tucker conditions help to verify its optimality and then its feasibility. The "feasible direction" search exploits the characteristics of the convex polyhedron (or prototype formed by the dual program constraints to find a starting point and then follows line segments, whose directions are found in afine subspaces defined by boundary hyperplanes of polyhedral faces, to find next points up to the (an optimal one. Them, the remaining dual constraints not satisfaced at that optimal dual point, if there are any, are handled as nonbasic variables of the primal program, which is to be solved by such "feasible direction" search. 13. Generalized Nash equilibrium problems, bilevel programming and mpec CERN Document Server Lalitha, CS 2017-01-01 The book discusses three classes of problems: the generalized Nash equilibrium problems, the bilevel problems and the mathematical programming with equilibrium constraints (MPEC). These problems interact through their mathematical analysis as well as their applications. The primary aim of the book is to present the modern tool of variational analysis and optimization, which are used to analyze these three classes of problems. All contributing authors are respected academicians, scientists and researchers from around the globe. These contributions are based on the lectures delivered by experts at CIMPA School, held at the University of Delhi, India, from 25 November–6 December 2013, and peer-reviewed by international experts. The book contains five chapters. Chapter 1 deals with nonsmooth, nonconvex bilevel optimization problems whose feasible set is described by using the graph of the solution set mapping of a parametric optimization problem. Chapter 2 describes a constraint qualification to MPECs considere... 14. Bonus algorithm for large scale stochastic nonlinear programming problems CERN Document Server Diwekar, Urmila 2015-01-01 This book presents the details of the BONUS algorithm and its real world applications in areas like sensor placement in large scale drinking water networks, sensor placement in advanced power systems, water management in power systems, and capacity expansion of energy systems. A generalized method for stochastic nonlinear programming based on a sampling based approach for uncertainty analysis and statistical reweighting to obtain probability information is demonstrated in this book. Stochastic optimization problems are difficult to solve since they involve dealing with optimization and uncertainty loops. There are two fundamental approaches used to solve such problems. The first being the decomposition techniques and the second method identifies problem specific structures and transforms the problem into a deterministic nonlinear programming problem. These techniques have significant limitations on either the objective function type or the underlying distributions for the uncertain variables. Moreover, these ... 15. EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report. Science.gov (United States) 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,… 16. An Improvement for Fuzzy Stochastic Goal Programming Problems Directory of Open Access Journals (Sweden) Shu-Cheng Lin 2017-01-01 Full Text Available We examined the solution process for linear programming problems under a fuzzy and random environment to transform fuzzy stochastic goal programming problems into standard linear programming problems. A previous paper that revised the solution process with the lower-side attainment index motivated our work. In this paper, we worked on a revision for both-side attainment index to amend its definition and theorems. Two previous examples were used to examine and demonstrate our improvement over previous results. Our findings not only improve the previous paper with both-side attainment index, but also provide a theoretical extension from lower-side attainment index to the both-side attainment index. 17. Mathematical programming methods for large-scale topology optimization problems DEFF Research Database (Denmark) Rojas Labanda, Susana for mechanical problems, but has rapidly extended to many other disciplines, such as fluid dynamics and biomechanical problems. However, the novelty and improvements of optimization methods has been very limited. It is, indeed, necessary to develop of new optimization methods to improve the final designs......, and at the same time, reduce the number of function evaluations. Nonlinear optimization methods, such as sequential quadratic programming and interior point solvers, have almost not been embraced by the topology optimization community. Thus, this work is focused on the introduction of this kind of second...... for the classical minimum compliance problem. Two of the state-of-the-art optimization algorithms are investigated and implemented for this structural topology optimization problem. A Sequential Quadratic Programming (TopSQP) and an interior point method (TopIP) are developed exploiting the specific mathematical... 18. Multiparametric programming based algorithms for pure integer and mixed-integer bilevel programming problems KAUST Repository Domínguez, Luis F. 2010-12-01 This work introduces two algorithms for the solution of pure integer and mixed-integer bilevel programming problems by multiparametric programming techniques. The first algorithm addresses the integer case of the bilevel programming problem where integer variables of the outer optimization problem appear in linear or polynomial form in the inner problem. The algorithm employs global optimization techniques to convexify nonlinear terms generated by a reformulation linearization technique (RLT). A continuous multiparametric programming algorithm is then used to solve the reformulated convex inner problem. The second algorithm addresses the mixed-integer case of the bilevel programming problem where integer and continuous variables of the outer problem appear in linear or polynomial forms in the inner problem. The algorithm relies on the use of global multiparametric mixed-integer programming techniques at the inner optimization level. In both algorithms, the multiparametric solutions obtained are embedded in the outer problem to form a set of single-level (M)(I)(N)LP problems - which are then solved to global optimality using standard fixed-point (global) optimization methods. Numerical examples drawn from the open literature are presented to illustrate the proposed algorithms. © 2010 Elsevier Ltd. 19. Needs and Problems of Posbindu Program: Community Health Volunteers Perspective Science.gov (United States) Putri, S. T.; Andriyani, S. 2018-01-01 Posbindu is a form of public participation to conduct early detection and monitoring of risk factors for non-communicable diseases(NCD), and where it was carried out in as an integrated manner, routine and periodic event. This paper aims to investigates the needs and problems on Posbindu Program based on community health volunteers(CHVs) perspective. This study used descriptive qualitative method by open ended questions. Content analysis using to explicating the result. There are 3 theme finding about elderly needs in Posbindu; medical care, support group community, and health education. We found four theme problems which in Posbindu program: low motivation from elderly, Inadequate of facilities, physical disability, failed communication. To be effective in Posbindu program, all the stakeholders have reached consensus on the Posbindu program as elderly need. CHVs need given wide knowledge about early detection, daily care, control disease continuously so that the elderly keep feeling the advantages of coming to the Posbindu. 20. Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution Energy Technology Data Exchange (ETDEWEB) Hamadameen, Abdulqader Othman [Optimization, Department of Mathematical Sciences, Faculty of Science, UTM (Malaysia); Zainuddin, Zaitul Marlizawati [Department of Mathematical Sciences, Faculty of Science, UTM (Malaysia) 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. 1. Geometric metamorphosis. Science.gov (United States) Niethammer, Marc; Hart, Gabriel L; Pace, Danielle F; Vespa, Paul M; Irimia, Andrei; Van Horn, John D; Aylward, Stephen R 2011-01-01 Standard image registration methods do not account for changes in image appearance. Hence, metamorphosis approaches have been developed which jointly estimate a space deformation and a change in image appearance to construct a spatio-temporal trajectory smoothly transforming a source to a target image. For standard metamorphosis, geometric changes are not explicitly modeled. We propose a geometric metamorphosis formulation, which explains changes in image appearance by a global deformation, a deformation of a geometric model, and an image composition model. This work is motivated by the clinical challenge of predicting the long-term effects of traumatic brain injuries based on time-series images. This work is also applicable to the quantification of tumor progression (e.g., estimating its infiltrating and displacing components) and predicting chronic blood perfusion changes after stroke. We demonstrate the utility of the method using simulated data as well as scans from a clinical traumatic brain injury patient. 2. A goal programming procedure for solving fuzzy multiobjective fractional linear programming problems Directory of Open Access Journals (Sweden) Tunjo Perić 2014-12-01 Full Text Available This paper presents a modification of Pal, Moitra and Maulik's goal programming procedure for fuzzy multiobjective linear fractional programming problem solving. The proposed modification of the method allows simpler solving of economic multiple objective fractional linear programming (MOFLP problems, enabling the obtained solutions to express the preferences of the decision maker defined by the objective function weights. The proposed method is tested on the production planning example. 3. Managing problem employees: a model program and practical guide. Science.gov (United States) 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. 4. Quantum algorithms for the ordered search problem via semidefinite programming International Nuclear Information System (INIS) Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A. 2007-01-01 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 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 605 N≅0.433 log 2 N queries, which improves upon the previously best known exact algorithm 5. A property of assignment type mixed integer linear programming problems NARCIS (Netherlands) Benders, J.F.; van Nunen, J.A.E.E. 1982-01-01 In this paper we will proof that rather tight upper bounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer linear assignment problems. Since in these cases the number of splitted assignments is 6. Polymorphic Uncertain Linear Programming for Generalized Production Planning Problems Directory of Open Access Journals (Sweden) Xinbo Zhang 2014-01-01 Full Text Available A polymorphic uncertain linear programming (PULP model is constructed to formulate a class of generalized production planning problems. In accordance with the practical environment, some factors such as the consumption of raw material, the limitation of resource and the demand of product are incorporated into the model as parameters of interval and fuzzy subsets, respectively. Based on the theory of fuzzy interval program and the modified possibility degree for the order of interval numbers, a deterministic equivalent formulation for this model is derived such that a robust solution for the uncertain optimization problem is obtained. Case study indicates that the constructed model and the proposed solution are useful to search for an optimal production plan for the polymorphic uncertain generalized production planning problems. 7. INTRODUCTION OF UNIVERSAL HEALTH PROGRAM IN GEORGIA: PROBLEMS AND PERSPECTIVES. Science.gov (United States) Verulava, T; Jorbenadze, R; Barkalaia, T 2017-01-01 Since 2013, Georgia enacted Universal Healthcare (UHC) program. Inclusion of uninsured population in the UHC program will have a positive impact on their financial accessibility to the health services. The study aims to analyze the referral rate of the beneficiaries to the health service providers before introduction and after application of the UHC program, particularly, how much it increased the recently uninsured population referral to primary health care units, and also to study the level of satisfaction with the UHC program. Research was conducted by qualitative and quantitative methods. The target groups' (program beneficiaries, physicians, personnel of the Social Service Agency) opinions were identified by means of face-to-face interviews. Enactment of the UHC programs significantly raised the population refferal to the family physicians, and the specialists. Insignificantly, but also increased the frequency of laboratory and diagnostic services. Despite the serious positive changes caused by UHC program implementation there still remain the problems in the primary healthcare system. Also, it is desirable to raise the financial availability of those medical services, which may cause catastrophic costs. In this respect, such medical services must be involved in the universal healthcare program and been expanded their scale. For the purpose of effective usage of the limited funds allocated for health care services provision, the private health insurance companies should be involved in UHC programs. This, together with the reduction of health care costs will increase a competition in the medical market, and enhance the quality of health service. 8. Solving seismological problems using sgraph program: II-waveform modeling International Nuclear Information System (INIS) Abdelwahed, Mohamed F. 2012-01-01 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. 9. Stochastic programming problems with generalized integrated chance constraints Czech Academy of Sciences Publication Activity Database Branda, Martin 2012-01-01 Roč. 61, č. 8 (2012), s. 949-968 ISSN 0233-1934 R&D Projects: GA ČR GAP402/10/1610 Grant - others:SVV(CZ) 261315/2010 Institutional support: RVO:67985556 Keywords : chance constraints * integrated chance constraints * penalty functions * sample approximations * blending problem Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.707, year: 2012 http://library.utia.cas.cz/separaty/2012/E/branda-stochastic programming problems with generalized integrated.pdf 10. Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems Directory of Open Access Journals (Sweden) D. Barilla 2016-01-01 Full Text Available We have considered a multiobjective semi-infinite programming problem with a feasible set defined by inequality constraints. First we studied a Fritz-John type necessary condition. Then, we introduced two constraint qualifications and derive the weak and strong Karush-Kuhn-Tucker (KKT in brief types necessary conditions for an efficient solution of the considered problem. Finally an extension of a Caristi-Ferrara-Stefanescu result for the (Φ,ρ-invexity is proved, and some sufficient conditions are presented under this weak assumption. All results are given in terms of Clark subdifferential. 11. Some problems in the acceptability of implementing radiation protection programs International Nuclear Information System (INIS) Neill, R.H. 1997-01-01 The three fundamentals that radiation protection programs are based upon are; 1) establishing a quantitative correlation between radiation exposure and biological effects in people; 2) determining a level of acceptable risk of exposure; and 3) establishing systems to measure the radiation dose to insure compliance with the regulations or criteria. The paper discusses the interrelationship of these fundamentals, difficulties in obtaining a consensus of acceptable risk and gives some examples of problems in identifying the most critical population-at-risk and in measuring dose. Despite such problems, it is recommended that we proceed with the existing conservative structure of radiation protection programs based upon a linear no threshold model for low radiation doses to insure public acceptability of various potential radiation risks. Voluntary compliance as well as regulatory requirements should continue to be pursued to maintain minimal exposure to ionizing radiation. (author) 12. A Compromise Programming Model for Highway Maintenance Resources Allocation Problem Directory of Open Access Journals (Sweden) Hui Xiong 2012-01-01 Full Text Available This paper formulates a bilevel compromise programming model for allocating resources between pavement and bridge deck maintenances. The first level of the model aims to solve the resource allocation problems for pavement management and bridge deck maintenance, without considering resource sharing between them. At the second level, the model uses the results from the first step as an input and generates the final solution to the resource-sharing problem. To solve the model, the paper applies genetic algorithms to search for the optimal solution. We use a combination of two digits to represent different maintenance types. Results of numerical examples show that the conditions of both pavements and bridge decks are improved significantly by applying compromise programming, rather than conventional methods. Resources are also utilized more efficiently when the proposed method is applied. 13. Geometric approximation algorithms CERN Document Server Har-Peled, Sariel 2011-01-01 Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas. 14. Solving a class of generalized fractional programming problems using the feasibility of linear programs. Science.gov (United States) Shen, Peiping; Zhang, Tongli; Wang, Chunfeng 2017-01-01 This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent optimization problem (Q) via an exploration of a suitably defined nonuniform grid. The main work of the algorithm involves checking the feasibility of linear programs associated with the interesting grid points. It is proved that the proposed algorithm is a fully polynomial time approximation scheme as the ratio terms are fixed in the objective function to problem (P), based on the computational complexity result. In contrast to existing results in literature, the algorithm does not require the assumptions on quasi-concavity or low-rank of the objective function to problem (P). Numerical results are given to illustrate the feasibility and effectiveness of the proposed algorithm. 15. Geometric inequalities methods of proving CERN Document Server Sedrakyan, Hayk 2017-01-01 This unique collection of new and classical problems provides full coverage of geometric inequalities. Many of the 1,000 exercises are presented with detailed author-prepared-solutions, developing creativity and an arsenal of new approaches for solving mathematical problems. This book can serve teachers, high-school students, and mathematical competitors. It may also be used as supplemental reading, providing readers with new and classical methods for proving geometric inequalities. . 16. NEWBOX: A computer program for parameter estimation in diffusion problems International Nuclear Information System (INIS) Nestor, C.W. Jr.; Godbee, H.W.; Joy, D.S. 1989-01-01 In the analysis of experiments to determine amounts of material transferred form 1 medium to another (e.g., the escape of chemically hazardous and radioactive materials from solids), there are at least 3 important considerations. These are (1) is the transport amenable to treatment by established mass transport theory; (2) do methods exist to find estimates of the parameters which will give a best fit, in some sense, to the experimental data; and (3) what computational procedures are available for evaluating the theoretical expressions. The authors have made the assumption that established mass transport theory is an adequate model for the situations under study. Since the solutions of the diffusion equation are usually nonlinear in some parameters (diffusion coefficient, reaction rate constants, etc.), use of a method of parameter adjustment involving first partial derivatives can be complicated and prone to errors in the computation of the derivatives. In addition, the parameters must satisfy certain constraints; for example, the diffusion coefficient must remain positive. For these reasons, a variant of the constrained simplex method of M. J. Box has been used to estimate parameters. It is similar, but not identical, to the downhill simplex method of Nelder and Mead. In general, they calculate the fraction of material transferred as a function of time from expressions obtained by the inversion of the Laplace transform of the fraction transferred, rather than by taking derivatives of a calculated concentration profile. With the above approaches to the 3 considerations listed at the outset, they developed a computer program NEWBOX, usable on a personal computer, to calculate the fractional release of material from 4 different geometrical shapes (semi-infinite medium, finite slab, finite circular cylinder, and sphere), accounting for several different boundary conditions 17. Geometric Computing for Freeform Architecture KAUST Repository Wallner, J. 2011-06-03 Geometric computing has recently found a new field of applications, namely the various geometric problems which lie at the heart of rationalization and construction-aware design processes of freeform architecture. We report on our work in this area, dealing with meshes with planar faces and meshes which allow multilayer constructions (which is related to discrete surfaces and their curvatures), triangles meshes with circle-packing properties (which is related to conformal uniformization), and with the paneling problem. We emphasize the combination of numerical optimization and geometric knowledge. 18. Geometric recursion DEFF Research Database (Denmark) Andersen, Jørgen Ellegaard; Borot, Gaëtan; Orantin, Nicolas We propose a general theory whose main component are functorial assignments ∑→Ω∑ ∈ E (∑), for a large class of functors E from a certain category of bordered surfaces (∑'s) to a suitable a target category of topological vector spaces. The construction is done by summing appropriate compositions...... as Poisson structures on the moduli space of flat connections. The theory has a wider scope than that and one expects that many functorial objects in low-dimensional geometry and topology should have a GR construction. The geometric recursion has various projections to topological recursion (TR) and we...... in particular show it retrieves all previous variants and applications of TR. We also show that, for any initial data for topological recursion, one can construct initial data for GR with values in Frobenius algebra-valued continuous functions on Teichmueller space, such that the ωg,n of TR are obtained... 19. Neural network for solving convex quadratic bilevel programming problems. Science.gov (United States) 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. 20. Motivating programming students by Problem Based Learning and LEGO robots DEFF Research Database (Denmark) Lykke, Marianne; Coto Chotto, Mayela; Mora, Sonia 2014-01-01 . For this reason the school is focusing on different teaching methods to help their students master these skills. This paper introduces an experimental, controlled comparison study of three learning designs, involving a problem based learning (PBL) approach in connection with the use of LEGO Mindstorms to improve...... students programming skills and motivation for learning in an introductory programming course. The paper reports the results related with one of the components of the study - the experiential qualities of the three learning designs. The data were collected through a questionnaire survey with 229 students...... from three groups exposed to different learning designs and through six qualitative walk-alongs collecting data from these groups by informal interviews and observations. Findings from the three studies were discussed in three focus group interviews with 10 students from the three experimental groups.... 1. Solving cyclical nurse scheduling problem using preemptive goal programming Science.gov (United States) 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. 2. A recurrent neural network for solving bilevel linear programming problem. Science.gov (United States) 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. 3. OPERATOR-RELATED FORMULATION OF THE EIGENVALUE PROBLEM FOR THE BOUNDARY PROBLEM OF ANALYSIS OF A THREE-DIMENSIONAL STRUCTURE WITH PIECEWISE-CONSTANT PHYSICAL AND GEOMETRICAL PARAMETERS ALONGSIDE THE BASIC DIRECTION WITHIN THE FRAMEWORK OF THE DISCRETE-CON Directory of Open Access Journals (Sweden) Akimov Pavel Alekseevich 2012-10-01 Full Text Available The proposed paper covers the operator-related formulation of the eigenvalue problem of analysis of a three-dimensional structure that has piecewise-constant physical and geometrical parameters alongside the so-called basic direction within the framework of a discrete-continual approach (a discrete-continual finite element method, a discrete-continual variation method. Generally, discrete-continual formulations represent contemporary mathematical models that become available for computer implementation. They make it possible for a researcher to consider the boundary effects whenever particular components of the solution represent rapidly varying functions. Another feature of discrete-continual methods is the absence of any limitations imposed on lengths of structures. The three-dimensional problem of elasticity is used as the design model of a structure. In accordance with the so-called method of extended domain, the domain in question is embordered by an extended one of an arbitrary shape. At the stage of numerical implementation, relative key features of discrete-continual methods include convenient mathematical formulas, effective computational patterns and algorithms, simple data processing, etc. The authors present their formulation of the problem in question for an isotropic medium with allowance for supports restrained by elastic elements while standard boundary conditions are also taken into consideration. 4. An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach Science.gov (United States) 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. 5. The transportation management division institutional program: Networking and problem solving International Nuclear Information System (INIS) McGinnis, K.A.; Peterson, J.M. 1989-06-01 The US Department of Energy (DOE) has several programs related to transportation. While these programs may have differing missions and legislative authority, the required activities are frequently similar. To ensure a DOE-wide perspective in developing transportation policies and procedures, a DOE Transportation Institutional Task Force (Task Force) has been formed, which is the primary focus of this paper. The Task Force, composed of representatives from each of the major DOE transportation programs, meets periodically to exchange experiences and insights on institutional issues related to Departmental shipping. The primary purpose of the group is to identify opportunities for productive interactions with the transportation community, including interested and affected members of the public. This paper will also focus sharply on the networking of DOE with the State, Tribal, and local officials in fostering better understanding and in solving problems. An example of such activity is the DOE's cooperative agreement with the Energy Task Force of the Urban Consortium. A major effort is to encourage cooperative action in identifying, addressing, and resolving issues that could impede the transportation of radioactive materials 6. A program package for solving linear optimization problems International Nuclear Information System (INIS) Horikami, Kunihiko; Fujimura, Toichiro; Nakahara, Yasuaki 1980-09-01 Seven computer programs for the solution of linear, integer and quadratic programming (four programs for linear programming, one for integer programming and two for quadratic programming) have been prepared and tested on FACOM M200 computer, and auxiliary programs have been written to make it easy to use the optimization program package. The characteristics of each program are explained and the detailed input/output descriptions are given in order to let users know how to use them. (author) 7. Problem area descriptions : motor vehicle crashes - data analysis and IVI program analysis Science.gov (United States) In general, the IVI program focuses on the more significant safety problem categories as : indicated by statistical analyses of crash data. However, other factors were considered in setting : program priorities and schedules. For some problem areas, ... 8. Comparing Mixed & Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems Directory of Open Access Journals (Sweden) Renata Melo e Silva de Oliveira 2015-03-01 Full Text Available Scheduling is a key factor for operations management as well as for business success. From industrial Job-shop Scheduling problems (JSSP, many optimization challenges have emerged since de 1960s when improvements have been continuously required such as bottlenecks allocation, lead-time reductions and reducing response time to requests. With this in perspective, this work aims to discuss 3 different optimization models for minimizing Makespan. Those 3 models were applied on 17 classical problems of examples JSSP and produced different outputs. The first model resorts on Mixed and Integer Programming (MIP and it resulted on optimizing 60% of the studied problems. The other models were based on Constraint Programming (CP and approached the problem in two different ways: a model CP1 is a standard IBM algorithm whereof restrictions have an interval structure that fail to solve 53% of the proposed instances, b Model CP-2 approaches the problem with disjunctive constraints and optimized 88% of the instances. In this work, each model is individually analyzed and then compared considering: i Optimization success performance, ii Computational processing time, iii Greatest Resource Utilization and, iv Minimum Work-in-process Inventory. Results demonstrated that CP-2 presented best results on criteria i and ii, but MIP was superior on criteria iii and iv and those findings are discussed at the final section of this work. 9. Bricolage Programming and Problem Solving Ability in Young Children : an Exploratory Study OpenAIRE Rose, Simon 2016-01-01 Visual programming environments, such as Scratch, are increasingly being used by schools to teach problem solving and computational thinking skills. However, academic research is divided on the effect that visual programming has on problem solving in a computational context. This paper focuses on the role of bricolage programming in this debate; a bottom-up programming approach that arises when using block-style programming interfaces. Bricolage programming was a term originally used to descr... 10. A Linear Programming Reformulation of the Standard Quadratic Optimization Problem NARCIS (Netherlands) de Klerk, E.; Pasechnik, D.V. 2005-01-01 The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO).It is NPhard, and contains the maximum stable set problem in graphs as a special case.In this note we show that the SQO problem may be reformulated as an (exponentially 11. Implementation of the - Constraint Method in Special Class of Multi-objective Fuzzy Bi-Level Nonlinear Problems Directory of Open Access Journals (Sweden) Azza Hassan Amer 2017-12-01 Full Text Available Geometric programming problem is a powerful tool for solving some special type nonlinear programming problems. In the last few years we have seen a very rapid development on solving multiobjective geometric programming problem. A few mathematical programming methods namely fuzzy programming, goal programming and weighting methods have been applied in the recent past to find the compromise solution. In this paper, -constraint method has been applied in bi-level multiobjective geometric programming problem to find the Pareto optimal solution at each level. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem at eash level. Here, we have developed a new algorithm for fuzzy programming technique to solve bi-level multiobjective geometric programming problems to find an optimal compromise solution. Finally the solution procedure of the fuzzy technique is illustrated by a numerical example 12. Mathematical solution of multilevel fractional programming problem with fuzzy goal programming approach Science.gov (United States) Lachhwani, Kailash; Poonia, Mahaveer Prasad 2012-08-01 In this paper, we show a procedure for solving multilevel fractional programming problems in a large hierarchical decentralized organization using fuzzy goal programming approach. In the proposed method, the tolerance membership functions for the fuzzily described numerator and denominator part of the objective functions of all levels as well as the control vectors of the higher level decision makers are respectively defined by determining individual optimal solutions of each of the level decision makers. A possible relaxation of the higher level decision is considered for avoiding decision deadlock due to the conflicting nature of objective functions. Then, fuzzy goal programming approach is used for achieving the highest degree of each of the membership goal by minimizing negative deviational variables. We also provide sensitivity analysis with variation of tolerance values on decision vectors to show how the solution is sensitive to the change of tolerance values with the help of a numerical example. 13. MULTI-CRITERIA PROGRAMMING METHODS AND PRODUCTION PLAN OPTIMIZATION PROBLEM SOLVING IN METAL INDUSTRY OpenAIRE Tunjo Perić; Željko Mandić 2017-01-01 This paper presents the production plan optimization in the metal industry considered as a multi-criteria programming problem. We first provided the definition of the multi-criteria programming problem and classification of the multicriteria programming methods. Then we applied two multi-criteria programming methods (the STEM method and the PROMETHEE method) in solving a problem of multi-criteria optimization production plan in a company from the metal industry. The obtained resul... 14. Teaching Introductory Programming to IS Students: Java Problems and Pitfalls Science.gov (United States) 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… 15. Geometric approach to soliton equations International Nuclear Information System (INIS) Sasaki, R. 1979-09-01 A class of nonlinear equations that can be solved in terms of nxn scattering problem is investigated. A systematic geometric method of exploiting conservation laws and related equations, the so-called prolongation structure, is worked out. The nxn problem is reduced to nsub(n-1)x(n-1) problems and finally to 2x2 problems, which have been comprehensively investigated recently by the author. A general method of deriving the infinite numbers of polynomial conservation laws for an nxn problem is presented. The cases of 3x3 and 2x2 problems are discussed explicitly. (Auth.) 16. Integrating packing and distribution problems and optimization through mathematical programming Directory of Open Access Journals (Sweden) Fabio Miguel 2016-06-01 Full Text Available This paper analyzes the integration of two combinatorial problems that frequently arise in production and distribution systems. One is the Bin Packing Problem (BPP problem, which involves finding an ordering of some objects of different volumes to be packed into the minimal number of containers of the same or different size. An optimal solution to this NP-Hard problem can be approximated by means of meta-heuristic methods. On the other hand, we consider the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW, which is a variant of the Travelling Salesman Problem (again a NP-Hard problem with extra constraints. Here we model those two problems in a single framework and use an evolutionary meta-heuristics to solve them jointly. Furthermore, we use data from a real world company as a test-bed for the method introduced here. 17. JAC, 2-D Finite Element Method Program for Quasi Static Mechanics Problems by Nonlinear Conjugate Gradient (CG) Method International Nuclear Information System (INIS) Biffle, J.H. 1991-01-01 1 - Description of program or function: JAC is a two-dimensional finite element program for solving large deformation, temperature dependent, quasi-static mechanics problems with the nonlinear conjugate gradient (CG) technique. Either plane strain or axisymmetric geometry may be used with material descriptions which include temperature dependent elastic-plastic, temperature dependent secondary creep, and isothermal soil models. The nonlinear effects examined include material and geometric nonlinearities due to large rotations, large strains, and surface which slide relative to one another. JAC is vectorized to perform efficiently on the Cray1 computer. A restart capability is included. 2 - Method of solution: The nonlinear conjugate gradient method is employed in a two-dimensional plane strain or axisymmetric setting with various techniques for accelerating convergence. Sliding interface conditions are also implemented. A four-node Lagrangian uniform strain element is used with orthogonal hourglass viscosity to control the zero energy modes. Three sets of continuum equations are needed - kinematic statements, constitutive equations, and equations of equilibrium - to describe the deformed configuration of the body. 3 - Restrictions on the complexity of the problem - Maxima of: 10 load and solution control functions, 4 materials. The strain rate is assumed constant over a time interval. Current large rotation theory is applicable to a maximum shear strain of 1.0. JAC should be used with caution for large shear strains. Problem size is limited only by available memory 18. On bivariate geometric distribution Directory of Open Access Journals (Sweden) K. Jayakumar 2013-05-01 Full Text Available Characterizations of bivariate geometric distribution using univariate and bivariate geometric compounding are obtained. Autoregressive models with marginals as bivariate geometric distribution are developed. Various bivariate geometric distributions analogous to important bivariate exponential distributions like, Marshall-Olkin’s bivariate exponential, Downton’s bivariate exponential and Hawkes’ bivariate exponential are presented. 19. Visualizing the Geometric Series. Science.gov (United States) Bennett, Albert B., Jr. 1989-01-01 Mathematical proofs often leave students unconvinced or without understanding of what has been proved, because they provide no visual-geometric representation. Presented are geometric models for the finite geometric series when r is a whole number, and the infinite geometric series when r is the reciprocal of a whole number. (MNS) 20. 34 CFR 356.11 - What types of problems may be researched under the fellowship program? Science.gov (United States) 2010-07-01 ... 34 Education 2 2010-07-01 2010-07-01 false What types of problems may be researched under the... (Continued) OFFICE OF SPECIAL EDUCATION AND REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION DISABILITY AND... Program? § 356.11 What types of problems may be researched under the fellowship program? Problems... 1. Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem. Science.gov (United States) 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. 2. COYOTE: a finite element computer program for nonlinear heat conduction problems International Nuclear Information System (INIS) Gartling, D.K. 1978-06-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 3. Fast geometric algorithms International Nuclear Information System (INIS) Noga, M.T. 1984-01-01 This thesis addresses a number of important problems that fall within the framework of the new discipline of Computational Geometry. The list of topics covered includes sorting and selection, convex hull algorithms, the L 1 hull, determination of the minimum encasing rectangle of a set of points, the Euclidean and L 1 diameter of a set of points, the metric traveling salesman problem, and finding the superrange of star-shaped and monotype polygons. The main theme of all the work was to develop a set of very fast state-of-the-art algorithms that supersede any rivals in terms of speed and ease of implementation. In some cases existing algorithms were refined; for others new techniques were developed that add to the present database of fast adaptive geometric algorithms. What emerges is a collection of techniques that is successful at merging modern tools developed in analysis of algorithms with those of classical geometry 4. A Hybrid Programming Framework for Modeling and Solving Constraint Satisfaction and Optimization Problems OpenAIRE Sitek, Paweł; Wikarek, Jarosław 2016-01-01 This paper proposes a hybrid programming framework for modeling and solving of constraint satisfaction problems (CSPs) and constraint optimization problems (COPs). Two paradigms, CLP (constraint logic programming) and MP (mathematical programming), are integrated in the framework. The integration is supplemented with the original method of problem transformation, used in the framework as a presolving method. The transformation substantially reduces the feasible solution space. The framework a... 5. Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem NARCIS (Netherlands) de Klerk, E.; Sotirov, R. 2007-01-01 We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard, 6. Program Administrator's Handbook. Strategies for Preventing Alcohol and Other Drug Problems. The College Series. Science.gov (United States) 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… 7. Portfolio selection problem: a comparison of fuzzy goal programming and linear physical programming Directory of Open Access Journals (Sweden) Fusun Kucukbay 2016-04-01 Full Text Available Investors have limited budget and they try to maximize their return with minimum risk. Therefore this study aims to deal with the portfolio selection problem. In the study two criteria are considered which are expected return, and risk. In this respect, linear physical programming (LPP technique is applied on Bist 100 stocks to be able to find out the optimum portfolio. The analysis covers the period April 2009- March 2015. This period is divided into two; April 2009-March 2014 and April 2014 – March 2015. April 2009-March 2014 period is used as data to find an optimal solution. April 2014-March 2015 period is used to test the real performance of portfolios. The performance of the obtained portfolio is compared with that obtained from fuzzy goal programming (FGP. Then the performances of both method, LPP and FGP are compared with BIST 100 in terms of their Sharpe Indexes. The findings reveal that LPP for portfolio selection problem is a good alternative to FGP. 8. Specific problems of beginners at study of programming and possibilities of their solution OpenAIRE Procházková, Petra 2017-01-01 This thesis deals with the problems of beginners in the study of programming at University of Economics in Prague, Faculty of Informatics and Statistics. This applies particularly to students who are studying the subject Programming in Java. 9. Dynamic Programming Approaches for the Traveling Salesman Problem with Drone NARCIS (Netherlands) P. Bouman (Paul); N.A.H. Agatz (Niels); M.E. Schmidt (Marie) 2017-01-01 markdownabstractA promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a drone and a truck gives rise to a new planning problem that is known as the Traveling Salesman Problem with Drone (TSP-D). This paper 10. Dynamic Programming Approaches for the Traveling Salesman Problem with Drone NARCIS (Netherlands) P. Bouman (Paul); N.A.H. Agatz (Niels); M.E. Schmidt (Marie) 2017-01-01 markdownabstractA promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a truck and a drone gives rise to a new planning problem that is known as the Traveling Salesman Problem with Drone (TSP-D). This paper 11. MULTI-CRITERIA PROGRAMMING METHODS AND PRODUCTION PLAN OPTIMIZATION PROBLEM SOLVING IN METAL INDUSTRY Directory of Open Access Journals (Sweden) Tunjo Perić 2017-09-01 Full Text Available This paper presents the production plan optimization in the metal industry considered as a multi-criteria programming problem. We first provided the definition of the multi-criteria programming problem and classification of the multicriteria programming methods. Then we applied two multi-criteria programming methods (the STEM method and the PROMETHEE method in solving a problem of multi-criteria optimization production plan in a company from the metal industry. The obtained results indicate a high efficiency of the applied methods in solving the problem. 12. An efficient method for generalized linear multiplicative programming problem with multiplicative constraints. Science.gov (United States) 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. 13. Guide to Geometric Algebra in Practice CERN Document Server Dorst, Leo 2011-01-01 This highly practical "Guide to Geometric Algebra in Practice" reviews algebraic techniques for geometrical problems in computer science and engineering, and the relationships between them. The topics covered range from powerful new theoretical developments, to successful applications, and the development of new software and hardware tools. This title: provides hands-on review exercises throughout the book, together with helpful chapter summaries; presents a concise introductory tutorial to conformal geometric algebra (CGA) in the appendices; examines the application of CGA for the d 14. TRUMP3-JR: a finite difference computer program for nonlinear heat conduction problems International Nuclear Information System (INIS) Ikushima, Takeshi 1984-02-01 Computer program TRUMP3-JR is a revised version of TRUMP3 which is a finite difference computer program used for the solution of multi-dimensional nonlinear heat conduction problems. Pre- and post-processings for input data generation and graphical representations of calculation results of TRUMP3 are avaiable in TRUMP3-JR. The calculation equations, program descriptions and user's instruction are presented. A sample problem is described to demonstrate the use of the program. (author) 15. Geometric scaling as traveling waves International Nuclear Information System (INIS) Munier, S.; Peschanski, R. 2003-01-01 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 16. Asymptotic geometric analysis, part I CERN Document Server Artstein-Avidan, Shiri 2015-01-01 The authors present the theory of asymptotic geometric analysis, a field which lies on the border between geometry and functional analysis. In this field, isometric problems that are typical for geometry in low dimensions are substituted by an "isomorphic" point of view, and an asymptotic approach (as dimension tends to infinity) is introduced. Geometry and analysis meet here in a non-trivial way. Basic examples of geometric inequalities in isomorphic form which are encountered in the book are the "isomorphic isoperimetric inequalities" which led to the discovery of the "concentration phenomen 17. Geometric Design Laboratory Data.gov (United States) Federal Laboratory Consortium — Purpose: The mission of the Geometric Design Laboratory (GDL) is to support the Office of Safety Research and Development in research related to the geometric design... 18. Dijkstra's interpretation of the approach to solving a problem of program correctness Directory of Open Access Journals (Sweden) Markoski Branko 2010-01-01 Full Text Available Proving the program correctness and designing the correct programs are two connected theoretical problems, which are of great practical importance. The first is solved within program analysis, and the second one in program synthesis, although intertwining of these two processes is often due to connection between the analysis and synthesis of programs. Nevertheless, having in mind the automated methods of proving correctness and methods of automatic program synthesis, the difference is easy to tell. This paper presents denotative interpretation of programming calculation explaining semantics by formulae φ and ψ, in such a way that they can be used for defining state sets for program P. 19. SOLUTION OF A MULTIVARIATE STRATIFIED SAMPLING PROBLEM THROUGH CHEBYSHEV GOAL PROGRAMMING Directory of Open Access Journals (Sweden) Mohd. Vaseem Ismail 2010-12-01 Full Text Available In this paper, we consider the problem of minimizing the variances for the various characters with fixed (given budget. Each convex objective function is first linearised at its minimal point where it meets the linear cost constraint. The resulting multiobjective linear programming problem is then solved by Chebyshev goal programming. A numerical example is given to illustrate the procedure. 20. Stacked Deck: An Effective, School-Based Program for the Prevention of Problem Gambling Science.gov (United States) 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… 1. Developing Student Programming and Problem-Solving Skills with Visual Basic Science.gov (United States) 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… 2. Sensitivity analysis of linear programming problem through a recurrent neural network Science.gov (United States) Das, Raja 2017-11-01 In this paper we study the recurrent neural network for solving linear programming problems. To achieve optimality in accuracy and also in computational effort, an algorithm is presented. We investigate the sensitivity analysis of linear programming problem through the neural network. A detailed example is also presented to demonstrate the performance of the recurrent neural network. 3. Fundamental solution of the problem of linear programming and method of its determination Science.gov (United States) 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. 4. On interpolation series related to the Abel-Goncharov problem, with applications to arithmetic-geometric mean relationship and Hellinger integrals NARCIS (Netherlands) K.O. Dzhaparidze (Kacha) 1998-01-01 textabstractIn this paper a convergence class is characterized for special series associated with Gelfond's interpolation problem (a generalization of the Abel-Goncharov problem) when the interpolation nodes are equidistantly distributed within the interval$[0,1]$. As a result, an expansion is 5. Geometric Approaches to Quadratic Equations from Other Times and Places. Science.gov (United States) 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) 6. The Coin Problem and Pseudorandomness for Branching Programs DEFF Research Database (Denmark) Brody, Joshua; Verbin, Elad 2010-01-01 in the model of emph{read-once width-$w$branching programs}. We prove that in order to succeed in this model,$beta$must be at least$1/ (log n)^{Theta(w)}$. For constant$w$this is tight by considering the recursive tribes function, and for other values of$w$this is nearly tight by considering other read...... be distinguished by small-width read-once branching programs. We suggest one application for this kind of theorems: we prove that Nisan's Generator fools width-$w$read-once emph{regular} branching programs, using seed length$O(w^4 log n log log n + log n log (1/eps))$. For$w=eps=Theta(1)$, this seed length... 7. Program evaluation and incentives for administrators of energy efficiency programs: can evaluation solve the principal/agent problem? Energy Technology Data Exchange (ETDEWEB) Blumstein, Carl (Univ. of California, Energy Institute (United States)) 2009-07-01 This paper addresses the nexus between the evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes problems that arise when evaluators are asked to measure program performance by answering the counterfactual question, what would have happened in the absence of the program? Then some ways of addressing these problems are examined. Key conclusions are that 1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, 2) given the current state of knowledge, the decision to tie all of the incentive to program outcomes is misguided, and 3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions. 8. Program evaluation and incentives for administrators of energy-efficiency programs: Can evaluation solve the principal/agent problem? Energy Technology Data Exchange (ETDEWEB) Blumstein, Carl, E-mail: blumstei@berkeley.ed [University of California Energy Institute, 2547 Channing Way, Berkeley, CA 94720 (United States) 2010-10-15 This paper addresses the nexus between evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes the problems that arise when evaluators are asked to measure program performance by answering the counterfactual question-what would have happened in the absence of the program? Then the paper examines some ways of addressing these problems. Key conclusions are (1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, (2) given the current state of knowledge, the decision to tie all incentives to program outcomes is misguided, and (3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions. 9. Program evaluation and incentives for administrators of energy-efficiency programs. Can evaluation solve the principal/agent problem? Energy Technology Data Exchange (ETDEWEB) Blumstein, Carl [University of California Energy Institute, 2547 Channing Way, Berkeley, CA 94720 (United States) 2010-10-15 This paper addresses the nexus between evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes the problems that arise when evaluators are asked to measure program performance by answering the counterfactual question - what would have happened in the absence of the program? Then the paper examines some ways of addressing these problems. Key conclusions are (1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, (2) given the current state of knowledge, the decision to tie all incentives to program outcomes is misguided, and (3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions. (author) 10. Program evaluation and incentives for administrators of energy-efficiency programs: Can evaluation solve the principal/agent problem? International Nuclear Information System (INIS) Blumstein, Carl 2010-01-01 This paper addresses the nexus between evaluation of energy-efficiency programs and incentive payments based on performance for program administrators in California. The paper describes the problems that arise when evaluators are asked to measure program performance by answering the counterfactual question-what would have happened in the absence of the program? Then the paper examines some ways of addressing these problems. Key conclusions are (1) program evaluation cannot precisely and accurately determine the counterfactual, there will always be substantial uncertainty, (2) given the current state of knowledge, the decision to tie all incentives to program outcomes is misguided, and (3) incentive programs should be regularly reviewed and revised so that they can be adapted to new conditions. 11. Geometric procedures for civil engineers CERN Document Server Tonias, Elias C 2016-01-01 This book provides a multitude of geometric constructions usually encountered in civil engineering and surveying practice. A detailed geometric solution is provided to each construction as well as a step-by-step set of programming instructions for incorporation into a computing system. The volume is comprised of 12 chapters and appendices that may be grouped in three major parts: the first is intended for those who love geometry for its own sake and its evolution through the ages, in general, and, more specifically, with the introduction of the computer. The second section addresses geometric features used in the book and provides support procedures used by the constructions presented. The remaining chapters and the appendices contain the various constructions. The volume is ideal for engineering practitioners in civil and construction engineering and allied areas. 12. Integer programming for the generalized high school timetabling problem DEFF Research Database (Denmark) Kristiansen, Simon; Sørensen, Matias; Stidsen, Thomas Riis 2015-01-01 , the XHSTT format serves as a common ground for researchers within this area. This paper describes the first exact method capable of handling an arbitrary instance of the XHSTT format. The method is based on a mixed-integer linear programming (MIP) model, which is solved in two steps with a commercial... 13. Using metrics in stability of stochastic programming problems Czech Academy of Sciences Publication Activity Database Houda, Michal 2005-01-01 Roč. 13, č. 1 (2005), s. 128-134 ISSN 0572-3043 R&D Projects: GA ČR(CZ) GA402/04/1294 Institutional research plan: CEZ:AV0Z10750506 Keywords : stochastic programming * quantitative stability * Wasserstein metrics * Kolmogorov metrics * simulation study Subject RIV: BB - Applied Statistics, Operational Research 14. A novel approach based on preference-based index for interval bilevel linear programming problem OpenAIRE Aihong Ren; Yuping Wang; Xingsi Xue 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-constrain... 15. Method for solving fully fuzzy linear programming problems using deviation degree measure Institute of Scientific and Technical Information of China (English) Haifang Cheng; Weilai Huang; Jianhu Cai 2013-01-01 A new ful y fuzzy linear programming (FFLP) prob-lem with fuzzy equality constraints is discussed. Using deviation degree measures, the FFLP problem is transformed into a crispδ-parametric linear programming (LP) problem. Giving the value of deviation degree in each constraint, the δ-fuzzy optimal so-lution of the FFLP problem can be obtained by solving this LP problem. An algorithm is also proposed to find a balance-fuzzy optimal solution between two goals in conflict: to improve the va-lues of the objective function and to decrease the values of the deviation degrees. A numerical example is solved to il ustrate the proposed method. 16. A new neural network model for solving random interval linear programming problems. Science.gov (United States) 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. Copyright © 2017 Elsevier Ltd. All rights reserved. 17. DESIGN OF EDUCATIONAL PROBLEMS ON LINEAR PROGRAMMING USING SYSTEMS OF COMPUTER MATHEMATICS Directory of Open Access Journals (Sweden) Volodymyr M. Mykhalevych 2013-11-01 Full Text Available From a perspective of the theory of educational problems a problem of substitution in the conditions of ICT use of one discipline by an educational problem of another discipline is represented. Through the example of mathematical problems of linear programming it is showed that a student’s method of operation in the course of an educational problem solving is determinant in the identification of an educational problem in relation to a specific discipline: linear programming, informatics, mathematical modeling, methods of optimization, automatic control theory, calculus etc. It is substantiated the necessity of linear programming educational problems renovation with the purpose of making students free of bulky similar arithmetic calculations and notes which often becomes a barrier to a deeper understanding of key ideas taken as a basis of algorithms used by them. 18. Personalized Computer-Assisted Mathematics Problem-Solving Program and Its Impact on Taiwanese Students Science.gov (United States) 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.… 19. How Does Early Feedback in an Online Programming Course Change Problem Solving? Science.gov (United States) 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… 20. Depandent samples in empirical estimation of stochastic programming problems Czech Academy of Sciences Publication Activity Database Kaňková, Vlasta; Houda, Michal 2006-01-01 Roč. 35, 2/3 (2006), s. 271-279 ISSN 1026-597X R&D Projects: GA ČR GA402/04/1294; GA ČR GD402/03/H057; GA ČR GA402/05/0115 Institutional research plan: CEZ:AV0Z10750506 Keywords : stochastic programming * stability * probability metrics * Wasserstein metric * Kolmogorov metric * simulations Subject RIV: BB - Applied Statistics , Operational Research 1. Probabilistic Quadratic Programming Problems with Some Fuzzy Parameters Directory of Open Access Journals (Sweden) S. K. Barik 2012-01-01 making problem by using some specified random variables and fuzzy numbers. In the present paper, randomness is characterized by Weibull random variables and fuzziness is characterized by triangular and trapezoidal fuzzy number. A defuzzification method has been introduced for finding the crisp values of the fuzzy numbers using the proportional probability density function associated with the membership functions of these fuzzy numbers. An equivalent deterministic crisp model has been established in order to solve the proposed model. Finally, a numerical example is presented to illustrate the solution procedure. 2. An introduction to fuzzy linear programming problems theory, methods and applications CERN Document Server Kaur, Jagdeep 2016-01-01 The book presents a snapshot of the state of the art in the field of fully fuzzy linear programming. The main focus is on showing current methods for finding the fuzzy optimal solution of fully fuzzy linear programming problems in which all the parameters and decision variables are represented by non-negative fuzzy numbers. It presents new methods developed by the authors, as well as existing methods developed by others, and their application to real-world problems, including fuzzy transportation problems. Moreover, it compares the outcomes of the different methods and discusses their advantages/disadvantages. As the first work to collect at one place the most important methods for solving fuzzy linear programming problems, the book represents a useful reference guide for students and researchers, providing them with the necessary theoretical and practical knowledge to deal with linear programming problems under uncertainty. 3. A Genetic-Algorithms-Based Approach for Programming Linear and Quadratic Optimization Problems with Uncertainty Directory of Open Access Journals (Sweden) Weihua Jin 2013-01-01 Full Text Available This paper proposes a genetic-algorithms-based approach as an all-purpose problem-solving method for operation programming problems under uncertainty. The proposed method was applied for management of a municipal solid waste treatment system. Compared to the traditional interactive binary analysis, this approach has fewer limitations and is able to reduce the complexity in solving the inexact linear programming problems and inexact quadratic programming problems. The implementation of this approach was performed using the Genetic Algorithm Solver of MATLAB (trademark of MathWorks. The paper explains the genetic-algorithms-based method and presents details on the computation procedures for each type of inexact operation programming problems. A comparison of the results generated by the proposed method based on genetic algorithms with those produced by the traditional interactive binary analysis method is also presented. 4. Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach Energy Technology Data Exchange (ETDEWEB) Pham, Huyên, E-mail: pham@math.univ-paris-diderot.fr; Wei, Xiaoli, E-mail: tyswxl@gmail.com [Laboratoire de Probabilités et Modèles Aléatoires, CNRS, UMR 7599, Université Paris Diderot (France) 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. 5. Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach International Nuclear Information System (INIS) Pham, Huyên; Wei, Xiaoli 2016-01-01 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. 6. Analysis of the critical thinking process of junior high school students in solving geometric problems by utilizing the v-a-k learning styles model Science.gov (United States) Hananto, R. B.; Kusmayadi, T. A.; Riyadi 2018-05-01 The research aims to identify the critical thinking process of students in solving geometry problems. The geometry problem selected in this study was the building of flat side room (cube). The critical thinking process was implemented to visual, auditory and kinesthetic learning styles. This research was a descriptive analysis research using qualitative method. The subjects of this research were 3 students selected by purposive sampling consisting of visual, auditory, and kinesthetic learning styles. Data collection was done through test, interview, and observation. The results showed that the students' critical thinking process in identifying and defining steps for each learning style were similar in solving problems. The critical thinking differences were seen in enumerate, analyze, list, and self-correct steps. It was also found that critical thinking process of students with kinesthetic learning style was better than visual and auditory learning styles. 7. Determination of the Geometric Form of a Plane of a Tectonic Gap as the Inverse III-posed Problem of Mathematical Physics Science.gov (United States) Sirota, Dmitry; Ivanov, Vadim 2017-11-01 Any mining operations influence stability of natural and technogenic massifs are the reason of emergence of the sources of differences of mechanical tension. These sources generate a quasistationary electric field with a Newtonian potential. The paper reviews the method of determining the shape and size of a flat source field with this kind of potential. This common problem meets in many fields of mining: geological exploration mineral resources, ore deposits, control of mining by underground method, determining coal self-heating source, localization of the rock crack's sources and other applied problems of practical physics. This problems are ill-posed and inverse and solved by converting to Fredholm-Uryson integral equation of the first kind. This equation will be solved by A.N. Tikhonov regularization method. 8. Interactive Approach for Multi-Level Multi-Objective Fractional Programming Problems with Fuzzy Parameters Directory of Open Access Journals (Sweden) M.S. Osman 2018-03-01 Full Text Available In this paper, an interactive approach for solving multi-level multi-objective fractional programming (ML-MOFP problems with fuzzy parameters is presented. The proposed interactive approach makes an extended work of Shi and Xia (1997. In the first phase, the numerical crisp model of the ML-MOFP problem has been developed at a confidence level without changing the fuzzy gist of the problem. Then, the linear model for the ML-MOFP problem is formulated. In the second phase, the interactive approach simplifies the linear multi-level multi-objective model by converting it into separate multi-objective programming problems. Also, each separate multi-objective programming problem of the linear model is solved by the ∊-constraint method and the concept of satisfactoriness. Finally, illustrative examples and comparisons with the previous approaches are utilized to evince the feasibility of the proposed approach. 9. Genetic programming over context-free languages with linear constraints for the knapsack problem: first results. Science.gov (United States) 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. 10. Nonlinear programming for classification problems in machine learning Science.gov (United States) 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. 11. Vocal problems among teachers: evaluation of a preventive voice program. Science.gov (United States) 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. 12. Mixed Waste Integrated Program -- Problem-oriented technology development International Nuclear Information System (INIS) Hart, P.W.; Wolf, S.W.; Berry, J.B. 1994-01-01 The Mixed Waste Integrated Program (MWIP) is responding to the need for DOE mixed waste treatment technologies that meet these dual regulatory requirements. MWIP is developing emerging and innovative treatment technologies to determine process feasibility. Technology demonstrations will be used to determine whether processes are superior to existing technologies in reducing risk, minimizing life-cycle cost, and improving process performance. Technology development is ongoing in technical areas required to process mixed waste: materials handling, chemical/physical treatment, waste destruction, off-gas treatment, final forms, and process monitoring/control. MWIP is currently developing a suite of technologies to process heterogeneous waste. One robust process is the fixed-hearth plasma-arc process that is being developed to treat a wide variety of contaminated materials with minimal characterization. Additional processes encompass steam reforming, including treatment of waste under the debris rule. Advanced off-gas systems are also being developed. Vitrification technologies are being demonstrated for the treatment of homogeneous wastes such as incinerator ash and sludge. An alternative to conventional evaporation for liquid removal--freeze crystallization--is being investigated. Since mercury is present in numerous waste streams, mercury removal technologies are being developed 13. Neutron dosimetry program at Mound - problems and solutions International Nuclear Information System (INIS) Winegardner, M.K. 1991-01-01 The Mound personnel neutron dosimetry program utilizes TLD albedo technology. The neutron dosimeter design incorporates a two-element spectrometer for site-specific neutron quality determination and empirical application of field neutron calibration factors. Design elements feature two Li(6)F (TLD- 600) chips for neutron detection and one Li(7)F (TLD-700) chip for gamma compensation of the TLD- 600 chips. One TLD-600 chip is Cadmium shielded on the front side of the dosimeter, the other is Cadmium shielded from the back side. Tin filters are placed opposite of the Cadmium shield on each of the TLD-600 chips and on both sides of the TLD-700 chip for symmetrically equivalent gamma absorption characteristics. Neutron quality determination is accomplished by the albedo neutron-to- incident thermal neutron response ratio above the Cadmium cutoff. This front Cadmium shielded-to-back Cadmium shielded response ratio, compensated for the presence of gamma radiation, provides the basis for neutron energy calibration via the albedo response curve 14. Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem Directory of Open Access Journals (Sweden) Vladimir A. Emelichev 2002-11-01 Full Text Available We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal solution preserves optimality was obtained. 15. Fuzzy Multi Objective Linear Programming Problem with Imprecise Aspiration Level and Parameters Directory of Open Access Journals (Sweden) Zahra Shahraki 2015-07-01 Full Text Available This paper considers the multi-objective linear programming problems with fuzzygoal for each of the objective functions and constraints. Most existing works deal withlinear membership functions for fuzzy goals. In this paper, exponential membershipfunction is used. 16. Possibility/Necessity-Based Probabilistic Expectation Models for Linear Programming Problems with Discrete Fuzzy Random Variables Directory of Open Access Journals (Sweden) Hideki Katagiri 2017-10-01 Full Text Available This paper considers linear programming problems (LPPs where the objective functions involve discrete fuzzy random variables (fuzzy set-valued discrete random variables. New decision making models, which are useful in fuzzy stochastic environments, are proposed based on both possibility theory and probability theory. In multi-objective cases, Pareto optimal solutions of the proposed models are newly defined. Computational algorithms for obtaining the Pareto optimal solutions of the proposed models are provided. It is shown that problems involving discrete fuzzy random variables can be transformed into deterministic nonlinear mathematical programming problems which can be solved through a conventional mathematical programming solver under practically reasonable assumptions. A numerical example of agriculture production problems is given to demonstrate the applicability of the proposed models to real-world problems in fuzzy stochastic environments. 17. All-union conference on the problem: evaluating the parameters of carbonate reservoirs and geometrization of oil pools in different geotectonic conditions on the territory of the USSR Energy Technology Data Exchange (ETDEWEB) Buryakovskiy, L A; Kondrushkin, Yu M 1979-01-01 Over 200 people participated in the work of the conference: members of sections, scientists and specialist of production and scientific research organizations of the Ministry of the Oil Industry, Ministry of Geology, Ministry of the Gas Industry, USSR State Commission on Mineral Reserves, as well as the Kuybyshev Polytechnical Institute, the Perm State University, the Institute of Problems of Deep Oil and Gas Fields of the Azerbaijan SSR Academy of Sciences. A total of 11 production organizations and 24 institutes from 15 oil recovery regions of the USSR were represented. 18. An optimal maintenance policy for machine replacement problem using dynamic programming OpenAIRE Mohsen Sadegh Amalnik; Morteza Pourgharibshahi 2017-01-01 In this article, we present an acceptance sampling plan for machine replacement problem based on the backward dynamic programming model. Discount dynamic programming is used to solve a two-state machine replacement problem. We plan to design a model for maintenance by consid-ering the quality of the item produced. The purpose of the proposed model is to determine the optimal threshold policy for maintenance in a finite time horizon. We create a decision tree based on a sequential sampling inc... 19. The role of metacognitive skills in solving object-oriented programming problems: a case study Directory of Open Access Journals (Sweden) Marietjie Havenga 2015-07-01 Full Text Available This article reports on the role of metacognitive skills when solving object-oriented programming problems as part of a case study. The research was constructivist-based within an interpretivist approach to explore how four students constructed their own thinking when solving programming problems. A qualitative methodology was employed. Both concept-driven coding and data-driven coding were applied. Two main issues emerged from the findings. Participating students had fragmented knowledge of the object-oriented approach and shortcomings regarding the implementation thereof, and they experienced problems with metacognitive control during all the steps of program development. Based on the findings the use of metacognitive critical control points (MCCPs is proposed to be used as a mechanism to facilitate students in their programming efforts and to prevent loss of control during program development. 20. A new methodological development for solving linear bilevel integer programming problems in hybrid fuzzy environment Directory of Open Access Journals (Sweden) Animesh Biswas 2016-04-01 Full Text Available This paper deals with fuzzy goal programming approach to solve fuzzy linear bilevel integer programming problems with fuzzy probabilistic constraints following Pareto distribution and Frechet distribution. In the proposed approach a new chance constrained programming methodology is developed from the view point of managing those probabilistic constraints in a hybrid fuzzy environment. A method of defuzzification of fuzzy numbers using ?-cut has been adopted to reduce the problem into a linear bilevel integer programming problem. The individual optimal value of the objective of each DM is found in isolation to construct the fuzzy membership goals. Finally, fuzzy goal programming approach is used to achieve maximum degree of each of the membership goals by minimizing under deviational variables in the decision making environment. To demonstrate the efficiency of the proposed approach, a numerical example is provided. 1. Geometric quantization and general relativity International Nuclear Information System (INIS) Souriau, J.-M. 1977-01-01 The purpose of geometric quantization is to give a rigorous mathematical content to the 'correspondence principle' between classical and quantum mechanics. The main tools are borrowed on one hand from differential geometry and topology (differential manifolds, differential forms, fiber bundles, homology and cohomology, homotopy), on the other hand from analysis (functions of positive type, infinite dimensional group representations, pseudo-differential operators). Some satisfactory results have been obtained in the study of dynamical systems, but some fundamental questions are still waiting for an answer. The 'geometric quantization of fields', where some further well known difficulties arise, is still in a preliminary stage. In particular, the geometric quantization on the gravitational field is still a mere project. The situation is even more uncertain due to the fact that there is no experimental evidence of any quantum gravitational effect which could give us a hint towards what we are supposed to look for. The first level of both Quantum Theory, and General Relativity describes passive matter: influence by the field without being a source of it (first quantization and equivalence principle respectively). In both cases this is only an approximation (matter is always a source). But this approximation turns out to be the least uncertain part of the description, because on one hand the first quantization avoids the problems of renormalization and on the other hand the equivalence principle does not imply any choice of field equations (it is known that one can modify Einstein equations at short distances without changing their geometrical properties). (Auth.) 2. An Integer Programming Formulation of the Minimum Common String Partition Problem. Directory of Open Access Journals (Sweden) S M Ferdous Full Text Available We consider the problem of finding a minimum common string partition (MCSP of two strings, which is an NP-hard problem. The MCSP problem is closely related to genome comparison and rearrangement, an important field in Computational Biology. In this paper, we map the MCSP problem into a graph applying a prior technique and using this graph, we develop an Integer Linear Programming (ILP formulation for the problem. We implement the ILP formulation and compare the results with the state-of-the-art algorithms from the literature. The experimental results are found to be promising. 3. Relationship between Maximum Principle and Dynamic Programming for Stochastic Recursive Optimal Control Problems and Applications Directory of Open Access Journals (Sweden) Jingtao Shi 2013-01-01 Full Text Available This paper is concerned with the relationship between maximum principle and dynamic programming for stochastic recursive optimal control problems. Under certain differentiability conditions, relations among the adjoint processes, the generalized Hamiltonian function, and the value function are given. A linear quadratic recursive utility portfolio optimization problem in the financial engineering is discussed as an explicitly illustrated example of the main result. 4. A Smooth Newton Method for Nonlinear Programming Problems with Inequality Constraints Directory of Open Access Journals (Sweden) Vasile Moraru 2012-02-01 Full Text Available The paper presents a reformulation of the Karush-Kuhn-Tucker (KKT system associated nonlinear programming problem into an equivalent system of smooth equations. Classical Newton method is applied to solve the system of equations. The superlinear convergence of the primal sequence, generated by proposed method, is proved. The preliminary numerical results with a problems test set are presented. 5. Analysis of Learning Behavior in a Flipped Programing Classroom Adopting Problem-Solving Strategies Science.gov (United States) 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… 6. An Achievement Degree Analysis Approach to Identifying Learning Problems in Object-Oriented Programming Science.gov (United States) 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. Progress and problems in the Formerly Utilized Sites Remedial Action Program and Surplus Facilities Management Program International Nuclear Information System (INIS) Fiore, J.J.; Turi, G.P. 1988-01-01 The Formerly Utilized Sites Remedial Action Program (FUSRAP) was established in 1974 to identify, evaluate, and as appropriate, conduct remedial actions at sites used in the early years of nuclear energy development by the Manhattan Engineer District and the Atomic Energy Commission (AEC). This program currently has 29 sites and is evaluating 350 other sites for possible inclusion in the program. Another remedial action program in the Department of Energy's (DOE) Division of Facility and Site Decommissioning Projects is the Surplus Facilities Management Program (SFMP). The SFMP involves the safe management, decontamination and disposal of surplus DOE contaminated facilities which were not related to defense activities. There are currently 33 projects at 15 different sites in the program. These two programs have made steady progress over the last 10 or so years in cleaning up sites so that they can be reused or released for unrestricted use. Work has been completed at 8 of the FUSRAP sites and three of the SFMP sites 8. CASKETSS-HEAT: a finite difference computer program for nonlinear heat conduction problems International Nuclear Information System (INIS) Ikushima, Takeshi 1988-12-01 A heat conduction program CASKETSS-HEAT has been developed. CASKETSS-HEAT is a finite difference computer program used for the solution of multi-dimensional nonlinear heat conduction problems. Main features of CASKETSS-HEAT are as follows. (1) One, two and three-dimensional geometries for heat conduction calculation are available. (2) Convection and radiation heat transfer of boundry can be specified. (3) Phase change and chemical change can be treated. (4) Finned surface heat transfer can be treated easily. (5) Data memory allocation in the program is variable according to problem size. (6) The program is a compatible heat transfer analysis program to the stress analysis program SAP4 and SAP5. (7) Pre- and post-processing for input data generation and graphic representation of calculation results are available. In the paper, brief illustration of calculation method, input data and sample calculation are presented. (author) 9. Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control Energy Technology Data Exchange (ETDEWEB) Gaitsgory, Vladimir, E-mail: vladimir.gaitsgory@mq.edu.au [Macquarie University, Department of Mathematics (Australia); Rossomakhine, Sergey, E-mail: serguei.rossomakhine@flinders.edu.au [Flinders University, Flinders Mathematical Sciences Laboratory, School of Computer Science, Engineering and Mathematics (Australia) 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. 10. Geometric optimization and sums of algebraic functions KAUST Repository Vigneron, Antoine E. 2014-01-01 We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of nonnegative, constant description complexity algebraic functions. We first give an FPTAS for optimizing such a sum of algebraic functions, and then we apply it to several geometric optimization problems. We obtain the first FPTAS for two fundamental geometric shape-matching problems in fixed dimension: maximizing the volume of overlap of two polyhedra under rigid motions and minimizing their symmetric difference. We obtain the first FPTAS for other problems in fixed dimension, such as computing an optimal ray in a weighted subdivision, finding the largest axially symmetric subset of a polyhedron, and computing minimum-area hulls. 11. NACHOS: a finite element computer program for incompressible flow problems. Part I. Theoretical background International Nuclear Information System (INIS) Gartling, D.K. 1978-04-01 The theoretical background for the finite element computer program, NACHOS, is presented in detail. The NACHOS code is designed for the two-dimensional analysis of viscous incompressible fluid flows, including the effects of heat transfer. A general description of the fluid/thermal boundary value problems treated by the program is described. The finite element method and the associated numerical methods used in the NACHOS code are also presented. Instructions for use of the program are documented in SAND77-1334 12. Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages Directory of Open Access Journals (Sweden) Hassan Ismkhan 2014-01-01 Full Text Available The traveling salesman problem (TSP is one of the most famous problems. Many applications and programming tools have been developed to handle TSP. However, it seems to be essential to provide easy programming tools according to state-of-the-art algorithms. Therefore, we have collected and programmed new easy tools by the three object-oriented languages. In this paper, we present ADT (abstract data type of developed tools at first; then we analyze their performance by experiments. We also design a hybrid genetic algorithm (HGA by developed tools. Experimental results show that the proposed HGA is comparable with the recent state-of-the-art applications. 13. APPLYING ROBUST RANKING METHOD IN TWO PHASE FUZZY OPTIMIZATION LINEAR PROGRAMMING PROBLEMS (FOLPP Directory of Open Access Journals (Sweden) Monalisha Pattnaik 2014-12-01 Full Text Available Background: This paper explores the solutions to the fuzzy optimization linear program problems (FOLPP where some parameters are fuzzy numbers. In practice, there are many problems in which all decision parameters are fuzzy numbers, and such problems are usually solved by either probabilistic programming or multi-objective programming methods. Methods: In this paper, using the concept of comparison of fuzzy numbers, a very effective method is introduced for solving these problems. This paper extends linear programming based problem in fuzzy environment. With the problem assumptions, the optimal solution can still be theoretically solved using the two phase simplex based method in fuzzy environment. To handle the fuzzy decision variables can be initially generated and then solved and improved sequentially using the fuzzy decision approach by introducing robust ranking technique. Results and conclusions: The model is illustrated with an application and a post optimal analysis approach is obtained. The proposed procedure was programmed with MATLAB (R2009a version software for plotting the four dimensional slice diagram to the application. Finally, numerical example is presented to illustrate the effectiveness of the theoretical results, and to gain additional managerial insights. 14. Developing a pedagogical problem solving view for mathematics teachers with two reflection programs Directory of Open Access Journals (Sweden) Bracha KRAMARSKI 2009-10-01 Full Text Available 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 discourse (R_D training. The S_Q program was based on the IMPROVE self-questioning approach which emphasizes systematic discussion along the phases of mathematical or pedagogical problem solving as student and teacher. The R_D program emphasized discussion of standard based teaching and learning principles. Findings indicated that systematic reflection support (S_Q is effective for developing mathematics PCK, and strengthening metacognitive knowledge of mathematics teachers, more than reflection discourse (R_D. No differences were found between the groups in developing beliefs about teaching mathematics in using problem solving view. 15. A hybrid Constraint Programming/Mixed Integer Programming framework for the preventive signaling maintenance crew scheduling problem DEFF Research Database (Denmark) Pour, Shahrzad M.; Drake, John H.; Ejlertsen, Lena Secher 2017-01-01 A railway signaling system is a complex and interdependent system which should ensure the safe operation of trains. We introduce and address a mixed integer optimisation model for the preventive signal maintenance crew scheduling problem in the Danish railway system. The problem contains many...... to feed as ‘warm start’ solutions to a Mixed Integer Programming (MIP) solver for further optimisation. We apply the CP/MIP framework to a section of the Danish rail network and benchmark our results against both direct application of a MIP solver and modelling the problem as a Constraint Optimisation... 16. On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study KAUST Repository Lima, Ricardo 2016-06-16 This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York 17. On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study KAUST Repository Lima, Ricardo; Grossmann, Ignacio E. 2016-01-01 This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York 18. A Kind of Nonlinear Programming Problem Based on Mixed Fuzzy Relation Equations Constraints Science.gov (United States) Li, Jinquan; Feng, Shuang; Mi, Honghai In this work, a kind of nonlinear programming problem with non-differential objective function and under the constraints expressed by a system of mixed fuzzy relation equations is investigated. First, some properties of this kind of optimization problem are obtained. Then, a polynomial-time algorithm for this kind of optimization problem is proposed based on these properties. Furthermore, we show that this algorithm is optimal for the considered optimization problem in this paper. Finally, numerical examples are provided to illustrate our algorithms. 19. The application of the fall-vector method in decomposition schemes for the solution of integer linear programming problems International Nuclear Information System (INIS) Sergienko, I.V.; Golodnikov, A.N. 1984-01-01 This article applies the methods of decompositions, which are used to solve continuous linear problems, to integer and partially integer problems. The fall-vector method is used to solve the obtained coordinate problems. An algorithm of the fall-vector is described. The Kornai-Liptak decomposition principle is used to reduce the integer linear programming problem to integer linear programming problems of a smaller dimension and to a discrete coordinate problem with simple constraints 20. Geometric reconstruction methods for electron tomography DEFF Research Database (Denmark) Alpers, Andreas; Gardner, Richard J.; König, Stefan 2013-01-01 Electron tomography is becoming an increasingly important tool in materials science for studying the three-dimensional morphologies and chemical compositions of nanostructures. The image quality obtained by many current algorithms is seriously affected by the problems of missing wedge artefacts...... and discuss several algorithms from the mathematical fields of geometric and discrete tomography. The algorithms incorporate geometric prior knowledge (mainly convexity and homogeneity), which also in principle considerably reduces the number of tilt angles required. Results are discussed... 1. Interior Point Method for Solving Fuzzy Number Linear Programming Problems Using Linear Ranking Function Directory of Open Access Journals (Sweden) Yi-hua Zhong 2013-01-01 Full Text Available Recently, various methods have been developed for solving linear programming problems with fuzzy number, such as simplex method and dual simplex method. But their computational complexities are exponential, which is not satisfactory for solving large-scale fuzzy linear programming problems, especially in the engineering field. A new method which can solve large-scale fuzzy number linear programming problems is presented in this paper, which is named a revised interior point method. Its idea is similar to that of interior point method used for solving linear programming problems in crisp environment before, but its feasible direction and step size are chosen by using trapezoidal fuzzy numbers, linear ranking function, fuzzy vector, and their operations, and its end condition is involved in linear ranking function. Their correctness and rationality are proved. Moreover, choice of the initial interior point and some factors influencing the results of this method are also discussed and analyzed. The result of algorithm analysis and example study that shows proper safety factor parameter, accuracy parameter, and initial interior point of this method may reduce iterations and they can be selected easily according to the actual needs. Finally, the method proposed in this paper is an alternative method for solving fuzzy number linear programming problems. 2. The new Space Shuttle Transportation System (STS) - Problem, performance, supportability, and programmatic trending program Science.gov (United States) Crawford, J. L.; Rodney, G. A. 1989-01-01 This paper describes the NASA Space Shuttle Trend Analysis program. The four main areas of the program - problem/reliability, performance, supportability, and programmatic trending - are defined, along with motivation for these areas, the statistical methods used, and illustrative Space Shuttle applications. Also described is the NASA Safety, Reliability, Maintainability and Quality Assurance (SRM&QA) Management Information Center, used to focus management attention on key near-term launch concerns and long-range mission trend issues. Finally, the computer data bases used to support the program and future program enhancements are discussed. 3. IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS Science.gov (United States) 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. 4. Problem Space Matters: Evaluation of a German Enrichment Program for Gifted Children. Science.gov (United States) Welter, Marisete M; Jaarsveld, Saskia; Lachmann, Thomas 2018-01-01 We studied the development of cognitive abilities related to intelligence and creativity ( N = 48, 6-10 years old), using a longitudinal design (over one school year), in order to evaluate an Enrichment Program for gifted primary school children initiated by the government of the German federal state of Rhineland-Palatinate ( Entdeckertag Rheinland Pfalz , Germany; ET; Day of Discoverers). A group of German primary school children ( N = 24), identified earlier as intellectually gifted and selected to join the ET program was compared to a gender-, class- and IQ- matched group of control children that did not participate in this program. All participants performed the Standard Progressive Matrices (SPM) test, which measures intelligence in well-defined problem space; the Creative Reasoning Task (CRT), which measures intelligence in ill-defined problem space; and the test of creative thinking-drawing production (TCT-DP), which measures creativity, also in ill-defined problem space. Results revealed that problem space matters: the ET program is effective only for the improvement of intelligence operating in well-defined problem space. An effect was found for intelligence as measured by SPM only, but neither for intelligence operating in ill-defined problem space (CRT) nor for creativity (TCT-DP). This suggests that, depending on the type of problem spaces presented, different cognitive abilities are elicited in the same child. Therefore, enrichment programs for gifted, but also for children attending traditional schools, should provide opportunities to develop cognitive abilities related to intelligence, operating in both well- and ill-defined problem spaces, and to creativity in a parallel, using an interactive approach. 5. Analysis of the efficiency of the linearization techniques for solving multi-objective linear fractional programming problems by goal programming Directory of Open Access Journals (Sweden) Tunjo Perić 2017-01-01 Full Text Available This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1 Taylor’s polynomial linearization approximation, (2 the method of variable change, and (3 a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a using the optimal value of the objective functions as the decision makers’ aspirations, and (b the decision makers’ aspirations are given by the decision makers. As the criteria for the analysis we use the efficiency of the obtained solutions and the difficulties the analyst comes upon in preparing the linearization models. To analyze the applicability of the linearization techniques incorporated in the linear goal programming method we use an example of a financial structure optimization problem. 6. Impossible Geometric Constructions: A Calculus Writing Project Science.gov (United States) 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… 7. Geometric group theory CERN Document Server Druţu, Cornelia 2018-01-01 The key idea in geometric group theory is to study infinite groups by endowing them with a metric and treating them as geometric spaces. This applies to many groups naturally appearing in topology, geometry, and algebra, such as fundamental groups of manifolds, groups of matrices with integer coefficients, etc. The primary focus of this book is to cover the foundations of geometric group theory, including coarse topology, ultralimits and asymptotic cones, hyperbolic groups, isoperimetric inequalities, growth of groups, amenability, Kazhdan's Property (T) and the Haagerup property, as well as their characterizations in terms of group actions on median spaces and spaces with walls. The book contains proofs of several fundamental results of geometric group theory, such as Gromov's theorem on groups of polynomial growth, Tits's alternative, Stallings's theorem on ends of groups, Dunwoody's accessibility theorem, the Mostow Rigidity Theorem, and quasiisometric rigidity theorems of Tukia and Schwartz. This is the f... 8. Geometric and engineering drawing CERN Document Server Morling, K 2010-01-01 The new edition of this successful text describes all the geometric instructions and engineering drawing information that are likely to be needed by anyone preparing or interpreting drawings or designs with plenty of exercises to practice these principles. 9. Differential geometric structures CERN Document Server Poor, Walter A 2007-01-01 This introductory text defines geometric structure by specifying parallel transport in an appropriate fiber bundle and focusing on simplest cases of linear parallel transport in a vector bundle. 1981 edition. 10. Geometric ghosts and unitarity International Nuclear Information System (INIS) Ne'eman, Y. 1980-09-01 A review is given of the geometrical identification of the renormalization ghosts and the resulting derivation of Unitarity equations (BRST) for various gauges: Yang-Mills, Kalb-Ramond, and Soft-Group-Manifold 11. Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming DEFF Research Database (Denmark) Rauff Lind Christensen, Tue; Klose, Andreas; Andersen, Kim Allan important aspects of supplier selection, an important application of the SSFCTP, this does not reflect the real life situation. First, transportation costs faced by many companies are in fact piecewise linear. Secondly, when suppliers offer discounts, either incremental or all-unit discounts, such savings......The Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem (SSFCMCTP) is a problem with versatile applications. This problem is a generalization of the Single-Sink, Fixed-Charge Transportation Problem (SSFCTP), which has a fixed-charge, linear cost structure. However, in at least two...... are neglected in the SSFCTP. The SSFCMCTP overcome this problem by incorporating a staircase cost structure in the cost function instead of the usual one used in SSFCTP. We present a dynamic programming algorithm for the resulting problem. To enhance the performance of the generic algorithm a number... 12. Asymptotic and geometrical quantization International Nuclear Information System (INIS) Karasev, M.V.; Maslov, V.P. 1984-01-01 The main ideas of geometric-, deformation- and asymptotic quantizations are compared. It is shown that, on the one hand, the asymptotic approach is a direct generalization of exact geometric quantization, on the other hand, it generates deformation in multiplication of symbols and Poisson brackets. Besides investigating the general quantization diagram, its applications to the calculation of asymptotics of a series of eigenvalues of operators possessing symmetry groups are considered 13. Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming DEFF Research Database (Denmark) Christensen, Tue; Andersen, Kim Allan; Klose, Andreas 2013-01-01 This paper considers a minimum-cost network flow problem in a bipartite graph with a single sink. The transportation costs exhibit a staircase cost structure because such types of transportation cost functions are often found in practice. We present a dynamic programming algorithm for solving...... this so-called single-sink, fixed-charge, multiple-choice transportation problem exactly. The method exploits heuristics and lower bounds to peg binary variables, improve bounds on flow variables, and reduce the state-space variable. In this way, the dynamic programming method is able to solve large...... instances with up to 10,000 nodes and 10 different transportation modes in a few seconds, much less time than required by a widely used mixed-integer programming solver and other methods proposed in the literature for this problem.... 14. On geometrized gravitation theories International Nuclear Information System (INIS) Logunov, A.A.; Folomeshkin, V.N. 1977-01-01 General properties of the geometrized gravitation theories have been considered. Geometrization of the theory is realized only to the extent that by necessity follows from an experiment (geometrization of the density of the matter Lagrangian only). Aor a general case the gravitation field equations and the equations of motion for matter are formulated in the different Riemann spaces. A covariant formulation of the energy-momentum conservation laws is given in an arbitrary geometrized theory. The noncovariant notion of ''pseudotensor'' is not required in formulating the conservation laws. It is shown that in the general case (i.e., when there is an explicit dependence of the matter Lagrangian density on the covariant derivatives) a symmetric energy-momentum tensor of the matter is explicitly dependent on the curvature tensor. There are enlisted different geometrized theories that describe a known set of the experimental facts. The properties of one of the versions of the quasilinear geometrized theory that describes the experimental facts are considered. In such a theory the fundamental static spherically symmetrical solution has a singularity only in the coordinate origin. The theory permits to create a satisfactory model of the homogeneous nonstationary Universe 15. An Improved Particle Swarm Optimization for Solving Bilevel Multiobjective Programming Problem Directory of Open Access Journals (Sweden) Tao Zhang 2012-01-01 Full Text Available An improved particle swarm optimization (PSO algorithm is proposed for solving bilevel multiobjective programming problem (BLMPP. For such problems, the proposed algorithm directly simulates the decision process of bilevel programming, which is different from most traditional algorithms designed for specific versions or based on specific assumptions. The BLMPP is transformed to solve multiobjective optimization problems in the upper level and the lower level interactively by an improved PSO. And a set of approximate Pareto optimal solutions for BLMPP is obtained using the elite strategy. This interactive procedure is repeated until the accurate Pareto optimal solutions of the original problem are found. Finally, some numerical examples are given to illustrate the feasibility of the proposed algorithm. 16. Seminar Neutronika-2012. Neutron-physical problems of nuclear-power engineering. Program and abstracts International Nuclear Information System (INIS) 2012-01-01 On October, 30 - November, 2 in State Scientific Center of the Russian Federation - Institute for Physics and Power Engineering named after A.I. Leypunsky a seminar Neutron-physical problems of nuclear power engineering - Neutronika-2012 took place. On the seminar the following problems were discussed: justification of neutron-physical characteristics of reactor facilities and innovation projects; constant support of neutron-physical calculations of nuclear power installations; numerical simulation during solving reactor physics problems; simulation of neutron-physical processes in reactor facilities by Monte Carlo method; development and verification of programs for reactor facilities neutron-physical calculations; algorithms and programs for solving nonstationary problems of neutron-physical calculation of nuclear reactors; analysis of integral and reactor experiments, experimental database; justification of nuclear and radiation safety of fuel cycle [ru 17. Development and Validation of the Motivation for Tutoring Questionnaire in Problem-Based Learning Programs OpenAIRE Kassab, Salah Eldin; Hassan, Nahla; El-Araby, Shimaa; Salem, Abdel Halim; Alrebish, Saleh Ali; Al-Amro, Ahmed S.; Al-Shobaili, Hani A.; Hamdy, Hossam 2017-01-01 Purpose: There are no published instruments, which measure tutor motivation for conducting small group tutorials in problem-based learning programs. Therefore, we aimed to develop a motivation for tutoring questionnaire in problem-based learning (MTQ-PBL) and evaluate its construct validity. Methods: The questionnaire included 28 items representing four constructs: tutoring self-efficacy (15 items), tutoring interest (6 items), tutoring value (4 items), and tutoring effort (3 items). Tutor... 18. Stress-constrained truss topology optimization problems that can be solved by linear programming DEFF Research Database (Denmark) Stolpe, Mathias; Svanberg, Krister 2004-01-01 We consider the problem of simultaneously selecting the material and determining the area of each bar in a truss structure in such a way that the cost of the structure is minimized subject to stress constraints under a single load condition. We show that such problems can be solved by linear...... programming to give the global optimum, and that two different materials are always sufficient in an optimal structure.... 19. Fuzzy solution of the linear programming problem with interval coefficients in the constraints OpenAIRE Dorota Kuchta 2005-01-01 A fuzzy concept of solving the linear programming problem with interval coefficients is proposed. For each optimism level of the decision maker (where the optimism concerns the certainty that no errors have been committed in the estimation of the interval coefficients and the belief that optimistic realisations of the interval coefficients will occur) another interval solution of the problem will be generated and the decision maker will be able to choose the final solution having a complete v... 20. Solving the Frequency Assignment Problem by Site Availability and Constraint Programming OpenAIRE Linhares, Andrea Carneiro; Torres-Moreno, Juan-Manuel; Peinl, Peter; Michelon, Philippe 2010-01-01 The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted ... 1. An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems Science.gov (United States) Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri 2018-01-01 The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems. 2. Heuristic algorithm for single resource constrained project scheduling problem based on the dynamic programming Directory of Open Access Journals (Sweden) Stanimirović Ivan 2009-01-01 Full Text Available We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion. We compare the implementation of this method with well-known heuristic scheduling method, called Minimum Slack First (known also as Gray-Kidd algorithm, as well as with Microsoft Project. 3. A novel approach based on preference-based index for interval bilevel linear programming problem. Science.gov (United States) 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. 4. A novel approach based on preference-based index for interval bilevel linear programming problem Directory of Open Access Journals (Sweden) Aihong Ren 2017-05-01 Full Text Available Abstract 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 ⪯ m w$\\preceq_{mw}$. 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. 5. Performance comparison of genetic algorithms and particle swarm optimization for model integer programming bus timetabling problem Science.gov (United States) Wihartiko, F. D.; Wijayanti, H.; Virgantari, F. 2018-03-01 Genetic Algorithm (GA) is a common algorithm used to solve optimization problems with artificial intelligence approach. Similarly, the Particle Swarm Optimization (PSO) algorithm. Both algorithms have different advantages and disadvantages when applied to the case of optimization of the Model Integer Programming for Bus Timetabling Problem (MIPBTP), where in the case of MIPBTP will be found the optimal number of trips confronted with various constraints. The comparison results show that the PSO algorithm is superior in terms of complexity, accuracy, iteration and program simplicity in finding the optimal solution. 6. The Expected Loss in the Discretization of Multistage Stochastic Programming Problems - Estimation and Convergence Rate Czech Academy of Sciences Publication Activity Database Šmíd, Martin 2009-01-01 Roč. 165, č. 1 (2009), s. 29-45 ISSN 0254-5330 R&D Projects: GA ČR GA402/04/1294 Institutional research plan: CEZ:AV0Z10750506 Keywords : multistage stochastic programming problems * approximation * discretization * Monte Carlo Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.961, year: 2009 http://library.utia.cas.cz/separaty/2008/E/smid-the expected loss in the discretization of multistage stochastic programming problems - estimation and convergence rate.pdf 7. Geometric mean for subspace selection. Science.gov (United States) Tao, Dacheng; Li, Xuelong; Wu, Xindong; Maybank, Stephen J 2009-02-01 Subspace selection approaches are powerful tools in pattern classification and data visualization. One of the most important subspace approaches is the linear dimensionality reduction step in the Fisher's linear discriminant analysis (FLDA), which has been successfully employed in many fields such as biometrics, bioinformatics, and multimedia information management. However, the linear dimensionality reduction step in FLDA has a critical drawback: for a classification task with c classes, if the dimension of the projected subspace is strictly lower than c - 1, the projection to a subspace tends to merge those classes, which are close together in the original feature space. If separate classes are sampled from Gaussian distributions, all with identical covariance matrices, then the linear dimensionality reduction step in FLDA maximizes the mean value of the Kullback-Leibler (KL) divergences between different classes. Based on this viewpoint, the geometric mean for subspace selection is studied in this paper. Three criteria are analyzed: 1) maximization of the geometric mean of the KL divergences, 2) maximization of the geometric mean of the normalized KL divergences, and 3) the combination of 1 and 2. Preliminary experimental results based on synthetic data, UCI Machine Learning Repository, and handwriting digits show that the third criterion is a potential discriminative subspace selection method, which significantly reduces the class separation problem in comparing with the linear dimensionality reduction step in FLDA and its several representative extensions. 8. A Hybrid Programming Framework for Modeling and Solving Constraint Satisfaction and Optimization Problems Directory of Open Access Journals (Sweden) Paweł Sitek 2016-01-01 Full Text Available This paper proposes a hybrid programming framework for modeling and solving of constraint satisfaction problems (CSPs and constraint optimization problems (COPs. Two paradigms, CLP (constraint logic programming and MP (mathematical programming, are integrated in the framework. The integration is supplemented with the original method of problem transformation, used in the framework as a presolving method. The transformation substantially reduces the feasible solution space. The framework automatically generates CSP and COP models based on current values of data instances, questions asked by a user, and set of predicates and facts of the problem being modeled, which altogether constitute a knowledge database for the given problem. This dynamic generation of dedicated models, based on the knowledge base, together with the parameters changing externally, for example, the user’s questions, is the implementation of the autonomous search concept. The models are solved using the internal or external solvers integrated with the framework. The architecture of the framework as well as its implementation outline is also included in the paper. The effectiveness of the framework regarding the modeling and solution search is assessed through the illustrative examples relating to scheduling problems with additional constrained resources. 9. Geometrical optics and optimal transport. Science.gov (United States) Rubinstein, Jacob; Wolansky, Gershon 2017-10-01 The Fermat principle is generalized to a system of rays. It is shown that all the ray mappings that are compatible with two given intensities of a monochromatic wave, measured at two planes, are stationary points of a canonical functional, which is the weighted average of the actions of all the rays. It is further shown that there exist at least two stationary points for this functional, implying that in the geometrical optics regime the phase from intensity problem has inherently more than one solution. The caustic structures of all the possible ray mappings are analyzed. A number of simulations illustrate the theoretical considerations. 10. The Artificial Neural Networks Based on Scalarization Method for a Class of Bilevel Biobjective Programming Problem Science.gov (United States) Chen, Zhong; Liu, June; Li, Xiong 2017-01-01 A two-stage artificial neural network (ANN) based on scalarization method is proposed for bilevel biobjective programming problem (BLBOP). The induced set of the BLBOP is firstly expressed as the set of minimal solutions of a biobjective optimization problem by using scalar approach, and then the whole efficient set of the BLBOP is derived by the proposed two-stage ANN for exploring the induced set. In order to illustrate the proposed method, seven numerical examples are tested and compared with results in the classical literature. Finally, a practical problem is solved by the proposed algorithm. PMID:29312446 11. QUANTITY DISCOUNTS IN SUPPLIER SELECTION PROBLEM BY USE OF FUZZY MULTI-CRITERIA PROGRAMMING Directory of Open Access Journals (Sweden) Tunjo Perić 2011-02-01 Full Text Available Supplier selection in supply chain is a multi-criteria problem that involves a number of quantitative and qualitative factors. This paper deals with a concrete problem of flour purchase by a company that manufactures bakery products and the purchasing price of flour depends on the quantity ordered. The criteria for supplier selection and quantities supplied by individual suppliers are: purchase costs, product quality and reliability of suppliers. The problem is solved using a model that combines revised weighting method and fuzzy multi-criteria linear programming (FMCLP. The paper highlights the efficiency of the proposed methodology in conditions when purchasing prices depend on order quantities. 12. An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems International Nuclear Information System (INIS) Zhang Jianzhong; Zhang Liwei 2010-01-01 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 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/√r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC 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. 13. Solutions to estimation problems for scalar hamilton-jacobi equations using linear programming KAUST Repository Claudel, Christian G.; Chamoin, Timothee; Bayen, Alexandre M. 2014-01-01 This brief presents new convex formulations for solving estimation problems in systems modeled by scalar Hamilton-Jacobi (HJ) equations. Using a semi-analytic formula, we show that the constraints resulting from a HJ equation are convex, and can be written as a set of linear inequalities. We use this fact to pose various (and seemingly unrelated) estimation problems related to traffic flow-engineering as a set of linear programs. In particular, we solve data assimilation and data reconciliation problems for estimating the state of a system when the model and measurement constraints are incompatible. We also solve traffic estimation problems, such as travel time estimation or density estimation. For all these problems, a numerical implementation is performed using experimental data from the Mobile Century experiment. In the context of reproducible research, the code and data used to compute the results presented in this brief have been posted online and are accessible to regenerate the results. © 2013 IEEE. 14. A Mixed Integer Linear Programming Approach to Electrical Stimulation Optimization Problems. Science.gov (United States) Abouelseoud, Gehan; Abouelseoud, Yasmine; Shoukry, Amin; Ismail, Nour; Mekky, Jaidaa 2018-02-01 Electrical stimulation optimization is a challenging problem. Even when a single region is targeted for excitation, the problem remains a constrained multi-objective optimization problem. The constrained nature of the problem results from safety concerns while its multi-objectives originate from the requirement that non-targeted regions should remain unaffected. In this paper, we propose a mixed integer linear programming formulation that can successfully address the challenges facing this problem. Moreover, the proposed framework can conclusively check the feasibility of the stimulation goals. This helps researchers to avoid wasting time trying to achieve goals that are impossible under a chosen stimulation setup. The superiority of the proposed framework over alternative methods is demonstrated through simulation examples. 15. Constraint Programming Approach to the Problem of Generating Milton Babbitt's All-partition Arrays DEFF Research Database (Denmark) Tanaka, Tsubasa; Bemman, Brian; Meredith, David 2016-01-01 elements and corresponding to a distinct integer partition of 12. Constraint programming (CP) is a tool for solving such combinatorial and constraint satisfaction problems. In this paper, we use CP for the first time to formalize this problem in generating an all-partition array. Solving the whole...... of this problem is difficult and few known solutions exist. Therefore, we propose solving two sub-problems and joining these to form a complete solution. We conclude by presenting a solution found using this method. Our solution is the first we are aware of to be discovered automatically using a computer......Milton Babbitt (1916–2011) was a composer of twelve-tone serial music noted for creating the all-partition array. One part of the problem in generating an all-partition array requires finding a covering of a pitch-class matrix by a collection of sets, each forming a region containing 12 distinct... 16. Field guide to geometrical optics CERN Document Server Greivenkamp, John E 2004-01-01 This Field Guide derives from the treatment of geometrical optics that has evolved from both the undergraduate and graduate programs at the Optical Sciences Center at the University of Arizona. The development is both rigorous and complete, and it features a consistent notation and sign convention. This volume covers Gaussian imagery, paraxial optics, first-order optical system design, system examples, illumination, chromatic effects, and an introduction to aberrations. The appendices provide supplemental material on radiometry and photometry, the human eye, and several other topics. 17. Problems Analysis on Increasing Rice Production Through Food Estate Program in Bulungan Regency, North Kalimantan Science.gov (United States) Setyo, P.; Elly, J. 2018-05-01 To increase rice production in the Province of North Kalimantan, the provincial government has launched a Food Estate Program. The program is also a central government program in relation to government policies on food security. One of the food estate development areas is the Delta Kayan Food Estate of 50,000 hectares in Bulungan Regency, where about 30,000 hectares area is a tidal land with a very fertile alluvial soil type. This policy study aims to identify and analyze problems of increasing rice production through food estate development in North Kalimantan Province and formulate priority programs as recommendations for policy making in increasing rice production. The study has identified a number of problems of increasing rice production, such as land tenure, land suitability, water system, infrastructure, accessibility of production factors, institutional, and capacity of human resources. The Analytic Hierarchy Process was applied to develop priority programs, resulting in the three most important programs being water management, improving access to production factors, and improving the capacity of human resources. Action plans related to priority programs have also been identified. 18. A note on solving large-scale zero-one programming problems NARCIS (Netherlands) Adema, Jos J. 1988-01-01 A heuristic for solving large-scale zero-one programming problems is provided. The heuristic is based on the modifications made by H. Crowder et al. (1983) to the standard branch-and-bound strategy. First, the initialization is modified. The modification is only useful if the objective function 19. The Effects of Teaching Programming via Scratch on Problem Solving Skills: A Discussion from Learners' Perspective Science.gov (United States) 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… 20. A Cooperative Training Program for Students with Severe Behavior Problems: Description and Comparative Evaluation. Science.gov (United States) 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… 1. Multiobjective Two-Stage Stochastic Programming Problems with Interval Discrete Random Variables Directory of Open Access Journals (Sweden) S. K. Barik 2012-01-01 Full Text Available Most of the real-life decision-making problems have more than one conflicting and incommensurable objective functions. In this paper, we present a multiobjective two-stage stochastic linear programming problem considering some parameters of the linear constraints as interval type discrete random variables with known probability distribution. Randomness of the discrete intervals are considered for the model parameters. Further, the concepts of best optimum and worst optimum solution are analyzed in two-stage stochastic programming. To solve the stated problem, first we remove the randomness of the problem and formulate an equivalent deterministic linear programming model with multiobjective interval coefficients. Then the deterministic multiobjective model is solved using weighting method, where we apply the solution procedure of interval linear programming technique. We obtain the upper and lower bound of the objective function as the best and the worst value, respectively. It highlights the possible risk involved in the decision-making tool. A numerical example is presented to demonstrate the proposed solution procedure. 2. On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems NARCIS (Netherlands) de Klerk, E.; Laurent, M. 2011-01-01 The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization problems is known to converge finitely under some assumptions. [J. B. Lasserre, Convexity in semialgebraic geometry and polynomial optimization, SIAM J. Optim., 19 (2009), pp. 1995–2014]. We give a 3. Comparison of Cursive Handwriting Instruction Programs among Students without Identified Problems Science.gov (United States) 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… 4. Visual, Algebraic and Mixed Strategies in Visually Presented Linear Programming Problems. Science.gov (United States) 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.)… 5. Results of Four Studies on Logo Programming, Problem Solving, and Knowledge-Based Instructional Design. Science.gov (United States) Swan, Karen; Black, John B. The results of four research studies conducted with subjects ranging in age and ability from elementary to graduate school students demonstrate that Logo programming environments can be instrumental in the development of five particular problem solving strategies: (1) subgoals formation; (2) forward chaining; (3) systematic trial and error; (4)… 6. Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems Czech Academy of Sciences Publication Activity Database Lukšan, Ladislav; Vlček, Jan 1998-01-01 Roč. 5, č. 3 (1998), s. 219-247 ISSN 1070-5325 R&D Projects: GA ČR GA201/96/0918 Keywords : nonlinear programming * sparse problems * equality constraints * truncated Newton method * augmented Lagrangian function * indefinite systems * indefinite preconditioners * conjugate gradient method * residual smoothing Subject RIV: BA - General Mathematics Impact factor: 0.741, year: 1998 7. Homotopy Method for a General Multiobjective Programming Problem under Generalized Quasinormal Cone Condition Directory of Open Access Journals (Sweden) X. Zhao 2012-01-01 Full Text Available A combined interior point homotopy continuation method is proposed for solving general multiobjective programming problem. We prove the existence and convergence of a smooth homotopy path from almost any interior initial interior point to a solution of the KKT system under some basic assumptions. 8. Universal algorithms and programs for calculating the motion parameters in the two-body problem Science.gov (United States) 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. 9. Enhancing Problem-Solving Capabilities Using Object-Oriented Programming Language Science.gov (United States) 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… 10. Geometrical optical illusionists. Science.gov (United States) 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. 11. Geometric Rationalization for Freeform Architecture KAUST Repository Jiang, Caigui 2016-06-20 The emergence of freeform architecture provides interesting geometric challenges with regards to the design and manufacturing of large-scale structures. To design these architectural structures, we have to consider two types of constraints. First, aesthetic constraints are important because the buildings have to be visually impressive. Sec- ond, functional constraints are important for the performance of a building and its e cient construction. This thesis contributes to the area of architectural geometry. Specifically, we are interested in the geometric rationalization of freeform architec- ture with the goal of combining aesthetic and functional constraints and construction requirements. Aesthetic requirements typically come from designers and architects. To obtain visually pleasing structures, they favor smoothness of the building shape, but also smoothness of the visible patterns on the surface. Functional requirements typically come from the engineers involved in the construction process. For exam- ple, covering freeform structures using planar panels is much cheaper than using non-planar ones. Further, constructed buildings have to be stable and should not collapse. In this thesis, we explore the geometric rationalization of freeform archi- tecture using four specific example problems inspired by real life applications. We achieve our results by developing optimization algorithms and a theoretical study of the underlying geometrical structure of the problems. The four example problems are the following: (1) The design of shading and lighting systems which are torsion-free structures with planar beams based on quad meshes. They satisfy the functionality requirements of preventing light from going inside a building as shad- ing systems or reflecting light into a building as lighting systems. (2) The Design of freeform honeycomb structures that are constructed based on hex-dominant meshes with a planar beam mounted along each edge. The beams intersect without 12. The Effectiveness of Parents' Skills Training Program on Reducing Children's Behavior Problems Directory of Open Access Journals (Sweden) مریم نعمت‌اللهی 2015-12-01 Full Text Available Objectives: The aim of this research was to evaluate the effectiveness of parents' skill training program on reducing children's behavioral problems. Method: In an experimental study (pre-post-test, 4 primary schools were randomly selected from schools of Tehran. Two schools were randomly allocated into experimental group and two into control group. Experimental group (mothers of children aged 7-9 years received parents' skill training program for 8 weeks, two hours sessions. Parents' reports participating in the training program (n=30 mothers were compared with parents' reports of non-trained control group (n=31 mothers. Data were gathered using Child Behavior Checklist (CBCL and analyzed using covariance analyses. Results: There was a significant difference between the experimental and control group after the training. The experimental group reported a significant decrease in children's behavioral problems. 13. Intuitionistic Fuzzy Goal Programming Technique for Solving Non-Linear Multi-objective Structural Problem Directory of Open Access Journals (Sweden) Samir Dey 2015-07-01 Full Text Available This paper proposes a new multi-objective intuitionistic fuzzy goal programming approach to solve a multi-objective nonlinear programming problem in context of a structural design. Here we describe some basic properties of intuitionistic fuzzy optimization. We have considered a multi-objective structural optimization problem with several mutually conflicting objectives. The design objective is to minimize weight of the structure and minimize the vertical deflection at loading point of a statistically loaded three-bar planar truss subjected to stress constraints on each of the truss members. This approach is used to solve the above structural optimization model based on arithmetic mean and compare with the solution by intuitionistic fuzzy goal programming approach. A numerical solution is given to illustrate our approach. 14. The Strengthening Families Program 10-14: influence on parent and youth problem-solving skill. Science.gov (United States) 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. 15. Geometrical method of decoupling Directory of Open Access Journals (Sweden) C. Baumgarten 2012-12-01 Full Text Available 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[over →], B[over →], and P[over →], 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 16. A quadratic approximation-based algorithm for the solution of multiparametric mixed-integer nonlinear programming problems KAUST Repository Domí nguez, Luis F.; Pistikopoulos, Efstratios N. 2012-01-01 An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear 17. Improved Genetic and Simulating Annealing Algorithms to Solve the Traveling Salesman Problem Using Constraint Programming Directory of Open Access Journals (Sweden) M. Abdul-Niby 2016-04-01 Full Text Available The Traveling Salesman Problem (TSP is an integer programming problem that falls into the category of NP-Hard problems. As the problem become larger, there is no guarantee that optimal tours will be found within reasonable computation time. Heuristics techniques, like genetic algorithm and simulating annealing, can solve TSP instances with different levels of accuracy. Choosing which algorithm to use in order to get a best solution is still considered as a hard choice. This paper suggests domain reduction as a tool to be combined with any meta-heuristic so that the obtained results will be almost the same. The hybrid approach of combining domain reduction with any meta-heuristic encountered the challenge of choosing an algorithm that matches the TSP instance in order to get the best results. 18. Geometric Liouville gravity International Nuclear Information System (INIS) La, H. 1992-01-01 A new geometric formulation of Liouville gravity based on the area preserving diffeo-morphism is given and a possible alternative to reinterpret Liouville gravity is suggested, namely, a scalar field coupled to two-dimensional gravity with a curvature constraint 19. Geometric Series via Probability Science.gov (United States) 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… 20. A System Analysis of the Recruitment and Retention Problems Associated with the Program Manager for Chemical Demilitarization Organization National Research Council Canada - National Science Library Gottschalk, Laurence 2001-01-01 The primary purpose of this thesis is to investigate the problems of retaining qualified personnel in the Program Manager for Chemical Demilitarization organization through the end date of the program... 1. Geometric function theory in higher dimension CERN Document Server 2017-01-01 The book collects the most relevant outcomes from the INdAM Workshop “Geometric Function Theory in Higher Dimension” held in Cortona on September 5-9, 2016. The Workshop was mainly devoted to discussions of basic open problems in the area, and this volume follows the same line. In particular, it offers a selection of original contributions on Loewner theory in one and higher dimensions, semigroups theory, iteration theory and related topics. Written by experts in geometric function theory in one and several complex variables, it focuses on new research frontiers in this area and on challenging open problems. The book is intended for graduate students and researchers working in complex analysis, several complex variables and geometric function theory. 2. Stability of multi-objective bi-level linear programming problems under fuzziness Directory of Open Access Journals (Sweden) Abo-Sinna Mahmoud A. 2013-01-01 Full Text Available This paper deals with multi-objective bi-level linear programming problems under fuzzy environment. In the proposed method, tentative solutions are obtained and evaluated by using the partial information on preference of the decision-makers at each level. The existing results concerning the qualitative analysis of some basic notions in parametric linear programming problems are reformulated to study the stability of multi-objective bi-level linear programming problems. An algorithm for obtaining any subset of the parametric space, which has the same corresponding Pareto optimal solution, is presented. Also, this paper established the model for the supply-demand interaction in the age of electronic commerce (EC. First of all, the study uses the individual objectives of both parties as the foundation of the supply-demand interaction. Subsequently, it divides the interaction, in the age of electronic commerce, into the following two classifications: (i Market transactions, with the primary focus on the supply demand relationship in the marketplace; and (ii Information service, with the primary focus on the provider and the user of information service. By applying the bi-level programming technique of interaction process, the study will develop an analytical process to explain how supply-demand interaction achieves a compromise or why the process fails. Finally, a numerical example of information service is provided for the sake of illustration. 3. French research program on the physiological problems caused by weightlessness. Use of the primate model Science.gov (United States) Pesquies, P. C.; Milhaud, C.; Nogues, C.; Klein, M.; Cailler, B.; Bost, R. The need to acquire a better knowledge of the main biological problems induced by microgravity implies—in addition to human experimentation—the use of animal models, and primates seem to be particularly well adapted to this type of research. The major areas of investigation to be considered are the phospho-calcium metabolism and the metabolism of supporting tissues, the hydroelectrolytic metabolism, the cardiovascular function, awakeness, sleep-awakeness cycles, the physiology of equilibrium and the pathophysiology of space sickness. Considering this program, the Centre d'Etudes et de Recherches de Medecine Aerospatiale, under the sponsorship of the Centre National d'Etudes Spatiales, developed both a program of research on restrained primates for the French-U.S. space cooperation (Spacelab program) and for the French-Soviet space cooperation (Bio-cosmos program), and simulation of the effects of microgravity by head-down bedrest. Its major characteristics are discussed in the study. 4. CLUST-applied program package for solution of radiation problems in solid-state physics International Nuclear Information System (INIS) Sidorenko, A.D. 1983-01-01 A general structure is outlined of the CLUST applied program package for a system of equations describing nucleation and growth of dislocation loops and vacancies in metal exposed to a fast particle flux. The CLUST package represents a set of programs for solving the systems of ordinary differential equations of special type with entering the count results into the file. The count process is controlled by a special monitor, which essentially facilitates the user program checkout and increases the efficiency of using computer time. The output of the results and scanning of the file can be realized through the analog-digital printing device or the terminal. The package structure enables the programs to be easily rearranged for solving other problems with the total number of variables 500. Operation with the package in the BEhSM-6 computer is described and principles of package rearrangement are presented 5. Solving inverse problems with the unfolding program TRUEE: Examples in astroparticle physics International Nuclear Information System (INIS) Milke, N.; Doert, M.; Klepser, S.; Mazin, D.; Blobel, V.; Rhode, W. 2013-01-01 The unfolding program TRUEE is a software package for the numerical solution of inverse problems. The algorithm was first applied in the FORTRAN 77 program RUN. RUN is an event-based unfolding algorithm which makes use of the Tikhonov regularization. It has been tested and compared to different unfolding applications and stood out with notably stable results and reliable error estimation. TRUEE is a conversion of RUN to C++, which works within the powerful ROOT framework. The program has been extended for more user-friendliness and delivers unfolding results which are identical to RUN. Beside the simplicity of the installation of the software and the generation of graphics, there are new functions, which facilitate the choice of unfolding parameters and observables for the user. In this paper, we introduce the new unfolding program and present its performance by applying it to two exemplary data sets from astroparticle physics, taken with the MAGIC telescopes and the IceCube neutrino detector, respectively. 6. Pragmatic geometric model evaluation Science.gov (United States) 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 7. A linear programming approach to max-sum problem: a review. Science.gov (United States) Werner, Tomás 2007-07-01 The max-sum labeling problem, defined as maximizing a sum of binary (i.e., pairwise) functions of discrete variables, is a general NP-hard optimization problem with many applications, such as computing the MAP configuration of a Markov random field. We review a not widely known approach to the problem, developed by Ukrainian researchers Schlesinger et al. in 1976, and show how it contributes to recent results, most importantly, those on the convex combination of trees and tree-reweighted max-product. In particular, we review Schlesinger et al.'s upper bound on the max-sum criterion, its minimization by equivalent transformations, its relation to the constraint satisfaction problem, the fact that this minimization is dual to a linear programming relaxation of the original problem, and the three kinds of consistency necessary for optimality of the upper bound. We revisit problems with Boolean variables and supermodular problems. We describe two algorithms for decreasing the upper bound. We present an example application for structural image analysis. 8. Multi-objective genetic algorithm for solving N-version program design problem International Nuclear Information System (INIS) Yamachi, Hidemi; Tsujimura, Yasuhiro; Kambayashi, Yasushi; Yamamoto, Hisashi 2006-01-01 N-version programming (NVP) is a programming approach for constructing fault tolerant software systems. Generally, an optimization model utilized in NVP selects the optimal set of versions for each module to maximize the system reliability and to constrain the total cost to remain within a given budget. In such a model, while the number of versions included in the obtained solution is generally reduced, the budget restriction may be so rigid that it may fail to find the optimal solution. In order to ameliorate this problem, this paper proposes a novel bi-objective optimization model that maximizes the system reliability and minimizes the system total cost for designing N-version software systems. When solving multi-objective optimization problem, it is crucial to find Pareto solutions. It is, however, not easy to obtain them. In this paper, we propose a novel bi-objective optimization model that obtains many Pareto solutions efficiently. We formulate the optimal design problem of NVP as a bi-objective 0-1 nonlinear integer programming problem. In order to overcome this problem, we propose a Multi-objective genetic algorithm (MOGA), which is a powerful, though time-consuming, method to solve multi-objective optimization problems. When implementing genetic algorithm (GA), the use of an appropriate genetic representation scheme is one of the most important issues to obtain good performance. We employ random-key representation in our MOGA to find many Pareto solutions spaced as evenly as possible along the Pareto frontier. To pursue improve further performance, we introduce elitism, the Pareto-insertion and the Pareto-deletion operations based on distance between Pareto solutions in the selection process. The proposed MOGA obtains many Pareto solutions along the Pareto frontier evenly. The user of the MOGA can select the best compromise solution among the candidates by controlling the balance between the system reliability and the total cost 9. Multi-objective genetic algorithm for solving N-version program design problem Energy Technology Data Exchange (ETDEWEB) Yamachi, Hidemi [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan) and Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo 191-0065 (Japan)]. E-mail: yamachi@nit.ac.jp; Tsujimura, Yasuhiro [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan)]. E-mail: tujimr@nit.ac.jp; Kambayashi, Yasushi [Department of Computer and Information Engineering, Nippon Institute of Technology, Miyashiro, Saitama 345-8501 (Japan)]. E-mail: yasushi@nit.ac.jp; Yamamoto, Hisashi [Department of Production and Information Systems Engineering, Tokyo Metropolitan Institute of Technology, Hino, Tokyo 191-0065 (Japan)]. E-mail: yamamoto@cc.tmit.ac.jp 2006-09-15 N-version programming (NVP) is a programming approach for constructing fault tolerant software systems. Generally, an optimization model utilized in NVP selects the optimal set of versions for each module to maximize the system reliability and to constrain the total cost to remain within a given budget. In such a model, while the number of versions included in the obtained solution is generally reduced, the budget restriction may be so rigid that it may fail to find the optimal solution. In order to ameliorate this problem, this paper proposes a novel bi-objective optimization model that maximizes the system reliability and minimizes the system total cost for designing N-version software systems. When solving multi-objective optimization problem, it is crucial to find Pareto solutions. It is, however, not easy to obtain them. In this paper, we propose a novel bi-objective optimization model that obtains many Pareto solutions efficiently. We formulate the optimal design problem of NVP as a bi-objective 0-1 nonlinear integer programming problem. In order to overcome this problem, we propose a Multi-objective genetic algorithm (MOGA), which is a powerful, though time-consuming, method to solve multi-objective optimization problems. When implementing genetic algorithm (GA), the use of an appropriate genetic representation scheme is one of the most important issues to obtain good performance. We employ random-key representation in our MOGA to find many Pareto solutions spaced as evenly as possible along the Pareto frontier. To pursue improve further performance, we introduce elitism, the Pareto-insertion and the Pareto-deletion operations based on distance between Pareto solutions in the selection process. The proposed MOGA obtains many Pareto solutions along the Pareto frontier evenly. The user of the MOGA can select the best compromise solution among the candidates by controlling the balance between the system reliability and the total cost. 10. The Effect of TMPT Program on Pre-School Children's Social Problem Solving Skills Science.gov (United States) Gur, Cagla; Kocak, Nurcan 2018-01-01 Purpose: Starting Thinking Training at an early age is important. However, few studies were found regarding Thinking Training programs for pre-school children and the contributions of these programs to children's social problem-solving. In this context, the TMPT Program was developed for pre-school children and the effect of the program on 5-6… 11. Mathematical programming models for solving in equal-sized facilities layout problems. A genetic search method International Nuclear Information System (INIS) Tavakkoli-Moghaddam, R. 1999-01-01 This paper present unequal-sized facilities layout solutions generated by a genetic search program. named Layout Design using a Genetic Algorithm) 9. The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computational results on test problems are reported as compared with layout solutions generated by the branch - and bound algorithm a hybrid method merging simulated annealing and local search techniques, and an optimization process of an enveloped block 12. Designing training programs for the development of emotional intelligence in adolescents with behavioral problems Directory of Open Access Journals (Sweden) A.V. Degtyarev 2013-10-01 Full Text Available In this article, deviant behavior is considered as a combination of different manifestations of personality, leading eventually to its social desaptation. It is shown that an effective method of preventing deviant behavior is psychological training. Group training activity helps to solve the problems associated with the development of various behavioral skills, to provide psychological support, and can be used as a means of psychological work with teenagers with behavioral problems. We discuss the basic points required to effectively create and conduct training programs in general, as well as the challenges and opportunities of designing trainings in order to develop emotional intelligence as a method of prevention of deviant behavior 13. Solving Bilevel Multiobjective Programming Problem by Elite Quantum Behaved Particle Swarm Optimization Directory of Open Access Journals (Sweden) Tao Zhang 2012-01-01 Full Text Available An elite quantum behaved particle swarm optimization (EQPSO algorithm is proposed, in which an elite strategy is exerted for the global best particle to prevent premature convergence of the swarm. The EQPSO algorithm is employed for solving bilevel multiobjective programming problem (BLMPP in this study, which has never been reported in other literatures. Finally, we use eight different test problems to measure and evaluate the proposed algorithm, including low dimension and high dimension BLMPPs, as well as attempt to solve the BLMPPs whose theoretical Pareto optimal front is not known. The experimental results show that the proposed algorithm is a feasible and efficient method for solving BLMPPs. 14. High profile students’ growth of mathematical understanding in solving linier programing problems Science.gov (United States) Utomo; Kusmayadi, TA; Pramudya, I. 2018-04-01 Linear program has an important role in human’s life. This linear program is learned in senior high school and college levels. This material is applied in economy, transportation, military and others. Therefore, mastering linear program is useful for provision of life. This research describes a growth of mathematical understanding in solving linear programming problems based on the growth of understanding by the Piere-Kieren model. Thus, this research used qualitative approach. The subjects were students of grade XI in Salatiga city. The subjects of this study were two students who had high profiles. The researcher generally chose the subjects based on the growth of understanding from a test result in the classroom; the mark from the prerequisite material was ≥ 75. Both of the subjects were interviewed by the researcher to know the students’ growth of mathematical understanding in solving linear programming problems. The finding of this research showed that the subjects often folding back to the primitive knowing level to go forward to the next level. It happened because the subjects’ primitive understanding was not comprehensive. 15. The study on the import of the geometric body by GDML in GEANT4 International Nuclear Information System (INIS) Sun Baodong; Liu Huilan; Sun Dawang; Xie Zhaoyang; Song Yushou 2014-01-01 Geometry Description Markup Language (GDML) can be used as an application interface program to import the geometric body into GEANT4. It greatly simplifies the detector construction work with high reliability. With this mechanism the geometric data of a detector is described in an XML file and read by the XML parser embedded in GEANT4. The geometric structure of a detector is designed in CAD toolkit Solidworks and saved as a standard STEP file. Then, by FastRad the STEP file is transformed into XML script, which is readable for GEANT4. In comparison with the detectors constructed by Constructed Solid Geometry (CSG) provided by GEANT4, those imported by GDML also satisfies the requests of general simulation application. At the same time, some solutions and tips for several common problems during the progress constructing the detectors by GDML are given. (authors) 16. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks DEFF Research Database (Denmark) Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee 2011-01-01 In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize network lifetime. In fact, lifetime depends on many parameters: the topology of the sensor network, the data aggregation regime in the network, the channel access schemes, the routing...... protocols, and the energy model for transmission. In this paper, we tackle the routing challenge for maximum lifetime of the sensor network. We introduce a novel linear programming approach to the maximum lifetime routing problem. To the best of our knowledge, this is the first mathematical programming... 17. Mixed-integer programming methods for transportation and power generation problems Science.gov (United States) 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. 18. Geometric Models for Collaborative Search and Filtering Science.gov (United States) 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… 19. Non-crossing geometric steiner arborescences NARCIS (Netherlands) Kostitsyna, I.; Speckmann, B.; Verbeek, K.A.B.; Okamoto, Yoshio; Tokuyama, Takeshi 2017-01-01 Motivated by the question of simultaneous embedding of several flow maps, we consider the problem of drawing multiple geometric Steiner arborescences with no crossings in the rectilinear and in the angle-restricted setting. When terminal-to-root paths are allowed to turn freely, we show that two 20. Geometric Algorithms for Part Orienting and Probing NARCIS (Netherlands) Panahi, F. 2015-01-01 In this thesis, detailed solutions are presented to several problems dealing with geometric shape and orientation of an object in the field of robotics and automation. We first have considered a general model for shape variations that allows variation along the entire boundary of an object, both in 1. An optimal maintenance policy for machine replacement problem using dynamic programming Directory of Open Access Journals (Sweden) Mohsen Sadegh Amalnik 2017-06-01 Full Text Available In this article, we present an acceptance sampling plan for machine replacement problem based on the backward dynamic programming model. Discount dynamic programming is used to solve a two-state machine replacement problem. We plan to design a model for maintenance by consid-ering the quality of the item produced. The purpose of the proposed model is to determine the optimal threshold policy for maintenance in a finite time horizon. We create a decision tree based on a sequential sampling including renew, repair and do nothing and wish to achieve an optimal threshold for making decisions including renew, repair and continue the production in order to minimize the expected cost. Results show that the optimal policy is sensitive to the data, for the probability of defective machines and parameters defined in the model. This can be clearly demonstrated by a sensitivity analysis technique. 2. Mixed integer linear programming model for dynamic supplier selection problem considering discounts Directory of Open Access Journals (Sweden) Adi Wicaksono Purnawan 2018-01-01 Full Text Available Supplier selection is one of the most important elements in supply chain management. This function involves evaluation of many factors such as, material costs, transportation costs, quality, delays, supplier capacity, storage capacity and others. Each of these factors varies with time, therefore, supplier identified for one period is not necessarily be same for the next period to supply the same product. So, mixed integer linear programming (MILP was developed to overcome the dynamic supplier selection problem (DSSP. In this paper, a mixed integer linear programming model is built to solve the lot-sizing problem with multiple suppliers, multiple periods, multiple products and quantity discounts. The buyer has to make a decision for some products which will be supplied by some suppliers for some periods cosidering by discount. To validate the MILP model with randomly generated data. The model is solved by Lingo 16. 3. Geometrical intuition and the learning and teaching of geometry OpenAIRE Fujita, Taro; Jones, Keith; Yamamoto, Shinya 2004-01-01 Intuition is often regarded as essential in the learning of geometry, but how such skills might be effectively developed in students remains an open question. This paper reviews the role and importance of geometrical intuition and suggests it involves the skills to create and manipulate geometrical figures in the mind, to see geometrical properties, to relate images to concepts and theorems in geometry, and decide where and how to start when solving problems in geometry. Based on these theore... 4. Introduction of problem-based learning in undergraduate dentistry program in Nepal OpenAIRE Rimal, Jyotsna; Paudel, Bishnu Hari; Shrestha, Ashish 2015-01-01 Context: Problem-based learning (PBL) is a methodology widely used in medical education and is growing in dental education. Initiation of new ideas and teaching methods requires a change in perception from faculty and institute management. Student-centered education is a need of the day and PBL provides the best outlet to it. Aim: To introduce PBL, assess feasibility and challenges in undergraduate dentistry program and evaluate the impact on their learning. Settings and Design: PBL was used ... 5. Solving a bi-objective mathematical programming model for bloodmobiles location routing problem Directory of Open Access Journals (Sweden) Masoud Rabbani 2017-01-01 Full Text Available Perishability of platelets, uncertainty of donors’ arrival and conflicting views in platelet supply chain have made platelet supply chain planning a problematic issue. In this paper, mobile blood collection system for platelet production is investigated. Two mathematical models are presented to cover the bloodmobile collection planning problem. The first model is a multi-objective fuzzy mathematical programming in which the bloodmobiles locations are considered with the aim of maximizing potential amount of blood collection and minimizing the operational cost. The second model is a vehicle routing problem with time windows which studies the shuttles routing problem. To tackle the first model, it is reformulated as a crisp multi objective linear programming model and then solved through a fuzzy multi objective programming approach. Several sensitivity analysis are conducted on important parameters to demonstrate the applicability of the proposed model. The proposed model is then solved by using a tailored Simulated Annealing (SA algorithm. The numerical results demonstrate promising efficiency of the proposed solution method. 6. A Mixed Integer Programming Poultry Feed Ration Optimisation Problem Using the Bat Algorithm Directory of Open Access Journals (Sweden) Godfrey Chagwiza 2016-01-01 Full Text Available In this paper, a feed ration problem is presented as a mixed integer programming problem. An attempt to find the optimal quantities of Moringa oleifera inclusion into the poultry feed ration was done and the problem was solved using the Bat algorithm and the Cplex solver. The study used findings of previous research to investigate the effects of Moringa oleifera inclusion in poultry feed ration. The results show that the farmer is likely to gain US$0.89 more if Moringa oleifera is included in the feed ration. Results also show superiority of the Bat algorithm in terms of execution time and number of iterations required to find the optimum solution as compared with the results obtained by the Cplex solver. Results revealed that there is a significant economic benefit of Moringa oleifera inclusion into the poultry feed ration.

7. Application of goal programming to decision problem on optimal allocation of radiation workers

International Nuclear Information System (INIS)

Sa, Sangduk; Narita, Masakuni

1993-01-01

This paper is concerned with an optimal planning in a multiple objective decision-making problem of allocating radiation workers to workplaces associated with occupational exposure. The model problem is formulated with the application of goal programming which effectively followed up diverse and conflicting factors influencing the optimal decision. The formulation is based on the data simulating the typical situations encountered at the operating facilities such as nuclear power plants where exposure control is critical to the management. Multiple goals set by the decision-maker/manager who has the operational responsibilities for radiological protection are illustrated in terms of work requirements, exposure constraints of the places, desired allocation of specific personnel and so on. Test results of the model are considered to indicate that the model structure and its solution process can provide the manager with a good set of analysis of his problems in implementing the optimization review of radiation protection during normal operation. (author)

8. A simulation based research on chance constrained programming in robust facility location problem

Directory of Open Access Journals (Sweden)

Kaijun Leng

2017-03-01

Full Text Available 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.

9. An integer programming model for gate assignment problem at airline terminals

Science.gov (United States)

Chun, Chong Kok; Nordin, Syarifah Zyurina

2015-05-01

In this paper, we concentrate on a gate assignment problem (GAP) at the airlines terminal. Our problem is to assign an arrival plane to a suitable gate. There are two considerations needed to take. One of its is passenger walking distance from arrival gate to departure gate while another consideration is the transport baggage distance from one gate to another. Our objective is to minimize the total distance between the gates that related to assign the arrival plane to the suitable gates. An integer linear programming (ILP) model is proposed to solve this gate assignment problem. We also conduct a computational experiment using CPLEX 12.1 solver in AIMMS 3.10 software to analyze the performance of the model. Results of the computational experiments are presented. The efficiency of flights assignment is depends on the ratio of the weight for both total passenger traveling distances and total baggage transport distances.

10. A primal-dual exterior point algorithm for linear programming problems

Directory of Open Access Journals (Sweden)

Samaras Nikolaos

2009-01-01

Full Text Available The aim of this paper is to present a new simplex type algorithm for the Linear Programming Problem. The Primal - Dual method is a Simplex - type pivoting algorithm that generates two paths in order to converge to the optimal solution. The first path is primal feasible while the second one is dual feasible for the original problem. Specifically, we use a three-phase-implementation. The first two phases construct the required primal and dual feasible solutions, using the Primal Simplex algorithm. Finally, in the third phase the Primal - Dual algorithm is applied. Moreover, a computational study has been carried out, using randomly generated sparse optimal linear problems, to compare its computational efficiency with the Primal Simplex algorithm and also with MATLAB's Interior Point Method implementation. The algorithm appears to be very promising since it clearly shows its superiority to the Primal Simplex algorithm as well as its robustness over the IPM algorithm.

11. A Two-Stage Stochastic Mixed-Integer Programming Approach to the Smart House Scheduling Problem

Science.gov (United States)

Ozoe, Shunsuke; Tanaka, Yoichi; Fukushima, Masao

A “Smart House” is a highly energy-optimized house equipped with photovoltaic systems (PV systems), electric battery systems, fuel cell cogeneration systems (FC systems), electric vehicles (EVs) and so on. Smart houses are attracting much attention recently thanks to their enhanced ability to save energy by making full use of renewable energy and by achieving power grid stability despite an increased power draw for installed PV systems. Yet running a smart house's power system, with its multiple power sources and power storages, is no simple task. In this paper, we consider the problem of power scheduling for a smart house with a PV system, an FC system and an EV. We formulate the problem as a mixed integer programming problem, and then extend it to a stochastic programming problem involving recourse costs to cope with uncertain electricity demand, heat demand and PV power generation. Using our method, we seek to achieve the optimal power schedule running at the minimum expected operation cost. We present some results of numerical experiments with data on real-life demands and PV power generation to show the effectiveness of our method.

12. Variable Neighbourhood Search and Mathematical Programming for Just-in-Time Job-Shop Scheduling Problem

Directory of Open Access Journals (Sweden)

Sunxin Wang

2014-01-01

Full Text Available This paper presents a combination of variable neighbourhood search and mathematical programming to minimize the sum of earliness and tardiness penalty costs of all operations for just-in-time job-shop scheduling problem (JITJSSP. Unlike classical E/T scheduling problem with each job having its earliness or tardiness penalty cost, each operation in this paper has its earliness and tardiness penalties, which are paid if the operation is completed before or after its due date. Our hybrid algorithm combines (i a variable neighbourhood search procedure to explore the huge feasible solution spaces efficiently by alternating the swap and insertion neighbourhood structures and (ii a mathematical programming model to optimize the completion times of the operations for a given solution in each iteration procedure. Additionally, a threshold accepting mechanism is proposed to diversify the local search of variable neighbourhood search. Computational results on the 72 benchmark instances show that our algorithm can obtain the best known solution for 40 problems, and the best known solutions for 33 problems are updated.

13. Dynamics in geometrical confinement

CERN Document Server

Kremer, Friedrich

2014-01-01

This book describes the dynamics of low molecular weight and polymeric molecules when they are constrained under conditions of geometrical confinement. It covers geometrical confinement in different dimensionalities: (i) in nanometer thin layers or self supporting films (1-dimensional confinement) (ii) in pores or tubes with nanometric diameters (2-dimensional confinement) (iii) as micelles embedded in matrices (3-dimensional) or as nanodroplets.The dynamics under such conditions have been a much discussed and central topic in the focus of intense worldwide research activities within the last two decades. The present book discusses how the resulting molecular mobility is influenced by the subtle counterbalance between surface effects (typically slowing down molecular dynamics through attractive guest/host interactions) and confinement effects (typically increasing the mobility). It also explains how these influences can be modified and tuned, e.g. through appropriate surface coatings, film thicknesses or pore...

14. Geometric group theory

CERN Document Server

2014-01-01

Geometric group theory refers to the study of discrete groups using tools from topology, geometry, dynamics and analysis. The field is evolving very rapidly and the present volume provides an introduction to and overview of various topics which have played critical roles in this evolution. The book contains lecture notes from courses given at the Park City Math Institute on Geometric Group Theory. The institute consists of a set of intensive short courses offered by leaders in the field, designed to introduce students to exciting, current research in mathematics. These lectures do not duplicate standard courses available elsewhere. The courses begin at an introductory level suitable for graduate students and lead up to currently active topics of research. The articles in this volume include introductions to CAT(0) cube complexes and groups, to modern small cancellation theory, to isometry groups of general CAT(0) spaces, and a discussion of nilpotent genus in the context of mapping class groups and CAT(0) gro...

15. Lectures in geometric combinatorics

CERN Document Server

Thomas, Rekha R

2006-01-01

This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for an advanced undergraduate or beginning graduate student. The book starts with the basics of polytope theory. Schlegel and Gale diagrams are introduced as geometric tools to visualize polytopes in high dimension and to unearth bizarre phenomena in polytopes. The heart of the book is a treatment of the secondary polytope of a point configuration and its connections to the state polytope of the toric ideal defined by the configuration. These polytopes are relatively recent constructs with numerous connections to discrete geometry, classical algebraic geometry, symplectic geometry, and combinatorics. The connections rely on Gr�bner bases of toric ideals and other methods from commutative algebra. The book is self-contained and does not require any background beyond basic linear algebra. With numerous figures and exercises, it can be used as a textbook for courses on geometric, combinatorial, and computational as...

16. Geometric information provider platform

Directory of Open Access Journals (Sweden)

2015-07-01

Full Text Available Renovation of existing buildings is known as an essential stage in reduction of the energy loss. Considerable part of renovation process depends on geometric reconstruction of building based on semantic parameters. Following many research projects which were focused on parameterizing the energy usage, various energy modelling methods were developed during the last decade. On the other hand, by developing accurate measuring tools such as laser scanners, the interests of having accurate 3D building models are rapidly growing. But the automation of 3D building generation from laser point cloud or detection of specific objects in that is still a challenge.  The goal is designing a platform through which required geometric information can be efficiently produced to support energy simulation software. Developing a reliable procedure which extracts required information from measured data and delivers them to a standard energy modelling system is the main purpose of the project.

17. Gravity, a geometrical course

CERN Document Server

Frè, Pietro Giuseppe

2013-01-01

‘Gravity, a Geometrical Course’ presents general relativity (GR) in a systematic and exhaustive way, covering three aspects that are homogenized into a single texture: i) the mathematical, geometrical foundations, exposed in a self consistent contemporary formalism, ii) the main physical, astrophysical and cosmological applications,  updated to the issues of contemporary research and observations, with glimpses on supergravity and superstring theory, iii) the historical development of scientific ideas underlying both the birth of general relativity and its subsequent evolution. The book is divided in two volumes.   Volume One is dedicated to the development of the theory and basic physical applications. It guides the reader from the foundation of special relativity to Einstein field equations, illustrating some basic applications in astrophysics. A detailed  account  of the historical and conceptual development of the theory is combined with the presentation of its mathematical foundations.  Differe...

18. Geometric Series and Computers--An Application.

Science.gov (United States)

McNerney, Charles R.

1983-01-01

This article considers the sum of a finite geometric series as applied to numeric data storage in the memory of an electronic digital computer. The presentation is viewed as relevant to programing in several languages and removes some of the mystique associated with syntax constraints that any language imposes. (MP)

19. Geometric homology revisited

OpenAIRE

Ruffino, Fabio Ferrari

2013-01-01

Given a cohomology theory, there is a well-known abstract way to define the dual homology theory using the theory of spectra. In [4] the author provides a more geometric construction of the homology theory, using a generalization of the bordism groups. Such a generalization involves in its definition the vector bundle modification, which is a particular case of the Gysin map. In this paper we provide a more natural variant of that construction, which replaces the vector bundle modification wi...

20. Geometric measure theory

CERN Document Server

Waerden, B

1996-01-01

From the reviews: "... Federer's timely and beautiful book indeed fills the need for a comprehensive treatise on geometric measure theory, and his detailed exposition leads from the foundations of the theory to the most recent discoveries. ... The author writes with a distinctive style which is both natural and powerfully economical in treating a complicated subject. This book is a major treatise in mathematics and is essential in the working library of the modern analyst." Bulletin of the London Mathematical Society.

1. Developing geometrical reasoning

OpenAIRE

Brown, Margaret; Jones, Keith; Taylor, Ron; Hirst, Ann

2004-01-01

This paper summarises a report (Brown, Jones & Taylor, 2003) to the UK Qualifications and Curriculum Authority of the work of one geometry group. The group was charged with developing and reporting on teaching ideas that focus on the development of geometrical reasoning at the secondary school level. The group was encouraged to explore what is possible both within and beyond the current requirements of the UK National Curriculum and the Key Stage 3 strategy, and to consider the whole atta...

2. Geometrically Consistent Mesh Modification

KAUST Repository

Bonito, A.

2010-01-01

A new paradigm of adaptivity is to execute refinement, coarsening, and smoothing of meshes on manifolds with incomplete information about their geometry and yet preserve position and curvature accuracy. We refer to this collectively as geometrically consistent (GC) mesh modification. We discuss the concept of discrete GC, show the failure of naive approaches, and propose and analyze a simple algorithm that is GC and accuracy preserving. © 2010 Society for Industrial and Applied Mathematics.

3. Geometric theory of information

CERN Document Server

2014-01-01

This book brings together geometric tools and their applications for Information analysis. It collects current and many uses of in the interdisciplinary fields of Information Geometry Manifolds in Advanced Signal, Image & Video Processing, Complex Data Modeling and Analysis, Information Ranking and Retrieval, Coding, Cognitive Systems, Optimal Control, Statistics on Manifolds, Machine Learning, Speech/sound recognition, and natural language treatment which are also substantially relevant for the industry.

4. College and University Environmental Programs as a Policy Problem (Part 2): Strategies for Improvement

Science.gov (United States)

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.

5. Solving seismological problems using SGRAPH program: I-source parameters and hypocentral location

International Nuclear Information System (INIS)

Abdelwahed, Mohamed F.

2012-01-01

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.

6. College and university environmental programs as a policy problem (Part 2): Strategies for improvement

Science.gov (United States)

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. Assessment of the NASA Space Shuttle Program's Problem Reporting and Corrective Action System

Science.gov (United States)

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.

8. Program elaborated of combined regime for on-line and off-line problems

International Nuclear Information System (INIS)

Ivanova, A.B.; Ioramashvili, Eh.Sh.; Polyakov, B.F.; Razdol'skaya, L.A.

1979-01-01

A description of the part of operational system designed for organization of packet treatment of algol tasks combined with the on-line system is provided. A block-scheme of the operational system functioning in the packet regime is presented. The ''Director'' program is the main part of the operational system which is responsible for the functioning of the algol programs. Its starting for the first time is carried out by the operator. All the subsequent process of the operation is automized. Problems connected with the organization of interruptions appearing in the cases of failures and as a reaction for the end of operation of any algol program or some of its links are considered

9. Stochastic Fractional Programming Approach to a Mean and Variance Model of a Transportation Problem

Directory of Open Access Journals (Sweden)

V. Charles

2011-01-01

Full Text Available In this paper, we propose a stochastic programming model, which considers a ratio of two nonlinear functions and probabilistic constraints. In the former, only expected model has been proposed without caring variability in the model. On the other hand, in the variance model, the variability played a vital role without concerning its counterpart, namely, the expected model. Further, the expected model optimizes the ratio of two linear cost functions where as variance model optimize the ratio of two non-linear functions, that is, the stochastic nature in the denominator and numerator and considering expectation and variability as well leads to a non-linear fractional program. In this paper, a transportation model with stochastic fractional programming (SFP problem approach is proposed, which strikes the balance between previous models available in the literature.

10. Geometric leaf placement strategies

International Nuclear Information System (INIS)

Fenwick, J D; Temple, S W P; Clements, R W; Lawrence, G P; Mayles, H M O; Mayles, W P M

2004-01-01

Geometric leaf placement strategies for multileaf collimators (MLCs) typically involve the expansion of the beam's-eye-view contour of a target by a uniform MLC margin, followed by movement of the leaves until some point on each leaf end touches the expanded contour. Film-based dose-distribution measurements have been made to determine appropriate MLC margins-characterized through an index d 90 -for multileaves set using one particular strategy to straight lines lying at various angles to the direction of leaf travel. Simple trigonometric relationships exist between different geometric leaf placement strategies and are used to generalize the results of the film work into d 90 values for several different strategies. Measured d 90 values vary both with angle and leaf placement strategy. A model has been derived that explains and describes quite well the observed variations of d 90 with angle. The d 90 angular variations of the strategies studied differ substantially, and geometric and dosimetric reasoning suggests that the best strategy is the one with the least angular variation. Using this criterion, the best straightforwardly implementable strategy studied is a 'touch circle' approach for which semicircles are imagined to be inscribed within leaf ends, the leaves being moved until the semicircles just touch the expanded target outline

11. Studies in geometric quantization

International Nuclear Information System (INIS)

Tuynman, G.M.

1988-01-01

This thesis contains five chapters, of which the first, entitled 'What is prequantization, and what is geometric quantization?', is meant as an introduction to geometric quantization for the non-specialist. The second chapter, entitled 'Central extensions and physics' deals with the notion of central extensions of manifolds and elaborates and proves the statements made in the first chapter. Central extensions of manifolds occur in physics as the freedom of a phase factor in the quantum mechanical state vector, as the phase factor in the prequantization process of classical mechanics and it appears in mathematics when studying central extension of Lie groups. In this chapter the connection between these central extensions is investigated and a remarkable similarity between classical and quantum mechanics is shown. In chapter three a classical model is given for the hydrogen atom including spin-orbit and spin-spin interaction. The method of geometric quantization is applied to this model and the results are discussed. In the final chapters (4 and 5) an explicit method to calculate the operators corresponding to classical observables is given when the phase space is a Kaehler manifold. The obtained formula are then used to quantise symplectic manifolds which are irreducible hermitian symmetric spaces and the results are compared with other quantization procedures applied to these manifolds (in particular to Berezin's quantization). 91 refs.; 3 tabs

12. The Effect of Hints and Model Answers in a Student-Controlled Problem-Solving Program for Secondary Physics Education

NARCIS (Netherlands)

Pol, Henk J.; Harskamp, Egbert G.; Suhre, Cor J. M.; Goedhart, Martin J.

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

13. Quality-assurance study of the special - purpose finite-element program - SPECTROM: I. Thermal, thermoelastic, and viscoelastic problems

International Nuclear Information System (INIS)

Wagner, R.A.

1980-12-01

This comparison study involves a preliminary verification of finite element calculations. The methodology of the comparison study consists of solving four example problems with both the SPECTROM finite element program and the MARC-CDC general purpose finite element program. The results show close agreement for all example problems

14. Geometrical framework for robust portfolio optimization

OpenAIRE

Bazovkin, Pavel

2014-01-01

We consider a vector-valued multivariate risk measure that depends on the user's profile given by the user's utility. It is constructed on the basis of weighted-mean trimmed regions and represents the solution of an optimization problem. The key feature of this measure is convexity. We apply the measure to the portfolio selection problem, employing different measures of performance as objective functions in a common geometrical framework.

15. SMACS - a system of computer programs for probabilistic seismic analysis of structures and subsystems. Volume II. Example problem

International Nuclear Information System (INIS)

Maslenikov, O.R.; Johnson, J.J.; Tiong, L.W.; Mraz, M.J.; Bumpus, S.; Gerhard, M.A.

1985-03-01

In this volume of the SMACS User's Manual an example problem is presented to demonstrate the type of problem that SMACS is capable of solving and to familiarize the user with format of the various data files involved. This volume is organized into thirteen appendices which follow a short description of the problem. Each appendix contains listings of the input and output files associated with each computer run that was necessary to solve the problem. In cases where one SMACS program uses data generated by another SMACS program, the data file is shown in the appendix for the programs which generated it

16. Geometrical model of multiple production

International Nuclear Information System (INIS)

Chikovani, Z.E.; Jenkovszky, L.L.; Kvaratshelia, T.M.; Struminskij, B.V.

1988-01-01

The relation between geometrical and KNO-scaling and their violation is studied in a geometrical model of multiple production of hadrons. Predictions concerning the behaviour of correlation coefficients at future accelerators are given

17. Solving the Fully Fuzzy Bilevel Linear Programming Problem through Deviation Degree Measures and a Ranking Function Method

OpenAIRE

Aihong Ren

2016-01-01

This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solut...

18. Geometric continuum regularization of quantum field theory

International Nuclear Information System (INIS)

Halpern, M.B.

1989-01-01

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

19. Employed women with alcohol problems who seek help from employee assistance programs. Description and comparisons.

Science.gov (United States)

Blum, T C; Roman, P M; Harwood, E M

1995-01-01

After a brief description of employee assistance programs (EAP), we present data collected from 6,400 employees from 84 worksites who used the services of EAPs, a portion of whom were assessed by the EAP as having alcohol-related problems and/or received scores on the Alcohol Dependence Scale (ADS) indicative of a potential alcohol-related problem. In addition, data were collected at intake from the EAP administrators, and employment status of the employee clients was assessed 18 to 24 months later. These data indicate that EAPs are effective in sustaining the employment of most women with alcohol-related problems who seek services from EAPs and that EAPs' goal of early intervention is especially realized among women with alcohol problems. Other conclusions include: women with alcohol problems do not enter EAPs through routes that are strikingly different from those of men; many of the gender differences that are revealed are associated with job status differences; employed women with alcohol problems are detached from nuclear families, with markedly low rates of current marriage; even when married, spouses are less likely to play a role in the referral of women with alcohol problems than the spouses of the men; and, there is no clear indication that women are the target of any form of discrimination in the process of EAP utilization. However, women are considerably more likely to have less adequate insurance coverage, according to the EAP administrators' assessment reported at client intake, than their male counterparts, leading to treatment choices that may be less than appropriate.

20. A Maximin Approach for the Bi-criteria 0-1 Random Fuzzy Programming Problem Based on the Necessity Measure

International Nuclear Information System (INIS)

Hasuike, Takashi; Ishii, Hiroaki; Katagiri, Hideki

2009-01-01

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.

1. Geometric Constructions with the Computer.

Science.gov (United States)

Chuan, Jen-chung

The computer can be used as a tool to represent and communicate geometric knowledge. With the appropriate software, a geometric diagram can be manipulated through a series of animation that offers more than one particular snapshot as shown in a traditional mathematical text. Geometric constructions with the computer enable the learner to see and…

2. Geometric inequalities for axially symmetric black holes

International Nuclear Information System (INIS)

Dain, Sergio

2012-01-01

A geometric inequality in general relativity relates quantities that have both a physical interpretation and a geometrical definition. It is well known that the parameters that characterize the Kerr-Newman black hole satisfy several important geometric inequalities. Remarkably enough, some of these inequalities also hold for dynamical black holes. This kind of inequalities play an important role in the characterization of the gravitational collapse; they are closely related with the cosmic censorship conjecture. Axially symmetric black holes are the natural candidates to study these inequalities because the quasi-local angular momentum is well defined for them. We review recent results in this subject and we also describe the main ideas behind the proofs. Finally, a list of relevant open problems is presented. (topical review)

3. A Color Image Watermarking Scheme Resistant against Geometrical Attacks

Directory of Open Access Journals (Sweden)

Y. Xing

2010-04-01

Full Text Available The geometrical attacks are still a problem for many digital watermarking algorithms at present. In this paper, we propose a watermarking algorithm for color images resistant to geometrical distortions (rotation and scaling. The singular value decomposition is used for watermark embedding and extraction. The log-polar map- ping (LPM and phase correlation method are used to register the position of geometrical distortion suffered by the watermarked image. Experiments with different kinds of color images and watermarks demonstrate that the watermarking algorithm is robust to common image processing attacks, especially geometrical attacks.

4. Exact solutions to robust control problems involving scalar hyperbolic conservation laws using Mixed Integer Linear Programming

KAUST Repository

Li, Yanning

2013-10-01

This article presents a new robust control framework for transportation problems in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi equation, we pose the problem of controlling the state of the system on a network link, using boundary flow control, as a Linear Program. Unlike many previously investigated transportation control schemes, this method yields a globally optimal solution and is capable of handling shocks (i.e. discontinuities in the state of the system). We also demonstrate that the same framework can handle robust control problems, in which the uncontrollable components of the initial and boundary conditions are encoded in intervals on the right hand side of inequalities in the linear program. The lower bound of the interval which defines the smallest feasible solution set is used to solve the robust LP (or MILP if the objective function depends on boolean variables). Since this framework leverages the intrinsic properties of the Hamilton-Jacobi equation used to model the state of the system, it is extremely fast. Several examples are given to demonstrate the performance of the robust control solution and the trade-off between the robustness and the optimality. © 2013 IEEE.

5. Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems.

Science.gov (United States)

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.

6. Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems

Science.gov (United States)

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.

7. Exact solutions to robust control problems involving scalar hyperbolic conservation laws using Mixed Integer Linear Programming

KAUST Repository

Li, Yanning; Canepa, Edward S.; Claudel, Christian G.

2013-01-01

This article presents a new robust control framework for transportation problems in which the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a Hamilton-Jacobi equation, we pose the problem of controlling the state of the system on a network link, using boundary flow control, as a Linear Program. Unlike many previously investigated transportation control schemes, this method yields a globally optimal solution and is capable of handling shocks (i.e. discontinuities in the state of the system). We also demonstrate that the same framework can handle robust control problems, in which the uncontrollable components of the initial and boundary conditions are encoded in intervals on the right hand side of inequalities in the linear program. The lower bound of the interval which defines the smallest feasible solution set is used to solve the robust LP (or MILP if the objective function depends on boolean variables). Since this framework leverages the intrinsic properties of the Hamilton-Jacobi equation used to model the state of the system, it is extremely fast. Several examples are given to demonstrate the performance of the robust control solution and the trade-off between the robustness and the optimality. © 2013 IEEE.

8. Geometric Algebra Computing

CERN Document Server

Corrochano, Eduardo Bayro

2010-01-01

This book presents contributions from a global selection of experts in the field. This useful text offers new insights and solutions for the development of theorems, algorithms and advanced methods for real-time applications across a range of disciplines. Written in an accessible style, the discussion of all applications is enhanced by the inclusion of numerous examples, figures and experimental analysis. Features: provides a thorough discussion of several tasks for image processing, pattern recognition, computer vision, robotics and computer graphics using the geometric algebra framework; int

9. Geometric multipartite entanglement measures

International Nuclear Information System (INIS)

Paz-Silva, Gerardo A.; Reina, John H.

2007-01-01

Within the framework of constructions for quantifying entanglement, we build a natural scenario for the assembly of multipartite entanglement measures based on Hopf bundle-like mappings obtained through Clifford algebra representations. Then, given the non-factorizability of an arbitrary two-qubit density matrix, we give an alternate quantity that allows the construction of two types of entanglement measures based on their arithmetical and geometrical averages over all pairs of qubits in a register of size N, and thus fully characterize its degree and type of entanglement. We find that such an arithmetical average is both additive and strongly super additive

10. Geometric correlations and multifractals

International Nuclear Information System (INIS)

Amritkar, R.E.

1991-07-01

There are many situations where the usual statistical methods are not adequate to characterize correlations in the system. To characterize such situations we introduce mutual correlation dimensions which describe geometric correlations in the system. These dimensions allow us to distinguish between variables which are perfectly correlated with or without a phase lag, variables which are uncorrelated and variables which are partially correlated. We demonstrate the utility of our formalism by considering two examples from dynamical systems. The first example is about the loss of memory in chaotic signals and describes auto-correlations while the second example is about synchronization of chaotic signals and describes cross-correlations. (author). 19 refs, 6 figs

11. Steepest descent method implementation on unconstrained optimization problem using C++ program

Science.gov (United States)

Napitupulu, H.; Sukono; Mohd, I. Bin; Hidayat, Y.; Supian, S.

2018-03-01

Steepest Descent is known as the simplest gradient method. Recently, many researches are done to obtain the appropriate step size in order to reduce the objective function value progressively. In this paper, the properties of steepest descent method from literatures are reviewed together with advantages and disadvantages of each step size procedure. The development of steepest descent method due to its step size procedure is discussed. In order to test the performance of each step size, we run a steepest descent procedure in C++ program. We implemented it to unconstrained optimization test problem with two variables, then we compare the numerical results of each step size procedure. Based on the numerical experiment, we conclude the general computational features and weaknesses of each procedure in each case of problem.

12. A Dynamic Programming-Based Heuristic for the Shift Design Problem in Airport Ground Handling

DEFF Research Database (Denmark)

Clausen, Tommy

We consider the heterogeneous shift design problem for a workforce with multiple skills, where work shifts are created to cover a given demand as well as possible while minimizing cost and satisfying a flexible set of constraints. We focus mainly on applications within airport ground handling whe...... programming that allows flexibility in modeling the workforce. Parameters allow a planner to determine the level of demand coverage that best fulfills the requirements of the organization. Results are presented from several diverse real-life ground handling instances.......We consider the heterogeneous shift design problem for a workforce with multiple skills, where work shifts are created to cover a given demand as well as possible while minimizing cost and satisfying a flexible set of constraints. We focus mainly on applications within airport ground handling where...

13. Lessons Learned for Cx PRACA. Constellation Program Problem Reporting, Analysis and Corrective Action Process and System

Science.gov (United States)

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.

14. An evolutionary programming based simulated annealing method for solving the unit commitment problem

Energy Technology Data Exchange (ETDEWEB)

Christober Asir Rajan, C. [Department of EEE, Pondicherry Engineering College, Pondicherry 605014 (India); Mohan, M.R. [Department of EEE, Anna University, Chennai 600 025 (India)

2007-09-15

This paper presents a new approach to solve the short-term unit commitment problem using an evolutionary programming based simulated annealing method. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. Evolutionary programming, which happens to be a global optimisation technique for solving unit commitment Problem, operates on a system, which is designed to encode each unit's operating schedule with regard to its minimum up/down time. In this, the unit commitment schedule is coded as a string of symbols. An initial population of parent solutions is generated at random. Here, each schedule is formed by committing all the units according to their initial status (''flat start''). Here the parents are obtained from a pre-defined set of solution's, i.e. each and every solution is adjusted to meet the requirements. Then, a random recommitment is carried out with respect to the unit's minimum down times. And SA improves the status. The best population is selected by evolutionary strategy. The Neyveli Thermal Power Station (NTPS) Unit-II in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different power systems consists of 10, 26, 34 generating units. Numerical results are shown comparing the cost solutions and computation time obtained by using the Evolutionary Programming method and other conventional methods like Dynamic Programming, Lagrangian Relaxation and Simulated Annealing and Tabu Search in reaching proper unit commitment. (author)

15. Analysis of problem solving on project based learning with resource based learning approach computer-aided program

Science.gov (United States)

Kuncoro, K. S.; Junaedi, I.; Dwijanto

2018-03-01

This study aimed to reveal the effectiveness of Project Based Learning with Resource Based Learning approach computer-aided program and analyzed problem-solving abilities in terms of problem-solving steps based on Polya stages. The research method used was mixed method with sequential explanatory design. The subject of this research was the students of math semester 4. The results showed that the S-TPS (Strong Top Problem Solving) and W-TPS (Weak Top Problem Solving) had good problem-solving abilities in each problem-solving indicator. The problem-solving ability of S-MPS (Strong Middle Problem Solving) and (Weak Middle Problem Solving) in each indicator was good. The subject of S-BPS (Strong Bottom Problem Solving) had a difficulty in solving the problem with computer program, less precise in writing the final conclusion and could not reflect the problem-solving process using Polya’s step. While the Subject of W-BPS (Weak Bottom Problem Solving) had not been able to meet almost all the indicators of problem-solving. The subject of W-BPS could not precisely made the initial table of completion so that the completion phase with Polya’s step was constrained.

16. Increasing self-efficacy in learning to program: exploring the benefits of explicit instruction for problem solving

Directory of Open Access Journals (Sweden)

Irene Govender

2014-07-01

Full Text Available The difficulty of learning to program has long been identified amongst novices. This study explored the benefits of teaching a problem solving strategy by comparing students’ perceptions and attitudes towards problem solving before and after the strategy was implemented in secondary schools. Based on self-efficacy theory, students’ problem solving self-efficacy as well as teachers’ self-efficacy were investigated, showing that both students’ and teachers’ self-efficacy may have benefited from the explicit instruction. This would imply that teaching problem solving explicitly should be encouraged to increase self-efficacy to program.

17. California's program: Indoor air problems aren't amenable to regulation

International Nuclear Information System (INIS)

Wesolowski, J.

1993-01-01

In 1982, California's legislature established an Indoor Air Quality Program (CIAQP) in the Department of Health Services to carry out research on the nature and extent of the indoor air problem (excluding industrial worksites), to find appropriate mitigation measures, and to promote and coordinate the efforts of other state agencies. Since indoor air problems usually are not amenable to regulatory solutions, regulatory authority was not included in the mandate. The program conducts research into a wide range of contaminants--radon, asbestos, formaldehyde, carbon monoxide, volatile organic compounds, environmental tobacco smoke (ETS), as well as into biological aerosols that cause such diseases as Legionnaires disease, tuberculosis, allergies, and asthma. Studies are also carried out to better understand the Sick Building Syndrome. The research includes field surveys to determine the exposure of the population to specific contaminants and experiments in the laboratory to develop protocols for reducing exposures. The research emphasizes measurement of exposure--concentration multiplied by the time a person is exposed--as opposed to measurement of concentration only

18. Discrete geometric structures for architecture

KAUST Repository

Pottmann, Helmut

2010-06-13

The emergence of freeform structures in contemporary architecture raises numerous challenging research problems, most of which are related to the actual fabrication and are a rich source of research topics in geometry and geometric computing. The talk will provide an overview of recent progress in this field, with a particular focus on discrete geometric structures. Most of these result from practical requirements on segmenting a freeform shape into planar panels and on the physical realization of supporting beams and nodes. A study of quadrilateral meshes with planar faces reveals beautiful relations to discrete differential geometry. In particular, we discuss meshes which discretize the network of principal curvature lines. Conical meshes are among these meshes; they possess conical offset meshes at a constant face/face distance, which in turn leads to a supporting beam layout with so-called torsion free nodes. This work can be generalized to a variety of multilayer structures and laid the ground for an adapted curvature theory for these meshes. There are also efforts on segmenting surfaces into planar hexagonal panels. Though these are less constrained than planar quadrilateral panels, this problem is still waiting for an elegant solution. Inspired by freeform designs in architecture which involve circles and spheres, we present a new kind of triangle mesh whose faces\\' in-circles form a packing, i.e., the in-circles of two triangles with a common edge have the same contact point on that edge. These "circle packing (CP) meshes" exhibit an aesthetic balance of shape and size of their faces. They are closely tied to sphere packings on surfaces and to various remarkable structures and patterns which are of interest in art, architecture, and design. CP meshes constitute a new link between architectural freeform design and computational conformal geometry. Recently, certain timber structures motivated us to study discrete patterns of geodesics on surfaces. This

19. Building Interactivity in Higher Education to Support Student Engagement in Spatial Problem Solving and Programming

Science.gov (United States)

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

20. BUILDING INTERACTIVITY IN HIGHER EDUCATION TO SUPPORT STUDENT ENGAGEMENT IN SPATIAL PROBLEM SOLVING AND PROGRAMMING

Directory of Open Access Journals (Sweden)

E.-K. Gulland

2012-07-01

Full Text Available 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

1. Geometrization of quantum physics

International Nuclear Information System (INIS)

Ol'khov, O.A.

2009-01-01

It is shown that the Dirac equation for a free particle can be considered as a description of specific distortion of the space Euclidean geometry (space topological defect). This approach is based on the possibility of interpretation of the wave function as vector realizing representation of the fundamental group of the closed topological space-time 4-manifold. Mass and spin appear to be topological invariants. Such a concept explains all so-called 'strange' properties of quantum formalism: probabilities, wave-particle duality, nonlocal instantaneous correlation between noninteracting particles (EPR-paradox) and so on. Acceptance of the suggested geometrical concept means rejection of atomistic concept where all matter is considered as consisting of more and more small elementary particles. There are no any particles a priory, before measurement: the notions of particles appear as a result of classical interpretation of the contact of the region of the curved space with a device

2. Geometrization of quantum physics

Science.gov (United States)

Ol'Khov, O. A.

2009-12-01

It is shown that the Dirac equation for free particle can be considered as a description of specific distortion of the space euclidean geometry (space topological defect). This approach is based on possibility of interpretation of the wave function as vector realizing representation of the fundamental group of the closed topological space-time 4-manifold. Mass and spin appear to be topological invariants. Such concept explains all so called “strange” properties of quantum formalism: probabilities, wave-particle duality, nonlocal instantaneous correlation between noninteracting particles (EPR-paradox) and so on. Acceptance of suggested geometrical concept means rejection of atomistic concept where all matter is considered as consisting of more and more small elementary particles. There is no any particles a priori, before measurement: the notions of particles appear as a result of classical interpretation of the contact of the region of the curved space with a device.

3. Geometrical Image Transforms

OpenAIRE

Havelka, Jan

2008-01-01

Tato diplomová práce se zabývá akcelerací geometrických transformací obrazu s využitím GPU a architektury NVIDIA (R) CUDA TM. Časově kritické části kódu jsou přesunuty na GPU a vykonány paralelně. Jedním z výsledků je demonstrační aplikace pro porovnání výkonnosti obou architektur: CPU, a GPU v kombinaci s CPU. Pro referenční implementaci jsou použity vysoce optimalizované algoritmy z knihovny OpenCV, od firmy Intel. This master's thesis deals with acceleration of geometrical image transfo...

4. THE MAIN PROBLEMS OF THE STUDENTS’ ELECTRONIC PORTFOLIO FORMATION IN TERMS OF THE HIGHER EDUCATIONAL PROGRAMS

Directory of Open Access Journals (Sweden)

Yulia V. Dementieva

2016-01-01

Full Text Available The aim of the study is the description of the main problems of formation of the student’s electronic portfolio in the conditions of realization of Federal State Educational Standards of the Higher Education (FSES of HE.Methods.Theoretical analysis of scientific literature concerning the subject under discussion; monitoring of existing practices in modern Russian Universities procedures for the formation and maintenance of students electronic portfolio.Results. The author describes the main problems of the electronic students’ portfolio formation; some ways of solving described problems are offered.Scientific novelty concludes in the formation of key ideas of the electronic students’ portfolio based on the understanding of requirements of Federal State Educational Standards of Higher Education for the results of mastering educational programs. They are the formation of general cultural, general professional and professional competences.Practical significance. The researching results will become the theoretical basis for the systematic organization of the process of creating and maintaining an electronic students’ portfolio during the whole period of their studying at the university; the researching results can become a basis for methodological developments.

5. An integer programming formulation of the parsimonious loss of heterozygosity problem.

Science.gov (United States)

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.

6. An improved exploratory search technique for pure integer linear programming problems

Science.gov (United States)

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.

7. A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems

Science.gov (United States)

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.

8. Geometric Measure Theory and Minimal Surfaces

CERN Document Server

Bombieri, Enrico

2011-01-01

W.K. ALLARD: On the first variation of area and generalized mean curvature.- F.J. ALMGREN Jr.: Geometric measure theory and elliptic variational problems.- E. GIUSTI: Minimal surfaces with obstacles.- J. GUCKENHEIMER: Singularities in soap-bubble-like and soap-film-like surfaces.- D. KINDERLEHRER: The analyticity of the coincidence set in variational inequalities.- M. MIRANDA: Boundaries of Caciopoli sets in the calculus of variations.- L. PICCININI: De Giorgi's measure and thin obstacles.

9. An Investigation of the Impact of Function of Problem Behavior on Effectiveness of the Behavior Education Program (BEP)

Science.gov (United States)

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…

10. Increasing self-efficacy in learning to program : Exploring the benefits of explicit instruction for problem solving

NARCIS (Netherlands)

Govender, I.; Govender, D.; Havenga, M.; Mentz, E.; Breed, B.; Dignum, F.; Dignum, V.

2014-01-01

The difficulty of learning to program has long been identified amongst novices. This study explored the benefits of teaching a problem solving strategy by comparing students’ perceptions and attitudes towards problem solving before and after the strategy was implemented in secondary schools. Based

11. Multiple Problem-Solving Strategies Provide Insight into Students' Understanding of Open-Ended Linear Programming Problems

Science.gov (United States)

Sole, Marla A.

2016-01-01

Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students' unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex,…

12. Collection of proceedings of the international conference on programming and mathematical methods for solution of physical problems

International Nuclear Information System (INIS)

1994-01-01

Traditional International Conference on programming and mathematical methods for solution of physical problems took place in Dubna in Jun, 14-19, 1993. More than 160 scientists from 14 countries participated in the Conference. They presented about 120 reports, the range of problems including computerized information complexes, experimental data acquisition and processing systems, mathematical simulation and calculation experiment in physics, analytical and numerical methods for solution of physical problems

13. Effectiveness of the Triple P Positive Parenting Program on behavioral problems in children: A meta-analysis

NARCIS (Netherlands)

de Graaf, I.; Speetjens, P.; Smit, F.; de Wolff, M.; Tavecchio, L.

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

14. Optimal decisions principles of programming

CERN Document Server

Lange, Oskar

1971-01-01

Optimal Decisions: Principles of Programming deals with all important problems related to programming.This book provides a general interpretation of the theory of programming based on the application of the Lagrange multipliers, followed by a presentation of the marginal and linear programming as special cases of this general theory. The praxeological interpretation of the method of Lagrange multipliers is also discussed.This text covers the Koopmans' model of transportation, geometric interpretation of the programming problem, and nature of activity analysis. The solution of t

15. Geometrical tile design for complex neighborhoods.

Science.gov (United States)

Czeizler, Eugen; Kari, Lila

2009-01-01

Recent research has showed that tile systems are one of the most suitable theoretical frameworks for the spatial study and modeling of self-assembly processes, such as the formation of DNA and protein oligomeric structures. A Wang tile is a unit square, with glues on its edges, attaching to other tiles and forming larger and larger structures. Although quite intuitive, the idea of glues placed on the edges of a tile is not always natural for simulating the interactions occurring in some real systems. For example, when considering protein self-assembly, the shape of a protein is the main determinant of its functions and its interactions with other proteins. Our goal is to use geometric tiles, i.e., square tiles with geometrical protrusions on their edges, for simulating tiled paths (zippers) with complex neighborhoods, by ribbons of geometric tiles with simple, local neighborhoods. This paper is a step toward solving the general case of an arbitrary neighborhood, by proposing geometric tile designs that solve the case of a "tall" von Neumann neighborhood, the case of the f-shaped neighborhood, and the case of a 3 x 5 "filled" rectangular neighborhood. The techniques can be combined and generalized to solve the problem in the case of any neighborhood, centered at the tile of reference, and included in a 3 x (2k + 1) rectangle.

16. Dynamic Programming and Error Estimates for Stochastic Control Problems with Maximum Cost

International Nuclear Information System (INIS)

Bokanowski, Olivier; Picarelli, Athena; Zidani, Hasnaa

2015-01-01

This work is concerned with stochastic optimal control for a running maximum cost. A direct approach based on dynamic programming techniques is studied leading to the characterization of the value function as the unique viscosity solution of a second order Hamilton–Jacobi–Bellman (HJB) equation with an oblique derivative boundary condition. A general numerical scheme is proposed and a convergence result is provided. Error estimates are obtained for the semi-Lagrangian scheme. These results can apply to the case of lookback options in finance. Moreover, optimal control problems with maximum cost arise in the characterization of the reachable sets for a system of controlled stochastic differential equations. Some numerical simulations on examples of reachable analysis are included to illustrate our approach

17. A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines

Directory of Open Access Journals (Sweden)

Diamantidis A. C.

2004-01-01

Full Text Available In this study, the buffer allocation problem (BAP in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990, for the performance evaluation (i.e., estimation of throughput of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly developed dynamic programming (DP algorithm for the BAP. The proposed algorithm is applied to production lines where the number of machines is varying from four up to a hundred machines. The proposed algorithm is fast because it reduces the volume of computations by rejecting allocations that do not lead to maximization of the line's throughput. Numerical results are also given for large production lines.

18. Dynamic Programming and Error Estimates for Stochastic Control Problems with Maximum Cost

Energy Technology Data Exchange (ETDEWEB)

Bokanowski, Olivier, E-mail: boka@math.jussieu.fr [Laboratoire Jacques-Louis Lions, Université Paris-Diderot (Paris 7) UFR de Mathématiques - Bât. Sophie Germain (France); Picarelli, Athena, E-mail: athena.picarelli@inria.fr [Projet Commands, INRIA Saclay & ENSTA ParisTech (France); Zidani, Hasnaa, E-mail: hasnaa.zidani@ensta.fr [Unité de Mathématiques appliquées (UMA), ENSTA ParisTech (France)

2015-02-15

This work is concerned with stochastic optimal control for a running maximum cost. A direct approach based on dynamic programming techniques is studied leading to the characterization of the value function as the unique viscosity solution of a second order Hamilton–Jacobi–Bellman (HJB) equation with an oblique derivative boundary condition. A general numerical scheme is proposed and a convergence result is provided. Error estimates are obtained for the semi-Lagrangian scheme. These results can apply to the case of lookback options in finance. Moreover, optimal control problems with maximum cost arise in the characterization of the reachable sets for a system of controlled stochastic differential equations. Some numerical simulations on examples of reachable analysis are included to illustrate our approach.

19. TRIP: a finite element computer program for the solution of convection heat transfer problems

International Nuclear Information System (INIS)

Slagter, W.; Roodbergen, H.A.

1976-01-01

The theory and use of the finite element code TRIP are described. The code calculates temperature distributions in three-dimensional continua subjected to convection heat transfer. A variational principle for transport phenomena is applied to solve the convection heat transfer problem with temperature and heat flux boundary conditions. The finite element discretization technique is used to reduce the continuous spatial solution into a finite number of unknowns. The method is developed in detail to determine temperature distributions in coolant passages of fuel rod bundles which are idealized by hexahedral elements. The development of the TRIP code is discussed and the listing of the program is given in FORTRAN IV. An example is given to illustrate the validity and practicality of the method

20. A chaos-based evolutionary algorithm for general nonlinear programming problems

International Nuclear Information System (INIS)

El-Shorbagy, M.A.; Mousa, A.A.; Nasr, S.M.

2016-01-01

In this paper we present a chaos-based evolutionary algorithm (EA) for solving nonlinear programming problems named chaotic genetic algorithm (CGA). CGA integrates genetic algorithm (GA) and chaotic local search (CLS) strategy to accelerate the optimum seeking operation and to speed the convergence to the global solution. The integration of global search represented in genetic algorithm and CLS procedures should offer the advantages of both optimization methods while offsetting their disadvantages. By this way, it is intended to enhance the global convergence and to prevent to stick on a local solution. The inherent characteristics of chaos can enhance optimization algorithms by enabling it to escape from local solutions and increase the convergence to reach to the global solution. Twelve chaotic maps have been analyzed in the proposed approach. The simulation results using the set of CEC’2005 show that the application of chaotic mapping may be an effective strategy to improve the performances of EAs.

1. DYNAMIC PROGRAMMING APPROACH TO TESTING RESOURCE ALLOCATION PROBLEM FOR MODULAR SOFTWARE

Directory of Open Access Journals (Sweden)

P.K. Kapur

2003-02-01

Full Text Available Testing phase of a software begins with module testing. During this period modules are tested independently to remove maximum possible number of faults within a specified time limit or testing resource budget. This gives rise to some interesting optimization problems, which are discussed in this paper. Two Optimization models are proposed for optimal allocation of testing resources among the modules of a Software. In the first model, we maximize the total fault removal, subject to budgetary Constraint. In the second model, additional constraint representing aspiration level for fault removals for each module of the software is added. These models are solved using dynamic programming technique. The methods have been illustrated through numerical examples.

2. An Integer Programming Model for Multi-Echelon Supply Chain Decision Problem Considering Inventories

Science.gov (United States)

Harahap, Amin; Mawengkang, Herman; Siswadi; Effendi, Syahril

2018-01-01

In this paper we address a problem that is of significance to the industry, namely the optimal decision of a multi-echelon supply chain and the associated inventory systems. By using the guaranteed service approach to model the multi-echelon inventory system, we develop a mixed integer; programming model to simultaneously optimize the transportation, inventory and network structure of a multi-echelon supply chain. To solve the model we develop a direct search approach using a strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points.

3. Analysis and presentation of experimental results with examples, problems and programs

CERN Document Server

Christodoulides, Costas

2017-01-01

This book is intended as a guide to the analysis and presentation of experimental results. It develops various techniques for the numerical processing of experimental data, using basic statistical methods and the theory of errors. After presenting basic theoretical concepts, the book describes the methods by which the results can be presented, both numerically and graphically. The book is divided into three parts, of roughly equal length, addressing the theory, the analysis of data, and the presentation of results. Examples are given and problems are solved using the Excel, Origin, Python and R software packages. In addition, programs in all four languages are made available to readers, allowing them to use them in analyzing and presenting the results of their own experiments. Subjects are treated at a level appropriate for undergraduate students in the natural sciences, but this book should also appeal to anyone whose work involves dealing with experimental results.

4. Integer programming formulation and variable neighborhood search metaheuristic for the multiproduct pipeline scheduling problem

Energy Technology Data Exchange (ETDEWEB)

Souza Filho, Erito M.; Bahiense, Laura; Ferreira Filho, Virgilio J.M. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE); Lima, Leonardo [Centro Federal de Educacao Tecnologica Celso Sukow da Fonseca (CEFET-RJ), Rio de Janeiro, RJ (Brazil)

2008-07-01

Pipeline are known as the most reliable and economical mode of transportation for petroleum and its derivatives, especially when large amounts of products have to be pumped for large distances. In this work we address the short-term schedule of a pipeline system comprising the distribution of several petroleum derivatives from a single oil refinery to several depots, connected to local consumer markets, through a single multi-product pipeline. We propose an integer linear programming formulation and a variable neighborhood search meta-heuristic in order to compare the performances of the exact and heuristic approaches to the problem. Computational tests in C language and MOSEL/XPRESS-MP language are performed over a real Brazilian pipeline system. (author)

5. Developing a Novel Multi-objective Programming Model for Personnel Assignment Problem

Directory of Open Access Journals (Sweden)

Mehdi Seifbarghy

2014-05-01

Full Text Available The assignment of personnel to the right positions in order to increase organization's performance is one of the most crucial tasks in human resource management. In this paper, personnel assignment problem is formulated as a multi-objective binary integer programming model in which skills, level of satisfaction and training cost of personnel are considered simultaneously in productive company. The purpose of this model is to obtain the best matching between candidates and positions. In this model, a set of methods such as a group analytic hierarchy process (GAHP, Shannon entropy, coefficient of variation (CV and fuzzy logic are used to calculate the weights of evaluation criteria, weights of position and coefficient of objective functions. This proposed model can rationalize the subjective judgments of decision makers with mathematic models.

6. Robust Optimization Using Supremum of the Objective Function for Nonlinear Programming Problems

International Nuclear Information System (INIS)

Lee, Se Jung; Park, Gyung Jin

2014-01-01

In the robust optimization field, the robustness of the objective function emphasizes an insensitive design. In general, the robustness of the objective function can be achieved by reducing the change of the objective function with respect to the variation of the design variables and parameters. However, in conventional methods, when an insensitive design is emphasized, the performance of the objective function can be deteriorated. Besides, if the numbers of the design variables are increased, the numerical cost is quite high in robust optimization for nonlinear programming problems. In this research, the robustness index for the objective function and a process of robust optimization are proposed. Moreover, a method using the supremum of linearized functions is also proposed to reduce the computational cost. Mathematical examples are solved for the verification of the proposed method and the results are compared with those from the conventional methods. The proposed approach improves the performance of the objective function and its efficiency

7. Revisiting Employee Assistance Programs and Substance Use Problems in the Workplace: Key Issues and a Research Agenda

OpenAIRE

Levy Merrick, Elizabeth S.; Volpe-Vartanian, Joanna; Horgan, Constance M.; McCann, Bernard

2007-01-01

This column describes employee assistance program (EAPs) and identifies key issues for contemporary EAPs. These programs began as occupational alcohol programs and have evolved into more comprehensive resources. To better understand contemporary EAPs, the authors suggest a research agenda at includes descriptive studies to provide an up-to-date picture of services; investigations of how contemporary EAPs address substance use problems, including management consultation for early identificatio...

8. Harmonic and geometric analysis

CERN Document Server

Citti, Giovanna; Pérez, Carlos; Sarti, Alessandro; Zhong, Xiao

2015-01-01

This book presents an expanded version of four series of lectures delivered by the authors at the CRM. Harmonic analysis, understood in a broad sense, has a very wide interplay with partial differential equations and in particular with the theory of quasiconformal mappings and its applications. Some areas in which real analysis has been extremely influential are PDE's and geometric analysis. Their foundations and subsequent developments made extensive use of the Calderón–Zygmund theory, especially the Lp inequalities for Calderón–Zygmund operators (Beurling transform and Riesz transform, among others) and the theory of Muckenhoupt weights.  The first chapter is an application of harmonic analysis and the Heisenberg group to understanding human vision, while the second and third chapters cover some of the main topics on linear and multilinear harmonic analysis. The last serves as a comprehensive introduction to a deep result from De Giorgi, Moser and Nash on the regularity of elliptic partial differen...

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

Directory of Open Access Journals (Sweden)

2015-10-01

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

10. Benchmark problem for IAEA coordinated research program (CRP-3) on GCR afterheat removal. 1

International Nuclear Information System (INIS)

Takada, Shoji; Shiina, Yasuaki; Inagaki, Yoshiyuki; Hishida, Makoto; Sudo, Yukio

1995-08-01

In this report, detailed data which are necessary for the benchmark analysis of International Atomic Energy Agency (IAEA) Coordinated Research Program (CRP-3) on 'Heat Transport and Afterheat Removal for Gas-cooled Reactors under Accident Conditions' are described concerning about the configuration and sizes of the cooling panel test apparatus, experimental data and thermal properties. The test section of the test apparatus is composed of pressure vessel (max. 450degC) containing an electric heater (max. 100kW, 600degC) and cooling panels surrounding the pressure vessel. Gas pressure is varied from vacuum to 1.0MPa in the pressure vessel. Two experimental cases are selected as benchmark problems about afterheat removal of HTGR, described as follows, The experimental conditions are vacuum inside the pressure vessel and heater output 13.14kW, and helium gas pressure 0.73MPa inside the pressure vessel and heater output 28.79kW. Benchmark problems are to calculate temperature distributions on the outer surface of pressure vessel and heat transferred to the cooling panel using the experimental data. The analytical result of temperature distribution on the pressure vessel was estimated +38degC, -29degC compared with the experimental data, and analytical result of heat transferred from the surface of pressure vessel to the cooling panel was estimated max. -11.4% compared with the experimental result by using the computational code -THANPACST2- of JAERI. (author)

11. Integer 1/0 Knapsack Problem Dynamic Programming Approach in Building Maintenance Optimization

Directory of Open Access Journals (Sweden)

Viska Dewi Fawzy

2017-12-01

Full Text Available The most common problem in urban areas is the high public demand and the limited provision of housing. In meeting the needs of affordable housing for low income communities, the Government of Indonesia implements Rusunawa Project. Object of this research is Pandanarang Rusunawa. Rusunawa Pandanarang is one of the vertical housing in Cilacap that is facing deterioration issue and needs good maintenance management. This study aims at insetting priority and optimizing maintenance plan due to limited funds (limited budget and the amount of damage that must be repaired.This study uses one of the optimization methods of Dynamic Programing on the application of Integer 1/0 Knapsack Problem, to determine an schedule the maintenance activities. The Criteria that are used such as: the level of building components damage and the level of occupants participation. In the first criterion, the benefit (p is the percentage of damage that is fixed with the cost (w. While on the second criterion, the benefit (p is the percentage of occupant participation rate on the maintenance activities with the cost (w. For the budget of Rp 125.000.000, 00, it was obtained from the simulation that the value of the optimum solution on the first criterion at the 7th stage of 71.88% with total cost Rp 106.000.000, 00. At the second criterion, the value of the optimum solution at the 7th stage of 89.29% with total cost Rp 124.000.000, 00.

12. Fitting of full Cobb-Douglas and full VRTS cost frontiers by solving goal programming problem

Science.gov (United States)

Venkateswarlu, B.; Mahaboob, B.; Subbarami Reddy, C.; Madhusudhana Rao, B.

2017-11-01

The present research article first defines two popular production functions viz, Cobb-Douglas and VRTS production frontiers and their dual cost functions and then derives their cost limited maximal outputs. This paper tells us that the cost limited maximal output is cost efficient. Here the one side goal programming problem is proposed by which the full Cobb-Douglas cost frontier, full VRTS frontier can be fitted. This paper includes the framing of goal programming by which stochastic cost frontier and stochastic VRTS frontiers are fitted. Hasan et al. [1] used a parameter approach Stochastic Frontier Approach (SFA) to examine the technical efficiency of the Malaysian domestic banks listed in the Kuala Lumpur stock Exchange (KLSE) market over the period 2005-2010. AshkanHassani [2] exposed Cobb-Douglas Production Functions application in construction schedule crashing and project risk analysis related to the duration of construction projects. Nan Jiang [3] applied Stochastic Frontier analysis to a panel of New Zealand dairy forms in 1998/99-2006/2007.

13. Regular Polygons and Geometric Series.

Science.gov (United States)

Jarrett, Joscelyn A.

1982-01-01

Examples of some geometric illustrations of limits are presented. It is believed the limit concept is among the most important topics in mathematics, yet many students do not have good intuitive feelings for the concept, since it is often taught very abstractly. Geometric examples are suggested as meaningful tools. (MP)

14. Geometric Invariants and Object Recognition.

Science.gov (United States)

1992-08-01

University of Chicago Press. Maybank , S.J. [1992], "The Projection of Two Non-coplanar Conics", in Geometric Invariance in Machine Vision, eds. J.L...J.L. Mundy and A. Zisserman, MIT Press, Cambridge, MA. Mundy, J.L., Kapur, .. , Maybank , S.J., and Quan, L. [1992a] "Geometric Inter- pretation of

15. College and university environmental programs as a policy problem (Part 1): Integrating Knowledge, education, and action for a better world?

Science.gov (United States)

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

The environmental sciences/studies movement, with more than 1000 programs at colleges and universities in the United States and Canada, is unified by a common interest-ameliorating environmental problems through empirical enquiry and analytic judgment. Unfortunately, environmental programs have struggled in their efforts to integrate knowledge across disciplines and educate students to become sound problem solvers and leaders. We examine the environmental program movement as a policy problem, looking at overall goals, mapping trends in relation to those goals, identifying the underlying factors contributing to trends, and projecting the future. We argue that despite its shared common interest, the environmental program movement is disparate and fragmented by goal ambiguity, positivistic disciplinary approaches, and poorly rationalized curricula, pedagogies, and educational philosophies. We discuss these challenges and the nature of the changes that are needed in order to overcome them. In a subsequent article (Part 2) we propose specific strategies for improvement. ?? 2011 Springer Science+Business Media, LLC.

16. Research Problems in Data Curation: Outcomes from the Data Curation Education in Research Centers Program

Science.gov (United States)

Palmer, C. L.; Mayernik, M. S.; Weber, N.; Baker, K. S.; Kelly, K.; Marlino, M. R.; Thompson, C. A.

2013-12-01

The need for data curation is being recognized in numerous institutional settings as national research funding agencies extend data archiving mandates to cover more types of research grants. Data curation, however, is not only a practical challenge. It presents many conceptual and theoretical challenges that must be investigated to design appropriate technical systems, social practices and institutions, policies, and services. This presentation reports on outcomes from an investigation of research problems in data curation conducted as part of the Data Curation Education in Research Centers (DCERC) program. DCERC is developing a new model for educating data professionals to contribute to scientific research. The program is organized around foundational courses and field experiences in research and data centers for both master's and doctoral students. The initiative is led by the Graduate School of Library and Information Science at the University of Illinois at Urbana-Champaign, in collaboration with the School of Information Sciences at the University of Tennessee, and library and data professionals at the National Center for Atmospheric Research (NCAR). At the doctoral level DCERC is educating future faculty and researchers in data curation and establishing a research agenda to advance the field. The doctoral seminar, Research Problems in Data Curation, was developed and taught in 2012 by the DCERC principal investigator and two doctoral fellows at the University of Illinois. It was designed to define the problem space of data curation, examine relevant concepts and theories related to both technical and social perspectives, and articulate research questions that are either unexplored or under theorized in the current literature. There was a particular emphasis on the Earth and environmental sciences, with guest speakers brought in from NCAR, National Snow and Ice Data Center (NSIDC), and Rensselaer Polytechnic Institute. Through the assignments, students

17. Long-term effects of the Family Bereavement Program on spousally bereaved parents: Grief, mental health problems, alcohol problems, and coping efficacy.

Science.gov (United States)

Sandler, Irwin; Tein, Jenn-Yun; Cham, Heining; Wolchik, Sharlene; Ayers, Tim

2016-08-01

This study reports on the findings from a 6-year follow-up of a randomized trial of the Family Bereavement Program (FBP) on the outcomes for spousally bereaved parents. Spousally bereaved parents (N = 131) participated in the trial in which they were randomly assigned to receive the FBP (N = 72) or literature control (N = 59). Parents were assessed at four time points: pretest, posttest, and 11-month and 6-year follow-up. They reported on mental health problems, grief, and parenting at all four time periods. At the 6-year follow-up, parents reported on additional measures of persistent complex bereavement disorder, alcohol abuse problems, and coping efficacy. Bereaved parents in the FBP as compared to those in the literature control had lower levels of symptoms of depression, general psychiatric distress, prolonged grief, and alcohol problems, and higher coping efficacy (for mothers) at the 6-year follow-up. Multiple characteristics of the parent (e.g., gender, age, and baseline mental health problems) and of the spousal death (e.g., cause of death) were tested as moderators of program effects on each outcome, but only 3 of 45 tests of moderation were significant. Latent growth modeling found that the effects of the FBP on depression, psychiatric distress, and grief occurred immediately following program participation and were maintained over 6 years. Mediation analysis found that improvement in positive parenting partially mediated program effects to reduce depression and psychiatric distress, but had an indirect effect to higher levels of grief at the 6-year follow-up. Mediation analysis also found that improved parenting at the 6-year follow-up was partially mediated by program effects to reduce depression and that program effects to increase coping efficacy at the 6-year follow-up was partially mediated through reduced depression and grief and improved parenting. FBP reduced mental health problems, prolonged grief, and alcohol abuse, and increased coping

18. Transmuted Complementary Weibull Geometric Distribution

Directory of Open Access Journals (Sweden)

Ahmed Z. Afify

2014-12-01

Full Text Available This paper provides a new generalization of the complementary Weibull geometric distribution that introduced by Tojeiro et al. (2014, using the quadratic rank transmutation map studied by Shaw and Buckley (2007. The new distribution is referred to as transmuted complementary Weibull geometric distribution (TCWGD. The TCWG distribution includes as special cases the complementary Weibull geometric distribution (CWGD, complementary exponential geometric distribution(CEGD,Weibull distribution (WD and exponential distribution (ED. Various structural properties of the new distribution including moments, quantiles, moment generating function and RØnyi entropy of the subject distribution are derived. We proposed the method of maximum likelihood for estimating the model parameters and obtain the observed information matrix. A real data set are used to compare the exibility of the transmuted version versus the complementary Weibull geometric distribution.

19. Geometric Reasoning for Automated Planning

Science.gov (United States)

Clement, Bradley J.; Knight, Russell L.; Broderick, Daniel

2012-01-01

An important aspect of mission planning for NASA s operation of the International Space Station is the allocation and management of space for supplies and equipment. The Stowage, Configuration Analysis, and Operations Planning teams collaborate to perform the bulk of that planning. A Geometric Reasoning Engine is developed in a way that can be shared by the teams to optimize item placement in the context of crew planning. The ISS crew spends (at the time of this writing) a third or more of their time moving supplies and equipment around. Better logistical support and optimized packing could make a significant impact on operational efficiency of the ISS. Currently, computational geometry and motion planning do not focus specifically on the optimized orientation and placement of 3D objects based on multiple distance and containment preferences and constraints. The software performs reasoning about the manipulation of 3D solid models in order to maximize an objective function based on distance. It optimizes for 3D orientation and placement. Spatial placement optimization is a general problem and can be applied to object packing or asset relocation.

20. Simulating geometrically complex blast scenarios

Directory of Open Access Journals (Sweden)

Ian G. Cullis

2016-04-01

Full Text Available The effects of blast waves generated by energetic and non-energetic sources are of continuing interest to the ballistics research community. Modern conflicts are increasingly characterised by asymmetric urban warfare, with improvised explosive devices (IEDs often playing a dominant role on the one hand and an armed forces requirement for minimal collateral effects from their weapons on the other. These problems are characterised by disparate length- and time-scales and may also be governed by complex physics. There is thus an increasing need to be able to rapidly assess and accurately predict the effects of energetic blast in topologically complex scenarios. To this end, this paper presents a new QinetiQ-developed advanced computational package called EAGLE-Blast, which is capable of accurately resolving the generation, propagation and interaction of blast waves around geometrically complex shapes such as vehicles and buildings. After a brief description of the numerical methodology, various blast scenario simulations are described and the results compared with experimental data to demonstrate the validation of the scheme and its ability to describe these complex scenarios accurately and efficiently. The paper concludes with a brief discussion on the use of the code in supporting the development of algorithms for fast running engineering models.

1. The profile of students’ problem-solving skill in physics across interest program in the secondary school

Science.gov (United States)

Jua, S. K.; Sarwanto; Sukarmin

2018-05-01

Problem-solving skills are important skills in physics. However, according to some researchers, the problem-solving skill of Indonesian students’ problem in physics learning is categorized still low. The purpose of this study was to identify the profile of problem-solving skills of students who follow the across the interests program of physics. The subjects of the study were high school students of Social Sciences, grade X. The type of this research was descriptive research. The data which used to analyze the problem-solving skills were obtained through student questionnaires and the test results with impulse materials and collision. From the descriptive analysis results, the percentage of students’ problem-solving skill based on the test was 52.93% and indicators respectively. These results indicated that students’ problem-solving skill is categorized low.

2. A place for marriage and family services in employee assistance programs (EAPs): a survey of EAP client problems and needs.

Science.gov (United States)

Shumway, Sterling T; Wampler, Richard S; Dersch, Charette; Arredondo, Rudy

2004-01-01

Marriage and family services have not been widely recognized as part of employee assistance programs (EAP), although family and relational problems are widely cited as sources of problems on the job. EAP clients (N = 800, 97% self-referred) indicated how much family, psychological/emotional, drug, alcohol, employment-related, legal, and medical problems troubled them and the need for services in each area. Psychological/emotional (66%) and family (65%) problem areas frequently were rated "considerable" or "extreme." Both areas were rated as "considerable" or "extreme" by 48.6% of participants. In view of the evidence that marriage and family services can be effective with both family and psychological/emotional problems, professionals who are competent to provide such services have much to offer EAP programs.

3. Plasma geometric optics analysis and computation

International Nuclear Information System (INIS)

Smith, T.M.

1983-01-01

Important practical applications in the generation, manipulation, and diagnosis of laboratory thermonuclear plasmas have created a need for elaborate computational capabilities in the study of high frequency wave propagation in plasmas. A reduced description of such waves suitable for digital computation is provided by the theory of plasma geometric optics. The existing theory is beset by a variety of special cases in which the straightforward analytical approach fails, and has been formulated with little attention to problems of numerical implementation of that analysis. The standard field equations are derived for the first time from kinetic theory. A discussion of certain terms previously, and erroneously, omitted from the expansion of the plasma constitutive relation is given. A powerful but little known computational prescription for determining the geometric optics field in the neighborhood of caustic singularities is rigorously developed, and a boundary layer analysis for the asymptotic matching of the plasma geometric optics field across caustic singularities is performed for the first time with considerable generality. A proper treatment of birefringence is detailed, wherein a breakdown of the fundamental perturbation theory is identified and circumvented. A general ray tracing computer code suitable for applications to radiation heating and diagnostic problems is presented and described

4. Solving the Fully Fuzzy Bilevel Linear Programming Problem through Deviation Degree Measures and a Ranking Function Method

Directory of Open Access Journals (Sweden)

Aihong Ren

2016-01-01

Full Text Available This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solution of the problem, we apply deviation degree measures to deal with the fuzzy constraints and use a ranking function method of fuzzy numbers to rank the upper and lower level fuzzy objective functions. Then the fully fuzzy bilevel linear programming problem can be transformed into a deterministic bilevel programming problem. Considering the overall balance between improving objective function values and decreasing allowed deviation degrees, the computational procedure for finding a fuzzy optimal solution is proposed. Finally, a numerical example is provided to illustrate the proposed approach. The results indicate that the proposed approach gives a better optimal solution in comparison with the existing method.

5. Dynamic-Programming Approaches to Single- and Multi-Stage Stochastic Knapsack Problems for Portfolio Optimization

National Research Council Canada - National Science Library

Khoo, Wai

1999-01-01

.... These problems model stochastic portfolio optimization problems (SPOPs) which assume deterministic unit weight, and normally distributed unit return with known mean and variance for each item type...

6. An Overview of the WIN Program: Its Objectives, Accomplishments, and Problems.

Science.gov (United States)

Comptroller General of the U.S., Washington, DC.

The Work Incentive (WIN) program is supposed to help recipients of Aid to Families with Dependent Children (AFDC) to get jobs through a program of training, work experience, and employment while reducing the cost of the AFDC program. Because of concerns raised about the program, the Government Accounting Office (GAO) assessed the program to…

7. Progressive geometric algorithms

NARCIS (Netherlands)

Alewijnse, S.P.A.; Bagautdinov, T.M.; de Berg, M.T.; Bouts, Q.W.; ten Brink, Alex P.; Buchin, K.A.; Westenberg, M.A.

2015-01-01

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms

8. Progressive geometric algorithms

NARCIS (Netherlands)

Alewijnse, S.P.A.; Bagautdinov, T.M.; Berg, de M.T.; Bouts, Q.W.; Brink, ten A.P.; Buchin, K.; Westenberg, M.A.

2014-01-01

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms

9. Towards a theory of geometric graphs

CERN Document Server

Pach, Janos

2004-01-01

The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...

10. Geometric mechanics of periodic pleated origami.

Science.gov (United States)

Wei, Z Y; Guo, Z V; Dudte, L; Liang, H Y; Mahadevan, L

2013-05-24

Origami structures are mechanical metamaterials with properties that arise almost exclusively from the geometry of the constituent folds and the constraint of piecewise isometric deformations. Here we characterize the geometry and planar and nonplanar effective elastic response of a simple periodically folded Miura-ori structure, which is composed of identical unit cells of mountain and valley folds with four-coordinated ridges, defined completely by two angles and two lengths. We show that the in-plane and out-of-plane Poisson's ratios are equal in magnitude, but opposite in sign, independent of material properties. Furthermore, we show that effective bending stiffness of the unit cell is singular, allowing us to characterize the two-dimensional deformation of a plate in terms of a one-dimensional theory. Finally, we solve the inverse design problem of determining the geometric parameters for the optimal geometric and mechanical response of these extreme structures.

11. Programming

OpenAIRE

Jackson, M A

1982-01-01

The programmer's task is often taken to be the construction of algorithms, expressed in hierarchical structures of procedures: this view underlies the majority of traditional programming languages, such as Fortran. A different view is appropriate to a wide class of problem, perhaps including some problems in High Energy Physics. The programmer's task is regarded as having three main stages: first, an explicit model is constructed of the reality with which the program is concerned; second, thi...

12. Industrial waste recycling strategies optimization problem: mixed integer programming model and heuristics

Science.gov (United States)

Tang, Jiafu; Liu, Yang; Fung, Richard; Luo, Xinggang

2008-12-01

Manufacturers have a legal accountability to deal with industrial waste generated from their production processes in order to avoid pollution. Along with advances in waste recovery techniques, manufacturers may adopt various recycling strategies in dealing with industrial waste. With reuse strategies and technologies, byproducts or wastes will be returned to production processes in the iron and steel industry, and some waste can be recycled back to base material for reuse in other industries. This article focuses on a recovery strategies optimization problem for a typical class of industrial waste recycling process in order to maximize profit. There are multiple strategies for waste recycling available to generate multiple byproducts; these byproducts are then further transformed into several types of chemical products via different production patterns. A mixed integer programming model is developed to determine which recycling strategy and which production pattern should be selected with what quantity of chemical products corresponding to this strategy and pattern in order to yield maximum marginal profits. The sales profits of chemical products and the set-up costs of these strategies, patterns and operation costs of production are considered. A simulated annealing (SA) based heuristic algorithm is developed to solve the problem. Finally, an experiment is designed to verify the effectiveness and feasibility of the proposed method. By comparing a single strategy to multiple strategies in an example, it is shown that the total sales profit of chemical products can be increased by around 25% through the simultaneous use of multiple strategies. This illustrates the superiority of combinatorial multiple strategies. Furthermore, the effects of the model parameters on profit are discussed to help manufacturers organize their waste recycling network.

13. A linear programming model for protein inference problem in shotgun proteomics.

Science.gov (United States)

Huang, Ting; He, Zengyou

2012-11-15

Assembling peptides identified from tandem mass spectra into a list of proteins, referred to as protein inference, is an important issue in shotgun proteomics. The objective of protein inference is to find a subset of proteins that are truly present in the sample. Although many methods have been proposed for protein inference, several issues such as peptide degeneracy still remain unsolved. In this article, we present a linear programming model for protein inference. In this model, we use a transformation of the joint probability that each peptide/protein pair is present in the sample as the variable. Then, both the peptide probability and protein probability can be expressed as a formula in terms of the linear combination of these variables. Based on this simple fact, the protein inference problem is formulated as an optimization problem: minimize the number of proteins with non-zero probabilities under the constraint that the difference between the calculated peptide probability and the peptide probability generated from peptide identification algorithms should be less than some threshold. This model addresses the peptide degeneracy issue by forcing some joint probability variables involving degenerate peptides to be zero in a rigorous manner. The corresponding inference algorithm is named as ProteinLP. We test the performance of ProteinLP on six datasets. Experimental results show that our method is competitive with the state-of-the-art protein inference algorithms. The source code of our algorithm is available at: https://sourceforge.net/projects/prolp/. zyhe@dlut.edu.cn. Supplementary data are available at Bioinformatics Online.

14. Development and piloting of a treatment foster care program for older youth with psychiatric problems.

Science.gov (United States)

McMillen, J Curtis; Narendorf, Sarah Carter; Robinson, Debra; Havlicek, Judy; Fedoravicius, Nicole; Bertram, Julie; McNelly, David

2015-01-01

Older youth in out-of-home care often live in restrictive settings and face psychiatric issues without sufficient family support. This paper reports on the development and piloting of a manualized treatment foster care program designed to step down older youth with high psychiatric needs from residential programs to treatment foster care homes. A team of researchers and agency partners set out to develop a treatment foster care model for older youth based on Multi-dimensional Treatment Foster Care (MTFC). After matching youth by mental health condition and determining for whom randomization would be allowed, 14 youth were randomized to treatment as usual or a treatment foster home intervention. Stakeholders were interviewed qualitatively at multiple time points. Quantitative measures assessed mental health symptoms, days in locked facilities, employment and educational outcomes. Development efforts led to substantial variations from the MTFC model and a new model, Treatment Foster Care for Older Youth was piloted. Feasibility monitoring suggested that it was difficult, but possible to recruit and randomize youth from and out of residential homes and that foster parents could be recruited to serve them. Qualitative data pointed to some qualified clinical successes. Stakeholders viewed two team roles - that of psychiatric nurse and skills coaches - very highly. However, results also suggested that foster parents and some staff did not tolerate the intervention well and struggled to address the emotion dysregulation issues of the young people they served. Quantitative data demonstrated that the intervention was not keeping youth out of locked facilities. The intervention needed further refinement prior to a broader trial. Intervention development work continued until components were developed to help address emotion regulation problems among fostered youth. Psychiatric nurses and skills coaches who work with youth in community settings hold promise as important

15. Summer Treatment Program for Preschoolers with Externalizing Behavior Problems: a Preliminary Examination of Parenting Outcomes.

Science.gov (United States)

Graziano, Paulo A; Ros, Rosmary; Hart, Katie C; Slavec, Janine

2017-11-07

Within an at-risk sample of preschoolers with externalizing behavior problems (EBP), the current study examined the initial promise of a multimodal intervention, the Summer Treatment Program for Pre-Kindergarteners (STP-PreK), in improving parenting outcomes. Using an open trial design, 154 parents and their preschool children (73% male; M age  = 5.06 years; 82% Hispanic/Latino background) with at-risk or clinically elevated levels of EBP (57% of which were referred by schools or mental health/medical professionals) completed a baseline and post-treatment assessment. A subsample of 90 families completed a follow-up assessment approximately 6 to 9 months after treatment completion. Parental measures of parenting stress and discipline strategies were collected across all three assessments. Observational data were also collected across all assessments during a 5-min standardized child-led play situation and a 5-min parent-led clean up task. The parenting component of the STP-PreK included a School Readiness Parenting Program (SRPP) of which the behavioral management component was implemented via a Parent-Child Interaction Therapy (PCIT) adaptation (8 weekly group sessions with 15-20 parents in each group, lack of requirement of "mastery" criteria). All parenting outcomes (both ratings and observed) significantly improved after the intervention (Cohen's d mean effect size across measures 0.89) with all effects being maintained at the 6-9 month follow-up. These findings highlight the initial promise of our SRPP's PCIT adaptation in targeting multiple aspects of parenting while yielding comparable parenting skills acquisition compared to traditional individual PCIT.

16. Geometric inequalities for black holes

International Nuclear Information System (INIS)

Dain, Sergio

2013-01-01

Full text: A geometric inequality in General Relativity relates quantities that have both a physical interpretation and a geometrical definition. It is well known that the parameters that characterize the Kerr-Newman black hole satisfy several important geometric inequalities. Remarkably enough, some of these inequalities also hold for dynamical black holes. This kind of inequalities, which are valid in the dynamical and strong field regime, play an important role in the characterization of the gravitational collapse. They are closed related with the cosmic censorship conjecture. In this talk I will review recent results in this subject. (author)

17. Optical traps with geometric aberrations

International Nuclear Information System (INIS)

Roichman, Yael; Waldron, Alex; Gardel, Emily; Grier, David G.

2006-01-01

We assess the influence of geometric aberrations on the in-plane performance of optical traps by studying the dynamics of trapped colloidal spheres in deliberately distorted holographic optical tweezers. The lateral stiffness of the traps turns out to be insensitive to moderate amounts of coma, astigmatism, and spherical aberration. Moreover holographic aberration correction enables us to compensate inherent shortcomings in the optical train, thereby adaptively improving its performance. We also demonstrate the effects of geometric aberrations on the intensity profiles of optical vortices, whose readily measured deformations suggest a method for rapidly estimating and correcting geometric aberrations in holographic trapping systems

18. Geometric inequalities for black holes

Energy Technology Data Exchange (ETDEWEB)

Dain, Sergio [Universidad Nacional de Cordoba (Argentina)

2013-07-01

Full text: A geometric inequality in General Relativity relates quantities that have both a physical interpretation and a geometrical definition. It is well known that the parameters that characterize the Kerr-Newman black hole satisfy several important geometric inequalities. Remarkably enough, some of these inequalities also hold for dynamical black holes. This kind of inequalities, which are valid in the dynamical and strong field regime, play an important role in the characterization of the gravitational collapse. They are closed related with the cosmic censorship conjecture. In this talk I will review recent results in this subject. (author)

19. An information geometric approach to least squares minimization

Science.gov (United States)

Transtrum, Mark; Machta, Benjamin; Sethna, James

2009-03-01

Parameter estimation by nonlinear least squares minimization is a ubiquitous problem that has an elegant geometric interpretation: all possible parameter values induce a manifold embedded within the space of data. The minimization problem is then to find the point on the manifold closest to the origin. The standard algorithm for minimizing sums of squares, the Levenberg-Marquardt algorithm, also has geometric meaning. When the standard algorithm fails to efficiently find accurate fits to the data, geometric considerations suggest improvements. Problems involving large numbers of parameters, such as often arise in biological contexts, are notoriously difficult. We suggest an algorithm based on geodesic motion that may offer improvements over the standard algorithm for a certain class of problems.

20. Diffusion Under Geometrical Constraint

OpenAIRE

Ogawa, Naohisa

2014-01-01

Here we discus the diffusion of particles in a curved tube. This kind of transport phenomenon is observed in biological cells and porous media. To solve such a problem, we discuss the three dimensional diffusion equation with a confining wall forming a thinner tube. We find that the curvature appears in a effective diffusion coefficient for such a quasi-one-dimensional system. As an application to higher dimensional case, we discuss the diffusion in a curved surface with ...

1. Effects of an explicit problem-solving skills training program using a metacomponential approach for outpatients with acquired brain injury.

Science.gov (United States)

Fong, Kenneth N K; Howie, Dorothy R

2009-01-01

We investigated the effects of an explicit problem-solving skills training program using a metacomponential approach with 33 outpatients with moderate acquired brain injury, in the Hong Kong context. We compared an experimental training intervention with this explicit problem-solving approach, which taught metacomponential strategies, with a conventional cognitive training approach that did not have this explicit metacognitive training. We found significant advantages for the experimental group on the Metacomponential Interview measure in association with the explicit metacomponential training, but transfer to the real-life problem-solving measures was not evidenced in statistically significant findings. Small sample size, limited time of intervention, and some limitations with these tools may have been contributing factors to these results. The training program was demonstrated to have a significantly greater effect than the conventional training approach on metacomponential functioning and the component of problem representation. However, these benefits were not transferable to real-life situations.

2. A Bi-Level Programming Model for the Railway Express Cargo Service Network Design Problem

Directory of Open Access Journals (Sweden)

Boliang Lin

2018-06-01

Full Text Available Service network design is fundamentally crucial for railway express cargo transportation. The main challenge is to strike a balance between two conflicting objectives: low network setup costs and high expected operational incomes. Different configurations of these objectives will have different impacts on the quality of freight transportation services. In this paper, a bi-level programming model for the railway express cargo service network design problem is proposed. The upper-level model forms the optimal decisions in terms of the service characteristics, and the low-level model selects the service arcs for each commodity. The rail express cargo is strictly subject to the service commitment, the capacity restriction, flow balance constraints, and logical relationship constraints among the decisions variables. Moreover, linearization techniques are used to convert the lower-level model to a linear one so that it can be directly solved by a standard optimization solver. Finally, a real-world case study based on the Beijing–Guangzhou Railway Line is carried out to demonstrate the effectiveness and efficiency of the proposed solution approach.

3. Error Analysis Of Students Working About Word Problem Of Linear Program With NEA Procedure

Science.gov (United States)

Santoso, D. A.; Farid, A.; Ulum, B.

2017-06-01

Evaluation and assessment is an important part of learning. In evaluation process of learning, written test is still commonly used. However, the tests usually do not following-up by further evaluation. The process only up to grading stage not to evaluate the process and errors which done by students. Whereas if the student has a pattern error and process error, actions taken can be more focused on the fault and why is that happen. NEA procedure provides a way for educators to evaluate student progress more comprehensively. In this study, students’ mistakes in working on some word problem about linear programming have been analyzed. As a result, mistakes are often made students exist in the modeling phase (transformation) and process skills (process skill) with the overall percentage distribution respectively 20% and 15%. According to the observations, these errors occur most commonly due to lack of precision of students in modeling and in hastiness calculation. Error analysis with students on this matter, it is expected educators can determine or use the right way to solve it in the next lesson.

4. The implementation of problem-based learning in collaborative groups in a chiropractic program in Malaysia.

Science.gov (United States)

Win, Ni Ni; Nadarajah, Vishna Devi V; Win, Daw Khin

2015-01-01

Problem-based learning (PBL) is usually conducted in small-group learning sessions with approximately eight students per facilitator. In this study, we implemented a modified version of PBL involving collaborative groups in an undergraduate chiropractic program and assessed its pedagogical effectiveness. This study was conducted at the International Medical University, Kuala Lumpur, Malaysia, and involved the 2012 chiropractic student cohort. Six PBL cases were provided to chiropractic students, consisting of three PBL cases for which learning resources were provided and another three PBL cases for which learning resources were not provided. Group discussions were not continuously supervised, since only one facilitator was present. The students' perceptions of PBL in collaborative groups were assessed with a questionnaire that was divided into three domains: motivation, cognitive skills, and perceived pressure to work. Thirty of the 31 students (97%) participated in the study. PBL in collaborative groups was significantly associated with positive responses regarding students' motivation, cognitive skills, and perceived pressure to work (Plearning resources increased motivation and cognitive skills (Plearning resources.

5. The problems and solutions of predicting participation in energy efficiency programs

International Nuclear Information System (INIS)

Davis, Alexander L.; Krishnamurti, Tamar

2013-01-01

Highlights: • Energy efficiency pilot studies suffer from severe volunteer bias. • We formulate an approach for accommodating volunteer bias. • A short questionnaire and classification trees can control for the bias. - Abstract: This paper discusses volunteer bias in residential energy efficiency studies. We briefly evaluate the bias in existing studies. We then show how volunteer bias can be corrected when not avoidable, using an on-line study of intentions to enroll in an in-home display trial as an example. We found that the best predictor of intentions to enroll was expected benefit from the in-home display. Constraints on participation, such as time in the home and trust in scientists, were also associated with enrollment intentions. Using Breiman’s classification tree algorithm we found that the best model of intentions to enroll contained only five variables: expected enjoyment of the program, presence in the home during morning hours, trust (in friends and in scientists), and perceived ability to handle unexpected problems. These results suggest that a short questionnaire, that takes at most 1 min to complete, would allow better control of volunteer bias than a more extensive questionnaire. This paper should allow researchers who employ field studies involving human behavior to be better equipped to address volunteer bias

6. Maternal education preferences moderate the effects of mandatory employment and education programs on child positive and problem behaviors.

Science.gov (United States)

Gassman-Pines, Anna; Godfrey, Erin B; Yoshikawa, Hirokazu

2013-01-01

Grounded in person-environment fit theory, this study examined whether low-income mothers' preferences for education moderated the effects of employment- and education-focused welfare programs on children's positive and problem behaviors. The sample included 1,365 families with children between ages 3 and 5 years at study entry. Results 5 years after random assignment, when children were ages 8-10 years, indicated that mothers' education preferences did moderate program impacts on teacher-reported child behavior problems and positive behavior. Children whose mothers were assigned to the education program were rated by teachers to have less externalizing behavior and more positive behavior than children whose mothers were assigned to the employment program but only when mothers had strong preferences for education. © 2012 The Authors. Child Development © 2012 Society for Research in Child Development, Inc.

7. Project selection problem under uncertainty: An application of utility theory and chance constrained programming to a real case

Directory of Open Access Journals (Sweden)

Reza Hosnavi Atashgah

2013-06-01

Full Text Available Selecting from a pool of interdependent projects under certainty, when faced with resource constraints, has been studied well in the literature of project selection problem. After briefly reviewing and discussing popular modeling approaches for dealing with uncertainty, this paper proposes an approach based on chance constrained programming and utility theory for a certain range of problems and under some practical assumptions. Expected Utility Programming, as the proposed modeling approach, will be compared with other well-known methods and its meaningfulness and usefulness will be illustrated via two numerical examples and one real case.

8. Expected value based fuzzy programming approach to solve integrated supplier selection and inventory control problem with fuzzy demand

Science.gov (United States)

Sutrisno; Widowati; Sunarsih; Kartono

2018-01-01

In this paper, a mathematical model in quadratic programming with fuzzy parameter is proposed to determine the optimal strategy for integrated inventory control and supplier selection problem with fuzzy demand. To solve the corresponding optimization problem, we use the expected value based fuzzy programming. Numerical examples are performed to evaluate the model. From the results, the optimal amount of each product that have to be purchased from each supplier for each time period and the optimal amount of each product that have to be stored in the inventory for each time period were determined with minimum total cost and the inventory level was sufficiently closed to the reference level.

9. Discrete geometric structures for architecture

KAUST Repository

Pottmann, Helmut

2010-01-01

. The talk will provide an overview of recent progress in this field, with a particular focus on discrete geometric structures. Most of these result from practical requirements on segmenting a freeform shape into planar panels and on the physical realization

KAUST Repository

Jiang, Caigui

2016-01-01

The emergence of freeform architecture provides interesting geometric challenges with regards to the design and manufacturing of large-scale structures. To design these architectural structures, we have to consider two types of constraints. First

11. Geometrical optics in general relativity

OpenAIRE

Loinger, A.

2006-01-01

General relativity includes geometrical optics. This basic fact has relevant consequences that concern the physical meaning of the discontinuity surfaces propagated in the gravitational field - as it was first emphasized by Levi-Civita.

12. Mobile Watermarking against Geometrical Distortions

Directory of Open Access Journals (Sweden)

Jing Zhang

2015-08-01

Full Text Available Mobile watermarking robust to geometrical distortions is still a great challenge. In mobile watermarking, efficient computation is necessary because mobile devices have very limited resources due to power consumption. In this paper, we propose a low-complexity geometrically resilient watermarking approach based on the optimal tradeoff circular harmonic function (OTCHF correlation filter and the minimum average correlation energy Mellin radial harmonic (MACE-MRH correlation filter. By the rotation, translation and scale tolerance properties of the two kinds of filter, the proposed watermark detector can be robust to geometrical attacks. The embedded watermark is weighted by a perceptual mask which matches very well with the properties of the human visual system. Before correlation, a whitening process is utilized to improve watermark detection reliability. Experimental results demonstrate that the proposed watermarking approach is computationally efficient and robust to geometrical distortions.

13. Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.

Science.gov (United States)

Lyubetsky, Vassily; Gershgorin, Roman; Gorbunov, Konstantin

2017-12-06

Chromosome structure is a very limited model of the genome including the information about its chromosomes such as their linear or circular organization, the order of genes on them, and the DNA strand encoding a gene. Gene lengths, nucleotide composition, and intergenic regions are ignored. Although highly incomplete, such structure can be used in many cases, e.g., to reconstruct phylogeny and evolutionary events, to identify gene synteny, regulatory elements and promoters (considering highly conserved elements), etc. Three problems are considered; all assume unequal gene content and the presence of gene paralogs. The distance problem is to determine the minimum number of operations required to transform one chromosome structure into another and the corresponding transformation itself including the identification of paralogs in two structures. We use the DCJ model which is one of the most studied combinatorial rearrangement models. Double-, sesqui-, and single-operations as well as deletion and insertion of a chromosome region are considered in the model; the single ones comprise cut and join. In the reconstruction problem, a phylogenetic tree with chromosome structures in the leaves is given. It is necessary to assign the structures to inner nodes of the tree to minimize the sum of distances between terminal structures of each edge and to identify the mutual paralogs in a fairly large set of structures. A linear algorithm is known for the distance problem without paralogs, while the presence of paralogs makes it NP-hard. If paralogs are allowed but the insertion and deletion operations are missing (and special constraints are imposed), the reduction of the distance problem to integer linear programming is known. Apparently, the reconstruction problem is NP-hard even in the absence of paralogs. The problem of contigs is to find the optimal arrangements for each given set of contigs, which also includes the mutual identification of paralogs. We proved that these

14. Implementing a Comprehensive Program for the Prevention of Conduct Problems in Rural Communities: The Fast Track Experience1

Science.gov (United States)

Bierman, Karen L.

2012-01-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. PMID:9338956

15. Geometric nonlinear effects on the planar dynamics of a pivoted flexible beam encountering a point-surface impact

International Nuclear Information System (INIS)

Li Qing; Wang Tianshu; Ma Xingrui

2009-01-01

Flexible-body modeling with geometric nonlinearities remains a hot topic of research by applications in multibody system dynamics undergoing large overall motions. However, the geometric nonlinear effects on the impact dynamics of flexible multibody systems have attracted significantly less attention. In this paper, a point-surface impact problem between a rigid ball and a pivoted flexible beam is investigated. The Hertzian contact law is used to describe the impact process, and the dynamic equations are formulated in the floating frame of reference using the assumed mode method. The two important geometric nonlinear effects of the flexible beam are taken into account, i.e., the longitudinal foreshortening effect due to the transverse deformation, and the stress stiffness effect due to the axial force. The simulation results show that good consistency can be obtained with the nonlinear finite element program ABAQUS/Explicit if proper geometric nonlinearities are included in the floating frame formulation. Specifically, only the foreshortening effect should be considered in a pure transverse impact for efficiency, while the stress stiffness effect should be further considered in an oblique case with much more computational effort. It also implies that the geometric nonlinear effects should be considered properly in the impact dynamic analysis of more general flexible multibody systems

16. Application of a quadratic method of programming to a particular problem of a rational development of a waterflooded field

Energy Technology Data Exchange (ETDEWEB)

Korotkov, S F; Khalitov, N T

1965-01-01

he quadratic method of programming is used to solve the following type of problem. A circular reservoir is subjected to a peripheral waterflood. The reservoir is drained by wells arranged in 3 concentric circles. The objective is to control the operation of producing wells, that a maximum quantity of water-free oil will be produced. The wells are flowed so that bottomhole pressure is above the bubble point. A quadratic equation is used to express the essential features of the problem; a system of linear equations is used to express the boundary conditions. The problem is solved by means of the Wolf algorithm method. The method is demonstrated by an illustrative example.

17. Time as a geometric property of space

Directory of Open Access Journals (Sweden)

James Michael Chappell

2016-11-01

Full Text Available The proper description of time remains a key unsolved problem in science. Newton conceived of time as absolute and universal which it `flows equably without relation to anything external'}. In the nineteenth century, the four-dimensional algebraic structure of the quaternions developed by Hamilton, inspired him to suggest that they could provide a unified representation of space and time. With the publishing of Einstein's theory of special relativity these ideas then lead to the generally accepted Minkowski spacetime formulation in 1908. Minkowski, though, rejected the formalism of quaternions suggested by Hamilton and adopted rather an approach using four-vectors. The Minkowski framework is indeed found to provide a versatile formalism for describing the relationship between space and time in accordance with Einstein's relativistic principles, but nevertheless fails to provide more fundamental insights into the nature of time itself. In order to answer this question we begin by exploring the geometric properties of three-dimensional space that we model using Clifford geometric algebra, which is found to contain sufficient complexity to provide a natural description of spacetime. This description using Clifford algebra is found to provide a natural alternative to the Minkowski formulation as well as providing new insights into the nature of time. Our main result is that time is the scalar component of a Clifford space and can be viewed as an intrinsic geometric property of three-dimensional space without the need for the specific addition of a fourth dimension.

18. Alcohol & drug abuse: Revisiting employee assistance programs and substance use problems in the workplace: key issues and a research agenda.

Science.gov (United States)

Merrick, Elizabeth S Levy; Volpe-Vartanian, Joanna; Horgan, Constance M; McCann, Bernard

2007-10-01

This column describes employee assistance program (EAPs) and identifies key issues for contemporary EAPs. These programs began as occupational alcohol programs and have evolved into more comprehensive resources. To better understand contemporary EAPs, the authors suggest a research agenda that includes descriptive studies to provide an up-to-date picture of services; investigations of how contemporary EAPs address substance use problems, including management consultation for early identification; further study of EAPs' effects on outcomes, such as productivity and work group outcomes; examination of the relationship between EAPs and other workplace resources; further examination of influences on EAP utilization; and development and testing of EAP performance measures.

19. Revisiting Employee Assistance Programs and Substance Use Problems in the Workplace: Key Issues and a Research Agenda

Science.gov (United States)

Levy Merrick, Elizabeth S.; Volpe-Vartanian, Joanna; Horgan, Constance M.; McCann, Bernard

2012-01-01

This column describes employee assistance program (EAPs) and identifies key issues for contemporary EAPs. These programs began as occupational alcohol programs and have evolved into more comprehensive resources. To better understand contemporary EAPs, the authors suggest a research agenda at includes descriptive studies to provide an up-to-date picture of services; investigations of how contemporary EAPs address substance use problems, including management consultation for early identification; further study of EAPs’ effects on outcomes, such as productivity and work group outcomes; examination of the relationship between EAPs and other workplace resources; further examination of influences on EAP utilization; and development and testing of EAP performance measures. PMID:17914000

20. A constraint programming solution for the military unit path finding problem

CSIR Research Space (South Africa)

Leenen, L

2012-01-01

Full Text Available In this chapter the authors present an algorithm to solve the Dynamic Military Unit Path Finding Problem (DMUPFP) which is based on Stentz’s well-known D* algorithm to solve dynamic path finding problems. The Military Unit Path Finding Problem...

1. Design of problem-specific evolutionary algorithm/mixed-integer programming hybrids: two-stage stochastic integer programming applied to chemical batch scheduling

Science.gov (United States)

Urselmann, Maren; Emmerich, Michael T. M.; Till, Jochen; Sand, Guido; Engell, Sebastian

2007-07-01

Engineering optimization often deals with large, mixed-integer search spaces with a rigid structure due to the presence of a large number of constraints. Metaheuristics, such as evolutionary algorithms (EAs), are frequently suggested as solution algorithms in such cases. In order to exploit the full potential of these algorithms, it is important to choose an adequate representation of the search space and to integrate expert-knowledge into the stochastic search operators, without adding unnecessary bias to the search. Moreover, hybridisation with mathematical programming techniques such as mixed-integer programming (MIP) based on a problem decomposition can be considered for improving algorithmic performance. In order to design problem-specific EAs it is desirable to have a set of design guidelines that specify properties of search operators and representations. Recently, a set of guidelines has been proposed that gives rise to so-called Metric-based EAs (MBEAs). Extended by the minimal moves mutation they allow for a generalization of EA with self-adaptive mutation strength in discrete search spaces. In this article, a problem-specific EA for process engineering task is designed, following the MBEA guidelines and minimal moves mutation. On the background of the application, the usefulness of the design framework is discussed, and further extensions and corrections proposed. As a case-study, a two-stage stochastic programming problem in chemical batch process scheduling is considered. The algorithm design problem can be viewed as the choice of a hierarchical decision structure, where on different layers of the decision process symmetries and similarities can be exploited for the design of minimal moves. After a discussion of the design approach and its instantiation for the case-study, the resulting problem-specific EA/MIP is compared to a straightforward application of a canonical EA/MIP and to a monolithic mathematical programming algorithm. In view of the

2. Geometric Algebra Techniques in Flux Compactifications

International Nuclear Information System (INIS)

Coman, Ioana Alexandra; Lazaroiu, Calin Iuliu; Babalic, Elena Mirela

2016-01-01

We study “constrained generalized Killing (s)pinors,” which characterize supersymmetric flux compactifications of supergravity theories. Using geometric algebra techniques, we give conceptually clear and computationally effective methods for translating supersymmetry conditions into differential and algebraic constraints on collections of differential forms. In particular, we give a synthetic description of Fierz identities, which are an important ingredient of such problems. As an application, we show how our approach can be used to efficiently treat N=1 compactification of M-theory on eight manifolds and prove that we recover results previously obtained in the literature.

3. ERC Workshop on Geometric Partial Differential Equations

CERN Document Server

Novaga, Matteo; Valdinoci, Enrico

2013-01-01

This book is the outcome of a conference held at the Centro De Giorgi of the Scuola Normale of Pisa in September 2012. The aim of the conference was to discuss recent results on nonlinear partial differential equations, and more specifically geometric evolutions and reaction-diffusion equations. Particular attention was paid to self-similar solutions, such as solitons and travelling waves, asymptotic behaviour, formation of singularities and qualitative properties of solutions. These problems arise in many models from Physics, Biology, Image Processing and Applied Mathematics in general, and have attracted a lot of attention in recent years.

4. Evaluation of a four month rehabilitation program for stroke patients with balance problems and binocular visual dysfunction

DEFF Research Database (Denmark)

Schow, Trine; Harris, Paul; Teasdale, Thomas William

2016-01-01

Trine Schow, Paul Harris, Thomas William Teasdale, Morten Arendt Rasmussen. Evaluation of a four month rehabilitation program for stroke patients with balance problems and binocular visual dysfunction. NeuroRehabilitation. 2016 Apr 6;38(4):331-41. doi: 10.3233/NRE-161324....

5. Transportation Problems in Special Education Programs in Rural Areas - A Specific Solution and Some Suggestions for Delivery System Development.

Science.gov (United States)

Brody, Z. H.

The paper describes transportation problems encountered and solutions employed in delivering systems of comprehensive services to handicapped children in Anderson County, Tennessee, a predominantly rural area with considerable mountain area. Detailed are methods of transportation utilized in the four different program areas of the county special…

6. Generation Psy: Student Characteristics and Academic Achievement in a Three-Year Problem-Based Learning Bachelor Program

Science.gov (United States)

de Koning, Bjorn B.; Loyens, Sofie M. M.; Rikers, Remy M. J. P.; Smeets, Guus; van der Molen, Henk T.

2012-01-01

This study investigated the simultaneous impact of demographic, personality, intelligence, and (prior) study performance factors on students' academic achievement in a three-year academic problem-based psychology program. Information regarding students' gender, age, nationality, pre-university education, high school grades, Big Five personality…

7. Summary of the landfill remediation problems and technology needs of the Oak Ridge Reservation Environmental Restoration Programs

International Nuclear Information System (INIS)

1991-01-01

This report discusses the following topics: brief description of the Oak Ridge Reservation Environmental Restoration Program; descriptions of representative waste burials at each site; ongoing, planned, or potential remediation; known or anticipated remediation problems; potential applications for robotics in the remediation of Oak Ridge Reservation landfills

8. Quality-assurance study of the special-purpose finite-element program SPECTROM: II. Plasticity problems

International Nuclear Information System (INIS)

Callahan, G.D.; Fossum, A.F.

1982-11-01

General plasticity theory and solution techniques as are currently employed in RE/SPEC's finite element plasticity code SPECTROM-II are presented. Various yield functions are discussed and their differences are illustrated using example problems. Comparison of the results of SPECTROM-II with analytical solutions, numerical solutions, and the general purpose finite element program MARC-CDC show excellent agreement

9. A quadratic approximation-based algorithm for the solution of multiparametric mixed-integer nonlinear programming problems

KAUST Repository

Domínguez, Luis F.

2012-06-25

An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear programming subproblem and a mixed-integer nonlinear programming subproblem to provide a series of parametric upper and lower bounds. The primal subproblem is formulated by fixing the integer variables and solved through a series of multiparametric quadratic programming (mp-QP) problems based on quadratic approximations of the objective function, while the deterministic master subproblem is formulated so as to provide feasible integer solutions for the next primal subproblem. To reduce the computational effort when infeasibilities are encountered at the vertices of the critical regions (CRs) generated by the primal subproblem, a simplicial approximation approach is used to obtain CRs that are feasible at each of their vertices. The algorithm terminates when there does not exist an integer solution that is better than the one previously used by the primal problem. Through a series of examples, the proposed algorithm is compared with a multiparametric mixed-integer outer approximation (mp-MIOA) algorithm to demonstrate its computational advantages. © 2012 American Institute of Chemical Engineers (AIChE).

10. On-the-Spot Problem Solving of Airline Professionals: A Case Study of Sky Business School Personnel Training Program

Science.gov (United States)

Nara, Jun

2010-01-01

This research explores how chief cabin crew members of major airlines made their decisions on-the-spot when they had unexpected problems. This research also presents some insights that may improve personnel training programs for future stewardesses and stewards based on the investigation of their decision-making styles. The theoretical framework…

11. Geometric singular perturbation analysis of systems with friction

DEFF Research Database (Denmark)

Bossolini, Elena

This thesis is concerned with the application of geometric singular perturbation theory to mechanical systems with friction. The mathematical background on geometric singular perturbation theory, on the blow-up method, on non-smooth dynamical systems and on regularization is presented. Thereafter......, two mechanical problems with two diﬀerent formulations of the friction force are introduced and analysed. The ﬁrst mechanical problem is a one-dimensional spring-block model describing earthquake faulting. The dynamics of earthquakes is naturally a multiple timescale problem: the timescale...... scales. The action of friction is generally explained as the loss and restoration of linkages between the surface asperities at the molecular scale. However, the consequences of friction are noticeable at much larger scales, like hundreds of kilometers. By using geometric singular perturbation theory...

12. The NOx Budget Trading Program: A Collaborative, Innovative Approach to Solving a Regional Air Pollution Problem

Science.gov (United States)

This article examines the development and implementation of the NOx Budget Trading Program (NBP) and the lessons the Environmental Protection Agency has learned from this seasonal emissions cap-and-trade program.

13. Geometric Mixing, Peristalsis, and the Geometric Phase of the Stomach.

Science.gov (United States)

Arrieta, Jorge; Cartwright, Julyan H E; Gouillart, Emmanuelle; Piro, Nicolas; Piro, Oreste; Tuval, Idan

2015-01-01

Mixing fluid in a container at low Reynolds number--in an inertialess environment--is not a trivial task. Reciprocating motions merely lead to cycles of mixing and unmixing, so continuous rotation, as used in many technological applications, would appear to be necessary. However, there is another solution: movement of the walls in a cyclical fashion to introduce a geometric phase. We show using journal-bearing flow as a model that such geometric mixing is a general tool for using deformable boundaries that return to the same position to mix fluid at low Reynolds number. We then simulate a biological example: we show that mixing in the stomach functions because of the "belly phase," peristaltic movement of the walls in a cyclical fashion introduces a geometric phase that avoids unmixing.

14. Geometric Mixing, Peristalsis, and the Geometric Phase of the Stomach.

Directory of Open Access Journals (Sweden)

Jorge Arrieta

Full Text Available Mixing fluid in a container at low Reynolds number--in an inertialess environment--is not a trivial task. Reciprocating motions merely lead to cycles of mixing and unmixing, so continuous rotation, as used in many technological applications, would appear to be necessary. However, there is another solution: movement of the walls in a cyclical fashion to introduce a geometric phase. We show using journal-bearing flow as a model that such geometric mixing is a general tool for using deformable boundaries that return to the same position to mix fluid at low Reynolds number. We then simulate a biological example: we show that mixing in the stomach functions because of the "belly phase," peristaltic movement of the walls in a cyclical fashion introduces a geometric phase that avoids unmixing.

15. Cost-Effectiveness of Four Parenting Programs and Bibliotherapy for Parents of Children with Conduct Problems.

Science.gov (United States)

Sampaio, Filipa; Enebrink, Pia; Mihalopoulos, Cathrine; Feldman, Inna

2016-12-01

Parenting programs and self-help parenting interventions employing written materials are effective in reducing child conduct problems (CP) in the short-term compared to control groups, however evidence on the cost-effectiveness of such interventions is insufficient. Few studies have looked at the differences in effects between interventions in the same study design. This study aimed to determine the cost-effectiveness of four parenting programs: Comet, Incredible Years (IY), Cope and Connect, and bibliotherapy, compared to a waitlist control (WC), with a time horizon of 4 months, targeting CP in children aged 3-12 years. This economic evaluation was conducted alongside an RCT of the four parenting interventions and bibliotherapy compared to a WC. The study sample consisted of 961 parents of 3-12 year-old children with CP. CP was measured by the Eyberg Child Behavior Inventory. Effectiveness was expressed as the proportion of "recovered" cases of CP. The time horizon of the study was four months with a limited health sector perspective, including parents' time costs. We performed an initial comparative cost analysis for interventions whose outcomes differed significantly from the WC, and later a cost-effectiveness analysis of interventions whose outcomes differed significantly from both the WC and each other. Secondary analyses were performed: (i) joint outcome "recovered and improved", (ii) intervention completers, (iii) exclusion of parents' time costs, (iv) exclusion of training costs. All interventions apart from Connect significantly reduced CP compared to the WC. Of the other interventions Comet resulted in a significantly higher proportion of recovered cases compared to bibliotherapy. A comparative cost analysis of the effective interventions rendered an average cost per recovered case for bibliotherapy of USD 483, Cope USD 1972, Comet USD 3741, and IY USD 6668. Furthermore, Comet had an ICER of USD 8375 compared to bibliotherapy. Secondary analyses of

16. Program Evaluation of a Special Education Day School for Conduct Problem Adolescents.

Science.gov (United States)

Maher, Charles A.

1981-01-01

Describes a procedure for program evaluation of a special education day school. The procedure enables a program evaluator to: (1) identify priority evaluation information needs of a school staff, (2) involve those persons in evaluation design and implementation, and (3) determine the utility of the evaluation for program decision-making purposes.…

17. An e-Learning Collaborative Filtering Approach to Suggest Problems to Solve in Programming Online Judges

Science.gov (United States)

Toledo, Raciel Yera; Mota, Yailé Caballero

2014-01-01

The paper proposes a recommender system approach to cover online judge's domains. Online judges are e-learning tools that support the automatic evaluation of programming tasks done by individual users, and for this reason they are usually used for training students in programming contest and for supporting basic programming teachings. The…

18. Effectiveness of the Triple P Positive Parenting Program on behavioral problems in children: a meta-analysis.

Science.gov (United States)

de Graaf, Ireen; Speetjens, Paula; Smit, Filip; de Wolff, Marianne; Tavecchio, Louis

2008-09-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 evidence from relevant literature that included Level 4 Triple P interventions. Level 4 intervention is indicated if the child has multiple behavior problems in a variety of settings and there are clear deficits in parenting skills. Results indicate that Level 4 of Triple P interventions reduced disruptive behaviors in children. These improvements were maintained well over time, with further improvements in long-term follow-up. These effects support the widespread adoption and implementation of Triple P that is taking place in an increasing number of countries in quite diverse cultural contexts around the world.

19. Exact solutions to traffic density estimation problems involving the Lighthill-Whitham-Richards traffic flow model using mixed integer programming

KAUST Repository

Canepa, Edward S.; Claudel, Christian G.

2012-01-01

This article presents a new mixed integer programming formulation of the traffic density estimation problem in highways modeled by the Lighthill Whitham Richards equation. We first present an equivalent formulation of the problem using an Hamilton-Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton-Jacobi equation result in linear constraints, albeit with unknown integers. We then pose the problem of estimating the density at the initial time given incomplete and inaccurate traffic data as a Mixed Integer Program. We then present a numerical implementation of the method using experimental flow and probe data obtained during Mobile Century experiment. © 2012 IEEE.

20. Exact solutions to traffic density estimation problems involving the Lighthill-Whitham-Richards traffic flow model using mixed integer programming

KAUST Repository

Canepa, Edward S.

2012-09-01

This article presents a new mixed integer programming formulation of the traffic density estimation problem in highways modeled by the Lighthill Whitham Richards equation. We first present an equivalent formulation of the problem using an Hamilton-Jacobi equation. Then, using a semi-analytic formula, we show that the model constraints resulting from the Hamilton-Jacobi equation result in linear constraints, albeit with unknown integers. We then pose the problem of estimating the density at the initial time given incomplete and inaccurate traffic data as a Mixed Integer Program. We then present a numerical implementation of the method using experimental flow and probe data obtained during Mobile Century experiment. © 2012 IEEE.

1. The Effect of Social Skills Training Program on the Emotional and Behavioral Problems of Adolescent Girls in a High School

Directory of Open Access Journals (Sweden)

Ali Alavi

2008-07-01

Full Text Available "n  "n  "nObjective: "nSchool-based interventions (such as life skills training have become the mainstay for prevention of some behavioral problems. This study was conducted to evaluate the efficacy of a social skills training program on a group of students who were in the first grade of high school in an urban area of Tehran, Iran "n  "n  "nMethod: "nIn a before-after study, a kind of social skill education program named Right Choices" was used for high school female students. The entire students of a class in a high school participated in the study. The students' age  ranged from 14-16 years. All of the participants lived in an urban area. Demographic characteristics were recorded in a designed questionnaire and included the name, age, educational level of the students and their parents, and prior history of psychiatric and medical condition. The total problem score and each of the subscale scores of the students before and after the study were calculated and compared. "n  "n  "nResults: "nThe mean age of the 33 participants in the study whose SDQ answer sheets were completed was equal to 15.15±6.2 years (14 to 17 years. The mean total problem score of the participants in the beginning of the program was equal to 14.3±5. After the program, the students' total problem score and all of the subscale scores improved, however, the differences between pre- and post intervention scores were not statistically significant. "n  "n  "nConclusion: "nSocial skills training program may impact the problem behaviors of the adolescent girls.

2. Java programming fundamentals problem solving through object oriented analysis and design

CERN Document Server

Nair, Premchand S

2008-01-01

While Java texts are plentiful, it's difficult to find one that takes a real-world approach, and encourages novice programmers to build on their Java skills through practical exercise. Written by an expert with 19 experience teaching computer programming, Java Programming Fundamentals presents object-oriented programming by employing examples taken from everyday life. Provides a foundation in object-oriented design principles and UML notation Describes common pitfalls and good programming practicesFurnishes supplemental links, documents, and programs on its companion website, www.premnair.netU

3. A mixed integer programming model for a continuous move transportation problem with service constraints

Directory of Open Access Journals (Sweden)

J. Fabian Lopez

2010-01-01

Full Text Available We consider a Pickup and Delivery Vehicle Routing Problem (PDP commonly encountered in real-world logistics operations. The problem involves a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of pickup and delivery requests, each of which has pickup time windows and delivery time windows. Transportation orders and vehicle types must satisfy a set of compatibility constraints that specify which orders cannot be covered by which vehicle types. In addition we include some dock service capacity constraints as is required on common real world operations. This problem requires to be attended on large scale instances (orders ≥ 500, (vehicles ≥ 150. As a generalization of the traveling salesman problem, clearly this problem is NP-hard. The exact algorithms are too slow for large scale instances. The PDP-TWDS is both a packing problem (assign order to vehicles, and a routing problem (find the best route for each vehicle. We propose to solve the problem in three stages. The first stage constructs initials solutions at aggregate level relaxing some constraints on the original problem. The other two stages imposes time windows and dock service constraints. Our results are favorable finding good quality solutions in relatively short computational times.

4. A new geometrical gravitational theory

International Nuclear Information System (INIS)

Obata, T.; Chiba, J.; Oshima, H.

1981-01-01

A geometrical gravitational theory is developed. The field equations are uniquely determined apart from one unknown dimensionless parameter ω 2 . It is based on an extension of the Weyl geometry, and by the extension the gravitational coupling constant and the gravitational mass are made to be dynamical and geometrical. The fundamental geometrical objects in the theory are a metric gsub(μν) and two gauge scalars phi and psi. The theory satisfies the weak equivalence principle, but breaks the strong one generally. u(phi, psi) = phi is found out on the assumption that the strong one keeps holding good at least for bosons of low spins. Thus there is the simple correspondence between the geometrical objects and the gravitational objects. Since the theory satisfies the weak one, the inertial mass is also dynamical and geometrical in the same way as is the gravitational mass. Moreover, the cosmological term in the theory is a coscalar of power -4 algebraically made of psi and u(phi, psi), so it is dynamical, too. Finally spherically symmetric exact solutions are given. The permissible range of the unknown parameter ω 2 is experimentally determined by applying the solutions to the solar system. (author)

5. Parents of children with chronic health problems: programs of nursing research and their relationship to developmental science.

Science.gov (United States)

Miles, Margaret Shandor

2003-01-01

This review identified nurse researchers and research teams that have current programs of research focused on parents and parenting of children with chronic health problems. Researchers were included if they had at least five publications since 1990, with at least three of these articles first-authored. These programs of research were critiqued from a developmental science perspective. Multiple methods were used for the search, including examination of previous review articles, hand search of journals, online computer searches, and review of the curriculum vitae of authors. Seven programs of research were identified. Two programs of research focused on childhood cancer--Ida M. Martinson et al. and Marsha H. Cohen. Three programs of research used a noncategorical approach encompassing a variety of childhood chronic conditions--Katherine A. Knafl and Janet A. Deatrick, Sharon O. Burke, and Ann Garwick. One program focused primarily on parents of children with Down syndrome and disabilities--Marsha Van Riper--and another on parents of infants with a variety of chronic health problems--Margaret S. Miles and Diane Holditch-Davis. Diverse theories and conceptual frameworks were used, and most had some focus on ecological systems that might affect parents and parenting. Many used a family perspective and included fathers. Still broader aspects of the family and community ecology and the health care were not generally included. Few examined the bidirectionality of the relationship between the child and aspects of the child's illness and parental responses. There was variability in the extent to which ethnicity and socioeconomic status were considered. Studies provide important insight into the responses of parents and their parenting of children with chronic health problems. The studies provide a sound base for continuing to build a developmentally sensitive body of knowledge related to parents and parenting of the child with chronic health problems.

6. Existence of localizing solutions in plasticity via the geometric singular perturbation theory

KAUST Repository

Lee, Min-Gi; Tzavaras, Athanasios

2017-01-01

system has fast and slow time scales, forming a singularly perturbed problem. Geometric singular perturbation theory is applied to this problem to achieve an invariant surface. The flow on the invariant surface is analyzed via the Poincaré

7. Geometric group theory an introduction

CERN Document Server

Löh, Clara

2017-01-01

Inspired by classical geometry, geometric group theory has in turn provided a variety of applications to geometry, topology, group theory, number theory and graph theory. This carefully written textbook provides a rigorous introduction to this rapidly evolving field whose methods have proven to be powerful tools in neighbouring fields such as geometric topology. Geometric group theory is the study of finitely generated groups via the geometry of their associated Cayley graphs. It turns out that the essence of the geometry of such groups is captured in the key notion of quasi-isometry, a large-scale version of isometry whose invariants include growth types, curvature conditions, boundary constructions, and amenability. This book covers the foundations of quasi-geometry of groups at an advanced undergraduate level. The subject is illustrated by many elementary examples, outlooks on applications, as well as an extensive collection of exercises.

8. An integer programming model for a forest harvest problem in Pinus pinaster stands

Energy Technology Data Exchange (ETDEWEB)

Fonseca, T. F.; Cerveira, A.; Mota, A.

2012-11-01

The study addresses the special case of a management plan for maritime pine (Pinus pinaster Ait.) in common lands. The study area refers to 4,432 ha of maritime pine stands in North Portugal (Perimetro Florestal do Barroso in the county of Ribeira de Pena), distributed among five common lands called baldio areas. Those lands are co-managed by the Official Forest Services and the local communities, essentially for timber production, using empirical guidance. As the current procedure does not guarantee the best thinning and clear-cutting scheduling, it was considered important to develop easy-to-use models, supported by optimization techniques, to be employed by the forest managers in the harvest planning of these communitarian forests. Planning of the thinning and clear-cutting operations involved certain conditions, such as: (1) the optimal age for harvesting; (2) the maximum stand density permitted; (3) the minimum volume to be cut; (4) the guarantee of incomes for each of the five baldios in at least a two year period; (5) balanced incomes during the length of the projection period. In order to evaluate the sustainability of the wood resources, a set of constraints lower bounding the average ending age was additionally tested. The problem was formulated as an integer linear programming model where the incomes from thinning and clear-cutting are maximized while considering the constraints mentioned above. Five major scenarios were simulated. The simplest one allows for silvicultural constraints only, whereas the other four consider these constraints besides different management options. Two of them introduce joint management of all common areas with or without constraints addressing balanced distribution of incomes during the plan horizon, whilst the other two consider the same options but for individual management of the baldios. The proposed model is easy to apply, providing immediate advantages for short and mid-term planning periods compared to the empirical

9. Studies of radiant heat transfer problems by the MOXY-program

International Nuclear Information System (INIS)

Wennerberg, D.; Thiede, M.

1988-01-01

MOXY is a program for calculation of transients at LOCA in a BWR. The program has been enlarged for application to 9 x 9 bundles (earlier only 7 x 7 - and 8 x 8 geometries). The report presents the results of five runs, two cases for 8 x 8 -bundle and three for 9 x 9 bundle. Comparison is made with estimates made by other, similar programs. (O.S.)

10. Employee assistance program services for alcohol and other drug problems: implications for increased identification and engagement in treatment.

Science.gov (United States)

Jacobson, Jodi M; Sacco, Paul

2012-01-01

Fourteen million U.S. workers meet the diagnostic criteria for substance dependence, costing millions in lost productivity. Prior research suggests that employees who follow through with their Employee Assistance Program's (EAP) recommendations are more likely to participate and remain engaged in alcohol and other drug (AOD) treatment programs. This study identified rates of lifetime EAP service use for AOD problems and compared adults who reported using EAP services for AOD problems with those who used services other than EAP. Researchers analyzed a subset of participants from the National Epidemiologic Survey of Alcohol and Related Conditions who reported having received help for an AOD problem (NESARC, 2001-2002). Statistical analyses tested for differences in sociodemographic variables, lifetime mental health and substance abuse disorders, and health disability between EAP services users and users of other types of services. Among adults who sought services for AOD problems (n= 2,272), 7.58% (n= 166) reported using EAP services for these problems at some point during their lives. Major depressive disorder (lifetime), a drug use disorder (lifetime), and Black race/ethnicity were associated with a greater likelihood that someone would seek EAP services for help with their AOD problem. Results provide a foundation for researchers to understand who uses EAP services for AOD problems. Health and mental health professionals should increase their knowledge of EAP services to improve continuity of care for employees with AOD problems. EAPs are in a unique position to reach out to vulnerable employees in the workplace and engage them in treatment. Copyright © American Academy of Addiction Psychiatry.

11. An introduction to geometrical physics

CERN Document Server

Aldrovandi, R

1995-01-01

This book stresses the unifying power of the geometrical framework in bringing together concepts from the different areas of physics. Common underpinnings of optics, elasticity, gravitation, relativistic fields, particle mechanics and other subjects are underlined. It attempts to extricate the notion of space currently in the physical literature from the metric connotation.The book's goal is to present mathematical ideas associated with geometrical physics in a rather introductory language. Included are many examples from elementary physics and also, for those wishing to reach a higher level o

12. Geometric integration for particle accelerators

International Nuclear Information System (INIS)

Forest, Etienne

2006-01-01

This paper is a very personal view of the field of geometric integration in accelerator physics-a field where often work of the highest quality is buried in lost technical notes or even not published; one has only to think of Simon van der Meer Nobel prize work on stochastic cooling-unpublished in any refereed journal. So I reconstructed the relevant history of geometrical integration in accelerator physics as much as I could by talking to collaborators and using my own understanding of the field. The reader should not be too surprised if this account is somewhere between history, science and perhaps even fiction

13. Geometrical spin symmetry and spin

International Nuclear Information System (INIS)

Pestov, I. B.

2011-01-01

Unification of General Theory of Relativity and Quantum Mechanics leads to General Quantum Mechanics which includes into itself spindynamics as a theory of spin phenomena. The key concepts of spindynamics are geometrical spin symmetry and the spin field (space of defining representation of spin symmetry). The essence of spin is the bipolar structure of geometrical spin symmetry induced by the gravitational potential. The bipolar structure provides a natural derivation of the equations of spindynamics. Spindynamics involves all phenomena connected with spin and provides new understanding of the strong interaction.

14. Geometric integration for particle accelerators

Science.gov (United States)

Forest, Étienne

2006-05-01

This paper is a very personal view of the field of geometric integration in accelerator physics—a field where often work of the highest quality is buried in lost technical notes or even not published; one has only to think of Simon van der Meer Nobel prize work on stochastic cooling—unpublished in any refereed journal. So I reconstructed the relevant history of geometrical integration in accelerator physics as much as I could by talking to collaborators and using my own understanding of the field. The reader should not be too surprised if this account is somewhere between history, science and perhaps even fiction.

15. Lattice degeneracies of geometric fermions

International Nuclear Information System (INIS)

Raszillier, H.

1983-05-01

We give the minimal numbers of degrees of freedom carried by geometric fermions on all lattices of maximal symmetries in d = 2, 3, and 4 dimensions. These numbers are lattice dependent, but in the (free) continuum limit, part of the degrees of freedom have to escape to infinity by a Wilson mechanism built in, and 2sup(d) survive for any lattice. On self-reciprocal lattices we compare the minimal numbers of degrees of freedom of geometric fermions with the minimal numbers of naive fermions on these lattices and argue that these numbers are equal. (orig.)

16. The Impact of an Educational Program in Brief Interventions for Alcohol Problems on Undergraduate Nursing Students: A Brazilian Context.

Science.gov (United States)

Junqueira, Marcelle Aparecida de Barros; Rassool, G Hussein; Santos, Manoel Antônio dos; Pillon, Sandra Cristina

2015-01-01

Nurses are the prime movers in the prevention and harm reduction in alcohol-related harm especially for those patients who are unwilling to access specialist care. The aim of the study is to evaluate the attitudes and knowledge of nursing students before and after Brief Intervention Training for alcohol problems. A quasi-experimental study was conducted with 120 undergraduate nursing students. Sixty recruited students were randomized into experimental and control groups (n = 60 each). Participants completed questionnaires on knowledge and attitudes before and after this training of brief intervention. The brief intervention program, 16 hours of duration, includes training for screening and early recognition, nursing, and the treatment of alcohol problems. Analysis of the data showed statistically significant positive change in the nursing students' knowledge (identifications and care) and personal and professional attitudes in working with patients with alcohol problems after the educational intervention. The experimental group differed significantly in all the variables measured at posteducational program. The provision of educational program on brief intervention in undergraduate nursing education can be an effective way for acquisition of knowledge and changes in attitudes in working with patients with alcohol problems.

17. The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared

NARCIS (Netherlands)

L. Evers (Lanah); K.M. Glorie (Kristiaan); S. van der Ster (Suzanne); A.I. Barros (Ana); H. Monsuur (Herman)

2012-01-01

textabstractThe Orienteering Problem (OP) is a generalization of the well-known traveling salesman problem and has many interesting applications in logistics, tourism and defense. To reflect real-life situations, we focus on an uncertain variant of the OP. Two main approaches that deal with

18. Articulation Works for Most Community College Transfer Students, But Some Problems Continue. OPPAGA Program Review.

Science.gov (United States)

Florida State Legislature, Tallahassee. Office of Program Policy Analysis and Government Accountability.

The Florida legislature has passed several reforms designed to shorten the time it takes students to obtain their degrees. Although the reforms have produced benefits, some articulation problems continue. The problems include the following: (1) One in five (20%) AA transfer students take a semester or more of lower division courses at a…

19. Investigating Problem-Based Learning Tutorship in Medical and Engineering Programs in Malaysia

Science.gov (United States)

Servant, Virginie F. C.; Dewar, Eleanor F. A.

2015-01-01

Although Malaysia was the first country in Asia to adopt problem-based learning (PBL), the impact that this has had on its tutors remains largely unexplored. This paper details a qualitative study of the changing perceptions of teaching roles in two groups of problem-based learning tutors in two institutional contexts--one in medicine located in…

20. Outcomes of a coaching program for families with multiple problems in the Netherlands : A prospective study

NARCIS (Netherlands)

Tausendfreund, Tim; Knot-Dickscheit, Jana; Post, Wendy J.; Knorth, Erik J.; Grietens, Hans

2014-01-01

Families who face a multitude of severe and persistent problems in a number of different areas of life are commonly referred to as multi-problem families in Dutch child welfare. Although evidence suggests that short-term crisis interventions can have positive effects in these families, they have up