WorldWideScience

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

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

  6. A Geometric Dissection Problem

    Indian Academy of Sciences (India)

    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.

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

  8. 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

  9. 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

  10. 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.

  11. 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.

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

  14. 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.

  15. 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)

  16. 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.)

  17. 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.

  18. 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.

  19. The problem 7 forming triangular geometric line field

    Directory of Open Access Journals (Sweden)

    Travush Vladimir Iljich

    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.

  20. 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

  1. 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.

  2. 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.

  3. 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.

  4. 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.

  5. The problem 4 of placement triangular geometric line field

    Directory of Open Access Journals (Sweden)

    Travush Vladimir Iljich

    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.

  6. 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.

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

  8. 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

  9. 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.

  10. 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

  11. 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.)

  12. 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

  13. 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...

  14. 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...

  15. 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.

  16. 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.

  17. 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.

  18. 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.

  19. 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.

  20. 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

  1. 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

  2. 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

  3. 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.

  4. 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

  5. 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.

  6. 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

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

  8. 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. .

  9. 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

  10. 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.

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

    Directory of Open Access Journals (Sweden)

    Klyachin Vladimir Aleksandrovich

    2015-10-01

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

  12. 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.

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

  15. 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).

  16. 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.

  17. 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.

  18. 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

  19. 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 different formulations of the friction force are introduced and analysed. The first 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...

  20. 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

  1. 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.

  2. 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)

  3. 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.

  4. 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.

  5. 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.

  6. 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

  7. 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.)

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

  10. 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

  11. Geometric reconstruction methods for electron tomography

    DEFF Research Database (Denmark)

    Alpers, Andreas; Gardner, Richard J.; Kö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...

  12. 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.

  13. 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)

  14. 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.

  15. 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

  16. 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

  17. 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.

  18. 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...

  19. 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.

  20. Polyhedral and semidefinite programming methods in combinatorial optimization

    CERN Document Server

    Tunçel, Levent

    2010-01-01

    Since the early 1960s, polyhedral methods have played a central role in both the theory and practice of combinatorial optimization. Since the early 1990s, a new technique, semidefinite programming, has been increasingly applied to some combinatorial optimization problems. The semidefinite programming problem is the problem of optimizing a linear function of matrix variables, subject to finitely many linear inequalities and the positive semidefiniteness condition on some of the matrix variables. On certain problems, such as maximum cut, maximum satisfiability, maximum stable set and geometric r

  1. 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

  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. Geometric method for stability of non-linear elastic thin shells

    CERN Document Server

    Ivanova, Jordanka

    2002-01-01

    PREFACE This book deals with the new developments and applications of the geometric method to the nonlinear stability problem for thin non-elastic shells. There are no other published books on this subject except the basic ones of A. V. Pogorelov (1966,1967,1986), where variational principles defined over isometric surfaces, are postulated, and applied mainly to static and dynamic problems of elastic isotropic thin shells. A. V. Pogorelov (Harkov, Ukraine) was the first to provide in his monographs the geometric construction of the deformed shell surface in a post-critical stage and deriving explicitely the asymptotic formulas for the upper and lower critical loads. In most cases, these formulas were presented in a closed analytical form, and confirmed by experimental data. The geometric method by Pogorelov is one of the most important analytical methods developed during the last century. Its power consists in its ability to provide a clear geometric picture of the postcritical form of a deformed shell surfac...

  4. Errors in the universal and sufficient heuristic criteria of estimating validity limits of geometric optics and of the geometric theory of diffraction

    International Nuclear Information System (INIS)

    Borovikov, V.A.; Kinber, B.E.

    1988-01-01

    The heuristic criteria (HC) of validity of geometric optics (GO) and of the geometric theory of diffraction (GTD), suggested in [2-7, 13, 14] and based on identifying the physical volume occupied by the ray with the Fresnel volume (FV) introduced in these papers (i.e., the envelope of the first Fresnel zone), are analyzed. Numerous examples of HC invalidity are given, as well as the reasons. In particular, HC provide an incorrect answer for all GO problems with caustics, since in these problems there always exists a ray, whose FV is nonlocal and covers the FV of other rays. The HC are shown to be unsuitable for multiple ray GTD problems, as well as for the simplest problems of diffraction of a cylindrical wave by a half-plane and of a plane wave by a curved half-plane

  5. GeoBuilder: a geometric algorithm visualization and debugging system for 2D and 3D geometric computing.

    Science.gov (United States)

    Wei, Jyh-Da; Tsai, Ming-Hung; Lee, Gen-Cher; Huang, Jeng-Hung; Lee, Der-Tsai

    2009-01-01

    Algorithm visualization is a unique research topic that integrates engineering skills such as computer graphics, system programming, database management, computer networks, etc., to facilitate algorithmic researchers in testing their ideas, demonstrating new findings, and teaching algorithm design in the classroom. Within the broad applications of algorithm visualization, there still remain performance issues that deserve further research, e.g., system portability, collaboration capability, and animation effect in 3D environments. Using modern technologies of Java programming, we develop an algorithm visualization and debugging system, dubbed GeoBuilder, for geometric computing. The GeoBuilder system features Java's promising portability, engagement of collaboration in algorithm development, and automatic camera positioning for tracking 3D geometric objects. In this paper, we describe the design of the GeoBuilder system and demonstrate its applications.

  6. On the motion of matter in the geometrical gauge field theory

    International Nuclear Information System (INIS)

    Konopleva, N.P.

    2005-01-01

    In the geometrical gauge field theory, the motion equations of matter (elementary particles) are connected with the field equations. The problems arising from this connection are discussed. For the first time, such problems arose in Einstein's General Relativity. Einstein hoped that solution of these problems will allow explanation of elementary particles nature without making use of quantum mechanics. But, as it turned out, the situation is more difficult. Here the corresponding problems are formulated for the connection of equations of particle motion and field equations in the geometrical gauge field theory. It is shown that appearance of the problems under discussion is an inevitable effect of passage to relativism and local symmetries

  7. On the Motion of Matter in the Geometrical Gauge Field Theory

    CERN Document Server

    Konopleva, N P

    2005-01-01

    In the geometrical gauge field theory, the motion equations of matter (elementary particles) are connected with the field equations. In the talk, the problems arising from this connection are discussed. For the first time, such problems arose in Einstein's General Relativity. Einstein hoped that solution of these problems will allow explanation of elementary particles nature without making use of quantum mechanics. But, as it turned out, the situation is more difficult. Here the corresponding problems are formulated for the connection of equations of particle motion and field equations in the geometrical gauge field theory. It is shown that appearance of the problems under discussion is an inevitable effect of passage to relativism and local symmetries.

  8. 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...

  9. 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...

  10. 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

  11. 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…

  12. 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.

  13. 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)

  14. 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

  15. 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.

  16. 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.

  17. 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...

  18. 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.

  19. 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...

  20. 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

  1. Algebraic dynamics algorithm: Numerical comparison with Runge-Kutta algorithm and symplectic geometric algorithm

    Institute of Scientific and Technical Information of China (English)

    WANG ShunJin; ZHANG Hua

    2007-01-01

    Based on the exact analytical solution of ordinary differential equations,a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm.A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models.The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision,and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.

  2. Algebraic dynamics algorithm:Numerical comparison with Runge-Kutta algorithm and symplectic geometric algorithm

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Based on the exact analytical solution of ordinary differential equations, a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm. A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models. The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision, and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.

  3. IMA’s 2014-2015 Annual Thematic Program on Discrete Structures: Analysis and Applications

    CERN Document Server

    Madiman, Mokshay; Werner, Elisabeth

    2017-01-01

    This volume presents some of the research topics discussed at the 2014-2015 Annual Thematic Program Discrete Structures: Analysis and Applications at the Institute of Mathematics and its Applications during the Spring 2015 where geometric analysis, convex geometry and concentration phenomena were the focus. Leading experts have written surveys of research problems, making state of the art results more conveniently and widely available. The volume is organized into two parts. Part I contains those contributions that focus primarily on problems motivated by probability theory, while Part II contains those contributions that focus primarily on problems motivated by convex geometry and geometric analysis. This book will be of use to those who research convex geometry, geometric analysis and probability directly or apply such methods in other fields.

  4. 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

  5. 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.

  6. PLANS; a finite element program for nonlinear analysis of structures. Volume 2: User's manual

    Science.gov (United States)

    Pifko, A.; Armen, H., Jr.; Levy, A.; Levine, H.

    1977-01-01

    The PLANS system, rather than being one comprehensive computer program, is a collection of finite element programs used for the nonlinear analysis of structures. This collection of programs evolved and is based on the organizational philosophy in which classes of analyses are treated individually based on the physical problem class to be analyzed. Each of the independent finite element computer programs of PLANS, with an associated element library, can be individually loaded and used to solve the problem class of interest. A number of programs have been developed for material nonlinear behavior alone and for combined geometric and material nonlinear behavior. The usage, capabilities, and element libraries of the current programs include: (1) plastic analysis of built-up structures where bending and membrane effects are significant, (2) three dimensional elastic-plastic analysis, (3) plastic analysis of bodies of revolution, and (4) material and geometric nonlinear analysis of built-up structures.

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

  8. 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. ...

  9. Optimal control for mathematical models of cancer therapies an application of geometric methods

    CERN Document Server

    Schättler, Heinz

    2015-01-01

    This book presents applications of geometric optimal control to real life biomedical problems with an emphasis on cancer treatments. A number of mathematical models for both classical and novel cancer treatments are presented as optimal control problems with the goal of constructing optimal protocols. The power of geometric methods is illustrated with fully worked out complete global solutions to these mathematically challenging problems. Elaborate constructions of optimal controls and corresponding system responses provide great examples of applications of the tools of geometric optimal control and the outcomes aid the design of simpler, practically realizable suboptimal protocols. The book blends mathematical rigor with practically important topics in an easily readable tutorial style. Graduate students and researchers in science and engineering, particularly biomathematics and more mathematical aspects of biomedical engineering, would find this book particularly useful.

  10. 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,…

  11. An atomistic geometrical model of the B-DNA configuration for DNA-radiation interaction simulations

    Science.gov (United States)

    Bernal, M. A.; Sikansi, D.; Cavalcante, F.; Incerti, S.; Champion, C.; Ivanchenko, V.; Francis, Z.

    2013-12-01

    In this paper, an atomistic geometrical model for the B-DNA configuration is explained. This model accounts for five organization levels of the DNA, up to the 30 nm chromatin fiber. However, fragments of this fiber can be used to construct the whole genome. The algorithm developed in this work is capable to determine which is the closest atom with respect to an arbitrary point in space. It can be used in any application in which a DNA geometrical model is needed, for instance, in investigations related to the effects of ionizing radiations on the human genetic material. Successful consistency checks were carried out to test the proposed model. Catalogue identifier: AEPZ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEPZ_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 1245 No. of bytes in distributed program, including test data, etc.: 6574 Distribution format: tar.gz Programming language: FORTRAN. Computer: Any. Operating system: Multi-platform. RAM: 2 Gb Classification: 3. Nature of problem: The Monte Carlo method is used to simulate the interaction of ionizing radiation with the human genetic material in order to determine DNA damage yields per unit absorbed dose. To accomplish this task, an algorithm to determine if a given energy deposition lies within a given target is needed. This target can be an atom or any other structure of the genetic material. Solution method: This is a stand-alone subroutine describing an atomic-resolution geometrical model of the B-DNA configuration. It is able to determine the closest atom to an arbitrary point in space. This model accounts for five organization levels of the human genetic material, from the nucleotide pair up to the 30 nm chromatin fiber. This subroutine carries out a series of coordinate transformations

  12. 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

  13. 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)

  14. θ-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.

  15. 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)

  16. A geometric viewpoint on generalized hydrodynamics

    Directory of Open Access Journals (Sweden)

    Benjamin Doyon

    2018-01-01

    Full Text Available Generalized hydrodynamics (GHD is a large-scale theory for the dynamics of many-body integrable systems. It consists of an infinite set of conservation laws for quasi-particles traveling with effective (“dressed” velocities that depend on the local state. We show that these equations can be recast into a geometric dynamical problem. They are conservation equations with state-independent quasi-particle velocities, in a space equipped with a family of metrics, parametrized by the quasi-particles' type and speed, that depend on the local state. In the classical hard rod or soliton gas picture, these metrics measure the free length of space as perceived by quasi-particles; in the quantum picture, they weigh space with the density of states available to them. Using this geometric construction, we find a general solution to the initial value problem of GHD, in terms of a set of integral equations where time appears explicitly. These integral equations are solvable by iteration and provide an extremely efficient solution algorithm for GHD.

  17. Military Applications of Curved Focal Plane Arrays Developed by the HARDI Program

    Science.gov (United States)

    2011-01-01

    considered one of the main founders of geometrical optics, modern photography, and cinematography . Among his inventions are the Petzval portrait lens...still be a problem. B. HARDI Program/Institute for Defense Analyses (IDA) Task 1. HARDI Program State-of-the- art cameras could be improved by

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

    Science.gov (United States)

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

    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.

  19. 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.

  20. Introduction to geometric nonlinear control; Linearization, observability, decoupling

    Energy Technology Data Exchange (ETDEWEB)

    Respondek, W [Laboratoire de Mathematiques, INSA de Rouen (France)

    2002-07-15

    These notes are devoted to the problems of linearization, observability, and decoupling of nonlinear control systems. Together with notes of Bronislaw Jakubczyk in the same volume, they form an introduction to geometric methods in nonlinear control theory. In the first part we discuss equivalence of control systems. We consider various aspects of the problem: state-space and feedback equivalence, local and global equivalence, equivalence to linear and partially linear systems. In the second part we present the notion of observability and give a geometric rank condition for local observability and an algebraic characterization of local observability. We discuss unm observability, decompositions of non-observable systems, and properties of generic observable systems. In the third part we introduce the notion of invariant distributions and discuss disturbance decoupling and input-output decoupling. Many concepts and results are illustrated with examples. (author)

  1. A content-based digital image watermarking scheme resistant to local geometric distortions

    International Nuclear Information System (INIS)

    Yang, Hong-ying; Chen, Li-li; Wang, Xiang-yang

    2011-01-01

    Geometric distortion is known as one of the most difficult attacks to resist, as it can desynchronize the location of the watermark and hence cause incorrect watermark detection. Geometric distortion can be decomposed into two classes: global affine transforms and local geometric distortions. Most countermeasures proposed in the literature only address the problem of global affine transforms. It is a challenging problem to design a robust image watermarking scheme against local geometric distortions. In this paper, we propose a new content-based digital image watermarking scheme with good visual quality and reasonable resistance against local geometric distortions. Firstly, the robust feature points, which can survive various common image processing and global affine transforms, are extracted by using a multi-scale SIFT (scale invariant feature transform) detector. Then, the affine covariant local feature regions (LFRs) are constructed adaptively according to the feature scale and local invariant centroid. Finally, the digital watermark is embedded into the affine covariant LFRs by modulating the magnitudes of discrete Fourier transform (DFT) coefficients. By binding the watermark with the affine covariant LFRs, the watermark detection can be done without synchronization error. Experimental results show that the proposed image watermarking is not only invisible and robust against common image processing operations such as sharpening, noise addition, and JPEG compression, etc, but also robust against global affine transforms and local geometric distortions

  2. 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.

  3. 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

  4. 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.

  5. The differential-geometric aspects of integrable dynamical systems

    International Nuclear Information System (INIS)

    Prykarpatsky, Y.A.; Samoilenko, A.M.; Prykarpatsky, A.K.; Bogolubov, N.N. Jr.; Blackmore, D.L.

    2007-05-01

    The canonical reduction method on canonically symplectic manifolds is analyzed in detail, and the relationships with the geometric properties of associated principal fiber bundles endowed with connection structures are described. Some results devoted to studying geometrical properties of nonabelian Yang-Mills type gauge field equations are presented. A symplectic theory approach is developed for partially solving the problem of algebraic-analytical construction of integral submanifold embeddings for integrable (via the abelian and nonabelian Liouville-Arnold theorems) Hamiltonian systems on canonically symplectic phase spaces. The fundamental role of the so-called Picard-Fuchs type equations is revealed, and their differential-geometric and algebraic properties are studied in detail. Some interesting examples of integrable Hamiltonian systems are are studied in detail in order to demonstrate the ease of implementation and effectiveness of the procedure for investigating the integral submanifold embedding mapping. (author)

  6. 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

  7. 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.)

  8. 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.

  9. Inverse Kinematics for Industrial Robots using Conformal Geometric Algebra

    Directory of Open Access Journals (Sweden)

    Adam L. Kleppe

    2016-01-01

    Full Text Available This paper shows how the recently developed formulation of conformal geometric algebra can be used for analytic inverse kinematics of two six-link industrial manipulators with revolute joints. The paper demonstrates that the solution of the inverse kinematics in this framework relies on the intersection of geometric objects like lines, circles, planes and spheres, which provides the developer with valuable geometric intuition about the problem. It is believed that this will be very useful for new robot geometries and other mechanisms like cranes and topside drilling equipment. The paper extends previous results on inverse kinematics using conformal geometric algebra by providing consistent solutions for the joint angles for the different configurations depending on shoulder left or right, elbow up or down, and wrist flipped or not. Moreover, it is shown how to relate the solution to the Denavit-Hartenberg parameters of the robot. The solutions have been successfully implemented and tested extensively over the whole workspace of the manipulators.

  10. 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.

  11. 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…

  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. Analysis of Geometric Thinking Students’ and Process-Guided Inquiry Learning Model

    Science.gov (United States)

    Hardianti, D.; Priatna, N.; Priatna, B. A.

    2017-09-01

    This research aims to analysis students’ geometric thinking ability and theoretically examine the process-oriented guided iquiry (POGIL) model. This study uses qualitative approach with descriptive method because this research was done without any treatment on subjects. Data were collected naturally. This study was conducted in one of the State Junior High School in Bandung. The population was second grade students and the sample was 32 students. Data of students’ geometric thinking ability were collected through geometric thinking test. These questions are made based on the characteristics of geometry thinking based on van hiele’s theory. Based on the results of the analysis and discussion, students’ geometric thinking ability is still low so it needs to be improved. Therefore, an effort is needed to overcome the problems related to students’ geometric thinking ability. One of the efforts that can be done by doing the learning that can facilitate the students to construct their own geometry concept, especially quadrilateral’s concepts so that students’ geometric thinking ability can enhance maximally. Based on study of the theory, one of the learning models that can enhance the students’ geometric thinking ability is POGIL model.

  14. 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.

  15. Geometric reconstruction methods for electron tomography

    Energy Technology Data Exchange (ETDEWEB)

    Alpers, Andreas, E-mail: alpers@ma.tum.de [Zentrum Mathematik, Technische Universität München, D-85747 Garching bei München (Germany); Gardner, Richard J., E-mail: Richard.Gardner@wwu.edu [Department of Mathematics, Western Washington University, Bellingham, WA 98225-9063 (United States); König, Stefan, E-mail: koenig@ma.tum.de [Zentrum Mathematik, Technische Universität München, D-85747 Garching bei München (Germany); Pennington, Robert S., E-mail: robert.pennington@uni-ulm.de [Center for Electron Nanoscopy, Technical University of Denmark, DK-2800 Kongens Lyngby (Denmark); Boothroyd, Chris B., E-mail: ChrisBoothroyd@cantab.net [Ernst Ruska-Centre for Microscopy and Spectroscopy with Electrons and Peter Grünberg Institute, Forschungszentrum Jülich, D-52425 Jülich (Germany); Houben, Lothar, E-mail: l.houben@fz-juelich.de [Ernst Ruska-Centre for Microscopy and Spectroscopy with Electrons and Peter Grünberg Institute, Forschungszentrum Jülich, D-52425 Jülich (Germany); Dunin-Borkowski, Rafal E., E-mail: rdb@fz-juelich.de [Ernst Ruska-Centre for Microscopy and Spectroscopy with Electrons and Peter Grünberg Institute, Forschungszentrum Jülich, D-52425 Jülich (Germany); Joost Batenburg, Kees, E-mail: Joost.Batenburg@cwi.nl [Centrum Wiskunde and Informatica, NL-1098XG, Amsterdam, The Netherlands and Vision Lab, Department of Physics, University of Antwerp, B-2610 Wilrijk (Belgium)

    2013-05-15

    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 non-linear projection intensities due to diffraction effects. The former refers to the fact that data cannot be acquired over the full 180° tilt range; the latter implies that for some orientations, crystalline structures can show strong contrast changes. To overcome these problems we introduce 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 for the reconstruction of an InAs nanowire. - Highlights: ► Four algorithms for electron tomography are introduced that utilize prior knowledge. ► Objects are assumed to be homogeneous; convexity and regularity is also discussed. ► We are able to reconstruct slices of a nanowire from as few as four projections. ► Algorithms should be selected based on the specific reconstruction task at hand.

  16. Geometric reconstruction methods for electron tomography

    International Nuclear Information System (INIS)

    Alpers, Andreas; Gardner, Richard J.; König, Stefan; Pennington, Robert S.; Boothroyd, Chris B.; Houben, Lothar; Dunin-Borkowski, Rafal E.; Joost Batenburg, Kees

    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 non-linear projection intensities due to diffraction effects. The former refers to the fact that data cannot be acquired over the full 180° tilt range; the latter implies that for some orientations, crystalline structures can show strong contrast changes. To overcome these problems we introduce 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 for the reconstruction of an InAs nanowire. - Highlights: ► Four algorithms for electron tomography are introduced that utilize prior knowledge. ► Objects are assumed to be homogeneous; convexity and regularity is also discussed. ► We are able to reconstruct slices of a nanowire from as few as four projections. ► Algorithms should be selected based on the specific reconstruction task at hand

  17. 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.

  18. 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.

  19. Object matching using a locally affine invariant and linear programming techniques.

    Science.gov (United States)

    Li, Hongsheng; Huang, Xiaolei; He, Lei

    2013-02-01

    In this paper, we introduce a new matching method based on a novel locally affine-invariant geometric constraint and linear programming techniques. To model and solve the matching problem in a linear programming formulation, all geometric constraints should be able to be exactly or approximately reformulated into a linear form. This is a major difficulty for this kind of matching algorithm. We propose a novel locally affine-invariant constraint which can be exactly linearized and requires a lot fewer auxiliary variables than other linear programming-based methods do. The key idea behind it is that each point in the template point set can be exactly represented by an affine combination of its neighboring points, whose weights can be solved easily by least squares. Errors of reconstructing each matched point using such weights are used to penalize the disagreement of geometric relationships between the template points and the matched points. The resulting overall objective function can be solved efficiently by linear programming techniques. Our experimental results on both rigid and nonrigid object matching show the effectiveness of the proposed algorithm.

  20. 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é

  1. Floating-point geometry: toward guaranteed geometric computations with approximate arithmetics

    Science.gov (United States)

    Bajard, Jean-Claude; Langlois, Philippe; Michelucci, Dominique; Morin, Géraldine; Revol, Nathalie

    2008-08-01

    Geometric computations can fail because of inconsistencies due to floating-point inaccuracy. For instance, the computed intersection point between two curves does not lie on the curves: it is unavoidable when the intersection point coordinates are non rational, and thus not representable using floating-point arithmetic. A popular heuristic approach tests equalities and nullities up to a tolerance ɛ. But transitivity of equality is lost: we can have A approx B and B approx C, but A not approx C (where A approx B means ||A - B|| < ɛ for A,B two floating-point values). Interval arithmetic is another, self-validated, alternative; the difficulty is to limit the swell of the width of intervals with computations. Unfortunately interval arithmetic cannot decide equality nor nullity, even in cases where it is decidable by other means. A new approach, developed in this paper, consists in modifying the geometric problems and algorithms, to account for the undecidability of the equality test and unavoidable inaccuracy. In particular, all curves come with a non-zero thickness, so two curves (generically) cut in a region with non-zero area, an inner and outer representation of which is computable. This last approach no more assumes that an equality or nullity test is available. The question which arises is: which geometric problems can still be solved with this last approach, and which cannot? This paper begins with the description of some cases where every known arithmetic fails in practice. Then, for each arithmetic, some properties of the problems they can solve are given. We end this work by proposing the bases of a new approach which aims to fulfill the geometric computations requirements.

  2. 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``.

  3. 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.

  4. 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 ...

  5. 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

  6. Geometric flows and (some of) their physical applications

    CERN Document Server

    Bakas, Ioannis

    2005-01-01

    The geometric evolution equations provide new ways to address a variety of non-linear problems in Riemannian geometry, and, at the same time, they enjoy numerous physical applications, most notably within the renormalization group analysis of non-linear sigma models and in general relativity. They are divided into classes of intrinsic and extrinsic curvature flows. Here, we review the main aspects of intrinsic geometric flows driven by the Ricci curvature, in various forms, and explain the intimate relation between Ricci and Calabi flows on Kahler manifolds using the notion of super-evolution. The integration of these flows on two-dimensional surfaces relies on the introduction of a novel class of infinite dimensional algebras with infinite growth. It is also explained in this context how Kac's K_2 simple Lie algebra can be used to construct metrics on S^2 with prescribed scalar curvature equal to the sum of any holomorphic function and its complex conjugate; applications of this special problem to general re...

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

  8. 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

  9. Reconstruction of the spatial dependence of dielectric and geometrical properties of adhesively bonded structures

    International Nuclear Information System (INIS)

    Mackay, C; Hayward, D; Mulholland, A J; McKee, S; Pethrick, R A

    2005-01-01

    An inverse problem motivated by the nondestructive testing of adhesively bonded structures used in the aircraft industry is studied. Using transmission line theory, a model is developed which, when supplied with electrical and geometrical parameters, accurately predicts the reflection coefficient associated with such structures. Particular attention is paid to modelling the connection between the structures and the equipment used to measure the reflection coefficient. The inverse problem is then studied and an optimization approach employed to recover these electrical and geometrical parameters from experimentally obtained data. In particular the approach focuses on the recovery of spatially varying geometrical parameters as this is paramount to the successful reconstruction of electrical parameters. Reconstructions of structure geometry using this method are found to be in close agreement with experimental observations

  10. 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

  11. Numerical and experimental investigation of geometric parameters in projection welding

    DEFF Research Database (Denmark)

    Kristensen, Lars; Zhang, Wenqi; Bay, Niels

    2000-01-01

    parameters by numerical modeling and experimental studies. SORPAS, an FEM program for numerical modeling of resistance welding, is developed as a tool to help in the phase of product design and process optimization in both spot and projection welding. A systematic experimental investigation of projection...... on the numerical and experimental investigations of the geometric parameters in projection welding, guidelines for selection of the geometry and material combinations in product design are proposed. These will be useful and applicable to industry.......Resistance projection welding is widely used for joining of workpieces with almost any geometric combination. This makes standardization of projection welding impossible. In order to facilitate industrial applications of projection welding, systematic investigations are carried out on the geometric...

  12. 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.

  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. 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)

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

    International Nuclear Information System (INIS)

    Dubinin, Vladimir N

    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.

  16. 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…

  17. Geometric constraint subsets and subgraphs in the analysis of assemblies and mechanisms Geometric constraint subsets and subgraphs in the analysis of assemblies and mechanisms

    Directory of Open Access Journals (Sweden)

    Oscar E Ruiz

    2006-06-01

    Full Text Available Geometric Reasoning ability is central to many applications in CAD/CAM/CAPP environments. An increasing demand exists for Geometric Reasoning systems which evaluate the feasibility of virtual scenes specified by geometric relations. Thus, the Geometric Constraint Satisfaction or Scene Feasibility (GCS/SF problem consists of a basic scenario containing geometric entities, whose context is used to propose constraining relations among still undefined entities. If the constraint specification is consistent, the answer of the problem is one of finitely or infinitely many solution scenarios satisfying the prescribed constraints. Otherwise, a diagnostic of inconsistency is expected. The three main approaches used for this problem are numerical, procedural or operational and mathematical. Numerical and procedural approaches answer only part of the problem, and are not complete in the sense that a failure to provide an answer does not preclude the existence of one. The mathematical approach previously presented by the authors describes the problem using a set of polynomial equations. The common roots to this set of polynomials characterizes the solution space for such a problem. That work presents the use of Groebner basis techniques for verifying the consistency of the constraints. It also integrates subgroups of the Special Euclidean Group of Displacements SE(3 in the problem formulation to exploit the structure implied by geometric relations. Although theoretically sound, these techniques require large amounts of computing resources. This work proposes Divide-and-Conquer techniques applied to local GCS/SF subproblems to identify strongly constrained clusters of geometric entities. The identification and preprocessing of these clusters generally reduces the effort required in solving the overall problem. Cluster identification can be related to identifying short cycles in the Spatial Constraint graph for the GCS/SF problem. Their preprocessing

  18. 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…

  19. The Riemannian geometry is not sufficient for the geometrization of the Maxwell's equations

    Science.gov (United States)

    Kulyabov, Dmitry S.; Korolkova, Anna V.; Velieva, Tatyana R.

    2018-04-01

    The transformation optics uses geometrized Maxwell's constitutive equations to solve the inverse problem of optics, namely to solve the problem of finding the parameters of the medium along the paths of propagation of the electromagnetic field. For the geometrization of Maxwell's constitutive equations, the quadratic Riemannian geometry is usually used. This is due to the use of the approaches of the general relativity. However, there arises the question of the insufficiency of the Riemannian structure for describing the constitutive tensor of the Maxwell's equations. The authors analyze the structure of the constitutive tensor and correlate it with the structure of the metric tensor of Riemannian geometry. It is concluded that the use of the quadratic metric for the geometrization of Maxwell's equations is insufficient, since the number of components of the metric tensor is less than the number of components of the constitutive tensor. A possible solution to this problem may be a transition to Finslerian geometry, in particular, the use of the Berwald-Moor metric to establish the structural correspondence between the field tensors of the electromagnetic field.

  20. Geometric algebra with applications in science and engineering

    CERN Document Server

    Sobczyk, Garret

    2001-01-01

    The goal of this book is to present a unified mathematical treatment of diverse problems in mathematics, physics, computer science, and engineer­ ing using geometric algebra. Geometric algebra was invented by William Kingdon Clifford in 1878 as a unification and generalization of the works of Grassmann and Hamilton, which came more than a quarter of a century before. Whereas the algebras of Clifford and Grassmann are well known in advanced mathematics and physics, they have never made an impact in elementary textbooks where the vector algebra of Gibbs-Heaviside still predominates. The approach to Clifford algebra adopted in most of the ar­ ticles here was pioneered in the 1960s by David Hestenes. Later, together with Garret Sobczyk, he developed it into a unified language for math­ ematics and physics. Sobczyk first learned about the power of geometric algebra in classes in electrodynamics and relativity taught by Hestenes at Arizona State University from 1966 to 1967. He still vividly remembers a feeling ...

  1. 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.

  2. 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 ...

  3. 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.

  4. The Data Transfer Kit: A geometric rendezvous-based tool for multiphysics data transfer

    International Nuclear Information System (INIS)

    Slattery, S. R.; Wilson, P. P. H.; Pawlowski, R. P.

    2013-01-01

    The Data Transfer Kit (DTK) is a software library designed to provide parallel data transfer services for arbitrary physics components based on the concept of geometric rendezvous. The rendezvous algorithm provides a means to geometrically correlate two geometric domains that may be arbitrarily decomposed in a parallel simulation. By repartitioning both domains such that they have the same geometric domain on each parallel process, efficient and load balanced search operations and data transfer can be performed at a desirable algorithmic time complexity with low communication overhead relative to other types of mapping algorithms. With the increased development efforts in multiphysics simulation and other multiple mesh and geometry problems, generating parallel topology maps for transferring fields and other data between geometric domains is a common operation. The algorithms used to generate parallel topology maps based on the concept of geometric rendezvous as implemented in DTK are described with an example using a conjugate heat transfer calculation and thermal coupling with a neutronics code. In addition, we provide the results of initial scaling studies performed on the Jaguar Cray XK6 system at Oak Ridge National Laboratory for a worse-case-scenario problem in terms of algorithmic complexity that shows good scaling on 0(1 x 104) cores for topology map generation and excellent scaling on 0(1 x 105) cores for the data transfer operation with meshes of O(1 x 109) elements. (authors)

  5. The Data Transfer Kit: A geometric rendezvous-based tool for multiphysics data transfer

    Energy Technology Data Exchange (ETDEWEB)

    Slattery, S. R.; Wilson, P. P. H. [Department of Engineering Physics, University of Wisconsin - Madison, 1500 Engineering Dr., Madison, WI 53706 (United States); Pawlowski, R. P. [Sandia National Laboratories, P.O. Box 5800, Albuquerque, NM 87185 (United States)

    2013-07-01

    The Data Transfer Kit (DTK) is a software library designed to provide parallel data transfer services for arbitrary physics components based on the concept of geometric rendezvous. The rendezvous algorithm provides a means to geometrically correlate two geometric domains that may be arbitrarily decomposed in a parallel simulation. By repartitioning both domains such that they have the same geometric domain on each parallel process, efficient and load balanced search operations and data transfer can be performed at a desirable algorithmic time complexity with low communication overhead relative to other types of mapping algorithms. With the increased development efforts in multiphysics simulation and other multiple mesh and geometry problems, generating parallel topology maps for transferring fields and other data between geometric domains is a common operation. The algorithms used to generate parallel topology maps based on the concept of geometric rendezvous as implemented in DTK are described with an example using a conjugate heat transfer calculation and thermal coupling with a neutronics code. In addition, we provide the results of initial scaling studies performed on the Jaguar Cray XK6 system at Oak Ridge National Laboratory for a worse-case-scenario problem in terms of algorithmic complexity that shows good scaling on 0(1 x 104) cores for topology map generation and excellent scaling on 0(1 x 105) cores for the data transfer operation with meshes of O(1 x 109) elements. (authors)

  6. 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...

  7. Discrete-Time Pricing and Optimal Exercise of American Perpetual Warrants in the Geometric Random Walk Model

    International Nuclear Information System (INIS)

    Vanderbei, Robert J.; Pınar, Mustafa Ç.; Bozkaya, Efe B.

    2013-01-01

    An American option (or, warrant) is the right, but not the obligation, to purchase or sell an underlying equity at any time up to a predetermined expiration date for a predetermined amount. A perpetual American option differs from a plain American option in that it does not expire. In this study, we solve the optimal stopping problem of a perpetual American option (both call and put) in discrete time using linear programming duality. Under the assumption that the underlying stock price follows a discrete time and discrete state Markov process, namely a geometric random walk, we formulate the pricing problem as an infinite dimensional linear programming (LP) problem using the excessive-majorant property of the value function. This formulation allows us to solve complementary slackness conditions in closed-form, revealing an optimal stopping strategy which highlights the set of stock-prices where the option should be exercised. The analysis for the call option reveals that such a critical value exists only in some cases, depending on a combination of state-transition probabilities and the economic discount factor (i.e., the prevailing interest rate) whereas it ceases to be an issue for the put.

  8. Discrete-Time Pricing and Optimal Exercise of American Perpetual Warrants in the Geometric Random Walk Model

    Energy Technology Data Exchange (ETDEWEB)

    Vanderbei, Robert J., E-mail: rvdb@princeton.edu [Princeton University, Department of Operations Research and Financial Engineering (United States); P Latin-Small-Letter-Dotless-I nar, Mustafa C., E-mail: mustafap@bilkent.edu.tr [Bilkent University, Department of Industrial Engineering (Turkey); Bozkaya, Efe B. [Sabanc Latin-Small-Letter-Dotless-I University, Faculty of Administrative Sciences (Turkey)

    2013-02-15

    An American option (or, warrant) is the right, but not the obligation, to purchase or sell an underlying equity at any time up to a predetermined expiration date for a predetermined amount. A perpetual American option differs from a plain American option in that it does not expire. In this study, we solve the optimal stopping problem of a perpetual American option (both call and put) in discrete time using linear programming duality. Under the assumption that the underlying stock price follows a discrete time and discrete state Markov process, namely a geometric random walk, we formulate the pricing problem as an infinite dimensional linear programming (LP) problem using the excessive-majorant property of the value function. This formulation allows us to solve complementary slackness conditions in closed-form, revealing an optimal stopping strategy which highlights the set of stock-prices where the option should be exercised. The analysis for the call option reveals that such a critical value exists only in some cases, depending on a combination of state-transition probabilities and the economic discount factor (i.e., the prevailing interest rate) whereas it ceases to be an issue for the put.

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

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

  13. 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.

  14. 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.

  15. 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.

  16. 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…

  17. 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...

  18. Determination of Nonlinear Stiffness Coefficients for Finite Element Models with Application to the Random Vibration Problem

    Science.gov (United States)

    Muravyov, Alexander A.

    1999-01-01

    In this paper, a method for obtaining nonlinear stiffness coefficients in modal coordinates for geometrically nonlinear finite-element models is developed. The method requires application of a finite-element program with a geometrically non- linear static capability. The MSC/NASTRAN code is employed for this purpose. The equations of motion of a MDOF system are formulated in modal coordinates. A set of linear eigenvectors is used to approximate the solution of the nonlinear problem. The random vibration problem of the MDOF nonlinear system is then considered. The solutions obtained by application of two different versions of a stochastic linearization technique are compared with linear and exact (analytical) solutions in terms of root-mean-square (RMS) displacements and strains for a beam structure.

  19. 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.

  20. 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.

  1. 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)

  2. 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.

  3. 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.

  4. 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.

  5. 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...

  6. Snap-Through Buckling Problem of Spherical Shell Structure

    Directory of Open Access Journals (Sweden)

    Sumirin Sumirin

    2014-12-01

    Full Text Available This paper presents results of a numerical study on the nonlinear behavior of shells undergoing snap-through instability. This research investigates the problem of snap-through buckling of spherical shells applying nonlinear finite element analysis utilizing ANSYS Program. The shell structure was modeled by axisymmetric thin shell of finite elements. Shells undergoing snap-through buckling meet with significant geometric change of their physical configuration, i.e. enduring large deflections during their deformation process. Therefore snap-through buckling of shells basically is a nonlinear problem. Nonlinear numerical operations need to be applied in their analysis. The problem was solved by a scheme of incremental iterative procedures applying Newton-Raphson method in combination with the known line search as well as the arc- length methods. The effects of thickness and depth variation of the shell is taken care of by considering their geometrical parameter l. The results of this study reveal that spherical shell structures subjected to pressure loading experience snap-through instability for values of l≥2.15. A form of ‘turn-back’ of the load-displacement curve took place at load levels prior to the achievement of the critical point. This phenomenon was observed for values of l=5.0 to l=7.0.

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

  8. General structure of the GRAND program for analysis of the data from a neutrino detector

    International Nuclear Information System (INIS)

    Zhigunov, V.P.; Kulikov, V.A.; Mukhin, S.A.; Naumov, V.L.; Platonov, V.G.; Spiridonov, A.A.

    1985-01-01

    The general structure of the GRAND (Global Result Analysis for Neutrino Detector) program used for geometrical and kinematic reconstruction of events recorded by a neutrino detector is considered. The detector consists of a calorimeter-target, a shower electron and γ detector and a magnetic spectrometer. While developing the GRAND program the multivariance (different types of the computers used), availability of various algorithms for solving the same problem, solution of separate particlular problems within the frames of one program are taken into account. The KERNLIB library and the HBOOK, ZBOOK, EPIO and FFREAD subroutine packages are used while creating the program as basic libraries

  9. 4th Italian-Japanese workshop on Geometric Properties for Parabolic and Elliptic PDE’s

    CERN Document Server

    Ishige, Kazuhiro; Nitsch, Carlo; Salani, Paolo

    2016-01-01

    This book collects recent research papers by respected specialists in the field. It presents advances in the field of geometric properties for parabolic and elliptic partial differential equations, an area that has always attracted great attention. It settles the basic issues (existence, uniqueness, stability and regularity of solutions of initial/boundary value problems) before focusing on the topological and/or geometric aspects. These topics interact with many other areas of research and rely on a wide range of mathematical tools and techniques, both analytic and geometric. The Italian and Japanese mathematical schools have a long history of research on PDEs and have numerous active groups collaborating in the study of the geometric properties of their solutions. .

  10. 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.

  11. 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...

  12. An efficient formulation for linear and geometric non-linear membrane elements

    Directory of Open Access Journals (Sweden)

    Mohammad Rezaiee-Pajand

    Full Text Available Utilizing the straingradient notation process and the free formulation, an efficient way of constructing membrane elements will be proposed. This strategy can be utilized for linear and geometric non-linear problems. In the suggested formulation, the optimization constraints of insensitivity to distortion, rotational invariance and not having parasitic shear error are employed. In addition, the equilibrium equations will be established based on some constraints among the strain states. The authors' technique can easily separate the rigid body motions, and those belong to deformational motions. In this article, a novel triangular element, named SST10, is formulated. This element will be used in several plane problems having irregular mesh and complicated geometry with linear and geometrically nonlinear behavior. The numerical outcomes clearly demonstrate the efficiency of the new formulation.

  13. 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, ...

  14. 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...

  15. 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.

  16. 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.

  17. 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...

  18. 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.

  19. 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...

  20. The effect of photometric and geometric context on photometric and geometric lightness effects.

    Science.gov (United States)

    Lee, Thomas Y; Brainard, David H

    2014-01-24

    We measured the lightness of probe tabs embedded at different orientations in various contextual images presented on a computer-controlled stereo display. Two background context planes met along a horizontal roof-like ridge. Each plane was a graphic rendering of a set of achromatic surfaces with the simulated illumination for each plane controlled independently. Photometric context was varied by changing the difference in simulated illumination intensity between the two background planes. Geometric context was varied by changing the angle between them. We parsed the data into separate photometric effects and geometric effects. For fixed geometry, varying photometric context led to linear changes in both the photometric and geometric effects. Varying geometric context did not produce a statistically reliable change in either the photometric or geometric effects.

  1. 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)

  2. Geometric phase for N-level systems through unitary integration

    International Nuclear Information System (INIS)

    Uskov, D. B.; Rau, A. R. P.

    2006-01-01

    Geometric phases are important in quantum physics and are now central to fault-tolerant quantum computation. For spin 1/2, the Bloch sphere S 2 , together with a U(1) phase, provides a complete SU(2) description. We generalize to N-level systems and SU(N) in terms of a 2(N-1)-dimensional base space and reduction to a (N-1)-level problem, paralleling closely the two-dimensional case. This iteratively solves the time evolution of an N-level system and gives (N-1) geometric phases explicitly. A complete analytical construction of an S 4 Bloch-like sphere for two qubits is given for the Spin(5) or SO(5) subgroup of SU(4)

  3. Study on Multi-Depot Collaborative Transportation Problem of Milk-Run Pattern

    Directory of Open Access Journals (Sweden)

    Lou Zhenkai

    2016-01-01

    Full Text Available Analyze the relevance between Milk Run mode and collaborative transportation problem, put forward collaborative transportation problem of multiple-depot on Milk Run mode under the supply and demand separate nodes, consider the value of transport and transport costs, introduce the concept of node - arc flow, by comparing the size of traffic flow determine nodes collection, and then constructed multi-transport model of the problem. Considering one-way pickup and delivery closed, construct two-stage algorithm model, use dynamic programming recursive solution to determine the best route to pick up, and then solving delivery routing problem with different start and return point based on geometric method of Cosine. Finally use a numerical example illustrates the effectiveness of the algorithm and reasonable model.

  4. 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.

  5. Hybrid Geometric Calibration Method for Multi-Platform Spaceborne SAR Image with Sparse Gcps

    Science.gov (United States)

    Lv, G.; Tang, X.; Ai, B.; Li, T.; Chen, Q.

    2018-04-01

    Geometric calibration is able to provide high-accuracy geometric coordinates of spaceborne SAR image through accurate geometric parameters in the Range-Doppler model by ground control points (GCPs). However, it is very difficult to obtain GCPs that covering large-scale areas, especially in the mountainous regions. In addition, the traditional calibration method is only used for single platform SAR images and can't support the hybrid geometric calibration for multi-platform images. To solve the above problems, a hybrid geometric calibration method for multi-platform spaceborne SAR images with sparse GCPs is proposed in this paper. First, we calibrate the master image that contains GCPs. Secondly, the point tracking algorithm is used to obtain the tie points (TPs) between the master and slave images. Finally, we calibrate the slave images using TPs as the GCPs. We take the Beijing-Tianjin- Hebei region as an example to study SAR image hybrid geometric calibration method using 3 TerraSAR-X images, 3 TanDEM-X images and 5 GF-3 images covering more than 235 kilometers in the north-south direction. Geometric calibration of all images is completed using only 5 GCPs. The GPS data extracted from GNSS receiver are used to assess the plane accuracy after calibration. The results after geometric calibration with sparse GCPs show that the geometric positioning accuracy is 3 m for TSX/TDX images and 7.5 m for GF-3 images.

  6. 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.

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

  8. 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. 

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

  11. CIME course on Ricci Flow and Geometric Applications

    CERN Document Server

    Mantegazza, Carlo

    2016-01-01

    Presenting some impressive recent achievements in differential geometry and topology, this volume focuses on results obtained using techniques based on Ricci flow. These ideas are at the core of the study of differentiable manifolds. Several very important open problems and conjectures come from this area and the techniques described herein are used to face and solve some of them. The book's four chapters are based on lectures given by leading researchers in the field of geometric analysis and low-dimensional geometry/topology, respectively offering an introduction to: the differentiable sphere theorem (G. Besson), the geometrization of 3-manifolds (M. Boileau), the singularities of 3-dimensional Ricci flows (C. Sinestrari), and Kahler-Ricci flow (G. Tian). The lectures will be particularly valuable to young researchers interested in differential manifolds.

  12. 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.

  13. Geometric model of pseudo-distance measurement in satellite location systems

    Science.gov (United States)

    Panchuk, K. L.; Lyashkov, A. A.; Lyubchinov, E. V.

    2018-04-01

    The existing mathematical model of pseudo-distance measurement in satellite location systems does not provide a precise solution of the problem, but rather an approximate one. The existence of such inaccuracy, as well as bias in measurement of distance from satellite to receiver, results in inaccuracy level of several meters. Thereupon, relevance of refinement of the current mathematical model becomes obvious. The solution of the system of quadratic equations used in the current mathematical model is based on linearization. The objective of the paper is refinement of current mathematical model and derivation of analytical solution of the system of equations on its basis. In order to attain the objective, geometric analysis is performed; geometric interpretation of the equations is given. As a result, an equivalent system of equations, which allows analytical solution, is derived. An example of analytical solution implementation is presented. Application of analytical solution algorithm to the problem of pseudo-distance measurement in satellite location systems allows to improve the accuracy such measurements.

  14. Solution of Inverse Kinematics for 6R Robot Manipulators With Offset Wrist Based on Geometric Algebra.

    Science.gov (United States)

    Fu, Zhongtao; Yang, Wenyu; Yang, Zhen

    2013-08-01

    In this paper, we present an efficient method based on geometric algebra for computing the solutions to the inverse kinematics problem (IKP) of the 6R robot manipulators with offset wrist. Due to the fact that there exist some difficulties to solve the inverse kinematics problem when the kinematics equations are complex, highly nonlinear, coupled and multiple solutions in terms of these robot manipulators stated mathematically, we apply the theory of Geometric Algebra to the kinematic modeling of 6R robot manipulators simply and generate closed-form kinematics equations, reformulate the problem as a generalized eigenvalue problem with symbolic elimination technique, and then yield 16 solutions. Finally, a spray painting robot, which conforms to the type of robot manipulators, is used as an example of implementation for the effectiveness and real-time of this method. The experimental results show that this method has a large advantage over the classical methods on geometric intuition, computation and real-time, and can be directly extended to all serial robot manipulators and completely automatized, which provides a new tool on the analysis and application of general robot manipulators.

  15. Problems for the seminar, ICTP, 2007-2008

    International Nuclear Information System (INIS)

    Arnold, V.

    2008-01-01

    The following problems for the ICPT seminar 2007-2008 are specified: topological classification of polynomials; equipartition of indivisible integer vectors; geometrical progressions? fractional parts? equipartitions; statistics of continued fractions of eigenvalues of matrices; growth rate of elements of periodic continued fractions; periods of geometrical progressions of residues; Kolmogorov?s distributions; stochasticity degree of arithmetical progressions of fractional parts; is a generic geometrical progression of fractional parts random?; prime numbers distribution?s randomness; algorithmic unsolvability of problems of higher dimensional continued fractions; periods of continued fractions of roots of quadratic equations; statistics of lengths of periods of continued fractions of quadratic irrational numbers; random matrices? characteristic polynomials distributions

  16. A Drawing and Multi-Representational Computer Environment for Beginners' Learning of Programming Using C: Design and Pilot Formative Evaluation

    Science.gov (United States)

    Kordaki, Maria

    2010-01-01

    This paper presents both the design and the pilot formative evaluation study of a computer-based problem-solving environment (named LECGO: Learning Environment for programming using C using Geometrical Objects) for the learning of computer programming using C by beginners. In its design, constructivist and social learning theories were taken into…

  17. 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

  18. Optimal design of geometrically nonlinear shells of revolution with using the mixed finite element method

    Science.gov (United States)

    Stupishin, L. U.; Nikitin, K. E.; Kolesnikov, A. G.

    2018-02-01

    The article is concerned with a methodology of optimal design of geometrically nonlinear (flexible) shells of revolution of minimum weight with strength, stability and strain constraints. The problem of optimal design with constraints is reduced to the problem of unconstrained minimization using the penalty functions method. Stress-strain state of shell is determined within the geometrically nonlinear deformation theory. A special feature of the methodology is the use of a mixed finite-element formulation based on the Galerkin method. Test problems for determining the optimal form and thickness distribution of a shell of minimum weight are considered. The validity of the results obtained using the developed methodology is analyzed, and the efficiency of various optimization algorithms is compared to solve the set problem. The developed methodology has demonstrated the possibility and accuracy of finding the optimal solution.

  19. 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.

  20. Concurrent Engineering in Aerospace Industry: How To Achieve Radiofrequency Geometric Specifications in Satellite Antennae

    Directory of Open Access Journals (Sweden)

    J. Vargas

    2000-01-01

    Full Text Available One of the problems that a satellite manufacturing involves is to obtain the geometrical forms and the accurate positions for the different radiofrequency components (reflectors, subreflectors and feeders. CFRP (Carbon Fibber Reinforced Plastics sandwich structures never are obtained as designed due to the deformations associated to the manufacturing process. So, reflectors, subreflectors and structural components (towers, panels... have to be measured in order to include their deviations in the design of the regulation parts. High performance equipment (Co-ordinate Measurement Machines, CAD/CAM Systems and 5 Axis Machine Tool is used, but it is also necessary to make an integrated and multidisciplinary team. This paper describes how this process was implemented in CASA Space Division during HISPASAT 1C satellite manufacturing program.

  1. Plateau's problem an invitation to varifold geometry

    CERN Document Server

    Frederick J Almgren, Jr

    2001-01-01

    There have been many wonderful developments in the theory of minimal surfaces and geometric measure theory in the past 25 to 30 years. Many of the researchers who have produced these excellent results were inspired by this little book--or by Fred Almgren himself. The book is indeed a delightful invitation to the world of variational geometry. A central topic is Plateau's Problem, which is concerned with surfaces that model the behavior of soap films. When trying to resolve the problem, however, one soon finds that smooth surfaces are insufficient: Varifolds are needed. With varifolds, one can obtain geometrically meaningful solutions without having to know in advance all their possible singularities. This new tool makes possible much exciting new analysis and many new results. Plateau's problem and varifolds live in the world of geometric measure theory, where differential geometry and measure theory combine to solve problems which have variational aspects. The author's hope in writing this book was to encour...

  2. 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...

  3. Geometric Aspects of Force Controllability for a Swimming Model

    International Nuclear Information System (INIS)

    Khapalov, A. Y.

    2008-01-01

    We study controllability properties (swimming capabilities) of a mathematical model of an abstract object which 'swims' in the 2-D Stokes fluid. Our goal is to investigate how the geometric shape of this object affects the forces acting upon it. Such problems are of interest in biology and engineering applications dealing with propulsion systems in fluids

  4. 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.

  5. 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.

  6. FED, Geometry Input Generator for Program TRUMP

    International Nuclear Information System (INIS)

    Schauer, D.A.; Elrod, D.C.

    1996-01-01

    1 - Description of program or function: FED reduces the effort required to obtain the necessary geometric input for problems which are to be solved using the heat-transfer code, TRUMP (NESC 771). TRUMP calculates transient and steady-state temperature distributions in multidimensional systems. FED can properly zone any body of revolution in one, or three dimensions. 2 - Method of solution: The region of interest must first be divided into areas which may consist of a common material. The boundaries of these areas are the required FED input. Each area is subdivided into volume nodes, and the geometrical properties are calculated. Finally, FED connects the adjacent nodes to one another, using the proper surface area, interface distance, and, if specified, radiation form factor and interface conductance. 3 - Restrictions on the complexity of the problem: Rectangular bodies can only be approximated by using a very large radius of revolution compared to the total radial thickness and by considering only a small angular segment in the circumferential direction

  7. Geometrical determination of the constant of motion in General Relativity

    International Nuclear Information System (INIS)

    Catoni, F.; Cannata, R.; Zampetti, P.

    2009-01-01

    In recent time a theorem, due to E. Beltrami, through which the integration of the geodesic equations of a curved manifold is obtained by means of a merely geometric method, has been revisited. This way of dealing with the problem is well in accordance with the geometric spirit of the Theory of General Relativity. In this paper we show another relevant consequence of this method. Actually, the constants of the motion, introduced in this geometrical way that is completely independent of Newton theory, are related to the conservation laws for test particles in the Einstein theory. These conservation laws may be compared with the conservation laws of Newton. In particular, by the conservation of energy (E) and the L z component of angular momentum, the equivalence of the conservation laws for the Schwarzschild field is verified and the difference between Newton and Einstein theories for the rotating bodies (Kerr metric) is obtained in a straightforward way.

  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. GENERATION OF GEOMETRIC ORNAMENTS IN ANCIENT MOSAIC ART

    Directory of Open Access Journals (Sweden)

    SASS Ludmila

    2015-06-01

    Full Text Available The paper examines geometrical ornaments from ancient mosaic.We studied the geometric generation by using Computer Aided Graphics for three examples of ancient mosaic: a mosaic of Ancient Corinth, a mosaic of the sacred geometry Flower of Life (exposed in the National Museum of Israel and a mosaic of fortress Masada - Israel. The technique of drawing ancient mosaic is recomposed using computer aided graphics. A program has been developed that can help draw a petal-type arc (semicircle of the mosaic that is the Byzantine church of Masada. Based on these mosaics, other variants of aesthetic images in monochrome or black and white and polychrome were drawn, all of which can be materialized in decorative art to embellish various surfaces: walls, floors, pools, fountains, etc.

  10. Dual geometric-gauge field aspects of gravity

    International Nuclear Information System (INIS)

    Huei Peng; Wang, K.

    1992-01-01

    We propose that the geometric and standard gauge field aspects of gravity are equally essential for a complete description of gravity and can be reconciled. We show that this dualism of gravity resolves the dimensional Newtonian constant problem in both quantum gravity and unification schemes involving gravity (i.e., the Newtonian constant is no longer the coupling constant in the gauge aspect of gravity) and reveals the profound similarity between gravity and other fields. 23 refs., 3 tabs

  11. Improved Object Proposals with Geometrical Features for Autonomous Driving

    Directory of Open Access Journals (Sweden)

    Yiliu Feng

    2017-01-01

    Full Text Available This paper aims at generating high-quality object proposals for object detection in autonomous driving. Most existing proposal generation methods are designed for the general object detection, which may not perform well in a particular scene. We propose several geometrical features suited for autonomous driving and integrate them into state-of-the-art general proposal generation methods. In particular, we formulate the integration as a feature fusion problem by fusing the geometrical features with existing proposal generation methods in a Bayesian framework. Experiments on the challenging KITTI benchmark demonstrate that our approach improves the existing methods significantly. Combined with a convolutional neural net detector, our approach achieves state-of-the-art performance on all three KITTI object classes.

  12. 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.

  13. Geometrical optics analysis of the structural imperfection of retroreflection corner cubes with a nonlinear conjugate gradient method.

    Science.gov (United States)

    Kim, Hwi; Min, Sung-Wook; Lee, Byoungho

    2008-12-01

    Geometrical optics analysis of the structural imperfection of retroreflection corner cubes is described. In the analysis, a geometrical optics model of six-beam reflection patterns generated by an imperfect retroreflection corner cube is developed, and its structural error extraction is formulated as a nonlinear optimization problem. The nonlinear conjugate gradient method is employed for solving the nonlinear optimization problem, and its detailed implementation is described. The proposed method of analysis is a mathematical basis for the nondestructive optical inspection of imperfectly fabricated retroreflection corner cubes.

  14. 3D geometric modeling and simulation of laser propagation through turbulence with plenoptic functions

    Science.gov (United States)

    Wu, Chensheng; Nelson, William; Davis, Christopher C.

    2014-10-01

    Plenoptic functions are functions that preserve all the necessary light field information of optical events. Theoretical work has demonstrated that geometric based plenoptic functions can serve equally well in the traditional wave propagation equation known as the "scalar stochastic Helmholtz equation". However, in addressing problems of 3D turbulence simulation, the dominant methods using phase screen models have limitations both in explaining the choice of parameters (on the transverse plane) in real-world measurements, and finding proper correlations between neighboring phase screens (the Markov assumption breaks down). Though possible corrections to phase screen models are still promising, the equivalent geometric approach based on plenoptic functions begins to show some advantages. In fact, in these geometric approaches, a continuous wave problem is reduced to discrete trajectories of rays. This allows for convenience in parallel computing and guarantees conservation of energy. Besides the pairwise independence of simulated rays, the assigned refractive index grids can be directly tested by temperature measurements with tiny thermoprobes combined with other parameters such as humidity level and wind speed. Furthermore, without loss of generality one can break the causal chain in phase screen models by defining regional refractive centers to allow rays that are less affected to propagate through directly. As a result, our work shows that the 3D geometric approach serves as an efficient and accurate method in assessing relevant turbulence problems with inputs of several environmental measurements and reasonable guesses (such as Cn 2 levels). This approach will facilitate analysis and possible corrections in lateral wave propagation problems, such as image de-blurring, prediction of laser propagation over long ranges, and improvement of free space optic communication systems. In this paper, the plenoptic function model and relevant parallel algorithm computing

  15. Geometric Algorithms for Private-Cache Chip Multiprocessors

    DEFF Research Database (Denmark)

    Ajwani, Deepak; Sitchinava, Nodari; Zeh, Norbert

    2010-01-01

    -D convex hulls. These results are obtained by analyzing adaptations of either the PEM merge sort algorithm or PRAM algorithms. For the second group of problems—orthogonal line segment intersection reporting, batched range reporting, and related problems—more effort is required. What distinguishes......We study techniques for obtaining efficient algorithms for geometric problems on private-cache chip multiprocessors. We show how to obtain optimal algorithms for interval stabbing counting, 1-D range counting, weighted 2-D dominance counting, and for computing 3-D maxima, 2-D lower envelopes, and 2...... these problems from the ones in the previous group is the variable output size, which requires I/O-efficient load balancing strategies based on the contribution of the individual input elements to the output size. To obtain nearly optimal algorithms for these problems, we introduce a parallel distribution...

  16. Geometric and Algebraic Approaches in the Concept of Complex Numbers

    Science.gov (United States)

    Panaoura, A.; Elia, I.; Gagatsis, A.; Giatilis, G.-P.

    2006-01-01

    This study explores pupils' performance and processes in tasks involving equations and inequalities of complex numbers requiring conversions from a geometric representation to an algebraic representation and conversions in the reverse direction, and also in complex numbers problem solving. Data were collected from 95 pupils of the final grade from…

  17. Image-Based Geometric Modeling and Mesh Generation

    CERN Document Server

    2013-01-01

    As a new interdisciplinary research area, “image-based geometric modeling and mesh generation” integrates image processing, geometric modeling and mesh generation with finite element method (FEM) to solve problems in computational biomedicine, materials sciences and engineering. It is well known that FEM is currently well-developed and efficient, but mesh generation for complex geometries (e.g., the human body) still takes about 80% of the total analysis time and is the major obstacle to reduce the total computation time. It is mainly because none of the traditional approaches is sufficient to effectively construct finite element meshes for arbitrarily complicated domains, and generally a great deal of manual interaction is involved in mesh generation. This contributed volume, the first for such an interdisciplinary topic, collects the latest research by experts in this area. These papers cover a broad range of topics, including medical imaging, image alignment and segmentation, image-to-mesh conversion,...

  18. 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.

  19. 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.

  20. Investigation of the Influence of Hydrocyclone Geometric and Flow Parameters on Its Performance Using CFD

    Directory of Open Access Journals (Sweden)

    Oboetswe Seraga Motsamai

    2010-01-01

    Full Text Available Effectiveness and efficiency of hydro-cyclone separators are highly dependent on their geometrical parameters and flow characteristics. Performance of the hydro-cyclone can, therefore, be improved by modifying the geometrical parameters or flow characteristics. The mining and chemical industries are faced with problems of separating ore-rich stones from the nonore-rich stones. Due to this problem a certain amount of precious metals is lost to the dumping sites. Plant managers try to solve these problems by stockpiling what could be useless stones, so that they can be reprocessed in the future. Reprocessing is not a sustainable approach, because the reprocessed material would give lower yield as compared to the production costs. Particulate separation in a hydro-cyclone has been investigated in this paper, by using computational fluid dynamics. The paper investigated the influence of various flow and geometric parameters on particulate separation. Optimal parameters for efficient separation have been determined for the density of fluid, diameter of the spigot, and diameter of the vortex finder. The principal contribution of this paper is that key parameters for design optimization of the hydro-cyclone have been investigated.

  1. 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.

  2. 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.

  3. 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…

  4. 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)

  5. 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.

  6. 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.

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

  8. Software module for geometric product modeling and NC tool path generation

    International Nuclear Information System (INIS)

    Sidorenko, Sofija; Dukovski, Vladimir

    2003-01-01

    The intelligent CAD/CAM system named VIRTUAL MANUFACTURE is created. It is consisted of four intelligent software modules: the module for virtual NC machine creation, the module for geometric product modeling and automatic NC path generation, the module for virtual NC machining and the module for virtual product evaluation. In this paper the second intelligent software module is presented. This module enables feature-based product modeling carried out via automatic saving of the designed product geometric features as knowledge data. The knowledge data are afterwards applied for automatic NC program generation for the designed product NC machining. (Author)

  9. 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.

  10. 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,

  11. 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.

  12. 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.

  13. 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.

  14. Geometric k-nearest neighbor estimation of entropy and mutual information

    Science.gov (United States)

    Lord, Warren M.; Sun, Jie; Bollt, Erik M.

    2018-03-01

    Nonparametric estimation of mutual information is used in a wide range of scientific problems to quantify dependence between variables. The k-nearest neighbor (knn) methods are consistent, and therefore expected to work well for a large sample size. These methods use geometrically regular local volume elements. This practice allows maximum localization of the volume elements, but can also induce a bias due to a poor description of the local geometry of the underlying probability measure. We introduce a new class of knn estimators that we call geometric knn estimators (g-knn), which use more complex local volume elements to better model the local geometry of the probability measures. As an example of this class of estimators, we develop a g-knn estimator of entropy and mutual information based on elliptical volume elements, capturing the local stretching and compression common to a wide range of dynamical system attractors. A series of numerical examples in which the thickness of the underlying distribution and the sample sizes are varied suggest that local geometry is a source of problems for knn methods such as the Kraskov-Stögbauer-Grassberger estimator when local geometric effects cannot be removed by global preprocessing of the data. The g-knn method performs well despite the manipulation of the local geometry. In addition, the examples suggest that the g-knn estimators can be of particular relevance to applications in which the system is large, but the data size is limited.

  15. WHAMSE: a program for three-dimensional nonlinear structural dynamics

    International Nuclear Information System (INIS)

    Belytschko, T.; Tsay, C.S.

    1982-02-01

    WHAMSE is a computer program for the nonlinear, transient analysis of structures. The formulation includes both geometric and material nonlinearities, so problems with large displacements and elastic-plastic behavior can be treated. Explicit time integration is used, so the program is most suitable for implusive loads. Energy balance calculations are provided to check numerical stability. The mass matrix is lumped. A finite element format is used for the description of the problem geometry, so the program is quite versatile in treating complex engineering structures. The following elements are included: a triangular element for thin plates and shells, a beam element, a spring element and a rigid body. Mesh generation features are provided to simplify program input. Other features of the program are: (1) a restart capability; (2) a variety of output options, such as printer plots or CALCOMP plots of selected time histories, picture (snapshot) output, and CALCOMP plots of the undeformed and deformed structure

  16. 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.

  17. Geometric function theory: a modern view of a classical subject

    International Nuclear Information System (INIS)

    Crowdy, Darren

    2008-01-01

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

  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. Geometrization of the Electromagnetic Field and Dark Matter

    CERN Document Server

    Pestov, I B

    2005-01-01

    A general concept of potential field is introduced. The potential field that one puts in correspondence with dark matter, has fundamental geometrical interpretation (parallel transport) and has intrinsically inherent local symmetry. The equations of dark matter field are derived that are invariant with respect to the local transformations. It is shown how to reduce these equations to the Maxwell equations. Thus, the dark matter field may be considered as generalized lectromagnetic field and a simple solution of the old problem is given to connect electromagnetic field with geometrical properties of the physical manifold itself. It is shown that gauge fixing renders generalized electromagnetic field effectively massive while the Maxwell electromagnetic field remains massless. To learn more about interactions between matter and dark matter on the microscopical level (and to recognize the fundamental role of internal symmetry) the general covariant Dirac equation is derived in the Minkowski space--time which des...

  20. Find the Dimensions: Students Solving a Tiling Problem

    Science.gov (United States)

    Obara, Samuel

    2018-01-01

    Students learn mathematics by solving problems. Mathematics textbooks are full of problems, and mathematics teachers use these problems to test students' understanding of mathematical concepts. This paper discusses how problem-solving skills can be fostered with a geometric tiling problem.

  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. What Makes a Beam Shaping Problem Difficult

    International Nuclear Information System (INIS)

    Romero, Louis; Dickey, Fred M.

    2000-01-01

    The authors have discussed the three factors that they believe are the most important in determining the difficulty of a beam shaping problem: scaling, smoothness, and coherence. The arguments have been almost completely based on considering how these factors influence beam shaping lenses that were designed using geometrical optics. However, they believe that these factors control the difficulty of beam shaping problems even if one does not base ones design strategy on geometrical optics. For example, they have shown that a lens designed using geometrical optics will not work well unless β is large. However, they have also shown that if β is small the uncertainty principle shows that it is impossible to do a good job of beam shaping no matter how one designs ones lens

  3. Approximate joint diagonalization and geometric mean of symmetric positive definite matrices.

    Science.gov (United States)

    Congedo, Marco; Afsari, Bijan; Barachant, Alexandre; Moakher, Maher

    2014-01-01

    We explore the connection between two problems that have arisen independently in the signal processing and related fields: the estimation of the geometric mean of a set of symmetric positive definite (SPD) matrices and their approximate joint diagonalization (AJD). Today there is a considerable interest in estimating the geometric mean of a SPD matrix set in the manifold of SPD matrices endowed with the Fisher information metric. The resulting mean has several important invariance properties and has proven very useful in diverse engineering applications such as biomedical and image data processing. While for two SPD matrices the mean has an algebraic closed form solution, for a set of more than two SPD matrices it can only be estimated by iterative algorithms. However, none of the existing iterative algorithms feature at the same time fast convergence, low computational complexity per iteration and guarantee of convergence. For this reason, recently other definitions of geometric mean based on symmetric divergence measures, such as the Bhattacharyya divergence, have been considered. The resulting means, although possibly useful in practice, do not satisfy all desirable invariance properties. In this paper we consider geometric means of covariance matrices estimated on high-dimensional time-series, assuming that the data is generated according to an instantaneous mixing model, which is very common in signal processing. We show that in these circumstances we can approximate the Fisher information geometric mean by employing an efficient AJD algorithm. Our approximation is in general much closer to the Fisher information geometric mean as compared to its competitors and verifies many invariance properties. Furthermore, convergence is guaranteed, the computational complexity is low and the convergence rate is quadratic. The accuracy of this new geometric mean approximation is demonstrated by means of simulations.

  4. Approximate joint diagonalization and geometric mean of symmetric positive definite matrices.

    Directory of Open Access Journals (Sweden)

    Marco Congedo

    Full Text Available We explore the connection between two problems that have arisen independently in the signal processing and related fields: the estimation of the geometric mean of a set of symmetric positive definite (SPD matrices and their approximate joint diagonalization (AJD. Today there is a considerable interest in estimating the geometric mean of a SPD matrix set in the manifold of SPD matrices endowed with the Fisher information metric. The resulting mean has several important invariance properties and has proven very useful in diverse engineering applications such as biomedical and image data processing. While for two SPD matrices the mean has an algebraic closed form solution, for a set of more than two SPD matrices it can only be estimated by iterative algorithms. However, none of the existing iterative algorithms feature at the same time fast convergence, low computational complexity per iteration and guarantee of convergence. For this reason, recently other definitions of geometric mean based on symmetric divergence measures, such as the Bhattacharyya divergence, have been considered. The resulting means, although possibly useful in practice, do not satisfy all desirable invariance properties. In this paper we consider geometric means of covariance matrices estimated on high-dimensional time-series, assuming that the data is generated according to an instantaneous mixing model, which is very common in signal processing. We show that in these circumstances we can approximate the Fisher information geometric mean by employing an efficient AJD algorithm. Our approximation is in general much closer to the Fisher information geometric mean as compared to its competitors and verifies many invariance properties. Furthermore, convergence is guaranteed, the computational complexity is low and the convergence rate is quadratic. The accuracy of this new geometric mean approximation is demonstrated by means of simulations.

  5. Tour of a Simple Trigonometry Problem

    Science.gov (United States)

    Poon, Kin-Keung

    2012-01-01

    This article focuses on a simple trigonometric problem that generates a strange phenomenon when different methods are applied to tackling it. A series of problem-solving activities are discussed, so that students can be alerted that the precision of diagrams is important when solving geometric problems. In addition, the problem-solving plan was…

  6. 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.

  7. Balanced partitions of 3-colored geometric sets in the plane

    NARCIS (Netherlands)

    Bereg, S.; Hurtado, F.; Kano, M.; Korman, M.; Lara, D.; Seara, C.; Silveira, R.I.; Urrutia, J.; Verbeek, K.A.B.

    2015-01-01

    Let SS be a finite set of geometric objects partitioned into classes or colors . A subset S'¿SS'¿S is said to be balanced if S'S' contains the same amount of elements of SS from each of the colors. We study several problems on partitioning 33-colored sets of points and lines in the plane into two

  8. 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...

  9. Inequalities an approach through problems

    CERN Document Server

    Venkatachala, B J

    2018-01-01

    This book discusses about the basic topics on inequalities and their applications. These include the arithmetic mean–geometric mean inequality, Cauchy–Schwarz inequality, Chebyshev inequality, rearrangement inequality, convex and concave functions and Muirhead's theorem. The book contains over 400 problems with their solutions. A chapter on geometric inequalities is a special feature of this book. Most of these problems are from International Mathematical Olympiads and from many national mathematical Olympiads. The book is intended to help students who are preparing for various mathematical competitions. It is also a good source book for graduate students who are consolidating their knowledge of inequalities and their applications. .

  10. Geometric Least Square Models for Deriving [0,1]-Valued Interval Weights from Interval Fuzzy Preference Relations Based on Multiplicative Transitivity

    Directory of Open Access Journals (Sweden)

    Xuan Yang

    2015-01-01

    Full Text Available This paper presents a geometric least square framework for deriving [0,1]-valued interval weights from interval fuzzy preference relations. By analyzing the relationship among [0,1]-valued interval weights, multiplicatively consistent interval judgments, and planes, a geometric least square model is developed to derive a normalized [0,1]-valued interval weight vector from an interval fuzzy preference relation. Based on the difference ratio between two interval fuzzy preference relations, a geometric average difference ratio between one interval fuzzy preference relation and the others is defined and employed to determine the relative importance weights for individual interval fuzzy preference relations. A geometric least square based approach is further put forward for solving group decision making problems. An individual decision numerical example and a group decision making problem with the selection of enterprise resource planning software products are furnished to illustrate the effectiveness and applicability of the proposed models.

  11. AutoCAD-To-NASTRAN Translator Program

    Science.gov (United States)

    Jones, A.

    1989-01-01

    Program facilitates creation of finite-element mathematical models from geometric entities. AutoCAD to NASTRAN translator (ACTON) computer program developed to facilitate quick generation of small finite-element mathematical models for use with NASTRAN finite-element modeling program. Reads geometric data of drawing from Data Exchange File (DXF) used in AutoCAD and other PC-based drafting programs. Written in Microsoft Quick-Basic (Version 2.0).

  12. A survey of open problems in symplectic integration

    Energy Technology Data Exchange (ETDEWEB)

    McLachlan, R.I. [Univ. of Colorado, Boulder, CO (United States); Scovel, C. [Los Alamos National Lab., NM (United States)

    1993-10-15

    In the past few years there has been a substantial amount of research on symplectic integration. The subject is only part of a program concerned with numerically preserving a system`s inherent geometrical structures. Volume preservation, reversibility, local conservation laws for elliptic equations, and systems with integral invariants are but a few examples of such invariant structures. In many cases one requires a numerical method to stay in the smallest possible appropriate group of phase space maps. It is not the authors` opinion that symplecticity, for example, automatically makes a numerical method superior to all others, but it is their opinion that it should be taken seriously and that a conscious, informed decision be made in that regard. The authors present here a survey of open problems in symplectic integration, including other problems from the larger program. This is not intended as a review of symplectic integration and is naturally derived from the authors` own research interests. At present, this survey is incomplete, but the authors hope the help of the colleagues to be able to include in the proceedings of this conference a more comprehensive survey. Many of the problems mentioned here call for numerical experimentation, some for application of suggested but untested methods, some for new methods, and some for theorems, Some envisage large research programs.

  13. 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…

  14. 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.

  15. 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)

  16. 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.

  17. 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.

  18. 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.

  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. Geometrization of the electromagnetic field and dark matter

    International Nuclear Information System (INIS)

    Pestov, I.B.

    2005-01-01

    A general concept of potential field is introduced. The potential field that one puts in correspondence with dark matter, has fundamental geometrical interpretation (parallel transport) and has intrinsically inherent local symmetry. The equations of dark matter field are derived that are invariant with respect to the local transformations. It is shown how to reduce these equations to the Maxwell equations. Thus, the dark matter field may be considered as generalized electromagnetic field and a simple solution of the old problem is given to connect electromagnetic field with geometrical properties of the physical manifold itself. It is shown that gauge fixing renders generalized electromagnetic field effectively massive while the Maxwell electromagnetic field remains massless. To learn more about interactions between matter and dark matter on the microscopical level (and to recognize the fundamental role of internal symmetry) the general covariant Dirac equation is derived in the Minkowski space-time which describes the interactions of spinor field with dark matter field

  1. Near-Regular Structure Discovery Using Linear Programming

    KAUST Repository

    Huang, Qixing

    2014-06-02

    Near-regular structures are common in manmade and natural objects. Algorithmic detection of such regularity greatly facilitates our understanding of shape structures, leads to compact encoding of input geometries, and enables efficient generation and manipulation of complex patterns on both acquired and synthesized objects. Such regularity manifests itself both in the repetition of certain geometric elements, as well as in the structured arrangement of the elements. We cast the regularity detection problem as an optimization and efficiently solve it using linear programming techniques. Our optimization has a discrete aspect, that is, the connectivity relationships among the elements, as well as a continuous aspect, namely the locations of the elements of interest. Both these aspects are captured by our near-regular structure extraction framework, which alternates between discrete and continuous optimizations. We demonstrate the effectiveness of our framework on a variety of problems including near-regular structure extraction, structure-preserving pattern manipulation, and markerless correspondence detection. Robustness results with respect to geometric and topological noise are presented on synthesized, real-world, and also benchmark datasets. © 2014 ACM.

  2. The geometric content of the interacting boson model for molecular spectra

    International Nuclear Information System (INIS)

    Levit, S.; Smilansky, U.

    1981-12-01

    The recently proposed algebraic model for collective spectra of diatomic molecules is analysed in terms of conventional geometrical degrees of freedom. We present a mapping of the algebraic Hamiltonian onto an exactly solvable geometrical Hamiltonian with the Morse potential. This mapping explains the success of the algebraic model in reproducing the low lying part of molecular spectra. At the same time the mapping shows that the expression for the dipole transition operator in terms of boson operators differs from the simplest IBM expression and in general must include many-body boson terms. The study also provides an insight into the problem of possible interpretations of the bosons in the nuclear IBM. (author)

  3. 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

  4. Geometric phases in discrete dynamical systems

    Energy Technology Data Exchange (ETDEWEB)

    Cartwright, Julyan H.E., E-mail: julyan.cartwright@csic.es [Instituto Andaluz de Ciencias de la Tierra, CSIC–Universidad de Granada, E-18100 Armilla, Granada (Spain); Instituto Carlos I de Física Teórica y Computacional, Universidad de Granada, E-18071 Granada (Spain); Piro, Nicolas, E-mail: nicolas.piro@epfl.ch [École Polytechnique Fédérale de Lausanne (EPFL), 1015 Lausanne (Switzerland); Piro, Oreste, E-mail: piro@imedea.uib-csic.es [Departamento de Física, Universitat de les Illes Balears, E-07122 Palma de Mallorca (Spain); Tuval, Idan, E-mail: ituval@imedea.uib-csic.es [Mediterranean Institute for Advanced Studies, CSIC–Universitat de les Illes Balears, E-07190 Mallorca (Spain)

    2016-10-14

    In order to study the behaviour of discrete dynamical systems under adiabatic cyclic variations of their parameters, we consider discrete versions of adiabatically-rotated rotators. Parallelling the studies in continuous systems, we generalize the concept of geometric phase to discrete dynamics and investigate its presence in these rotators. For the rotated sine circle map, we demonstrate an analytical relationship between the geometric phase and the rotation number of the system. For the discrete version of the rotated rotator considered by Berry, the rotated standard map, we further explore this connection as well as the role of the geometric phase at the onset of chaos. Further into the chaotic regime, we show that the geometric phase is also related to the diffusive behaviour of the dynamical variables and the Lyapunov exponent. - Highlights: • We extend the concept of geometric phase to maps. • For the rotated sine circle map, we demonstrate an analytical relationship between the geometric phase and the rotation number. • For the rotated standard map, we explore the role of the geometric phase at the onset of chaos. • We show that the geometric phase is related to the diffusive behaviour of the dynamical variables and the Lyapunov exponent.

  5. Right-invertibility for a class of nonlinear control systems: A geometric approach

    NARCIS (Netherlands)

    Nijmeijer, Henk

    1986-01-01

    In recent years it has become evident that various synthesis problems known from linear system theory can also be solved for nonlinear control systems by using differential geometric methods. The purpose of this paper is to use this mathematical framework for giving a preliminary account on the

  6. Navigability of Random Geometric Graphs in the Universe and Other Spacetimes.

    Science.gov (United States)

    Cunningham, William; Zuev, Konstantin; Krioukov, Dmitri

    2017-08-18

    Random geometric graphs in hyperbolic spaces explain many common structural and dynamical properties of real networks, yet they fail to predict the correct values of the exponents of power-law degree distributions observed in real networks. In that respect, random geometric graphs in asymptotically de Sitter spacetimes, such as the Lorentzian spacetime of our accelerating universe, are more attractive as their predictions are more consistent with observations in real networks. Yet another important property of hyperbolic graphs is their navigability, and it remains unclear if de Sitter graphs are as navigable as hyperbolic ones. Here we study the navigability of random geometric graphs in three Lorentzian manifolds corresponding to universes filled only with dark energy (de Sitter spacetime), only with matter, and with a mixture of dark energy and matter. We find these graphs are navigable only in the manifolds with dark energy. This result implies that, in terms of navigability, random geometric graphs in asymptotically de Sitter spacetimes are as good as random hyperbolic graphs. It also establishes a connection between the presence of dark energy and navigability of the discretized causal structure of spacetime, which provides a basis for a different approach to the dark energy problem in cosmology.

  7. On Approximation of Hyper-geometric Function Values of a Special Class

    Directory of Open Access Journals (Sweden)

    P. L. Ivankov

    2017-01-01

    Full Text Available Investigations of arithmetic properties of the hyper-geometric function values make it possible to single out two trends, namely, Siegel’s method and methods based on the effective construction of a linear approximating form. There are also methods combining both approaches mentioned.  The Siegel’s method allows obtaining the most general results concerning the abovementioned problems. In many cases it was used to establish the algebraic independence of the values of corresponding functions. Although the effective methods do not allow obtaining propositions of such generality they have nevertheless some advantages. Among these advantages one can distinguish at least two: a higher precision of the quantitative results obtained by effective methods and a possibility to study the hyper-geometric functions with irrational parameters.In this paper we apply the effective construction to estimate a measure of the linear independence of the hyper-geometric function values over the imaginary quadratic field. The functions themselves were chosen by a special way so that it could be possible to demonstrate a new approach to the effective construction of a linear approximating form. This approach makes it possible also to extend the well-known effective construction methods of the linear approximating forms for poly-logarithms to the functions of more general type.To obtain the arithmetic result we had to establish a linear independence of the functions under consideration over the field of rational functions. It is apparently impossible to apply directly known theorems containing sufficient (and in some cases needful and sufficient conditions for the system of functions appearing in the theorems mentioned. For this reason, a special technique has been developed to solve this problem.The paper presents the obtained arithmetic results concerning the values of integral functions, but, with appropriate alterations, the theorems proved can be adapted to

  8. 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...

  9. Situating the Debate on "Geometrical Algebra" within the Framework of Premodern Algebra.

    Science.gov (United States)

    Sialaros, Michalis; Christianidis, Jean

    2016-06-01

    Argument The aim of this paper is to employ the newly contextualized historiographical category of "premodern algebra" in order to revisit the arguably most controversial topic of the last decades in the field of Greek mathematics, namely the debate on "geometrical algebra." Within this framework, we shift focus from the discrepancy among the views expressed in the debate to some of the historiographical assumptions and methodological approaches that the opposing sides shared. Moreover, by using a series of propositions related to Elem. II.5 as a case study, we discuss Euclid's geometrical proofs, the so-called "semi-algebraic" alternative demonstrations attributed to Heron of Alexandria, as well as the solutions given by Diophantus, al-Sulamī, and al-Khwārizmī to the corresponding numerical problem. This comparative analysis offers a new reading of Heron's practice, highlights the significance of contextualizing "premodern algebra," and indicates that the origins of algebraic reasoning should be sought in the problem-solving practice, rather than in the theorem-proving tradition.

  10. 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.

  11. 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.

  12. 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.

  13. ISOGEOMETRIC SHAPE OPTIMIZATION FOR ELECTROMAGNETIC SCATTERING PROBLEMS

    DEFF Research Database (Denmark)

    Nguyen, D. M.; Evgrafov, Anton; Gravesen, Jens

    2012-01-01

    We consider the benchmark problem of magnetic energy density enhancement in a small spatial region by varying the shape of two symmetric conducting scatterers. We view this problem as a prototype for a wide variety of geometric design problems in electromagnetic applications. Our approach...

  14. 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.

  15. Cross-Grade Comparison of Students' Conceptual Understanding with Lenses in Geometric Optics

    Science.gov (United States)

    Tural, G.

    2015-01-01

    Students commonly find the field of physics difficult. Therefore, they generally have learning problems. One of the subjects with which they have difficulties is optics within a physics discipline. This study aims to determine students' conceptual understanding levels at different education levels relating to lenses in geometric optics. A…

  16. 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…

  17. 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.

  18. 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.

  19. 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)

    Ebrahimnejad, Ali

    2015-08-01

    There are several methods, in the literature, for solving fuzzy variable linear programming problems (fuzzy linear programming in which the right-hand-side vectors and decision variables are represented by trapezoidal fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings a new method based on the bounded dual simplex method is proposed to determine the fuzzy optimal solution of that kind of fuzzy variable linear programming problems in which some or all variables are restricted to lie within lower and upper bounds. To illustrate the proposed method, an application example is solved and the obtained results are given. The advantages of the proposed method over existing methods are discussed. Also, one application of this algorithm in solving bounded transportation problems with fuzzy supplies and demands is dealt with. The proposed method is easy to understand and to apply for determining the fuzzy optimal solution of bounded fuzzy variable linear programming problems occurring in real-life situations.

  20. NP-hardness of the cluster minimization problem revisited

    Science.gov (United States)

    Adib, Artur B.

    2005-10-01

    The computational complexity of the 'cluster minimization problem' is revisited (Wille and Vennik 1985 J. Phys. A: Math. Gen. 18 L419). It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as those that depend on the geometric distance between the particles. A geometric analogue of the original problem is formulated, and a new proof for such potentials is provided by polynomial time transformation from the independent set problem for unit disk graphs. Limitations of this formulation are pointed out, and new subproblems that bear more direct consequences to the numerical study of clusters are suggested.

  1. NP-hardness of the cluster minimization problem revisited

    International Nuclear Information System (INIS)

    Adib, Artur B

    2005-01-01

    The computational complexity of the 'cluster minimization problem' is revisited (Wille and Vennik 1985 J. Phys. A: Math. Gen. 18 L419). It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as those that depend on the geometric distance between the particles. A geometric analogue of the original problem is formulated, and a new proof for such potentials is provided by polynomial time transformation from the independent set problem for unit disk graphs. Limitations of this formulation are pointed out, and new subproblems that bear more direct consequences to the numerical study of clusters are suggested

  2. NP-hardness of the cluster minimization problem revisited

    Energy Technology Data Exchange (ETDEWEB)

    Adib, Artur B [Physics Department, Brown University, Providence, RI 02912 (United States)

    2005-10-07

    The computational complexity of the 'cluster minimization problem' is revisited (Wille and Vennik 1985 J. Phys. A: Math. Gen. 18 L419). It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as those that depend on the geometric distance between the particles. A geometric analogue of the original problem is formulated, and a new proof for such potentials is provided by polynomial time transformation from the independent set problem for unit disk graphs. Limitations of this formulation are pointed out, and new subproblems that bear more direct consequences to the numerical study of clusters are suggested.

  3. A geometric Hamiltonian description of composite quantum systems and quantum entanglement

    Science.gov (United States)

    Pastorello, Davide

    2015-05-01

    Finite-dimensional Quantum Mechanics can be geometrically formulated as a proper classical-like Hamiltonian theory in a projective Hilbert space. The description of composite quantum systems within the geometric Hamiltonian framework is discussed in this paper. As summarized in the first part of this work, in the Hamiltonian formulation the phase space of a quantum system is the Kähler manifold given by the complex projective space P(H) of the Hilbert space H of the considered quantum theory. However the phase space of a bipartite system must be P(H1 ⊗ H2) and not simply P(H1) × P(H2) as suggested by the analogy with Classical Mechanics. A part of this paper is devoted to manage this problem. In the second part of the work, a definition of quantum entanglement and a proposal of entanglement measure are given in terms of a geometrical point of view (a rather studied topic in recent literature). Finally two known separability criteria are implemented in the Hamiltonian formalism.

  4. 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...

  5. 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.

  6. 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.

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

  8. 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

  9. 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

  10. 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.

  11. 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....

  12. 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.

  13. 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.

  14. 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

  15. 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

  16. The inverse problem of the calculus of variations for discrete systems

    Science.gov (United States)

    Barbero-Liñán, María; Farré Puiggalí, Marta; Ferraro, Sebastián; Martín de Diego, David

    2018-05-01

    We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also provide a transition between the discrete and the continuous problems and propose variationality as an interesting geometric property to take into account in the design and computer simulation of numerical integrators for constrained systems. For instance, nonholonomic mechanics is generally non variational but some special cases admit an alternative variational description. We apply some standard nonholonomic integrators to such an example to study which ones conserve this property.

  17. 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.

  18. Classification of cyclic initial states and geometric phase for the spin-j system

    Energy Technology Data Exchange (ETDEWEB)

    Skrynnikov, N.R.; Zhou, J.; Sanctuary, B.C. [Dept. of Chem., McGill Univ., Montreal, PQ (Canada)

    1994-09-21

    Quantum states which evolve cyclically in their projective Hilbert space give rise to a geometric (or Aharonov-Anandan) phase. An aspect of primary interest is stable cyclic behaviour as realized under a periodic Hamiltonian. The problem has been handled by use of time-dependent transformations treated along the lines of Floquet's theory as well as in terms of exponential operators with a goal to examine the variety of initial states exhibiting cyclic behaviour. A particular case of special cyclic initial states is described which is shown to be important for nuclear magnetic resonance experiments aimed at the study of the effects of the geometric phase. An example of arbitrary spin j in a precessing magnetic field and spin j=1 subject to both axially symmetric quadrupolar interaction and a precessing magnetic field are presented. The invariant (Kobe's) geometric phase is calculated for special cyclic states. (author)

  19. 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.

  20. 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.

  1. Graphene geometric diodes for terahertz rectennas

    International Nuclear Information System (INIS)

    Zhu Zixu; Joshi, Saumil; Grover, Sachit; Moddel, Garret

    2013-01-01

    We demonstrate a new thin-film graphene diode called a geometric diode that relies on geometric asymmetry to provide rectification at 28 THz. The geometric diode is coupled to an optical antenna to form a rectenna that rectifies incoming radiation. This is the first reported graphene-based antenna-coupled diode working at 28 THz, and potentially at optical frequencies. The planar structure of the geometric diode provides a low RC time constant, on the order of 10 −15 s, required for operation at optical frequencies, and a low impedance for efficient power transfer from the antenna. Fabricated geometric diodes show asymmetric current–voltage characteristics consistent with Monte Carlo simulations for the devices. Rectennas employing the geometric diode coupled to metal and graphene antennas rectify 10.6 µm radiation, corresponding to an operating frequency of 28 THz. The graphene bowtie antenna is the first demonstrated functional antenna made using graphene. Its response indicates that graphene is a suitable terahertz resonator material. Applications for this terahertz diode include terahertz-wave and optical detection, ultra-high-speed electronics and optical power conversion. (paper)

  2. Comment on “Time-changed geometric fractional Brownian motion and option pricing with transaction costs” by Hui Gu et al.

    Science.gov (United States)

    Guo, Zhidong; Song, Yukun; Zhang, Yunliang

    2013-05-01

    The purpose of this comment is to point out the inappropriate assumption of “3αH>1” and two problems in the proof of “Theorem 3.1” in section 3 of the paper “Time-changed geometric fractional Brownian motion and option pricing with transaction costs” by Hui Gu et al. [H. Gu, J.R. Liang, Y. X. Zhang, Time-changed geometric fractional Brownian motion and option pricing with transaction costs, Physica A 391 (2012) 3971-3977]. Then we show the two problems will be solved under our new assumption.

  3. Analytical pricing of geometric Asian power options on an underlying driven by a mixed fractional Brownian motion

    Science.gov (United States)

    Zhang, Wei-Guo; Li, Zhe; Liu, Yong-Jun

    2018-01-01

    In this paper, we study the pricing problem of the continuously monitored fixed and floating strike geometric Asian power options in a mixed fractional Brownian motion environment. First, we derive both closed-form solutions and mixed fractional partial differential equations for fixed and floating strike geometric Asian power options based on delta-hedging strategy and partial differential equation method. Second, we present the lower and upper bounds of the prices of fixed and floating strike geometric Asian power options under the assumption that both risk-free interest rate and volatility are interval numbers. Finally, numerical studies are performed to illustrate the performance of our proposed pricing model.

  4. Research on geometric rectification of the Large FOV Linear Array Whiskbroom Image

    Science.gov (United States)

    Liu, Dia; Liu, Hui-tong; Dong, Hao; Liu, Xiao-bo

    2015-08-01

    To solve the geometric distortion problem of large FOV linear array whiskbroom image, a model of multi center central projection collinearity equation was founded considering its whiskbroom and linear CCD imaging feature, and the principle of distortion was analyzed. Based on the rectification method with POS, we introduced the angular position sensor data of the servo system, and restored the geometric imaging process exactly. An indirect rectification scheme aiming at linear array imaging with best scanline searching method was adopted, matrixes for calculating the exterior orientation elements was redesigned. We improved two iterative algorithms for this device, and did comparison and analysis. The rectification for the images of airborne imaging experiment showed ideal effect.

  5. Geometric solitons of Hamiltonian flows on manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Song, Chong, E-mail: songchong@xmu.edu.cn [School of Mathematical Sciences, Xiamen University, Xiamen 361005 (China); Sun, Xiaowei, E-mail: sunxw@cufe.edu.cn [School of Applied Mathematics, Central University of Finance and Economics, Beijing 100081 (China); Wang, Youde, E-mail: wyd@math.ac.cn [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China)

    2013-12-15

    It is well-known that the LIE (Locally Induction Equation) admit soliton-type solutions and same soliton solutions arise from different and apparently irrelevant physical models. By comparing the solitons of LIE and Killing magnetic geodesics, we observe that these solitons are essentially decided by two families of isometries of the domain and the target space, respectively. With this insight, we propose the new concept of geometric solitons of Hamiltonian flows on manifolds, such as geometric Schrödinger flows and KdV flows for maps. Moreover, we give several examples of geometric solitons of the Schrödinger flow and geometric KdV flow, including magnetic curves as geometric Schrödinger solitons and explicit geometric KdV solitons on surfaces of revolution.

  6. 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...

  7. Introduction to geometric nonlinear control; Controllability and lie bracket

    Energy Technology Data Exchange (ETDEWEB)

    Jakubczyk, B [Institute of Mathematics, Polish Academy of Sciences, Warsaw (Poland)

    2002-07-15

    We present an introduction to the qualitative theory of nonlinear control systems, with the main emphasis on controllability properties of such systems. We introduce the differential geometric language of vector fields, Lie bracket, distributions, foliations etc. One of the basic tools is the orbit theorem of Stefan and Sussmann. We analyse the basic controllability problems and give criteria for complete controllability, accessibility and related properties, using certain Lie algebras of ve fields defined by the system. A problem of path approximation is considered as an application of the developed theory. We illustrate our considerations with examples of simple systems or systems appearing in applications. The notes start from an elementary level and are self-contained. (author)

  8. Hydrodynamic Limit with Geometric Correction of Stationary Boltzmann Equation

    OpenAIRE

    Wu, Lei

    2014-01-01

    We consider the hydrodynamic limit of a stationary Boltzmann equation in a unit plate with in-flow boundary. We prove the solution can be approximated in $L^{\\infty}$ by the sum of interior solution which satisfies steady incompressible Navier-Stokes-Fourier system, and boundary layer with geometric correction. Also, we construct a counterexample to the classical theory which states the behavior of solution near boundary can be described by the Knudsen layer derived from the Milne problem.

  9. 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)

  10. 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.

  11. Boundary element methods applied to two-dimensional neutron diffusion problems

    International Nuclear Information System (INIS)

    Itagaki, Masafumi

    1985-01-01

    The Boundary element method (BEM) has been applied to two-dimensional neutron diffusion problems. The boundary integral equation and its discretized form have been derived. Some numerical techniques have been developed, which can be applied to critical and fixed-source problems including multi-region ones. Two types of test programs have been developed according to whether the 'zero-determinant search' or the 'source iteration' technique is adopted for criticality search. Both programs require only the fluxes and currents on boundaries as the unknown variables. The former allows a reduction in computing time and memory in comparison with the finite element method (FEM). The latter is not always efficient in terms of computing time due to the domain integral related to the inhomogeneous source term; however, this domain integral can be replaced by the equivalent boundary integral for a region with a non-multiplying medium or with a uniform source, resulting in a significant reduction in computing time. The BEM, as well as the FEM, is well suited for solving irregular geometrical problems for which the finite difference method (FDM) is unsuited. The BEM also solves problems with infinite domains, which cannot be solved by the ordinary FEM and FDM. Some simple test calculations are made to compare the BEM with the FEM and FDM, and discussions are made concerning the relative merits of the BEM and problems requiring future solution. (author)

  12. 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…

  13. A generalization of the convex Kakeya problem

    KAUST Repository

    Ahn, Heekap; Bae, Sangwon; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine E.

    2012-01-01

    We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya's problem

  14. Operational geometric phase for mixed quantum states

    International Nuclear Information System (INIS)

    Andersson, O; Heydari, H

    2013-01-01

    The geometric phase has found a broad spectrum of applications in both classical and quantum physics, such as condensed matter and quantum computation. In this paper, we introduce an operational geometric phase for mixed quantum states, based on spectral weighted traces of holonomies, and we prove that it generalizes the standard definition of the geometric phase for mixed states, which is based on quantum interferometry. We also introduce higher order geometric phases, and prove that under a fairly weak, generically satisfied, requirement, there is always a well-defined geometric phase of some order. Our approach applies to general unitary evolutions of both non-degenerate and degenerate mixed states. Moreover, since we provide an explicit formula for the geometric phase that can be easily implemented, it is particularly well suited for computations in quantum physics. (paper)

  15. Time-changed geometric fractional Brownian motion and option pricing with transaction costs

    Science.gov (United States)

    Gu, Hui; Liang, Jin-Rong; Zhang, Yun-Xiu

    2012-08-01

    This paper deals with the problem of discrete time option pricing by a fractional subdiffusive Black-Scholes model. The price of the underlying stock follows a time-changed geometric fractional Brownian motion. By a mean self-financing delta-hedging argument, the pricing formula for the European call option in discrete time setting is obtained.

  16. 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.

  17. Appropriating Geometric Series as a Cultural Tool: A Study of Student Collaborative Learning

    Science.gov (United States)

    Carlsen, Martin

    2010-01-01

    The aim of this article is to illustrate how students, through collaborative small-group problem solving, appropriate the concept of geometric series. Student appropriation of cultural tools is dependent on five sociocultural aspects: involvement in joint activity, shared focus of attention, shared meanings for utterances, transforming actions and…

  18. 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.

  19. 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.

  20. 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.

  1. 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.

  2. ALGOL geometrical module for reactor and reactor cell calculations in the R-Z geometry with the Monte Carlo method

    International Nuclear Information System (INIS)

    Usikov, D.A.

    1975-01-01

    A description of a geometrical module used in a program of the ARMONT complex of the Monte Carlo calculations is given. The geometrical module is designed to simulate the particle trajectory in the R-Z geometry. The geometrical module follows the particle trajectory from the start point to the next collision or flight-out points. The flight direction at the scattering point is assumed isotropic in the laboratory coordinate system. In the module the angle between the flight direction before and after collision is not determined. The principles for the module construction are presented alongside with the text-module in the ALGOL language. The module is optimumized as to the counting rate and it is rather compact not to cause difficulties due to the translator limitations in common translation with other program blocks based on the use of the Monte Carlo calculations

  3. 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.

  4. 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)

  5. 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.

  6. 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.

  7. Geometrical factors in the perception of sacredness

    DEFF Research Database (Denmark)

    Costa, Marco; Bonetti, Leonardo

    2016-01-01

    Geometrical and environmental factors in the perception of sacredness, dominance, and attractiveness were assessed by 137 participants in five tests. In the first test, a two-alternative forced-choice paradigm was used to test the perception of sacredness, dominance, and attractiveness in geometr......Geometrical and environmental factors in the perception of sacredness, dominance, and attractiveness were assessed by 137 participants in five tests. In the first test, a two-alternative forced-choice paradigm was used to test the perception of sacredness, dominance, and attractiveness...... in geometrical figures differing in shape, verticality, size, and symmetry. Verticality, symmetry, and convexity were found to be important factors in the perception of sacredness. In the second test, participants had to mark the point inside geometrical surfaces that was perceived as most sacred, dominant....... Geometrical factors in the perception of sacredness, dominance, and attractiveness were largely overlapping....

  8. 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.…

  9. 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

  10. 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

  11. 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)

  12. 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

  13. 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)

  14. Geometric Integration of Hybrid Correspondences for RGB-D Unidirectional Tracking

    Directory of Open Access Journals (Sweden)

    Shengjun Tang

    2018-05-01

    Full Text Available Traditionally, visual-based RGB-D SLAM systems only use correspondences with valid depth values for camera tracking, thus ignoring the regions without 3D information. Due to the strict limitation on measurement distance and view angle, such systems adopt only short-range constraints which may introduce larger drift errors during long-distance unidirectional tracking. In this paper, we propose a novel geometric integration method that makes use of both 2D and 3D correspondences for RGB-D tracking. Our method handles the problem by exploring visual features both when depth information is available and when it is unknown. The system comprises two parts: coarse pose tracking with 3D correspondences, and geometric integration with hybrid correspondences. First, the coarse pose tracking generates the initial camera pose using 3D correspondences with frame-by-frame registration. The initial camera poses are then used as inputs for the geometric integration model, along with 3D correspondences, 2D-3D correspondences and 2D correspondences identified from frame pairs. The initial 3D location of the correspondence is determined in two ways, from depth image and by using the initial poses to triangulate. The model improves the camera poses and decreases drift error during long-distance RGB-D tracking iteratively. Experiments were conducted using data sequences collected by commercial Structure Sensors. The results verify that the geometric integration of hybrid correspondences effectively decreases the drift error and improves mapping accuracy. Furthermore, the model enables a comparative and synergistic use of datasets, including both 2D and 3D features.

  15. SYMMETRY, HAMILTONIAN PROBLEMS AND WAVELETS IN ACCELERATOR PHYSICS

    International Nuclear Information System (INIS)

    FEDOROVA, A.; ZEITLIN, M.; PARSA, Z.

    2000-01-01

    In this paper the authors consider applications of methods from wavelet analysis to nonlinear dynamical problems related to accelerator physics. In this approach they take into account underlying algebraical, geometrical and topological structures of corresponding problems

  16. Improved remote gaze estimation using corneal reflection-adaptive geometric transforms

    Science.gov (United States)

    Ma, Chunfei; Baek, Seung-Jin; Choi, Kang-A.; Ko, Sung-Jea

    2014-05-01

    Recently, the remote gaze estimation (RGE) technique has been widely applied to consumer devices as a more natural interface. In general, the conventional RGE method estimates a user's point of gaze using a geometric transform, which represents the relationship between several infrared (IR) light sources and their corresponding corneal reflections (CRs) in the eye image. Among various methods, the homography normalization (HN) method achieves state-of-the-art performance. However, the geometric transform of the HN method requiring four CRs is infeasible for the case when fewer than four CRs are available. To solve this problem, this paper proposes a new RGE method based on three alternative geometric transforms, which are adaptive to the number of CRs. Unlike the HN method, the proposed method not only can operate with two or three CRs, but can also provide superior accuracy. To further enhance the performance, an effective error correction method is also proposed. By combining the introduced transforms with the error-correction method, the proposed method not only provides high accuracy and robustness for gaze estimation, but also allows for a more flexible system setup with a different number of IR light sources. Experimental results demonstrate the effectiveness of the proposed method.

  17. 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.

  18. 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…

  19. 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

  20. 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

  1. Geometric phases for nonlinear coherent and squeezed states

    International Nuclear Information System (INIS)

    Yang Dabao; Chen Ying; Chen Jingling; Zhang Fulin

    2011-01-01

    The geometric phases for standard coherent states which are widely used in quantum optics have attracted considerable attention. Nevertheless, few physicists consider the counterparts of nonlinear coherent states, which are useful in the description of the motion of a trapped ion. In this paper, the non-unitary and non-cyclic geometric phases for two nonlinear coherent and one squeezed states are formulated, respectively. Moreover, some of their common properties are discussed, such as gauge invariance, non-locality and nonlinear effects. The nonlinear functions have dramatic impacts on the evolution of the corresponding geometric phases. They speed the evolution up or down. So this property may have an application in controlling or measuring geometric phase. For the squeezed case, when the squeezed parameter r → ∞, the limiting value of the geometric phase is also determined by a nonlinear function at a given time and angular velocity. In addition, the geometric phases for standard coherent and squeezed states are obtained under a particular condition. When the time evolution undergoes a period, their corresponding cyclic geometric phases are achieved as well. And the distinction between the geometric phases of the two coherent states may be regarded as a geometric criterion.

  2. Theoretical frameworks for the learning of geometrical reasoning

    OpenAIRE

    Jones, Keith

    1998-01-01

    With the growth in interest in geometrical ideas it is important to be clear about the nature of geometrical reasoning and how it develops. This paper provides an overview of three theoretical frameworks for the learning of geometrical reasoning: the van Hiele model of thinking in geometry, Fischbein’s theory of figural concepts, and Duval’s cognitive model of geometrical reasoning. Each of these frameworks provides theoretical resources to support research into the development of geometrical...

  3. 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.

  4. 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.

  5. 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)

  6. Induced subgraph searching for geometric model fitting

    Science.gov (United States)

    Xiao, Fan; Xiao, Guobao; Yan, Yan; Wang, Xing; Wang, Hanzi

    2017-11-01

    In this paper, we propose a novel model fitting method based on graphs to fit and segment multiple-structure data. In the graph constructed on data, each model instance is represented as an induced subgraph. Following the idea of pursuing the maximum consensus, the multiple geometric model fitting problem is formulated as searching for a set of induced subgraphs including the maximum union set of vertices. After the generation and refinement of the induced subgraphs that represent the model hypotheses, the searching process is conducted on the "qualified" subgraphs. Multiple model instances can be simultaneously estimated by solving a converted problem. Then, we introduce the energy evaluation function to determine the number of model instances in data. The proposed method is able to effectively estimate the number and the parameters of model instances in data severely corrupted by outliers and noises. Experimental results on synthetic data and real images validate the favorable performance of the proposed method compared with several state-of-the-art fitting methods.

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

  8. 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

  9. 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

  10. On geometric optics and surface waves for light scattering by spheres

    International Nuclear Information System (INIS)

    Liou, K.N.; Takano, Y.; Yang, P.

    2010-01-01

    A geometric optics approach including surface wave contributions has been developed for homogeneous and concentrically coated spheres. In this approach, a ray-by-ray tracing program was used for efficient computation of the extinction and absorption cross sections. The present geometric-optics surface-wave (GOS) theory for light scattering by spheres considers the surface wave contribution along the edge of a particle as a perturbation term to the geometric-optics core that includes Fresnel reflection-refraction and Fraunhofer diffraction. Accuracies of the GOS approach for spheres have been assessed through comparison with the results determined from the exact Lorenz-Mie (LM) theory in terms of the extinction efficiency, single-scattering albedo, and asymmetry factor in the size-wavelength ratio domain. In this quest, we have selected a range of real and imaginary refractive indices representative of water/ice and aerosol species and demonstrated close agreement between the results computed by GOS and LM. This provides the foundation to conduct physically reliable light absorption and scattering computations based on the GOS approach for aerosol aggregates associated with internal and external mixing states employing spheres as building blocks.

  11. Design of an ultra-thin near-eye display with geometrical waveguide and freeform optics.

    Science.gov (United States)

    Cheng, Dewen; Wang, Yongtian; Xu, Chen; Song, Weitao; Jin, Guofan

    2014-08-25

    Small thickness and light weight are two important requirements for a see-through near-eye display which are achieved in this paper by using two advanced technologies: geometrical waveguide and freeform optics. A major problem associated with the geometrical waveguide is the stray light which can severely degrade the display quality. The causes and solutions to this problem are thoroughly studied. A mathematical model of the waveguide is established and a non-sequential ray tracing algorithm is developed, which enable us to carefully examine the stray light of the planar waveguide and explore a global searching method to find an optimum design with the least amount of stray light. A projection optics using freeform surfaces on a wedge shaped prism is also designed. The near-eye display integrating the projection optics and the waveguide has a field of view of 28°, an exit pupil diameter of 9.6mm and an exit pupil distance of 20mm. In our final design, the proportion of the stray light energy over the image output energy of the waveguide is reduced to 2%, the modulation transfer function values across the entire field of the eyepiece are above 0.5 at 30 line pairs/mm (lps/mm). A proof-of-concept prototype of the proposed geometrical waveguide near-eye display is developed and demonstrated.

  12. APPLICATION OF FINITE ELEMENT METHOD TAKING INTO ACCOUNT PHYSICAL AND GEOMETRIC NONLINEARITY FOR THE CALCULATION OF PRESTRESSED REINFORCED CONCRETE BEAMS

    Directory of Open Access Journals (Sweden)

    Vladimir P. Agapov

    2017-01-01

    Full Text Available Abstract. Objectives Modern building codes prescribe the calculation of building structures taking into account the nonlinearity of deformation. To achieve this goal, the task is to develop a methodology for calculating prestressed reinforced concrete beams, taking into account physical and geometric nonlinearity. Methods The methodology is based on nonlinear calculation algorithms implemented and tested in the computation complex PRINS (a program for calculating engineering constructions for other types of construction. As a tool for solving this problem, the finite element method is used. Non-linear calculation of constructions is carried out by the PRINS computational complex using the stepwise iterative method. In this case, an equation is constructed and solved at the loading step, using modified Lagrangian coordinates. Results The basic formulas necessary for both the formation and the solution of a system of nonlinear algebraic equations by the stepwise iteration method are given, taking into account the loading, unloading and possible additional loading. A method for simulating prestressing is described by setting the temperature action on the reinforcement and stressing steel rod. Different approaches to accounting for physical and geometric nonlinearity of reinforced concrete beam rods are considered. A calculation example of a flat beam is given, in which the behaviour of the beam is analysed at various stages of its loading up to destruction. Conclusion A program is developed for the calculation of flat and spatially reinforced concrete beams taking into account the nonlinearity of deformation. The program is adapted to the computational complex PRINS and as part of this complex is available to a wide range of engineering, scientific and technical specialists. 

  13. 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

  14. 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.

  15. 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.

  16. Geometric phases and quantum computation

    International Nuclear Information System (INIS)

    Vedral, V.

    2005-01-01

    Full text: In my lectures I will talk about the notion of the geometric phase and explain its relevance for both fundamental quantum mechanics as well as quantum computation. The phase will be at first introduced via the idea of Pancharatnam which involves interference of three or more light beams. This notion will then be generalized to the evolving quantum systems. I will discuss both pure and mixed states as well as unitary and non-unitary evolutions. I will also show how the concept of the vacuum induced geometric phase arises in quantum optics. A simple measurement scheme involving a Mach Zehnder interferometer will be presented and will be used to illustrate all the concepts in the lecture. Finally, I will expose a simple generalization of the geometric phase to evolving degenerate states. This will be seen to lead to the possibility of universal quantum computation using geometric effects only. Moreover, this contains a promise of intrinsically fault tolerant quantum information processing, whose prospects will be outlined at the end of the lecture. (author)

  17. Geometric and dynamic perspectives on phase-coherent and noncoherent chaos.

    Science.gov (United States)

    Zou, Yong; Donner, Reik V; Kurths, Jürgen

    2012-03-01

    Statistically distinguishing between phase-coherent and noncoherent chaotic dynamics from time series is a contemporary problem in nonlinear sciences. In this work, we propose different measures based on recurrence properties of recorded trajectories, which characterize the underlying systems from both geometric and dynamic viewpoints. The potentials of the individual measures for discriminating phase-coherent and noncoherent chaotic oscillations are discussed. A detailed numerical analysis is performed for the chaotic Rössler system, which displays both types of chaos as one control parameter is varied, and the Mackey-Glass system as an example of a time-delay system with noncoherent chaos. Our results demonstrate that especially geometric measures from recurrence network analysis are well suited for tracing transitions between spiral- and screw-type chaos, a common route from phase-coherent to noncoherent chaos also found in other nonlinear oscillators. A detailed explanation of the observed behavior in terms of attractor geometry is given.

  18. Geometric Phases for Mixed States in Trapped Ions

    International Nuclear Information System (INIS)

    Lu Hongxia

    2006-01-01

    The generalization of geometric phase from the pure states to the mixed states may have potential applications in constructing geometric quantum gates. We here investigate the mixed state geometric phases and visibilities of the trapped ion system in both non-degenerate and degenerate cases. In the proposed quantum system, the geometric phases are determined by the evolution time, the initial states of trapped ions, and the initial states of photons. Moreover, special periods are gained under which the geometric phases do not change with the initial states changing of photon parts in both non-degenerate and degenerate cases. The high detection efficiency in the ion trap system implies that the mixed state geometric phases proposed here can be easily tested.

  19. 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 ...

  20. 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.

  1. 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.

  2. Geometric supergravity in D = 11 and its hidden supergroup

    International Nuclear Information System (INIS)

    D'Auria, R.; Fre, P.

    1982-01-01

    In this paper we address two questions: the geometrical formulation of D=11 supergravity and the derivation of the super Lie algebra it is based on. The solutions of the two problems are intimately related and are obtained via the introduction of the new concept of a Cartan integrable system described in this paper. The previously developed group manifold framework can be naturally extended to a Cartan integrable system manifold approach. Within this scheme we obtain a geometric action for D=11 supergravity based on a suitable Cartan system. This latter turns out to be compact description of a two-element class of supergroups containing besides Lorentz Jsub(ab), translation Psub(a) and ordinary supersymmetry Q, the following extra generators: two- and five-index skew-symmetric tensors Zsub(a1a2)Zsub(a1...a5) and a further spinorial charge Q'. Q' commutes with itself and everyhting else except Jsub(ab). It appears in the commutators of Q with Psub(a),Zsub(a1a2),Zsub(a1...a5). (orig.)

  3. Exposing region duplication through local geometrical color invariant features

    Science.gov (United States)

    Gong, Jiachang; Guo, Jichang

    2015-05-01

    Many advanced image-processing softwares are available for tampering images. How to determine the authenticity of an image has become an urgent problem. Copy-move is one of the most common image forgery operations. Many methods have been proposed for copy-move forgery detection (CMFD). However, most of these methods are designed for grayscale images without any color information used. They are usually not suitable when the duplicated regions have little structure or have undergone various transforms. We propose a CMFD method using local geometrical color invariant features to detect duplicated regions. The method starts by calculating the color gradient of the inspected image. Then, we directly take the color gradient as the input for scale invariant features transform (SIFT) to extract color-SIFT descriptors. Finally, keypoints are matched and clustered before their geometrical relationship is estimated to expose the duplicated regions. We evaluate the detection performance and computational complexity of the proposed method together with several popular CMFD methods on a public database. Experimental results demonstrate the efficacy of the proposed method in detecting duplicated regions with various transforms and poor structure.

  4. A quick introduction to Burnside's problem

    International Nuclear Information System (INIS)

    Sergiescu, V.

    1991-01-01

    The main purpose of this exposition is to describe an interesting and fairly elementary geometric construction due to Gupta and Sidki in connection with a classical problem in group theory. This is related in several ways to the topics discussed during the workshop. It also provides motivation for further research on open problems. (author). 17 refs, 2 figs

  5. Exact Solutions for Einstein's Hyperbolic Geometric Flow

    International Nuclear Information System (INIS)

    He Chunlei

    2008-01-01

    In this paper we investigate the Einstein's hyperbolic geometric flow and obtain some interesting exact solutions for this kind of flow. Many interesting properties of these exact solutions have also been analyzed and we believe that these properties of Einstein's hyperbolic geometric flow are very helpful to understanding the Einstein equations and the hyperbolic geometric flow

  6. 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

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

  8. 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.

  9. Modifications of Geometric Truncation of the Scattering Phase Function

    Science.gov (United States)

    Radkevich, A.

    2017-12-01

    Phase function (PF) of light scattering on large atmospheric particles has very strong peak in forward direction constituting a challenge for accurate numerical calculations of radiance. Such accurate (and fast) evaluations are important in the problems of remote sensing of the atmosphere. Scaling transformation replaces original PF with a sum of the delta function and a new regular smooth PF. A number of methods to construct such a PF were suggested. Delta-M and delta-fit methods require evaluation of the PF moments which imposes a numerical problem if strongly anisotropic PF is given as a function of angle. Geometric truncation keeps the original PF unchanged outside the forward peak cone replacing it with a constant within the cone. This approach is designed to preserve the asymmetry parameter. It has two disadvantages: 1) PF has discontinuity at the cone; 2) the choice of the cone is subjective, no recommendations were provided on the choice of the truncation angle. This choice affects both truncation fraction and the value of the phase function within the forward cone. Both issues are addressed in this study. A simple functional form of the replacement PF is suggested. This functional form allows for a number of modifications. This study consider 3 versions providing continuous PF. The considered modifications also bear either of three properties: preserve asymmetry parameter, provide continuity of the 1st derivative of the PF, and preserve mean scattering angle. The second problem mentioned above is addressed with a heuristic approach providing unambiguous criterion of selection of the truncation angle. The approach showed good performance on liquid water and ice clouds with different particle size distributions. Suggested modifications were tested on different cloud PFs using both discrete ordinates and Monte Carlo methods. It was showed that the modifications provide better accuracy of the radiance computation compare to the original geometric truncation.

  10. Stiffness design of geometrically nonlinear structures using topology optimization

    DEFF Research Database (Denmark)

    Buhl, Thomas; Pedersen, Claus B. Wittendorf; Sigmund, Ole

    2000-01-01

    of the objective functions are found with the adjoint method and the optimization problem is solved using the Method of Moving Asymptotes. A filtering scheme is used to obtain checkerboard-free and mesh-independent designs and a continuation approach improves convergence to efficient designs. Different objective......The paper deals with topology optimization of structures undergoing large deformations. The geometrically nonlinear behaviour of the structures are modelled using a total Lagrangian finite element formulation and the equilibrium is found using a Newton-Raphson iterative scheme. The sensitivities...... functions are tested. Minimizing compliance for a fixed load results in degenerated topologies which are very inefficient for smaller or larger loads. The problem of obtaining degenerated "optimal" topologies which only can support the design load is even more pronounced than for structures with linear...

  11. Geometric control theory and sub-Riemannian geometry

    CERN Document Server

    Boscain, Ugo; Gauthier, Jean-Paul; Sarychev, Andrey; Sigalotti, Mario

    2014-01-01

    This volume presents recent advances in the interaction between Geometric Control Theory and sub-Riemannian geometry. On the one hand, Geometric Control Theory used the differential geometric and Lie algebraic language for studying controllability, motion planning, stabilizability and optimality for control systems. The geometric approach turned out to be fruitful in applications to robotics, vision modeling, mathematical physics etc. On the other hand, Riemannian geometry and its generalizations, such as  sub-Riemannian, Finslerian  geometry etc., have been actively adopting methods developed in the scope of geometric control. Application of these methods  has led to important results regarding geometry of sub-Riemannian spaces, regularity of sub-Riemannian distances, properties of the group  of diffeomorphisms of sub-Riemannian manifolds, local geometry and equivalence of distributions and sub-Riemannian structures, regularity of the Hausdorff volume.

  12. 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

  13. Asymmetric design for Compound Elliptical Concentrators (CEC) and its geometric flux implications

    Science.gov (United States)

    Jiang, Lun; Winston, Roland

    2015-08-01

    The asymmetric compound elliptical concentrator (CEC) has been a less discussed subject in the nonimaging optics society. The conventional way of understanding an ideal concentrator is based on maximizing the concentration ratio based on a uniformed acceptance angle. Although such an angle does not exist in the case of CEC, the thermodynamic laws still hold and we can produce concentrators with the maximum concentration ratio allowed by them. Here we restate the problem and use the string method to solve this general problem. Built on the solution, we can discover groups of such ideal concentrators using geometric flux field, or flowline method.

  14. 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.

  15. 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.

  16. Program package for data preparation of RISK events

    International Nuclear Information System (INIS)

    Denes, E.; Wagner, I.; Nagy, J.

    1980-01-01

    A FORTRAN program package written for the CDC-6500 computer is presented. The SMHV program is designed to transform data obtained from events of RISK streamer chamber by means of measuring SAMET or PUOS devices to the HEVAS data tormat format needed by the geometrical reconstruction program. Such a transformation provides the standartization of measurement data procession inside the RISK collaboration and capability of the direct input into program of event geometrical reconstruction registered on a film of RISK streamer chamber

  17. SOME PROPERTIES OF GEOMETRIC DEA MODELS

    Directory of Open Access Journals (Sweden)

    Ozren Despić

    2013-02-01

    Full Text Available Some specific geometric data envelopment analysis (DEA models are well known to the researchers in DEA through so-called multiplicative or log-linear efficiency models. Valuable properties of these models were noted by several authors but the models still remain somewhat obscure and rarely used in practice. The purpose of this paper is to show from a mathematical perspective where the geometric DEA fits in relation to the classical DEA, and to provide a brief overview of some benefits in using geometric DEA in practice of decision making and/or efficiency measurement.

  18. Lectures on geometrical properties of nuclei

    International Nuclear Information System (INIS)

    Myers, W.D.

    1975-11-01

    Material concerning the geometrical properties of nuclei is drawn from a number of different sources. The leptodermous nature of nuclear density distributions and potential wells is used to draw together the various geometrical properties of these systems and to provide a unified means for their description. Extensive use is made of expansions of radial properties in terms of the surface diffuseness. A strong case is made for the use of convolution as a geometrical ansatz for generating diffuse surface distributions because of the number of simplifications that arise which are of practical importance. 7 figures

  19. Random Process Theory Approach to Geometric Heterogeneous Surfaces: Effective Fluid-Solid Interaction

    Science.gov (United States)

    Khlyupin, Aleksey; Aslyamov, Timur

    2017-06-01

    Realistic fluid-solid interaction potentials are essential in description of confined fluids especially in the case of geometric heterogeneous surfaces. Correlated random field is considered as a model of random surface with high geometric roughness. We provide the general theory of effective coarse-grained fluid-solid potential by proper averaging of the free energy of fluid molecules which interact with the solid media. This procedure is largely based on the theory of random processes. We apply first passage time probability problem and assume the local Markov properties of random surfaces. General expression of effective fluid-solid potential is obtained. In the case of small surface irregularities analytical approximation for effective potential is proposed. Both amorphous materials with large surface roughness and crystalline solids with several types of fcc lattices are considered. It is shown that the wider the lattice spacing in terms of molecular diameter of the fluid, the more obtained potentials differ from classical ones. A comparison with published Monte-Carlo simulations was discussed. The work provides a promising approach to explore how the random geometric heterogeneity affects on thermodynamic properties of the fluids.

  20. 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.

  1. 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).

  2. 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…

  3. Geometric phases for mixed states during cyclic evolutions

    International Nuclear Information System (INIS)

    Fu Libin; Chen Jingling

    2004-01-01

    The geometric phases of cyclic evolutions for mixed states are discussed in the framework of unitary evolution. A canonical 1-form is defined whose line integral gives the geometric phase, which is gauge invariant. It reduces to the Aharonov and Anandan phase in the pure state case. Our definition is consistent with the phase shift in the proposed experiment (Sjoeqvist et al 2000 Phys. Rev. Lett. 85 2845) for a cyclic evolution if the unitary transformation satisfies the parallel transport condition. A comprehensive geometric interpretation is also given. It shows that the geometric phases for mixed states share the same geometric sense with the pure states

  4. 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.

  5. 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.

  6. Geometrical optics and the diffraction phenomenon

    International Nuclear Information System (INIS)

    Timofeev, Aleksandr V

    2005-01-01

    This note outlines the principles of the geometrical optics of inhomogeneous waves whose description necessitates the use of complex values of the wave vector. Generalizing geometrical optics to inhomogeneous waves permits including in its scope the analysis of the diffraction phenomenon. (methodological notes)

  7. Geometric U-folds in four dimensions

    Science.gov (United States)

    Lazaroiu, C. I.; Shahbazi, C. S.

    2018-01-01

    We describe a general construction of geometric U-folds compatible with a non-trivial extension of the global formulation of four-dimensional extended supergravity on a differentiable spin manifold. The topology of geometric U-folds depends on certain flat fiber bundles which encode how supergravity fields are globally glued together. We show that smooth non-trivial U-folds of this type can exist only in theories where both the scalar and space-time manifolds have non-trivial fundamental group and in addition the scalar map of the solution is homotopically non-trivial. Consistency with string theory requires smooth geometric U-folds to be glued using subgroups of the effective discrete U-duality group, implying that the fundamental group of the scalar manifold of such solutions must be a subgroup of the latter. We construct simple examples of geometric U-folds in a generalization of the axion-dilaton model of \

  8. The effects of spatial autoregressive dependencies on inference in ordinary least squares: a geometric approach

    Science.gov (United States)

    Smith, Tony E.; Lee, Ka Lok

    2012-01-01

    There is a common belief that the presence of residual spatial autocorrelation in ordinary least squares (OLS) regression leads to inflated significance levels in beta coefficients and, in particular, inflated levels relative to the more efficient spatial error model (SEM). However, our simulations show that this is not always the case. Hence, the purpose of this paper is to examine this question from a geometric viewpoint. The key idea is to characterize the OLS test statistic in terms of angle cosines and examine the geometric implications of this characterization. Our first result is to show that if the explanatory variables in the regression exhibit no spatial autocorrelation, then the distribution of test statistics for individual beta coefficients in OLS is independent of any spatial autocorrelation in the error term. Hence, inferences about betas exhibit all the optimality properties of the classic uncorrelated error case. However, a second more important series of results show that if spatial autocorrelation is present in both the dependent and explanatory variables, then the conventional wisdom is correct. In particular, even when an explanatory variable is statistically independent of the dependent variable, such joint spatial dependencies tend to produce "spurious correlation" that results in over-rejection of the null hypothesis. The underlying geometric nature of this problem is clarified by illustrative examples. The paper concludes with a brief discussion of some possible remedies for this problem.

  9. 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.

  10. Forward error correction based on algebraic-geometric theory

    CERN Document Server

    A Alzubi, Jafar; M Chen, Thomas

    2014-01-01

    This book covers the design, construction, and implementation of algebraic-geometric codes from Hermitian curves. Matlab simulations of algebraic-geometric codes and Reed-Solomon codes compare their bit error rate using different modulation schemes over additive white Gaussian noise channel model. Simulation results of Algebraic-geometric codes bit error rate performance using quadrature amplitude modulation (16QAM and 64QAM) are presented for the first time and shown to outperform Reed-Solomon codes at various code rates and channel models. The book proposes algebraic-geometric block turbo codes. It also presents simulation results that show an improved bit error rate performance at the cost of high system complexity due to using algebraic-geometric codes and Chase-Pyndiah’s algorithm simultaneously. The book proposes algebraic-geometric irregular block turbo codes (AG-IBTC) to reduce system complexity. Simulation results for AG-IBTCs are presented for the first time.

  11. A geometrical description of local and global anomalies

    International Nuclear Information System (INIS)

    Catenacci, R.; Pirola, G.P.

    1990-01-01

    The general topological framework for testing the possible occurrence of anomalies in gauge theories can be constructed in terms of the theory of group actions on line bundles through the introduction of a suitable group cohomology. In this Letter, we generalize this construction in such a way that it can be applied to a larger class of theories, allowing for a noncontractible configuration space and a nonconnected 'gauge' group. This construction find applications to the problem of the lifts of principal group actions. As a physical application, we compare the mechanisms of the anomalies cancelation in gauge and string theories, through a geometrical splitting of local and global anomalies. (orig.)

  12. Frequency-Domain Robust Performance Condition for Controller Uncertainty in SISO LTI Systems: A Geometric Approach

    Directory of Open Access Journals (Sweden)

    Vahid Raissi Dehkordi

    2009-01-01

    Full Text Available This paper deals with the robust performance problem of a linear time-invariant control system in the presence of robust controller uncertainty. Assuming that plant uncertainty is modeled as an additive perturbation, a geometrical approach is followed in order to find a necessary and sufficient condition for robust performance in the form of a bound on the magnitude of controller uncertainty. This frequency domain bound is derived by converting the problem into an optimization problem, whose solution is shown to be more time-efficient than a conventional structured singular value calculation. The bound on controller uncertainty can be used in controller order reduction and implementation problems.

  13. Refined geometric transition and qq-characters

    Science.gov (United States)

    Kimura, Taro; Mori, Hironori; Sugimoto, Yuji

    2018-01-01

    We show the refinement of the prescription for the geometric transition in the refined topological string theory and, as its application, discuss a possibility to describe qq-characters from the string theory point of view. Though the suggested way to operate the refined geometric transition has passed through several checks, it is additionally found in this paper that the presence of the preferred direction brings a nontrivial effect. We provide the modified formula involving this point. We then apply our prescription of the refined geometric transition to proposing the stringy description of doubly quantized Seiberg-Witten curves called qq-characters in certain cases.

  14. 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.

  15. 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

  16. The perception of geometrical structure from congruence

    Science.gov (United States)

    Lappin, Joseph S.; Wason, Thomas D.

    1989-01-01

    The principle function of vision is to measure the environment. As demonstrated by the coordination of motor actions with the positions and trajectories of moving objects in cluttered environments and by rapid recognition of solid objects in varying contexts from changing perspectives, vision provides real-time information about the geometrical structure and location of environmental objects and events. The geometric information provided by 2-D spatial displays is examined. It is proposed that the geometry of this information is best understood not within the traditional framework of perspective trigonometry, but in terms of the structure of qualitative relations defined by congruences among intrinsic geometric relations in images of surfaces. The basic concepts of this geometrical theory are outlined.

  17. 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.

  18. 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

  19. From the geometric quantization to conformal field theory

    International Nuclear Information System (INIS)

    Alekseev, A.; Shatashvili, S.

    1990-01-01

    Investigation of 2d conformal field theory in terms of geometric quantization is given. We quantize the so-called model space of the compact Lie group, Virasoro group and Kac-Moody group. In particular, we give a geometrical interpretation of the Virasoro discrete series and explain that this type of geometric quantization reproduces the chiral part of CFT (minimal models, 2d-gravity, WZNW theory). In the appendix we discuss the relation between classical (constant) r-matrices and this geometrical approach. (orig.)

  20. Tools for Teaching Mathematical Functions and Geometric Figures to Tactile Visualization through a Braille Printer for Visual Impairment People

    Directory of Open Access Journals (Sweden)

    Lorena León

    2016-04-01

    Full Text Available In this article, we showed the features and facilities offered by two new computer programs developed for the treatment and generation of geometric figures and math functions, through a Braille printer designed for visually impaired people. The programs have complete accessible features, in which users with full visual impairments can communicate with the systems via short-keys, and the speech synthesizer. The system sends sound messages that will accompanying the user during all the process to generate geometrical figures or to do a mathematical treatment. Finally, a tactile visualization displays as the results to the person with visual impairment, thus they will can complete their geometry and mathematical studies.

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

  3. 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…

  4. 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.

  5. Geometric Properties of Grassmannian Frames for and

    Directory of Open Access Journals (Sweden)

    Benedetto John J

    2006-01-01

    Full Text Available Grassmannian frames are frames satisfying a min-max correlation criterion. We translate a geometrically intuitive approach for two- and three-dimensional Euclidean space ( and into a new analytic method which is used to classify many Grassmannian frames in this setting. The method and associated algorithm decrease the maximum frame correlation, and hence give rise to the construction of specific examples of Grassmannian frames. Many of the results are known by other techniques, and even more generally, so that this paper can be viewed as tutorial. However, our analytic method is presented with the goal of developing it to address unresovled problems in -dimensional Hilbert spaces which serve as a setting for spherical codes, erasure channel modeling, and other aspects of communications theory.

  6. Geometric Methods in the Algebraic Theory of Quadratic Forms : Summer School

    CERN Document Server

    2004-01-01

    The geometric approach to the algebraic theory of quadratic forms is the study of projective quadrics over arbitrary fields. Function fields of quadrics have been central to the proofs of fundamental results since the renewal of the theory by Pfister in the 1960's. Recently, more refined geometric tools have been brought to bear on this topic, such as Chow groups and motives, and have produced remarkable advances on a number of outstanding problems. Several aspects of these new methods are addressed in this volume, which includes - an introduction to motives of quadrics by Alexander Vishik, with various applications, notably to the splitting patterns of quadratic forms under base field extensions; - papers by Oleg Izhboldin and Nikita Karpenko on Chow groups of quadrics and their stable birational equivalence, with application to the construction of fields which carry anisotropic quadratic forms of dimension 9, but none of higher dimension; - a contribution in French by Bruno Kahn which lays out a general fra...

  7. Geometric theory of fundamental interactions. Foundations of unified physics

    International Nuclear Information System (INIS)

    Pestov, A.B.

    2012-01-01

    We put forward an idea that regularities of unified physics are in a simple relation: everything in the concept of space and the concept of space in everything. With this hypothesis as a ground, a conceptual structure of a unified geometrical theory of fundamental interactions is created and deductive derivation of its main equations is produced. The formulated theory gives solution of the actual problems, provides opportunity to understand the origin and nature of physical fields, local internal symmetry, time, energy, spin, charge, confinement, dark energy and dark matter, thus conforming the existence of new physics in its unity

  8. 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.

  9. Geometric Relations for CYLEX Test Tube-Wall Motion

    Science.gov (United States)

    Hill, Larry

    2015-06-01

    The CYLinder EXpansion (CYLEX) test is a (precision, instrumented, high-purity annealed copper) pipe bomb. Its essential measured quantities are detonation speed and tube-wall motion. Its main purpose is to calibrate detonation product equations of state (EOS) by measuring how product fluid pushes metal. In its full complexity, CYLEX is an integral test, for which EOS calibration requires the entire system to be computationally modeled and compared to salient data. Stripped to its essence, CYLEX is a non-integral test for which one may perform the inverse problem, to infer the EOS directly from data. CYLEX analysis can be simplified by the fact that the test constituents achieve a steady traveling wave structure; this allows derivation of several useful geometric relationships regarding tube wall motion. The first such treatment was by G.I. Taylor. Although his analysis was limited to small wall deflection angles, he asserted that the results remain valid for arbitrary ones. I confirm this attribute and present additional useful relationships. In the past decade, CYLEX wall-motion instrumentation has migrated almost entirely from streak camera to PDV, yet discrepancies remain between the two methods. I further present geometric relationships that shed light on this issue. Work supported by the U.S. DOE.

  10. A generalization of the convex Kakeya problem

    KAUST Repository

    Ahn, Heekap

    2012-01-01

    We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be turned through 360 degrees within this region. Our main result is an optimal Θ(n log n)-time algorithm for our geometric alignment problem, when the input is a set of n line segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then the optimum placement is when the midpoints of the segments coincide. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of any rotated copy of G. © 2012 Springer-Verlag Berlin Heidelberg.

  11. 5th Dagstuhl Seminar on Geometric Modelling

    CERN Document Server

    Brunnett, Guido; Farin, Gerald; Goldman, Ron

    2004-01-01

    In 19 articles presented by leading experts in the field of geometric modelling the state-of-the-art on representing, modeling, and analyzing curves, surfaces as well as other 3-dimensional geometry is given. The range of applications include CAD/CAM-systems, computer graphics, scientific visualization, virtual reality, simulation and medical imaging. The content of this book is based on selected lectures given at a workshop held at IBFI Schloss Dagstuhl, Germany. Topics treated are: – curve and surface modelling – non-manifold modelling in CAD – multiresolution analysis of complex geometric models – surface reconstruction – variational design – computational geometry of curves and surfaces – 3D meshing – geometric modelling for scientific visualization – geometric models for biomedical applications

  12. Geometrical scaling, furry branching and minijets

    International Nuclear Information System (INIS)

    Hwa, R.C.

    1988-01-01

    Scaling properties and their violations in hadronic collisions are discussed in the framework of the geometrical branching model. Geometrical scaling supplemented by Furry branching characterizes the soft component, while the production of jets specifies the hard component. Many features of multiparticle production processes are well described by this model. 21 refs

  13. 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.

  14. 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…

  15. 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.

  16. An analysis of Landsat-4 Thematic Mapper geometric properties

    Science.gov (United States)

    Walker, R. E.; Zobrist, A. L.; Bryant, N. A.; Gohkman, B.; Friedman, S. Z.; Logan, T. L.

    1984-01-01

    Landsat-4 Thematic Mapper data of Washington, DC, Harrisburg, PA, and Salton Sea, CA were analyzed to determine geometric integrity and conformity of the data to known earth surface geometry. Several tests were performed. Intraband correlation and interband registration were investigated. No problems were observed in the intraband analysis, and aside from indications of slight misregistration between bands of the primary versus bands of the secondary focal planes, interband registration was well within the specified tolerances. A substantial number of ground control points were found and used to check the images' conformity to the Space Oblique Mercator (SOM) projection of their respective areas. The means of the residual offsets, which included nonprocessing related measurement errors, were close to the one pixel level in the two scenes examined. The Harrisburg scene residual mean was 28.38 m (0.95 pixels) with a standard deviation of 19.82 m (0.66 pixels), while the mean and standard deviation for the Salton Sea scene were 40.46 (1.35 pixels) and 30.57 m (1.02 pixels), respectively. Overall, the data were judged to be a high geometric quality with errors close to those targeted by the TM sensor design specifications.

  17. 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

  18. Implementing High-Performance Geometric Multigrid Solver with Naturally Grained Messages

    Energy Technology Data Exchange (ETDEWEB)

    Shan, H; Williams, S; Zheng, Y; Kamil, A; Yelick, K

    2015-10-26

    Structured-grid linear solvers often require manually packing and unpacking of communication data to achieve high performance.Orchestrating this process efficiently is challenging, labor-intensive, and potentially error-prone.In this paper, we explore an alternative approach that communicates the data with naturally grained messagesizes without manual packing and unpacking. This approach is the distributed analogue of shared-memory programming, taking advantage of the global addressspace in PGAS languages to provide substantial programming ease. However, its performance may suffer from the large number of small messages. We investigate theruntime support required in the UPC ++ library for this naturally grained version to close the performance gap between the two approaches and attain comparable performance at scale using the High-Performance Geometric Multgrid (HPGMG-FV) benchmark as a driver.

  19. Type II Superstring Field Theory: Geometric Approach and Operadic Description

    CERN Document Server

    Jurco, Branislav

    2013-01-01

    We outline the construction of type II superstring field theory leading to a geometric and algebraic BV master equation, analogous to Zwiebach's construction for the bosonic string. The construction uses the small Hilbert space. Elementary vertices of the non-polynomial action are described with the help of a properly formulated minimal area problem. They give rise to an infinite tower of superstring field products defining a $\\mathcal{N}=1$ generalization of a loop homotopy Lie algebra, the genus zero part generalizing a homotopy Lie algebra. Finally, we give an operadic interpretation of the construction.

  20. 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

  1. Geometric integrator for simulations in the canonical ensemble

    Energy Technology Data Exchange (ETDEWEB)

    Tapias, Diego, E-mail: diego.tapias@nucleares.unam.mx [Departamento de Física, Facultad de Ciencias, Universidad Nacional Autónoma de México, Ciudad Universitaria, Ciudad de México 04510 (Mexico); Sanders, David P., E-mail: dpsanders@ciencias.unam.mx [Departamento de Física, Facultad de Ciencias, Universidad Nacional Autónoma de México, Ciudad Universitaria, Ciudad de México 04510 (Mexico); Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (United States); Bravetti, Alessandro, E-mail: alessandro.bravetti@iimas.unam.mx [Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas, Universidad Nacional Autónoma de México, Ciudad Universitaria, Ciudad de México 04510 (Mexico)

    2016-08-28

    We introduce a geometric integrator for molecular dynamics simulations of physical systems in the canonical ensemble that preserves the invariant distribution in equations arising from the density dynamics algorithm, with any possible type of thermostat. Our integrator thus constitutes a unified framework that allows the study and comparison of different thermostats and of their influence on the equilibrium and non-equilibrium (thermo-)dynamic properties of a system. To show the validity and the generality of the integrator, we implement it with a second-order, time-reversible method and apply it to the simulation of a Lennard-Jones system with three different thermostats, obtaining good conservation of the geometrical properties and recovering the expected thermodynamic results. Moreover, to show the advantage of our geometric integrator over a non-geometric one, we compare the results with those obtained by using the non-geometric Gear integrator, which is frequently used to perform simulations in the canonical ensemble. The non-geometric integrator induces a drift in the invariant quantity, while our integrator has no such drift, thus ensuring that the system is effectively sampling the correct ensemble.

  2. Geometric integrator for simulations in the canonical ensemble

    International Nuclear Information System (INIS)

    Tapias, Diego; Sanders, David P.; Bravetti, Alessandro

    2016-01-01

    We introduce a geometric integrator for molecular dynamics simulations of physical systems in the canonical ensemble that preserves the invariant distribution in equations arising from the density dynamics algorithm, with any possible type of thermostat. Our integrator thus constitutes a unified framework that allows the study and comparison of different thermostats and of their influence on the equilibrium and non-equilibrium (thermo-)dynamic properties of a system. To show the validity and the generality of the integrator, we implement it with a second-order, time-reversible method and apply it to the simulation of a Lennard-Jones system with three different thermostats, obtaining good conservation of the geometrical properties and recovering the expected thermodynamic results. Moreover, to show the advantage of our geometric integrator over a non-geometric one, we compare the results with those obtained by using the non-geometric Gear integrator, which is frequently used to perform simulations in the canonical ensemble. The non-geometric integrator induces a drift in the invariant quantity, while our integrator has no such drift, thus ensuring that the system is effectively sampling the correct ensemble.

  3. Establishment of Imaging Spectroscopy of Nuclear Gamma-Rays based on Geometrical Optics.

    Science.gov (United States)

    Tanimori, Toru; Mizumura, Yoshitaka; Takada, Atsushi; Miyamoto, Shohei; Takemura, Taito; Kishimoto, Tetsuro; Komura, Shotaro; Kubo, Hidetoshi; Kurosawa, Shunsuke; Matsuoka, Yoshihiro; Miuchi, Kentaro; Mizumoto, Tetsuya; Nakamasu, Yuma; Nakamura, Kiseki; Parker, Joseph D; Sawano, Tatsuya; Sonoda, Shinya; Tomono, Dai; Yoshikawa, Kei

    2017-02-03

    Since the discovery of nuclear gamma-rays, its imaging has been limited to pseudo imaging, such as Compton Camera (CC) and coded mask. Pseudo imaging does not keep physical information (intensity, or brightness in Optics) along a ray, and thus is capable of no more than qualitative imaging of bright objects. To attain quantitative imaging, cameras that realize geometrical optics is essential, which would be, for nuclear MeV gammas, only possible via complete reconstruction of the Compton process. Recently we have revealed that "Electron Tracking Compton Camera" (ETCC) provides a well-defined Point Spread Function (PSF). The information of an incoming gamma is kept along a ray with the PSF and that is equivalent to geometrical optics. Here we present an imaging-spectroscopic measurement with the ETCC. Our results highlight the intrinsic difficulty with CCs in performing accurate imaging, and show that the ETCC surmounts this problem. The imaging capability also helps the ETCC suppress the noise level dramatically by ~3 orders of magnitude without a shielding structure. Furthermore, full reconstruction of Compton process with the ETCC provides spectra free of Compton edges. These results mark the first proper imaging of nuclear gammas based on the genuine geometrical optics.

  4. 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

  5. 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.

  6. Exact computation of the Voronoi Diagram of spheres in 3D, its topology and its geometric invariants

    DEFF Research Database (Denmark)

    Anton, François; Mioc, Darka; Santos, Marcelo

    2011-01-01

    In this paper, we are addressing the exact computation of the Delaunay graph (or quasi-triangulation) and the Voronoi diagram of spheres using Wu’s algorithm. Our main contribution is first a methodology for automated derivation of invariants of the Delaunay empty circumcircle predicate for spheres...... and the Voronoi vertex of four spheres, then the application of this methodology to get all geometrical invariants that intervene in this problem and the exact computation of the Delaunay graph and the Voronoi diagram of spheres. To the best of our knowledge, there does not exist a comprehensive treatment...... of the exact computation with geometrical invariants of the Delaunay graph and the Voronoi diagram of spheres. Starting from the system of equations defining the zero-dimensional algebraic set of the problem, we are following Wu’s algorithm to transform the initial system into an equivalent Wu characteristic...

  7. Computer programs simplify optical system analysis

    Science.gov (United States)

    1965-01-01

    The optical ray-trace computer program performs geometrical ray tracing. The energy-trace program calculates the relative monochromatic flux density on a specific target area. This program uses the ray-trace program as a subroutine to generate a representation of the optical system.

  8. 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

  9. Geometric phase topology in weak measurement

    Science.gov (United States)

    Samlan, C. T.; Viswanathan, Nirmal K.

    2017-12-01

    The geometric phase visualization proposed by Bhandari (R Bhandari 1997 Phys. Rep. 281 1-64) in the ellipticity-ellipse orientation basis of the polarization ellipse of light is implemented to understand the geometric aspects of weak measurement. The weak interaction of a pre-selected state, acheived via spin-Hall effect of light (SHEL), results in a spread in the polarization ellipticity (η) or ellipse orientation (χ) depending on the resulting spatial or angular shift, respectively. The post-selection leads to the projection of the η spread in the complementary χ basis results in the appearance of a geometric phase with helical phase topology in the η - χ parameter space. By representing the weak measurement on the Poincaré sphere and using Jones calculus, the complex weak value and the geometric phase topology are obtained. This deeper understanding of the weak measurement process enabled us to explore the techniques’ capabilities maximally, as demonstrated via SHEL in two examples—external reflection at glass-air interface and transmission through a tilted half-wave plate.

  10. Design and performance analysis of solid-propellant rocket motors using a simplified computer program

    Science.gov (United States)

    Sforzini, R. H.

    1972-01-01

    An analysis and a computer program are presented which represent a compromise between the more sophisticated programs using precise burning geometric relations and the textbook type of solutions. The program requires approximately 900 computer cards including a set of 20 input data cards required for a typical problem. The computer operating time for a single configuration is approximately 1 minute and 30 seconds on the IBM 360 computer. About l minute and l5 seconds of the time is compilation time so that additional configurations input at the same time require approximately 15 seconds each. The program uses approximately 11,000 words on the IBM 360. The program is written in FORTRAN 4 and is readily adaptable for use on a number of different computers: IBM 7044, IBM 7094, and Univac 1108.

  11. Optimal Layout Design using the Element Connectivity Parameterization Method: Application to Three Dimensional Geometrical Nonlinear Structures

    DEFF Research Database (Denmark)

    Yoon, Gil Ho; Joung, Young Soo; Kim, Yoon Young

    2005-01-01

    The topology design optimization of “three-dimensional geometrically-nonlinear” continuum structures is still a difficult problem not only because of its problem size but also the occurrence of unstable continuum finite elements during the design optimization. To overcome this difficulty, the ele......) stiffness matrix of continuum finite elements. Therefore, any finite element code, including commercial codes, can be readily used for the ECP implementation. The key ideas and characteristics of these methods will be presented in this paper....

  12. An integrated introduction to computer graphics and geometric modeling

    CERN Document Server

    Goldman, Ronald

    2009-01-01

    … this book may be the first book on geometric modelling that also covers computer graphics. In addition, it may be the first book on computer graphics that integrates a thorough introduction to 'freedom' curves and surfaces and to the mathematical foundations for computer graphics. … the book is well suited for an undergraduate course. … The entire book is very well presented and obviously written by a distinguished and creative researcher and educator. It certainly is a textbook I would recommend. …-Computer-Aided Design, 42, 2010… Many books concentrate on computer programming and soon beco

  13. 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...

  14. The representations of Lie groups and geometric quantizations

    International Nuclear Information System (INIS)

    Zhao Qiang

    1998-01-01

    In this paper we discuss the relation between representations of Lie groups and geometric quantizations. A series of representations of Lie groups are constructed by geometric quantization of coadjoint orbits. Particularly, all representations of compact Lie groups, holomorphic discrete series of representations and spherical representations of reductive Lie groups are constructed by geometric quantizations of elliptic and hyperbolic coadjoint orbits. (orig.)

  15. Nonadiabatic geometrical quantum gates in semiconductor quantum dots

    International Nuclear Information System (INIS)

    Solinas, Paolo; Zanghi, Nino; Zanardi, Paolo; Rossi, Fausto

    2003-01-01

    In this paper, we study the implementation of nonadiabatic geometrical quantum gates with in semiconductor quantum dots. Different quantum information enconding (manipulation) schemes exploiting excitonic degrees of freedom are discussed. By means of the Aharanov-Anandan geometrical phase, one can avoid the limitations of adiabatic schemes relying on adiabatic Berry phase; fast geometrical quantum gates can be, in principle, implemented

  16. Identifying and Fostering Higher Levels of Geometric Thinking

    Science.gov (United States)

    Škrbec, Maja; Cadež, Tatjana Hodnik

    2015-01-01

    Pierre M. Van Hiele created five levels of geometric thinking. We decided to identify the level of geometric thinking in the students in Slovenia, aged 9 to 11 years. The majority of students (60.7%) are at the transition between the zero (visual) level and the first (descriptive) level of geometric thinking. Nearly a third (31.7%) of students is…

  17. Physical principles, geometrical aspects, and locality properties of gauge field theories

    International Nuclear Information System (INIS)

    Mack, G.; Hamburg Univ.

    1981-01-01

    Gauge field theories, particularly Yang - Mills theories, are discussed at a classical level from a geometrical point of view. The introductory chapters are concentrated on physical principles and mathematical tools. The main part is devoted to locality problems in gauge field theories. Examples show that locality problems originate from two sources in pure Yang - Mills theories (without matter fields). One is topological and the other is related to the existence of degenerated field configurations of the infinitesimal holonomy groups on some extended region of space or space-time. Nondegenerate field configurations in theories with semisimple gauge groups can be analysed with the help of the concept of a local gauge. Such gauges play a central role in the discussion. (author)

  18. 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…

  19. 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.)…

  20. Riemannian geometry and geometric analysis

    CERN Document Server

    Jost, Jürgen

    2017-01-01

    This established reference work continues to provide its readers with a gateway to some of the most interesting developments in contemporary geometry. It offers insight into a wide range of topics, including fundamental concepts of Riemannian geometry, such as geodesics, connections and curvature; the basic models and tools of geometric analysis, such as harmonic functions, forms, mappings, eigenvalues, the Dirac operator and the heat flow method; as well as the most important variational principles of theoretical physics, such as Yang-Mills, Ginzburg-Landau or the nonlinear sigma model of quantum field theory. The present volume connects all these topics in a systematic geometric framework. At the same time, it equips the reader with the working tools of the field and enables her or him to delve into geometric research.  The 7th edition has been systematically reorganized and updated. Almost no page has been left unchanged. It also includes new material, for instance on symplectic geometry, as well as the B...

  1. 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

  2. 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

  3. 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.

  4. AutoCAD-To-GIFTS Translator Program

    Science.gov (United States)

    Jones, Andrew

    1989-01-01

    AutoCAD-to-GIFTS translator program, ACTOG, developed to facilitate quick generation of small finite-element models using CASA/GIFTS finite-element modeling program. Reads geometric data of drawing from Data Exchange File (DXF) used in AutoCAD and other PC-based drafting programs. Geometric entities recognized by ACTOG include points, lines, arcs, solids, three-dimensional lines, and three-dimensional faces. From this information, ACTOG creates GIFTS SRC file, which then reads into GIFTS preprocessor BULKM or modified and reads into EDITM to create finite-element model. SRC file used as is or edited for any number of uses. Written in Microsoft Quick-Basic (Version 2.0).

  5. 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...

  6. 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

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

  8. Reasoning with Paper and Pencil: The Role of Inscriptions in Student Learning of Geometric Series

    Science.gov (United States)

    Carlsen, Martin

    2009-01-01

    The purpose of this article is to analyse how students use inscriptions as tools for thinking and learning in mathematical problem-solving activities. The empirical context is that of learning about geometric series in a small group setting. What has been analysed is how students made use of inscriptions, self-made as well as those provided by…

  9. 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

  10. An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm.

    Science.gov (United States)

    Deb, Kalyanmoy; Sinha, Ankur

    2010-01-01

    Bilevel optimization problems involve two optimization tasks (upper and lower level), in which every feasible upper level solution must correspond to an optimal solution to a lower level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy developments, transportation problems, and others. However, they are commonly converted into a single level optimization problem by using an approximate solution procedure to replace the lower level optimization task. Although there exist a number of theoretical, numerical, and evolutionary optimization studies involving single-objective bilevel programming problems, not many studies look at the context of multiple conflicting objectives in each level of a bilevel programming problem. In this paper, we address certain intricate issues related to solving multi-objective bilevel programming problems, present challenging test problems, and propose a viable and hybrid evolutionary-cum-local-search based algorithm as a solution methodology. The hybrid approach performs better than a number of existing methodologies and scales well up to 40-variable difficult test problems used in this study. The population sizing and termination criteria are made self-adaptive, so that no additional parameters need to be supplied by the user. The study indicates a clear niche of evolutionary algorithms in solving such difficult problems of practical importance compared to their usual solution by a computationally expensive nested procedure. The study opens up many issues related to multi-objective bilevel programming and hopefully this study will motivate EMO and other researchers to pay more attention to this important and difficult problem solving activity.

  11. Accuracy increase of the coordinate measurement based on the model production of geometrical parts specifications

    Science.gov (United States)

    Zlatkina, O. Yu

    2018-04-01

    There is a relationship between the service properties of component parts and their geometry; therefore, to predict and control the operational characteristics of parts and machines, it is necessary to measure their geometrical specifications. In modern production, a coordinate measuring machine is the advanced measuring instrument of the products geometrical specifications. The analysis of publications has shown that during the coordinate measurements the problems of choosing locating chart of parts and coordination have not been sufficiently studied. A special role in the coordination of the part is played by the coordinate axes informational content. Informational content is the sum of the degrees of freedom limited by the elementary item of a part. The coordinate planes of a rectangular coordinate system have different informational content (three, two, and one). The coordinate axes have informational content of four, two and zero. The higher the informational content of the coordinate plane or axis, the higher its priority for reading angular and linear coordinates is. The geometrical model production of the coordinate measurements object taking into account the information content of coordinate planes and coordinate axes allows us to clearly reveal the interrelationship of the coordinates of the deviations in location, sizes and deviations of their surfaces shape. The geometrical model helps to select the optimal locating chart of parts for bringing the machine coordinate system to the part coordinate system. The article presents an algorithm the model production of geometrical specifications using the example of the piston rod of a compressor.

  12. Non-Gaussian Closed Form Solutions for Geometric Average Asian Options in the Framework of Non-Extensive Statistical Mechanics

    Directory of Open Access Journals (Sweden)

    Pan Zhao

    2018-01-01

    Full Text Available In this paper we consider pricing problems of the geometric average Asian options under a non-Gaussian model, in which the underlying stock price is driven by a process based on non-extensive statistical mechanics. The model can describe the peak and fat tail characteristics of returns. Thus, the description of underlying asset price and the pricing of options are more accurate. Moreover, using the martingale method, we obtain closed form solutions for geometric average Asian options. Furthermore, the numerical analysis shows that the model can avoid underestimating risks relative to the Black-Scholes model.

  13. Math word problems for dummies

    CERN Document Server

    Sterling, Mary Jane

    2008-01-01

    Covers percentages, probability, proportions, and moreGet a grip on all types of word problems by applying them to real lifeAre you mystified by math word problems? This easy-to-understand guide shows you how to conquer these tricky questions with a step-by-step plan for finding the right solution each and every time, no matter the kind or level of problem. From learning math lingo and performing operations to calculating formulas and writing equations, you''ll get all the skills you need to succeed!Discover how to: * Translate word problems into plain English* Brush up on basic math skills* Plug in the right operation or formula* Tackle algebraic and geometric problems* Check your answers to see if they work

  14. 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.

  15. Characteristic of bio-geometric profile of students’ posture and physical fitness in process of physical education

    Directory of Open Access Journals (Sweden)

    M.V. Dudko

    2015-08-01

    Full Text Available Purpose: to determine specific features of bio-geometric profile of posture and physical fitness of students in process of physical education. Material: 250 students were tested. Video-recording and analysis of bio-geometric profile of human posture were fulfilled. Program Torso was used for this purpose. Results: it was found out that only 15.2% of students had correct posture. The most quantity of posture abnormalities was detected in 36.4% of the tested. In sagittal plane we observed the following types of abnormalities: round back - in 24.4% of students, slouching back - in 24% of students. We found that 63.3% of students with normal posture are in zone of risk. Low backbone flexibility, mobility of hip joints and elasticity of hamstrings was detected on students. Conclusions: students with unsatisfactory bio-geometric profile of posture (scoliosis posture - 43.33%; round back - 23. 33%; slouching back - 22. 73% are in the called pre-morbid state of muscular-skeletal apparatus.

  16. Geometrical analysis of the interacting boson model

    International Nuclear Information System (INIS)

    Dieperink, A.E.L.

    1983-01-01

    The Interacting Boson Model is considered, in relation with geometrical models and the application of mean field techniques to algebraic models, in three lectures. In the first, several methods are reviewed to establish a connection between the algebraic formulation of collective nuclear properties in terms of the group SU(6) and the geometric approach. In the second lecture the geometric interpretation of new degrees of freedom that arise in the neutron-proton IBA is discussed, and in the third one some further applications of algebraic techniques to the calculation of static and dynamic collective properties are presented. (U.K.)

  17. A Geometrical View of Higgs Effective Theory

    CERN Multimedia

    CERN. Geneva

    2016-01-01

    A geometric formulation of Higgs Effective Field Theory (HEFT) is presented. Experimental observables are given in terms of geometric invariants of the scalar sigma model sector such as the curvature of the scalar field manifold M. We show how the curvature can be measured experimentally via Higgs cross-sections, W_L scattering, and the S parameter. The one-loop action of HEFT is given in terms of geometric invariants of M. The distinction between the Standard Model (SM) and HEFT is whether M is flat or curved, with the curvature a signal of the scale of new physics.

  18. Large-scale block adjustment without use of ground control points based on the compensation of geometric calibration for ZY-3 images

    Science.gov (United States)

    Yang, Bo; Wang, Mi; Xu, Wen; Li, Deren; Gong, Jianya; Pi, Yingdong

    2017-12-01

    The potential of large-scale block adjustment (BA) without ground control points (GCPs) has long been a concern among photogrammetric researchers, which is of effective guiding significance for global mapping. However, significant problems with the accuracy and efficiency of this method remain to be solved. In this study, we analyzed the effects of geometric errors on BA, and then developed a step-wise BA method to conduct integrated processing of large-scale ZY-3 satellite images without GCPs. We first pre-processed the BA data, by adopting a geometric calibration (GC) method based on the viewing-angle model to compensate for systematic errors, such that the BA input images were of good initial geometric quality. The second step was integrated BA without GCPs, in which a series of technical methods were used to solve bottleneck problems and ensure accuracy and efficiency. The BA model, based on virtual control points (VCPs), was constructed to address the rank deficiency problem caused by lack of absolute constraints. We then developed a parallel matching strategy to improve the efficiency of tie points (TPs) matching, and adopted a three-array data structure based on sparsity to relieve the storage and calculation burden of the high-order modified equation. Finally, we used the conjugate gradient method to improve the speed of solving the high-order equations. To evaluate the feasibility of the presented large-scale BA method, we conducted three experiments on real data collected by the ZY-3 satellite. The experimental results indicate that the presented method can effectively improve the geometric accuracies of ZY-3 satellite images. This study demonstrates the feasibility of large-scale mapping without GCPs.

  19. Geometric phases and hidden local gauge symmetry

    International Nuclear Information System (INIS)

    Fujikawa, Kazuo

    2005-01-01

    The analysis of geometric phases associated with level crossing is reduced to the familiar diagonalization of the Hamiltonian in the second quantized formulation. A hidden local gauge symmetry, which is associated with the arbitrariness of the phase choice of a complete orthonormal basis set, becomes explicit in this formulation (in particular, in the adiabatic approximation) and specifies physical observables. The choice of a basis set which specifies the coordinate in the functional space is arbitrary in the second quantization, and a subclass of coordinate transformations, which keeps the form of the action invariant, is recognized as the gauge symmetry. We discuss the implications of this hidden local gauge symmetry in detail by analyzing geometric phases for cyclic and noncyclic evolutions. It is shown that the hidden local symmetry provides a basic concept alternative to the notion of holonomy to analyze geometric phases and that the analysis based on the hidden local gauge symmetry leads to results consistent with the general prescription of Pancharatnam. We however note an important difference between the geometric phases for cyclic and noncyclic evolutions. We also explain a basic difference between our hidden local gauge symmetry and a gauge symmetry (or equivalence class) used by Aharonov and Anandan in their definition of generalized geometric phases

  20. 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.

  1. Geometric group theory

    CERN Document Server

    Bestvina, Mladen; Vogtmann, Karen

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

  2. A methodology for the geometric design of heat recovery steam generators applying genetic algorithms

    International Nuclear Information System (INIS)

    Durán, M. Dolores; Valdés, Manuel; Rovira, Antonio; Rincón, E.

    2013-01-01

    This paper shows how the geometric design of heat recovery steam generators (HRSG) can be achieved. The method calculates the product of the overall heat transfer coefficient (U) by the area of the heat exchange surface (A) as a function of certain thermodynamic design parameters of the HRSG. A genetic algorithm is then applied to determine the best set of geometric parameters which comply with the desired UA product and, at the same time, result in a small heat exchange area and low pressure losses in the HRSG. In order to test this method, the design was applied to the HRSG of an existing plant and the results obtained were compared with the real exchange area of the steam generator. The findings show that the methodology is sound and offers reliable results even for complex HRSG designs. -- Highlights: ► The paper shows a methodology for the geometric design of heat recovery steam generators. ► Calculates product of the overall heat transfer coefficient by heat exchange area as a function of certain HRSG thermodynamic design parameters. ► It is a complement for the thermoeconomic optimization method. ► Genetic algorithms are used for solving the optimization problem

  3. Geometric Transformations in Engineering Geometry

    Directory of Open Access Journals (Sweden)

    I. F. Borovikov

    2015-01-01

    Full Text Available Recently, for business purposes, in view of current trends and world experience in training engineers, research and faculty staff there has been a need to transform traditional courses of descriptive geometry into the course of engineering geometry in which the geometrical transformations have to become its main section. On the basis of critical analysis the paper gives suggestions to improve a presentation technique of this section both in the classroom and in academic literature, extend an application scope of geometrical transformations to solve the position and metric tasks and simulation of surfaces, as well as to design complex engineering configurations, which meet a number of pre-specified conditions.The article offers to make a number of considerable amendments to the terms and definitions used in the existing courses of descriptive geometry. It draws some conclusions and makes the appropriate proposals on feasibility of coordination in teaching the movement transformation in the courses of analytical and descriptive geometry. This will provide interdisciplinary team teaching and allow students to be convinced that a combination of analytical and graphic ways to solve geometric tasks is useful and reasonable.The traditional sections of learning courses need to be added with a theory of projective and bi-rational transformations. In terms of application simplicity and convenience it is enough to consider the central transformations when solving the applied tasks. These transformations contain a beam of sub-invariant (low-invariant straight lines on which the invariant curve induces non-involution and involution projectivities. The expediency of nonlinear transformations application is shown in the article by a specific example of geometric modeling of the interfacing surface "spar-blade".Implementation of these suggestions will contribute to a real transformation of a traditional course of descriptive geometry to the engineering geometry

  4. 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.

  5. DOA estimation for conformal vector-sensor array using geometric algebra

    Science.gov (United States)

    Meng, Tianzhen; Wu, Minjie; Yuan, Naichang

    2017-12-01

    In this paper, the problem of direction of arrival (DOA) estimation is considered in the case of multiple polarized signals impinging on the conformal electromagnetic vector-sensor array (CVA). We focus on modeling the manifold holistically by a new mathematical tool called geometric algebra. Compared with existing methods, the presented one has two main advantages. Firstly, it acquires higher resolution by preserving the orthogonality of the signal components. Secondly, it avoids the cumbersome matrix operations while performing the coordinate transformations, and therefore, has a much lower computational complexity. Simulation results are provided to demonstrate the effectiveness of the proposed algorithm.

  6. 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....

  7. Non-Markovian effect on the geometric phase of a dissipative qubit

    International Nuclear Information System (INIS)

    Chen Juanjuan; Tong Qingjun; An Junhong; Luo Honggang; Oh, C. H.

    2010-01-01

    We studied the geometric phase of a two-level atom coupled to an environment with Lorentzian spectral density. The non-Markovian effect on the geometric phase is explored analytically and numerically. In the weak coupling limit, the lowest order correction to the geometric phase is derived analytically and the general case is calculated numerically. It was found that the correction to the geometric phase is significantly large if the spectral width is small, and in this case the non-Markovian dynamics has a significant impact on the geometric phase. When the spectral width increases, the correction to the geometric phase becomes negligible, which shows the robustness of the geometric phase to the environmental white noises. The result is significant to the quantum information processing based on the geometric phase.

  8. 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.

  9. Correcting geometric and photometric distortion of document images on a smartphone

    Science.gov (United States)

    Simon, Christian; Williem; Park, In Kyu

    2015-01-01

    A set of document image processing algorithms for improving the optical character recognition (OCR) capability of smartphone applications is presented. The scope of the problem covers the geometric and photometric distortion correction of document images. The proposed framework was developed to satisfy industrial requirements. It is implemented on an off-the-shelf smartphone with limited resources in terms of speed and memory. Geometric distortions, i.e., skew and perspective distortion, are corrected by sending horizontal and vertical vanishing points toward infinity in a downsampled image. Photometric distortion includes image degradation from moiré pattern noise and specular highlights. Moiré pattern noise is removed using low-pass filters with different sizes independently applied to the background and text region. The contrast of the text in a specular highlighted area is enhanced by locally enlarging the intensity difference between the background and text while the noise is suppressed. Intensive experiments indicate that the proposed methods show a consistent and robust performance on a smartphone with a runtime of less than 1 s.

  10. 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.

  11. Some Hermite–Hadamard Type Inequalities for Geometrically Quasi ...

    Indian Academy of Sciences (India)

    Abstract. In the paper, we introduce a new concept 'geometrically quasi-convex function' and establish some Hermite–Hadamard type inequalities for functions whose derivatives are of geometric quasi-convexity.

  12. 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.

  13. Geometric Hypergraph Learning for Visual Tracking

    OpenAIRE

    Du, Dawei; Qi, Honggang; Wen, Longyin; Tian, Qi; Huang, Qingming; Lyu, Siwei

    2016-01-01

    Graph based representation is widely used in visual tracking field by finding correct correspondences between target parts in consecutive frames. However, most graph based trackers consider pairwise geometric relations between local parts. They do not make full use of the target's intrinsic structure, thereby making the representation easily disturbed by errors in pairwise affinities when large deformation and occlusion occur. In this paper, we propose a geometric hypergraph learning based tr...

  14. Sparse geometric graphs with small dilation

    NARCIS (Netherlands)

    Aronov, B.; Berg, de M.; Cheong, O.; Gudmundsson, J.; Haverkort, H.J.; Vigneron, A.; Deng, X.; Du, D.

    2005-01-01

    Given a set S of n points in the plane, and an integer k such that 0 = k geometric graph with vertex set S, at most n – 1 + k edges, and dilation O(n / (k + 1)) can be computed in time O(n log n). We also construct n–point sets for which any geometric graph with n – 1 + k edges

  15. 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

  16. Solving Absolute Value Equations Algebraically and Geometrically

    Science.gov (United States)

    Shiyuan, Wei

    2005-01-01

    The way in which students can improve their comprehension by understanding the geometrical meaning of algebraic equations or solving algebraic equation geometrically is described. Students can experiment with the conditions of the absolute value equation presented, for an interesting way to form an overall understanding of the concept.

  17. 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

  18. 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.)

  19. Quasirandom geometric networks from low-discrepancy sequences

    Science.gov (United States)

    Estrada, Ernesto

    2017-08-01

    We define quasirandom geometric networks using low-discrepancy sequences, such as Halton, Sobol, and Niederreiter. The networks are built in d dimensions by considering the d -tuples of digits generated by these sequences as the coordinates of the vertices of the networks in a d -dimensional Id unit hypercube. Then, two vertices are connected by an edge if they are at a distance smaller than a connection radius. We investigate computationally 11 network-theoretic properties of two-dimensional quasirandom networks and compare them with analogous random geometric networks. We also study their degree distribution and their spectral density distributions. We conclude from this intensive computational study that in terms of the uniformity of the distribution of the vertices in the unit square, the quasirandom networks look more random than the random geometric networks. We include an analysis of potential strategies for generating higher-dimensional quasirandom networks, where it is know that some of the low-discrepancy sequences are highly correlated. In this respect, we conclude that up to dimension 20, the use of scrambling, skipping and leaping strategies generate quasirandom networks with the desired properties of uniformity. Finally, we consider a diffusive process taking place on the nodes and edges of the quasirandom and random geometric graphs. We show that the diffusion time is shorter in the quasirandom graphs as a consequence of their larger structural homogeneity. In the random geometric graphs the diffusion produces clusters of concentration that make the process more slow. Such clusters are a direct consequence of the heterogeneous and irregular distribution of the nodes in the unit square in which the generation of random geometric graphs is based on.

  20. Geometric convergence of some two-point Pade approximations

    International Nuclear Information System (INIS)

    Nemeth, G.

    1983-01-01

    The geometric convergences of some two-point Pade approximations are investigated on the real positive axis and on certain infinite sets of the complex plane. Some theorems concerning the geometric convergence of Pade approximations are proved, and bounds on geometric convergence rates are given. The results may be interesting considering the applications both in numerical computations and in approximation theory. As a specific case, the numerical calculations connected with the plasma dispersion function may be performed. (D.Gy.)