Academic literature on the topic 'Strategies to solve geometric problems'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Strategies to solve geometric problems.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Strategies to solve geometric problems"
1
Eker, Barış, and H. Levent Akın. "Using evolution strategies to solve DEC-POMDP problems." Soft Computing 14, no. 1 (December 9, 2008): 35–47. http://dx.doi.org/10.1007/s00500-008-0388-7.
Full text
2
Lin, Ming Hua, and Jung Fa Tsai. "Optimal Design of a Speed Reducer." Applied Mechanics and Materials 376 (August 2013): 327–30. http://dx.doi.org/10.4028/www.scientific.net/amm.376.327.
Full textAbstract:
The mathematical model for optimal design of a speed reducer is a generalized geometric programming problem that is non-convex and not easy be globally solved. This paper applies a deterministic approach including convexification strategies and piecewise linearization techniques to globally solve speed reducer design problems. A practical speed reducer design problem is solved to demonstrate that this study obtains a better solution than other methods.
3
Pangastuti, Ratna. "Media Puzzle untuk Mengenal Bentuk Geometri." JECED : Journal of Early Childhood Education and Development 1, no. 1 (December 27, 2019): 50–59. http://dx.doi.org/10.15642/jeced.v1i1.496.
Full textAbstract:
Learning media are all things that can be used to channel learning materials so that they can stimulate the attention, interests, thoughts and feelings of students (students) in learning activities to achieve certain learning goals. Learning media is a tool or other material that provides a complete form of information and can support the teaching and learning process. Learning in the introduction of geometric shapes in early childhood really requires appropriate learning strategies and media, so to maximize the child's ability to introduce geometric shapes can use puzzle media. Compiling geometric shapes puzzles can improve cognitive for children. Cognitive skills (cognitive skills) associated with the ability to learn and solve problems in children. Moreover, it can improve social skills for children. By using the content analysis method and the study documentation, this research tries to describe the puzzle media to introduce geometric shapes to early childhood
4
Kochikov, Igor V., Svetlana A. Sharapova, Anatoly G. Yagola, and Alexander V. Tikhonravov. "Correlation of errors in inverse problems of optical coatings monitoring." Journal of Inverse and Ill-posed Problems 28, no. 6 (December 1, 2020): 915–21. http://dx.doi.org/10.1515/jiip-2020-0079.
Full textAbstract:
AbstractOn-line optical monitoring of multilayer coating production requires solving inverse identification problems of determining the thicknesses of coating layers. Regardless of the algorithm used to solve inverse problems, the errors in the thicknesses of the deposited layers are correlated by the monitoring procedure. Studying the correlation of thickness errors is important for the production of the most complex optical coatings. We develop a general geometric approach to study this correlation. It is based on a statistical analysis of large numbers of error vectors obtained during computational experiments on optical coating production. The application of the proposed approach is demonstrated using computational manufacturing experiments on the production of a 50-layer filter with four different monitoring strategies. A special coefficient is introduced to evaluate the strength of the error correlation effect. The results obtained confirm that the introduced parameter can be used as a measure of the strength of the correlation effect in practical applications.
5
Yang, Feng Wei, Chandrasekhar Venkataraman, Vanessa Styles, and Anotida Madzvamuse. "A Robust and Efficient Adaptive Multigrid Solver for the Optimal Control of Phase Field Formulations of Geometric Evolution Laws." Communications in Computational Physics 21, no. 1 (December 5, 2016): 65–92. http://dx.doi.org/10.4208/cicp.240715.080716a.
Full textAbstract:
AbstractWe propose and investigate a novel solution strategy to efficiently and accurately compute approximate solutions to semilinear optimal control problems, focusing on the optimal control of phase field formulations of geometric evolution laws. The optimal control of geometric evolution laws arises in a number of applications in fields including material science, image processing, tumour growth and cell motility. Despite this, many open problems remain in the analysis and approximation of such problems. In the current work we focus on a phase field formulation of the optimal control problem, hence exploiting the well developed mathematical theory for the optimal control of semilinear parabolic partial differential equations. Approximation of the resulting optimal control problemis computationally challenging, requiring massive amounts of computational time and memory storage. The main focus of this work is to propose, derive, implement and test an efficient solution method for such problems. The solver for the discretised partial differential equations is based upon a geometric multigrid method incorporating advanced techniques to deal with the nonlinearities in the problem and utilising adaptive mesh refinement. An in-house two-grid solution strategy for the forward and adjoint problems, that significantly reduces memory requirements and CPU time, is proposed and investigated computationally. Furthermore, parallelisation as well as an adaptive-step gradient update for the control are employed to further improve efficiency. Along with a detailed description of our proposed solution method together with its implementation we present a number of computational results that demonstrate and evaluate our algorithms with respect to accuracy and efficiency. A highlight of the present work is simulation results on the optimal control of phase field formulations of geometric evolution laws in 3-D which would be computationally infeasible without the solution strategies proposed in the present work.
6
Evidiasari, Serli, Subanji Subanji, and Santi Irawati. "Students’ Spatial Reasoning in Solving Geometrical Transformation Problems." Indonesian Journal on Learning and Advanced Education (IJOLAE) 1, no. 2 (August 29, 2019): 38–51. http://dx.doi.org/10.23917/ijolae.v1i2.8703.
Full textAbstract:
This study describes spatial reasoning of senior high school students in solving geometrical transformation problems. Spatial reasoning consists of three aspects: spatial visualization, mental rotation, and spatial orientation. The approach that is used in this study is descriptive qualitative. Data resource is the test result of reflection, translation, and rotation problems then continued by interview. Collecting data process involves 35 students. They are grouped to three spatial reasoning aspects then selected one respondent to be the most dominant of each aspect. The results of this study are: (1) the students with spatial visualization aspect used drawing strategy and non-spatial strategy in solving geometrical transformation problems. She transformed every vertex of the object and drew assistance lines which connect every vertex of the object to center point; (2) the students with mental rotation aspect used holistic and analytic strategies in solving geometrical transformation problems. Using holistic strategy means imagining the whole of transformational objects to solve easy problems. While using analytic strategy means transforming some components of objects to solve hard problems; (3) the students with spatial orientation didn’t involve mental imagery and she only could determine the position and orientation of the object in solving geometrical transformation problems
7
Rufai, Mufutau Ajani, and Higinio Ramos. "Numerical Solution for Singular Boundary Value Problems Using a Pair of Hybrid Nyström Techniques." Axioms 10, no. 3 (August 25, 2021): 202. http://dx.doi.org/10.3390/axioms10030202.
Full textAbstract:
This manuscript presents an efficient pair of hybrid Nyström techniques to solve second-order Lane–Emden singular boundary value problems directly. One of the proposed strategies uses three off-step points. The obtained formulas are paired with an appropriate set of formulas implemented for the first step to avoid singularity at the left end of the integration interval. The fundamental properties of the proposed scheme are analyzed. Some test problems, including chemical kinetics and physical model problems, are solved numerically to determine the efficiency and validity of the proposed approach.
8
Xu, Xinlin, Zhongbo Hu, Qinghua Su, and Zenggang Xiong. "Multiobjective Collective Decision Optimization Algorithm for Economic Emission Dispatch Problem." Complexity 2018 (November 13, 2018): 1–20. http://dx.doi.org/10.1155/2018/1027193.
Full textAbstract:
The collective decision optimization algorithm (CDOA) is a new stochastic population-based evolutionary algorithm which simulates the decision behavior of human. In this paper, a multiobjective collective decision optimization algorithm (MOCDOA) is first proposed to solve the environmental/economic dispatch (EED) problem. MOCDOA uses three novel learning strategies, that is, a leader-updating strategy based on the maximum distance of each solution in an external archive, a wise random perturbation strategy based on the sparse mark around a leader, and a geometric center-updating strategy based on an extreme point. The proposed three learning strategies benefit the improvement of the uniformity and the diversity of Pareto optimal solutions. Several experiments have been carried out on the IEEE 30-bus 6-unit test system and 10-unit test system to investigate the performance of MOCDOA. In terms of extreme solutions, compromise solution, and three metrics (SP, HV, and CM), MOCDOA is compared with other existing multiobjective optimization algorithms. It is demonstrated that MOCDOA can generate the well-distributed and the high-quality Pareto optimal solutions for the EED problem and has the potential to solve the multiobjective optimization problems of other power systems.
9
Ma, Chaoqun, Hui Wu, and Xiang Lin. "Nonzero-Sum Stochastic Differential Portfolio Games under a Markovian Regime Switching Model." Mathematical Problems in Engineering 2015 (2015): 1–18. http://dx.doi.org/10.1155/2015/738181.
Full textAbstract:
We consider a nonzero-sum stochastic differential portfolio game problem in a continuous-time Markov regime switching environment when the price dynamics of the risky assets are governed by a Markov-modulated geometric Brownian motion (GBM). The market parameters, including the bank interest rate and the appreciation and volatility rates of the risky assets, switch over time according to a continuous-time Markov chain. We formulate the nonzero-sum stochastic differential portfolio game problem as two utility maximization problems of the sum process between two investors’ terminal wealth. We derive a pair of regime switching Hamilton-Jacobi-Bellman (HJB) equations and two systems of coupled HJB equations at different regimes. We obtain explicit optimal portfolio strategies and Feynman-Kac representations of the two value functions. Furthermore, we solve the system of coupled HJB equations explicitly in a special case where there are only two states in the Markov chain. Finally we provide comparative statics and numerical simulation analysis of optimal portfolio strategies and investigate the impact of regime switching on optimal portfolio strategies.
10
Qiao, H., B. S. Dalay, and R. M. Parkin. "Fine Motion Strategies for Robotic Peg-Hole Insertion." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 209, no. 6 (November 1995): 429–48. http://dx.doi.org/10.1243/pime_proc_1995_209_173_02.
Full textAbstract:
The robotic assembly operation has a prominent role in industry due to the fact that (a) it accounts for a substantial proportion of production cycle times and (b) it requires high precision. The peg-hole insertion operation, which is a simplified industrial application model, has special prominence. In terms of the hardware, various complex six-component force sensors, passive compliance and vibration systems have been designed for this purpose alone. In the control area, the disturbance filter and real-time control have been applied to the system to enhance performance. Techniques using geometric concepts such as pre-images and back-projections, models of the contact configurations, pattern recognition and fine motion analysis have been studied. The objective of this paper is to illustrate a method that combines these ideas together to solve practical problems. In this paper: 1. General contact configurations and contact motions between the peg and hole are presented. 2. An important problem in the identification of the contact configuration according to the force sensors is studied. It is concluded that the complete identification of the contact configuration should depend not only on the signals from the force sensors but also on the knowledge about the range of the initial state of the peg and clever utilization of the environment. 3. Various strategies with and without force sensors are proposed. Motion and model analysis is used to study the general identification and motion problems in the peg-hole insertion system. Pre-image and back-projection concepts are employed to enable practical implementation of the method which used Petri nets. Selecting the configuration parameters that can be (a) easily measured and (b) used to decide the incremental motion steps through the procedure were found to be complex and critical tasks that enabled success. These strategies have been verified through experimental trials. It is apparent that the fine motion strategy has a wide application in the robotic peg-hole insertion operation.
Dissertations / Theses on the topic "Strategies to solve geometric problems"
1
Costa, Aline Alves. "Estratégias adotadas para a resolução de problemas geométricos : o caso dos alunos dos anos finais do ensino fundamental da rede municipal de Aracaju." Universidade Federal de Sergipe, 2014. https://ri.ufs.br/handle/riufs/5151.
Full textAbstract:
This paper presents the results of an investigation that aimed to analyze the strategies adopted by Aracajunian students of final year of elementary school to solving geometric problems. For this, we turn to problems taken from the books of |The Conquest Collection of Mathematics| authored by Giovanni Jr and Castrucci (2009) to develop an instrument that was initially applied to the students of 7th to 9th grades four municipal schools. After an examination of the responses submitted, a script was prepared to conduct semi-structured interviews with individuals who had different strategies through the first instrument collection. The theoretical assumptions were taken primarily from Polya (1978) for the understanding of mathematical problem geometric, their typology and possible resolution procedures. According to the examination of Polya (1978), a geometric problem characterized by ordering the contents geometry to solve it. The types of mathematical problems, according to the author can be classified from the utterance as routine, practical, and puzzle heuristic, and also for its solution are forms of determination and demonstration. Strategies to solve geometric problems highlighted in the book |The Art of Problem Solving| are using notation and formulas, as well as idealization or making figures. The results indicate that students have to geometrical problems responses, all three types by means of figures and then through arithmetic strategy. Records and algebraic strategies do not occur to students of Year 7, students are tentatively expressed by the following year and begin to gain prominence in the 9th grade classes. Students of years the different elementary school to solve routine problems similar to position geometry, in general, do not get the same success in the resolution, and the classes of 9th grade using guaranteed geometric strategy, while classes of Year 7, even if they have auxiliary notations demonstrate not feel secure about your solution, because their calculations up to justify their answers. Practical issues, applied to students in Year 7, related to the area have been resolved through the notion of perimeter, since the 8th grade students had good understanding of the concepts related to angles. In both cases there is a strong presence of geometric and arithmetic strategies. In short the figures are an important resource for these students develop their strategies with greater freedom of exposition, because through them, takes the stimulus to creativity and exercise for the establishment of solution plans.O presente trabalho apresenta os resultados de uma investigação que teve como objetivo analisar as estratégias adotadas pelos alunos aracajuanos dos anos finais do ensino fundamental para resolução de problemas geométricos. Para isso, recorremos à problemas retirados dos livros da Coleção A Conquista da Matemática de autoria de Giovanni Jr e Castrucci (2009) para elaborar o instrumento que foi aplicado inicialmente aos alunos de 7º ao 9º anos de quatro escolas municipais. Após um exame das respostas apresentadas, foi elaborado um roteiro para realizar entrevistas semiestruturadas com os sujeitos que apresentaram estratégias diferenciadas por meio do primeiro instrumento de coleta. Os pressupostos teóricos foram tomados basicamente de Polya (1978) para o entendimento sobre problema matemático geométrico, sua tipologia e os possíveis procedimentos de resolução. De acordo com o exame de Polya (1978), um problema geométrico caracteriza-se por requisitar conteúdo da Geometria para resolvê-lo. Os tipos de problemas matemáticos, de acordo com o referido autor podem ser classificados a partir do enunciado como rotineiro, prático, enigma e heurístico, e também pela sua solução que são das formas determinação e demonstração. As estratégias para resolver problemas geométricos evidenciadas na obra A Arte de Resolver Problemas são uso de notação e de fórmulas, como também idealização ou confecção de figuras. Os resultados da pesquisa indicam que os alunos apresentam respostas aos problemas geométricos, de todos os três tipos, por meio de figuras e em seguida por meio de estratégia aritmética. Os registros e estratégias algébricas não ocorrem aos alunos de 7º ano, se expressam timidamente pelos alunos do ano sucessivo e começam a ganhar destaque nas turmas de 9º ano. Alunos de diferentes anos do ensino fundamental ao resolverem problema rotineiro similar sobre geometria de posição, em geral, não obtêm o mesmo sucesso na resolução, sendo que as turmas de 9º ano utilizam com garantia a estratégia geométrica, enquanto as turmas do 7º ano, ainda que disponham de notações auxiliares, demonstram não se sentir seguros sobre sua solução, pois apresentam até cálculos para justificar suas respostas. Os problemas práticos, aplicados a alunos de 7º ano, relacionados a área foram solucionados através da noção de perímetro, já os alunos de 8º ano, apresentam boa compreensão dos conceitos relacionados a ângulos. Em ambos os casos há forte presença de estratégias aritméticas e geométricas. Em suma as figuras constituem um importante recurso para esses alunos desenvolverem suas estratégias com maior liberdade de exposição, pois através delas, se dá o estímulo para a criatividade e o exercício para o estabelecimento de planos de solução.
2
Cranfield, Corvell George. "An investigation into how Grade 12 students understand and solve Geometric problems." Master's thesis, University of Cape Town, 2001. http://hdl.handle.net/11427/10305.
Full textAbstract:
Bibliography: leaves 104-108.This study investigates how grade 12 students understand and solve geometric problems. A review of the literature on "how students learn and understand geometry" is used to develop a conceptual framework for discussion. The framework is used to assess students' level of understanding and to analyse their difficulties in solving geometric problems. The study was conducted at four low achieving schools in mathematics (based on student performance in the South African Senior Certificate Examination). It involved 267 students across the schools. The students' level of understanding was assessed through the use of two tests. These tests were designed to cover 80% of the grade 11 syllabus and involved the testing of a terminology framework (test 1) and problem solving exercises (test 2). Test 1 included 10 items were students were asked to complete statements, as well as 9 items where students were asked to write down properties from given sketches. Test 2 included 16 items of true or false responses.
3
Montero, Elisabeth. "Calibration strategies for bio-inspired population-based algorithms that solve combinatorial optimization problems." Nice, 2011. http://www.theses.fr/2011NICE4040.
Full textAbstract:
La sélection de valeurs adéquates pour les paramètres des algorithmes bio-inspirés est un processus crucial pour obtenir de bonnes performances. C’est un processus complexe étant donné que les valeurs des paramètres dépendent en général du problème que l’on cherche à résoudre. Il est de plus très coûteux en temps, et les paramètres ne sont pas complètement indépendants entre eux. La première contribution de cette thèse consiste en une étude comparative des caractéristiques et performances des différentes méthodes connues dans la littérature pour ajuster les paramètres, en analysant leurs avantages et leurs inconvénients. Le plus grand désavantage de ces méthodes est qu’elles sont très coûteuses en temps. Cependant, elles permettent d’obtenir de bonnes estimations pour les paramètres, en concentrant la recherche dans des régions statistiquement prometteuses. Nous présentons de plus une analyse du potentiel de ces techniques en tant qu’aide dans le processus de conception d’algorithmes évolutifs. Même si ces techniques aident à prendre des décisions quant à la conception de l’algorithme, elles ne sont pas capables d’éliminer de l’algorithme les éléments qui ne contribuent pas à son bon fonctionnement. La contribution principale de la thèse se situe sur la capacité de déterminer les valeurs des paramètres à la volée. Nous proposons deux nouvelles méthodes pour améliorer les performances des algorithmes évolutifs : Ac et Sac. Ac réalise un contrôle de la population dans lequel un opérateur reçoit une récompense en fonction de l’amélioration de performance issue de son application. Sac est quant à lui orienté à un contrôle individuel dans lequel le taux d’un opérateur qui correspond à un individu dépend de l’efficacité qu’a eue cet opérateur dans l’amélioration des générations précédentes. Ces deux méthodes peuvent être incorporées sans introduire un coût significatif, et sans changement important dans la conception d’origine de l’algorithme. Les décisions prises durant la recherche se basent ainsi sur les informations disponibles sur le comportement passé, à partir d’un processus permettant à l’algorithme d’effectuer des changements de valeurs de paramètres qu’il juge nécessaires. L’application de ces techniques a permis à l’algorithme d’éliminer des composants non nécessaires à sa recherche, grâce à une utilisation minimale de ceux-ci. Nous proposons également la stratégie (C,n)-strategy connue pour réaliser un contrôle dans l’algorithme immunitaire CLONAG, permettant de réduire en bonne partie le nombre de paramètres sur lesquels repose son exécution, ainsi que d’améliorer son comportement grâce à la modification à la volée du nombre de cellules sélectionnées pour le clonage, ainsi que le nombre de clones produits. Les techniques appliquées à l’algorithme évolutif, comme celle appliquée à l’algorithme immunitaire cherchent un équilibre entre l’exploration et l’exploitation de l’espace de recherche en utilisant les paramètres sélectionnés pour réaliser le contrôle. A partir du travail réalisé dans cette thèse, nous pouvons conclure que les techniques d’ajustement des paramètres permettent effectivement de trouver un ensemble de valeurs des paramètres qui offre une bonne performance de l’algorithme de recherche. Ces techniques demandent une analyse antérieure de la définition de l’espace de recherche pour les valeurs des paramètres, et requièrent de plus un temps d‘exécution considérable. Néanmoins, à partir des informations données par ces techniques d’ajustement, il est possible de prendre des décisions concernant la conception de l’algorithme que l’on veut ajuster. En ce qui concerne les techniques de contrôle de paramètres, nous pouvons conclure qu’elles permettent d’améliorer l’efficacité de l’algorithme et de réduire l’effort d’ajustement des paramètres car elles réduisent le nombre de paramètres à ajuster, qu’elles sont capables d’ajuster automatiquement les paramètres de l’algorithme sans modifier la conception d’origine de l’algorithme, et enfin, qu’elles ajoutent une quantité minime de paramètres additionnels à l’algorithme. Le développement de techniques capables de travailler avec n’importe quel type de paramètres demandant une définition de l’information d’entrée et qui soient capables de stopper à temps la recherche afin de ne pas perdre de ressources, reste un terme de recherche ouvert. Nous avons montré dans cette thèse qu’il est possible de réaliser un contrôle à la volée des paramètres des algorithmes basés sur des populations. Une perspective de recherche intéressante consiste à arriver à automatiser l’identification du rôle des composants de l’algorithme afin de pouvoir concevoir automatiquement les stratégies de contrôleSelection of proper values for parameters of bio-inspired algorithms is crucial to get good performance. To find these values is a complex process because parameter values depend on the problem that is being solved. Moreover, it is a high time consuming task and parameters are interrelated values. The first contribution of this thesis is the comparative study of features and performance of some automated parameter tuning methods. Advantages and disadvantages of these methods were identified. The main disadvantage of tuning methods is that they are high consuming time process. These methods search for parameters values focusing on statistically promising areas of the parameters search space. We also present an analysis of the potential of using these techniques to support the design process of evolutionary algorithms. In most cases, tuning methods are not able to discard elements that do not contribute to their operation. The main contribution of this thesis is related to the ability of varying parameter values during the execution of the algorithm. These kinds of approaches are known as parameter control methods. Two methods are proposed in this thesis for improving the performance of evolutionary algorithms by controlling its operators rates : Ac and Sac. Ac works in a population level rewarding operators that perfom good transformations during the iteration and punishing the others. Sac works in an individual level rewarding or punishing operators according to the performance of their applications in each individual. These both control methods can be incorporated to the evolutionary algorithm without introducing a meaningful cost in terms of time and without changing the original structure of the evolutionary algorithm. Variations of parameter values are based on current and past information about the operators performance. The incorporation of these techniques allows the algorithm to decide when and how much use each operator during the search process. Moreover, we propose the (C,n)-strategy for the CLONALG artificial immune system. In this case we control the amount of selected cells and clones produced in each iteration. The application of our control method allows us to reduce the amount of parameters to tune for the algorithm. Our control technique is able to manage the relationship between intensification and diversification stages of the search by varying the values of these parameters. From this work, we can conclude that parameter tuning techniques are able to find parameter values that show a good performance on the tuned algorithm. Most of these techniques require a previous analysis of the parameter search spaces and, in general, they require a considerable amount time. However, they can be able to make decisions about the design of the evolutionary algorithm. About the incorporation of parameter control strategies, we can conclude that it is possible to improve the efficiency of the algorithm, reducing the tuning effort by decreasing the number of parameters of tune. It is possible to vary parameter values during the search without changing the original design of the algorithm. Finally, the proposed techniques add a minimum amount of easily tunable new parameters. The development of tuning techniques able to work with any kind of parameters and capable to determine proper stopping criteria in order to do not waste resources is still an open research area. In this thesis we have shown that it is possible to perform on-line parameter variation in population-based algorithms. One interesting point of research is the automatic identification of the role of different components of the algorithm in order to automatize the design process of parameter control strategies
4
Bailey, Jodie Angela. "Strategies Used by Grade 4 Students to Solve Three-Digit Addition and Subtraction Problems of Varying Format." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1366149600.
Full text
5
Lopez, Lurdes. "HELPING AT-RISK STUDENTS SOLVE MATHEMATICAL WORD PROBLEMS THROUGH THE USE OF DIRECT INSTRUCTION AND PROBLEM SOLVING STRATEGIES." Master's thesis, University of Central Florida, 2008. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3193.
Full textAbstract:
This action research study examined the influence mathematical strategies had on middle school students' mathematical ability. The purpose of this action research study was to observe students mathematical abilities and to investigate whether teaching students problem-solving strategies in mathematics will enhance student's mathematical thinking and their ability to comprehend and solve word problems. The study took place in an urban school in Orlando, Florida in the fall of 2004. The subjects will be 12 eighth grade students assigned to my intensive math class. Quantitative data was collected. Students' took a pre and post test designed to measure and give students practice on mathematical skills. Students worked individually on practice problems, answered questions daily in their problem solving notebook and mathematics journals. Results showed the effectiveness of the use of direct instruction and problem-solving strategies on at-risk students. M.Ed.
Other
Graduate Studies;
K-8 Math and Science MEd
6
Chang, Ching-Hsuan, and 張景軒. "The strategies of solving linear classical geometric problems." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/04112233438789248132.
Full textAbstract:
碩士中原大學
應用數學研究所
104
“Proof question” is the most difficult topic for teachers to teach in high school mathematics classes; and this is proved the most insufficient training for students nowadays. To compare to other topics, "proof question” is less interesting; however, students can be trained effectively to think logically and to inspire their observation skills and imagination by solving proof questions. The topic of this study is based on the plane geometry of ninth grade in junior high schools and takes the proof of plane geometry into consideration. The topic of this study: What are the strategies for solving proof questions of linear classical geometric? According to the topic of this study, there are several ways to solve the question are: “extensive midline, graphics features, auxiliary circle, graphic cut edges and corners.” With these strategies, the proof questions can be solved step by step. A decent knowledge is a prerequisite for solving any proof questions; in addition, proof questions usually have various solutions. The more solutions can be thought of when students have more experience. Importantly, teachers are also required to observe students’ ideas and reaction and give appropriate hints for students to think and learn. By having a broader vision given by the teachers, students’ way of thinking and development will be limited less. Overall, these strategies and techniques are specifically for straight geometric proofs, not applicable for any other kinds of questions. With these strategies skills, students can reach the objective of the requirement of nine-year integrated mathematics courses on the topic of Geometric: To understand the significance of proof.
7
Guo, Jen-Ning, and 郭鎮寧. "The Strategies of Solving Geometric Proof Problems of Circles." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/rvb4ba.
Full textAbstract:
碩士中原大學
應用數學研究所
105
Geometry is always the most difficult problem which junior high school students encounter.Students even feel frustrated and may give up learning especially when facing the chapter of circle. As excellent educators, what we need to do is not only to observe the learning situation of the students but also to build up their ability of drawing and thinking about geometry, leading them how to deal with problems. The topic of the research is based on the Unit Two “Circle” of the ninth grader of junior high school. It aims to how to clarify the related questions, how to analyze the problem-solving strategies and how to instruct the students to figure out the problems. The purpose of the study is as follows: (a) The students know how to figure out the problems step by step and estabish the ability to write out the solutions of the proof questions. (b) The students have the ability to apply the geometric thinking to the related ideas about circle. (c) The students have the ability to extend the prove by using the result of the prove. (d) The students can understand the related properties of congruent circles and concyclic. The study only focuses on how to provide the problem-solving strategies by using the proof of congruent circles and concyclic. In teaching, it’s important to build up the prerequisite knowledge, guide the students to think by using the way of the proof of the fragment and build up the problem- solving strategies. So that we can achieve the inferential capability and the linking ability of the core competencies of the junior high school mathematics curriculum guidelines.
8
Wu, Hsinhui. "Difficulty of and strategies used to solve two-step change word problems." 1994. http://catalog.hathitrust.org/api/volumes/oclc/32058265.html.
Full text
9
Costa, Gabriel Faria da. "Assessment in Pediatrics Clerkships: Impact of strategies to solve item-sharing problems." Dissertação, 2017. https://repositorio-aberto.up.pt/handle/10216/104203.
Full text
10
Costa, Gabriel Faria Da. "Assessment in Pediatrics Clerkships: Impact of strategies to solve item-sharing problems." Master's thesis, 2017. https://hdl.handle.net/10216/104203.
Full textBooks on the topic "Strategies to solve geometric problems"
1
Cascini, Gaetano, ed. TRIZ Future Conference 2004. Florence: Firenze University Press, 2004. http://dx.doi.org/10.36253/88-8453-220-5.
Full textAbstract:
TRIZ the Theory of Inventive Problem Solving is a living science and a practical methodology: millions of patents have been examined to look for principles of innovation and patterns of excellence. Large and small companies are using TRIZ to solve problems and to develop strategies for future technologies. The TRIZ Future Conference is the annual meeting of the European TRIZ Association, with contributions from everywhere in the world. The aims of the 2004 edition are the integration of TRIZ with other methodologies and the dissemination of systematic innovation practices even through SMEs: a broad spectrum of subjects in several fields debated with experts, practitioners and TRIZ newcomers.
2
Caskey, Bill. The Death of Persuasion: Essential Strategies to Solve the Most Painful Problems in Sales. Winpoint Publishing, 2004.
Find full text
3
Holliday, Micki. Coaching, Mentoring, and Managing: Breakthrough Strategies to Solve Performance Problems and Build Winning Teams. 2nd ed. Career Press, 2001.
Find full text
4
Kiesewetter, Benjamin. Bootstrapping and Other Detachment Problems. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198754282.003.0004.
Full textAbstract:
Chapter 4 discusses the problem that a normative understanding of structural requirements of rationality seems to allow for the detachment of unacceptable conclusions about what we ought or have reason to do. The chapter begins by illustrating the ‘bootstrapping problem’ that occurs when we take the relevant requirements to have narrow scope (4.1), and then discusses and rejects two strategies to solve this problem: the reasons strategy (4.2), and the subjective ‘ought’ strategy (4.3). A third, and more promising, strategy is presented, which blocks bootstrapping by taking structural requirements of rationality to have wide scope (4.4). The remainder of the chapter examines further detachment problems that arise when the wide-scope account is combined with independent principles about the transmission of reasons and ‘oughts’ (4.5–4.7). The conclusion is that the wide-scope account ultimately fails to block detachment of unacceptable normative conclusions (4.8).
5
Nolte, David D. Geometry on my Mind. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198805847.003.0005.
Full textAbstract:
This chapter reviews the history of modern geometry with a focus on the topics that provided the foundation for the new visualization of physics. It begins with Carl Gauss and Bernhard Riemann, who redefined geometry and identified the importance of curvature for physics. Vector spaces, developed by Hermann Grassmann, Giuseppe Peano and David Hilbert, are examples of the kinds of abstract new spaces that are so important for modern physics, such as Hilbert space for quantum mechanics. Fractal geometry developed by Felix Hausdorff later provided the geometric language needed to solve problems in chaos theory. Motion cannot exist without space—trajectories are the tracks of points, mathematical or physical, through it.
6
Morsanyi, Kinga, and Denes Szucs. Intuition in Mathematical and Probabilistic Reasoning. Edited by Roi Cohen Kadosh and Ann Dowker. Oxford University Press, 2014. http://dx.doi.org/10.1093/oxfordhb/9780199642342.013.016.
Full textAbstract:
Many people have a fragmented knowledge and understanding of the rules of mathematics and probability. As a consequence, they struggle with selecting the appropriate strategies to solve problems, and they often rely on intuitive solutions instead of normative rules. The purpose of this chapter is to introduce some typical intuitive strategies that people might apply when they solve mathematical or probability problems. Then the chapter describes the notions of primary and secondary intuitions, and gives an overview of the factors that might affect the selection of a particular intuitive strategy (such as certain individual differences variables and task characteristics). Finally, the chapter discusses the implications of these findings for researchers and educators.
7
Basu, Sanjay. Good Modeling Practices. Edited by Sanjay Basu. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780190667924.003.0011.
Full textAbstract:
Throughout this book, the author has focused on the practices of constructing models or using standard modeling templates and strategies to solve common public health and healthcare system problems. But inherent to the task of using models is the challenge of being a good consumer of models. Often, the planner is faced with the task of reading and interpreting models produced by others and determining whether they “believe” the model results and can make use of the model implementation to help make decisions. In this chapter, the author addresses the issue of how we might become better consumers of modeling studies.
8
Verschaffel, Lieven, Fien Depaepe, and Wim Van Dooren. Individual Differences in Word Problem Solving. Edited by Roi Cohen Kadosh and Ann Dowker. Oxford University Press, 2014. http://dx.doi.org/10.1093/oxfordhb/9780199642342.013.040.
Full textAbstract:
There is currently a rather broad consensus that the competencies that are required to solve word problems involve: (a) a well-organized and flexibly accessible knowledge base involving the relevant factual, conceptual, and procedural knowledge that is relevant for solving word problems; (b) heuristic methods, i.e. search strategies for problem analysis and transformation which increase the probability of finding a solution; (c) metacognition, involving both metacognitive knowledge and metacognitive skills; (d) positive task-related affects, involving positive beliefs, attitudes, and emotions; and (e) meta-affect, involving knowledge about one’s affects and skills for regulating one’s affective processes. The present chapter reviews and discusses research that provides a view on how individual differences in performance on word problems can be related to each of these components.
9
Levitin, Anany, and Maria Levitin. Algorithmic Puzzles. Oxford University Press, 2011. http://dx.doi.org/10.1093/oso/9780199740444.001.0001.
Full textAbstract:
While many think of algorithms as specific to computer science, at its core algorithmic thinking is defined by the use of analytical logic to solve problems. This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles. In Algorithmic Puzzles, Anany and Maria Levitin use many classic brainteasers as well as newer examples from job interviews with major corporations to show readers how to apply analytical thinking to solve puzzles requiring well-defined procedures. The book's unique collection of puzzles is supplemented with carefully developed tutorials on algorithm design strategies and analysis techniques intended to walk the reader step-by-step through the various approaches to algorithmic problem solving. Mastery of these strategies--exhaustive search, backtracking, and divide-and-conquer, among others--will aid the reader in solving not only the puzzles contained in this book, but also others encountered in interviews, puzzle collections, and throughout everyday life. Each of the 150 puzzles contains hints and solutions, along with commentary on the puzzle's origins and solution methods. The only book of its kind, Algorithmic Puzzles houses puzzles for all skill levels. Readers with only middle school mathematics will develop their algorithmic problem-solving skills through puzzles at the elementary level, while seasoned puzzle solvers will enjoy the challenge of thinking through more difficult puzzles.
10
Unger, Herwig, and Wolfgang A. Halang, eds. Autonomous Systems 2016. VDI Verlag, 2016. http://dx.doi.org/10.51202/9783186848109.
Full textAbstract:
To meet the expectations raised by the terms Industrie 4.0, Industrial Internet and Internet of Things, real innovations are necessary, which can be brought about by information processing systems working autonomously. Owing to their growing complexity and their embedding in complex environments, their design becomes increasingly critical. Thus, the topics addressed in this book span from verification and validation of safety-related control software and suitable hardware designed for verifiability to be deployed in embedded systems over approaches to suppress electromagnetic interferences to strategies for network routing based on centrality measures and continuous re-authentication in peer-to-peer networks. Methods of neural and evolutionary computing are employed to aid diagnosing retinopathy of prematurity, to invert matrices and to solve non-deterministic polynomial-time hard problems. In natural language processing, interface problems between humans and machines are solved with g...
Book chapters on the topic "Strategies to solve geometric problems"
1
Macke, Jaroslav, Jiri Sedlar, Miroslav Olsak, Josef Urban, and Josef Sivic. "Learning to Solve Geometric Construction Problems from Images." In Lecture Notes in Computer Science, 167–84. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81097-9_14.
Full text
2
Dhouib, Souhail, Sana Kouraïchi, Taïcir loukil, and Habib Chabchoub. "An Interactive Simulated Annealing Multi-agents Platform to Solve Hierarchical Scheduling Problems with Goals." In Nature Inspired Cooperative Strategies for Optimization (NICSO 2008), 177–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03211-0_15.
Full text
3
Blanchard, Julien, Charlotte Beauthier, and Timoteo Carletti. "Investigating Overlapped Strategies to Solve Overlapping Problems in a Cooperative Co-evolutionary Framework." In Communications in Computer and Information Science, 254–66. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85672-4_19.
Full text
4
Krueger, Ryan, Jesse Michael Han, and Daniel Selsam. "Automatically Building Diagrams for Olympiad Geometry Problems." In Automated Deduction – CADE 28, 577–88. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_33.
Full textAbstract:
AbstractWe present a method for automatically building diagrams for olympiad-level geometry problems and implement our approach in a new open-source software tool, the Geometry Model Builder (GMB). Central to our method is a new domain-specific language, the Geometry Model-Building Language (GMBL), for specifying geometry problems along with additional metadata useful for building diagrams. A GMBL program specifies (1) how to parameterize geometric objects (or sets of geometric objects) and initialize these parameterized quantities, (2) which quantities to compute directly from other quantities, and (3) additional constraints to accumulate into a (differentiable) loss function. A GMBL program induces a (usually) tractable numerical optimization problem whose solutions correspond to diagrams of the original problem statement, and that we can solve reliably using gradient descent. Of the 39 geometry problems since 2000 appearing in the International Mathematical Olympiad, 36 can be expressed in our logic and our system can produce diagrams for 94% of them on average. To the best of our knowledge, our method is the first in automated geometry diagram construction to generate models for such complex problems.
5
Baran, Bahar, Berrin Dogusoy, and Kursat Cagiltay. "How Do Adults Solve Digital Tangram Problems? Analyzing Cognitive Strategies Through Eye Tracking Approach." In Human-Computer Interaction. HCI Intelligent Multimodal Interaction Environments, 555–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73110-8_60.
Full text
6
Langham, A. E., and P. W. Grant. "Using Competing Ant Colonies to Solve k-way Partitioning Problems with Foraging and Raiding Strategies." In Advances in Artificial Life, 621–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48304-7_82.
Full text
7
Santos-Trigo, Manuel, Daniel Aguilar-Magallón, and Isaid Reyes-Martínez. "A Mathematical Problem-Solving Approach Based on Digital Technology Affordances to Represent, Explore, and Solve problems via Geometric Reasoning." In Research in Mathematics Education, 145–66. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-29215-7_8.
Full text
8
Marques da Silva, José Rafael, and Manuela Correia. "The soil-water-plant agrisystem:a little about soil, water and plants." In Manuali – Scienze Tecnologiche, 7. Florence: Firenze University Press, 2020. http://dx.doi.org/10.36253/978-88-5518-044-3.07.
Full textAbstract:
Soil and water are essential for plants to grow. By analysing a Vegetation Index map of a corn field after emergency we are going to observe different concentrations of chlorophyll across the field. We will try to identify possible causes for those differences and discuss the strategies to solve any problems that are occurring. These problems can be related with soil characteristics, irrigation, plant germination capacity, nutrition, etc., highlighting the importance of soil-water-plant agrisystem.
9
Dasgupta, Subrata. "Going Heuristic." In It Began with Babbage. Oxford University Press, 2014. http://dx.doi.org/10.1093/oso/9780199309412.003.0018.
Full textAbstract:
Let us rewind the historical tape to 1945, the year in which John von Neumann wrote his celebrated report on the EDVAC (see Chapter 9 ). That same year, George Polya (1887–1985), a professor of mathematics at Stanford University and, like von Neumann, a Hungarian-American, published a slender book bearing the title How to Solve It. Polya’s aim in writing this book was to demonstrate how mathematical problems are really solved. The book focused on the kinds of reasoning that go into making discoveries in mathematics—not just “great” discoveries by “great” mathematicians, but the kind a high school mathematics student might make in solving back-of-the-chapter problems. Polya pointed out that, although a mathematical subject such as Euclidean geometry might seem a rigorous, systematic, deductive science, it is also experimental or inductive. By this he meant that solving mathematical problems involves the same kinds of mental strategies—trial and error, informed guesswork, analogizing, divide and conquer— that attend the empirical or “inductive” sciences. Mathematical problem solving, Polya insisted, involves the use of heuristics—an Anglicization of the Greek heurisko —meaning, to find. Heuristics, as an adjective, means “serving to discover.” We are oft en forced to deploy heuristic reasoning when we have no other options. Heuristic reasoning would not be necessary if we have algorithms to solve our problems; heuristics are summoned in the absence of algorithms. And so we seek analogies between the problem at hand and other, more familiar, situations and use the analogy as a guide to solve our problem, or we split a problem into simpler subproblems in the hope this makes the overall task easier, or we summon experience to bear on the problem and apply actions we had taken before with the reasonable expectation that it may help solve the problem, or we apply rules of thumb that have worked before. The point of heuristics, however, is that they offer promises of solution to certain kinds of problems but there are no guarantees of success. As Polya said, heuristic thinking is never considered as final, but rather is provisional or plausible.
10
Luengo, Isabel. "A Diagrammatic Subsystem of Hilbert's Geometry." In Logical Reasoning with Diagrams. Oxford University Press, 1996. http://dx.doi.org/10.1093/oso/9780195104271.003.0012.
Full textAbstract:
In the last few years there has been an increasing interest in the visual representation of mathematical concepts. The fact that computers can help us perform graphical tasks very easily has been translated into an increasing interest in diagrammatic representations in general. Several experiments have shown that diagrammatic reasoning plays a main role in the way in which experts in several areas solve problems (Gobert and Freferiksen [1992] and Kindfield [1992]). Two kinds of explanations have been given for the advantages of visual representations over linguistic ones. The first kind of explanation is psychological. It has been argued that visual representations are easier to use because they resemble the mental models hurnans build to solve problems Stenning and Oberlander [1991], Johnson-Laird and Byrne [1991], arid Tverski [1991]. The second kind of explanation is related to computational efficiency. Larkin and Simon [1987] have argued that diagrammatic representations are computationally more efficient than sentential representations because the location of each element in the diagram corresponds to the spatial or topological properties of the objects they represent. However, the efficiency of the use of diagrams is not enough justification for their use in analytical areas of knowledge. Mathematical discoveries often have been made using visual reasoning, but those very same discoveries were not justified by the visual reasoning. Diagrams are associated with intuitions and illustrations, not with rigorous proofs. Visual representations are allowed in the context of discovery, not in the context of justification. Many authors have considered diagrams in opposition to deductive systems. Lindsay [1988], for instance, has claimed that the main feature of visual representations is that they correspond to a non-deductive kind of inference system. Koedinger and Anderson [1991] have related diagrammatic reasoning in geometry to informal, inductive strategies to solve problems. Thus, though we have an empirical justification for the use of diagrams in mathematics (people use them and they work!) we do not usually have an analytical justification. In fact, the history of mathematics, and especially the history of geometry, is full of mistakes related to the use of diagrams.
Conference papers on the topic "Strategies to solve geometric problems"
1
Cadrecha, David, Jose M. Chaquet, Roque Corral, and Guillermo Pastor. "Two-Dimensional Airfoil Shape Optimization Using Highly Differentiable Splines and Evolution Strategies." In ASME Turbo Expo 2016: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/gt2016-56040.
Full textAbstract:
An optimization method based on Covariance Matrix Adaptation Evolution Strategies (CMA-ES) is applied on a parametric design tool for the automated generation of two-dimensional turbomachinery airfoil sections. Highly differentiable curves are managed to ensure continuity in the slope of the curvature on the blade surface to avoid undesired anomalies in the Mach number distributions. An Euler solver coupled with an integral boundary layer method is employed to assess the aerodynamic behavior of the geometries. Special care has been made defining several cost functions to allow the algorithm handle unfeasible geometries that can appear during the evolutionary process. The fitness function of feasible individuals can be set up to fulfill several geometric and aerodynamic constraints. To show the potential of the method, several optimization problems have been solved, tracing existing geometries originally defined in a point wise fashion, and applying inverse design to match target Mach number distributions. This method can facilitate the two-dimensional airfoil design and can be used to import external data defined with a set of points. This optimization approach could be employed as well to generate an initial blading geometry which could feed a more sophisticated optimization method based on a three-dimensional CFD solver.
2
Barawkar, Shraddha, and Manish Kumar. "Cooperative Transport of a Payload With Offset CG Using Multiple UAVs." In ASME 2019 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/dscc2019-9131.
Full textAbstract:
Abstract Cooperative transportation by multiple Unmanned Aerial Vehicles (UAVs) has been a topic of interest amongst robotics researchers since a decade. Researchers have developed different control schemes to address some of the issues related to cooperative transport. However, most of the existing control strategies assume a stationary center of gravity (CG) coinciding with the geometric center of the payload. In real world applications such as package delivery or human transport, position of CG, in general, would not be at geometric center, or would not be even known a – priori. This paper proposes a Proportional, Integral and Derivative (PID) controller to address the issue of control when the CG is offset during transportation of a common payload using multiple UAVs. The proposed PID scheme is centralized in nature in that it provides the same control action to all UAVs. Using extensive numerical simulations, the paper shows that such a scheme is shown to work effectively irrespective of the location of CG on the payload. The control scheme is also independent of the payload geometry and number of UAVs employed for cooperative transport. The work presented in this paper provides the groundwork to develop better control strategies to solve the problem of multi-UAV cooperative transport with a – priori unknown CG.
3
Loy, James M., Ajay Vadakkepatt, Sanjay R. Mathur, and Jayathi Y. Murthy. "A Fast Coupled Solver for Phonon Transport in Composites." In ASME 2013 Heat Transfer Summer Conference collocated with the ASME 2013 7th International Conference on Energy Sustainability and the ASME 2013 11th International Conference on Fuel Cell Science, Engineering and Technology. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/ht2013-17302.
Full textAbstract:
In recent years, computational techniques for solving phonon transport have been developed under the framework of the semiclassical Boltzmann Transport Equation (BTE). Early work addressed gray transport, but more recent work has begun to resolve wave vector and polarization dependence, including that in relaxation times. Because the relaxation time in typical materials of interest spans several orders of magnitude, typical solution techniques must address an enormous range of Knudsen numbers in the same problem. Calculation procedures which solve the BTE in phase space sequentially work well in the ballistic limit, but are slow to converge in the thick limit. Unfortunately, both extremes may be encountered simultaneously in typical wave-number (K) -resolved phonon transport problems. In previous work, we developed the coupled ordinate method (COMET) to address this problem. COMET employs a point-coupled solution to resolve coupling in K-space, and embeds this point solver as a relaxation sweep in a geometric multigrid method to maintain spatial coupling. We have demonstrated speedups of up to 200 over conventional sequential solution procedures using this method. COMET also exhibits excellent scaling on multiprocessor platforms, far beyond those obtained by sequential solvers. In this paper, we extend COMET to address interface transport in composites. Just as scattering couples phonons of different wave vectors in the bulk, reflection and transmission couple different wave vectors together at interfaces. Again, sequential solution procedures perform poorly because of the poor algorithmic coupling in K space. A computational procedure based on COMET is developed for composites, addressing multigrid agglomeration strategies to promote stronger K-space coupling at interfaces. The technique is applied to canonical superlattice geometries and superior performance over typical sequential solvers is demonstrated. Furthermore, the method is applied to realistic particle composites employing computational meshes developed from x-ray computed tomography (CT) scans of particulate beds. It is demonstrated to yield solutions where sequential solution techniques fail to converge at all.
4
Yin, Su, and Jonathan Cagan. "A Pattern Search-Based Algorithm for Three-Dimensional Component Layout." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/dac-5582.
Full textAbstract:
Abstract A pattern search-based algorithm is introduced for efficient component layout optimization. The algorithm is applicable to general layout problems, where component geometry can be arbitrary, design goals can be multiple and spatial constraint satisfactions can be of different types. Extensions to pattern search are introduced to help the algorithm to converge to optimal solutions by escaping inferior local minima. The performance on all of the test problems shows that the algorithm runs one-to-two orders of magnitude faster than a robust simulated annealing-based algorithm for results with the same quality. The algorithm is further extended to solve a concurrent layout and routing problem, which demonstrates the ability of the algorithm to apply new pattern strategies in search and to include different objective functions in optimization.
5
Lobato, Fran Se´rgio, Edu Barbosa Arruda, Aldemir Ap Cavalini, and Valder Steffen. "Engineering System Design Using Firefly Algorithm and Multi-Objective Optimization." In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-47197.
Full textAbstract:
Modern engineering problems, such as aircraft or automobile design, are often composed by a large number of variables that must be chosen simultaneously for better design performance. Normally, most of these parameters are conflicting, i.e., an improvement in one of them does not lead, necessarily, to better results for the other ones. Thus, many methods to solve multi-objective optimization problems (MOP) have been proposed. The MOP solution, unlike the single objective problems, is a set of non-dominated solutions that form the Pareto Curve, also known as Pareto Optimal. Among the MOP algorithms, we can cite the Firefly Algorithm (FA). FA is a bio-inspired method that mimics the patterns of short and rhythmic flashes emitted by fireflies in order to attract other individuals to their vicinities. For illustration purposes, in the present contribution the FA, associated with the Pareto dominance criterion, is applied to three different design cases. The first one is related to the geometric design of a clamped-free beam. The second one deals with the project of a welded beam and the last one focuses on estimating the characteristic parameters of a rotary dryer pilot plant. The proposed methodology is compared with other evolutionary strategies. The results indicate that the proposed approach characterizes an interesting alternative for multi-objective optimization problems.
6
Marefat, Michael M. "Feature-Based Computer Integrated Inspection." In ASME 1993 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/cie1993-0017.
Full textAbstract:
Abstract This paper presents an approach to knowledge-based inspection planning for solid objects. The goals of intelligent inspection planning include determining (i) which entities (edge segments, etc) of the object should be measured, (ii) what camera locations and viewing directions should be used to perform inspection, and (iii) how can the search for these entities, and their inspection be robustly and efficiently done once the sensor data is obtained. An effective solution to this problem is clearly very important not only from the automation point of view, but also in order to effectively gather and use sensor information to overcome the volume and complexity of required information for adequate performance. In order to achieve the inspection planning goals, several interrelated problems must be solved. These problems include: (i) developing hierarchical representation mechanisms to effectively capture the knowledge about geometric entities, their relationships, sensors, and plans, (ii) reasoning mechanisms to determine the different attributes of the different features of object to be inspected, and the alternative strategies which can be used for inspection of each attribute, (iii) strategies for setting the sensor parameters, such as the position and viewing direction of the cameras, and methods to determine the visible entities in each configuration, and (iv) plan optimization. Our prototype is developed in the Smalltalk object oriented environment.
7
Soto, Ricardo, Broderick Crawford, Rodrigo Olivares, Rodrigo Herrera, Franklin Johnson, and Fernando Paredes. "Enumeration strategies to solve constraint satisfaction problems: Performance evaluation." In 2015 10th Iberian Conference on Information Systems and Technologies (CISTI). IEEE, 2015. http://dx.doi.org/10.1109/cisti.2015.7170511.
Full text
8
Shah, Muhammad A., Raphael Olivier, and Bhiksha Raj. "Optimal Strategies For Comparing Covariates To Solve Matching Problems." In 2020 25th International Conference on Pattern Recognition (ICPR). IEEE, 2021. http://dx.doi.org/10.1109/icpr48806.2021.9412932.
Full text
9
Duca, Anton, Laurentiu Duca, Gabriela Ciuprina, and Daniel Ioan. "Neighborhood Strategies for QPSO Algorithms to Solve Benchmark Electromagnetic Problems." In 8th International Conference on Evolutionary Computation Theory and Applications. SCITEPRESS - Science and Technology Publications, 2016. http://dx.doi.org/10.5220/0006040901480155.
Full text
10
Ridens, Brandon L., Timothy C. Allison, Sarah B. Simons, and Klaus Brun. "Modeling and Mitigation of Acoustic Induced Vibration (AIV) in Piping Systems." In ASME 2018 Pressure Vessels and Piping Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/pvp2018-84107.
Full textAbstract:
This paper explores new analysis techniques and mitigation concepts developed to extend the current state of the art acoustic induced vibrations (AIV) analyses. These new methods are intended to provide more accurate evaluations of this phenomenon in an attempt to solve AIV problems found in blowdown and piping systems. Current screening methods for AIV are based on pass/fail data with minimal or undesired options for reducing the likelihood of failure for AIV events. Computational fluid dynamics simulations and finite element analysis in combination with lab testing of novel mitigation options using accelerometers, dynamic pressure transducers, and strain gages were performed to better understand the phenomenon and develop possible solutions to reduce the impact of AIV on piping systems. Results of the testing and analyses performed at the Southwest Research Institute (SwRI) indicate that there is a possible correlation with acoustic modes, structural modes, and elevated stresses during AIV events. Minor reductions in dynamic pressure fluctuations throughout piping during AIV events can be made by changes in valve geometry and piping configurations. Results of CFD modeling and analysis demonstrate that computational analysis can be used to evaluate mitigation strategies and suggest that the use of a dampener as a mitigation technique may be successful in reducing the amplitudes of dynamic pressure waves in piping systems caused by AIV events.