Generalized hill climbing (GHC) algorithms provide a unifying framework for describing several discrete optimization problem local search heuristics, including simulated annealing and tabu search. A necessary and a sufficient convergence condition for GHC algorithms are presented. The convergence conditions presented in this dissertation are based upon a new iteration classification scheme for GHC algorithms. The convergence theory for particular formulations of GHC algorithms is presented and the implications discussed. Examples are provided to illustrate the relationship between the new convergence conditions and previously existing convergence conditions in the literature. The contributions of the necessary and the sufficient convergence conditions for GHC algorithms are discussed and future research endeavors are suggested. / Ph. D.

Identifying a globally optimal solution for an intractable discrete optimization problem is often cost prohibitive. Therefore, solutions that are within a predetermined threshold are often acceptable in practice. This dissertation introduces the concept of B-acceptable solutions where B is a predetermined threshold for the objective function value. It is difficult to assess a priori the effectiveness of local search algorithms, which makes the process of choosing parameters to improve their performance difficult. This dissertation introduces the B-acceptable solution probability in terms of B-acceptable solutions as a finite-time performance measure for local search algorithms. The B-acceptable solution probability reflects how effectively an algorithm has performed to date and how effectively an algorithm can be expected to perform in the future. The B-acceptable solution probability is also used to obtain necessary asymptotic convergence (with probability one) conditions. Upper and lower bounds for the B-acceptable solution probability are presented. These expressions assume particularly simple forms when applied to specific local search strategies such as Monte Carlo search and threshold accepting. Moreover, these expressions provide guidelines on how to manage the execution of local search algorithm runs. Computational experiments are reported to estimate the probability of reaching a B-acceptable solution for a fixed number of iterations. Logistic regression is applied as a tool to estimate the probability of reaching a B-acceptable solution for values of B close to the objective function value of a globally optimal solution as well as to estimate this objective function value. Computational experiments are reported with logistic regression for pure local search, simulated annealing and threshold accepting applied to instances of the TSP with known optimal solutions. / Ph. D.

Generalized hill climbing (GHC) algorithms are introduced, as a tool to address difficult discrete optimization problems. Particular formulations of GHC algorithms include simulated annealing (SA), local search, and threshold accepting (T A), among. others. A proof of convergence of GHC algorithms is presented, that relaxes the sufficient conditions for the most general proof of convergence for stochastic search algorithms in the literature (Anily and Federgruen [1987]). Proofs of convergence for SA are based on the concept that deteriorating (hill climbing) transitions between neighboring solutions are accepted by comparing a deterministic function of both the solution change cost and a temperature parameter to a uniform (0,1) random variable. GHC algorithms represent a more general model, whereby deteriorating moves are accepted according to a general random variable. Computational results are reported that illustrate relationships that exist between the GHC algorithm's finite-time performance on three problems, and the general random variable formulations used. The dissertation concludes with suggestions for further research. / Ph. D.

This is a bachelor thesis in information design with a focus on informative illustration at Mälardalen University. The thesis was carried out in collaboration with Klättercentret Västerås and investigates how to visualize human movements in static media to facilitate the understanding of bouldering techniques for beginners. By applying various visualization techniques, the thesis aims to develop effective instructional materials that enable users to understand and perform complex movements without seeing any actual movement. The methods included the use of think-aloud protocol and semi-structured interviews to collect data from test subjects. Two main visualization techniques were tested: multiple static-simultaneous pictures and overlapping multiples. In addition to these, movement indicating arrows and movement lines were also used as clarifying additions. The test subjects studied the instructions and then performed the movements on a climbing wall. Their performance and feedback were documented and analyzed to assess the comprehensibility and usability of the material. The instructional material was developed in an iterative process, in which the feedback and performance from each user test was used to develop and refine the material. The results show that multiple static-simultaneous pictures were most effective in conveying complex movements. Users found these visualizations easier to understand and follow compared to overlapping multiples. The results also indicate that visualizations with clear visual cues, such as arrows and color markings, reduced cognitive load and facilitated comprehension. / Detta är ett examensarbete i informationsdesign med inriktningen informativ illustration vid Mälardalens universitet. Examensarbetet genomfördes i samarbete med Klättercentret Västerås och undersöker hur man kan visualisera mänskliga rörelser i statiska medier för att underlätta förståelsen av boulderingstekniker för nybörjare. Genom att tillämpa olika visualiseringstekniker syftar arbetet till att utveckla effektiva instruktionsmaterial som gör det möjligt för användare att förstå och utföra komplexa rörelser utan att se några faktiska rörelser. Metoderna inkluderade användningen av think-aloud protokoll och semistrukturerade intervjuer för att samla in data från testpersoner. Två huvudsakliga visualiseringstekniker testades: flera seriellt bildberättande och överlappande multiplar (overlapping multiples). Utöver dessa användes även rörelseindikerande pilar och rörelselinjer som förtydligande tillägg. Testpersonerna studerade instruktionerna och utförde sedan rörelserna på en klättervägg. Deras prestationer och feedback dokumenterades och analyserades för att bedöma materialets begriplighet och användbarhet. Instruktionsmaterialet utvecklades i en iterativ process, där feedback och prestanda från varje användartest användes för att utveckla och förfina materialet. Resultaten visar att seriellt bildberättande var mest effektivt för att förmedla komplexa rörelser. Testpersonerna ansåg att dessa visualiseringar var lättare att förstå och följa jämfört med överlappande multiplar. Resultaten tyder också på att visualiseringar med tydliga visuella signaler, såsom pilar och färgmarkeringar, minskade kognitiv belastning och underlättade förståelsen.

For their inherent stability and simple dynamics of motion, wheeled robots are very common in robotics applications. Many highly complex robots are being developed in research laboratories, but wheeled robots remain the most used robot in real-world situations. One of the most significant downfalls of wheeled robots is their inability to navigate over large obstacles or steps without assistance. A wheeled robot is capable of climbing steps that are no larger than the radius of the robot's tires, but steps larger than this are impassable by simply rolling over the object. Active systems that have been designed for use on wheeled robots to lift the robot over a step are effective, but are generally not easily implemented on a range of robotic platforms. Also, the additional size, cost, and power required for the additional actuators is a major drawback to these options. A solution to these problems is a novel, passive dynamic system that is inertially excited by the motion of the robot to allow the robot to rotate on each axle and "hop" over the step. The system that was investigated for this project is a sliding mass-spring that shifts forward and backward based on the acceleration of the base robot. With high acceleration, the mass is pushed towards the rear wheel from an inertial force and compresses a spring that creates a moment on the body to induce rotation. This torque can cause the robot to "pop a wheelie", lifting its front wheels off the ground. To pull the rear wheels up, the inertial force from a large deceleration of the robot shifts the mass forward and extends a spring. These effects result in a moment acting in the opposite direction that can rotate the robot on its front axle and pull the rear wheels up. By coordinating the acceleration and deceleration of the robot, the front wheels can lift over a step and the rear wheels can be pulled up afterward — both actions being a product of inertial actuation. This passive system does not need additional actuators or direct control of the sliding mass, so it can be more durable over a robot's lifetime. Other advantages of this system are that the design is simple, cost-effective, and can be adjusted and retrofit to a different wheeled robot in the future with little effort. By deriving the equations of motion of this inertially actuated sliding mass, the dynamics show how design parameters of the system can be tuned to better optimize the overall step-climbing process. A computer simulation was created to visualize the robotic step-climbing process and demonstrate the effects of changing design parameters. An implementation of this sliding mass system was added to a wheeled robot, and the results from experiments were compared to simulated trials. This research has shown that an inertially actuated sliding mass can effectively enable a wheeled robot to climb a step that was previously impassable and that the system can be tuned for other wheeled robots using an understanding of the system dynamics. / Master of Science

The main objective of the thesis is to work out the proposal that should develop the rock-climbing as a tourist activity in the region of Adršpach and Teplice nad Metují. The thesis focused on the situational analysis of the destination which uncovered a lot of conflicts. Based on the results of the situational analysis of the destination (especially SWOT) the strategic objectives, strategy and the next steps were worked out. These measures should solve the mentioned conflicts in the given territory. The main focus of the thesis is to propose the new product aimed at organization of the rock-climbing triathlon of couples in the given region.

Made available in DSpace on 2014-07-29T15:08:20Z (GMT). No. of bitstreams: 1 dissertacao geraldo valeriano eec.pdf: 1215973 bytes, checksum: 4ceb98a1d5250ad33d16a8997882d277 (MD5) Previous issue date: 2009-06-29 / This work presents two methods to solve the problem of Electric Distribution Networks (EDN) with geographical and power restrictions. The high cost of the project involving EDN together with lack of efficient methods when working with real applications justifies the development of this research. Taking into account concepts of heuristic and metaheuristic two methods are proposed: The first is based on the Hill-Climbing (HC) heuristic and the second is based on the Simulated Annealing (SA) metaheuristic. The possible paths are provided by the Delaunay triangulation and it is considered the natural and socio-political obstacles of the site where you want to locate a new energy network. The dimension of the EDN feeders is calculated using the power flow results from the Forward-Backward method. The initial solution is found using an intelligent method. Then the SA metaheuristic and/or HC heuristic are used providing a good solution for a new EDN in comparison with the heuristic used to find the initial solution. A comparison is also made between the two proposed methods / RESUMO Neste trabalho são apresentados dois métodos para resolver o problema de planejamento de rede de distribuição de energia elétrica (RDEE) com restrições geográficas e elétricas. O custo elevado que envolve o projeto de RDEE unido à escassez de métodos eficientes quando se trata de aplicações reais justificam o desenvolvimento desta pesquisa. Considerando os conceitos de heurística e metaheurística são propostos dois métodos: o primeiro é baseado na heurística Hill-Climbing (HC) e o segundo é baseado na metaheurística Simulated Annealing (SA). Os possíveis caminhos são fornecidos pela triangulação de Delaunay e são considerados os obstáculos naturais e políticosociais (restrições geográficas) do local onde se deseja implantar a nova rede de energia elétrica. O dimensionamento dos alimentadores da RDEE é feito utilizando-se do fluxo de potência calculado pelo método Backward-Forward. A solução inicial é encontrada utilizando-se um método inteligente. A metaheurística SA e/ou a heurística HC são então utilizadas, fornecendo uma boa solução para uma nova RDEE, em relação à heurística utilizada para encontrar a solução inicial. Também é realizada uma comparação entre os dois métodos propostos.

No description available.

TITLE OF THE WORK Physical preparation for the military part of the talent exam at Military Department of the Faculty of Physical Education and Sport in Prague. DEFINITION OF THE PROBLEM It is necessary to pass the special physical exam to be admitted for studying at Military Department. The content of this exam is significantly different from other physical activities and the preparation for it may cause several problems to the candidates. MAIN GOALS The main goal of this diploma thesis is to create a package of the exercises used for improving technical and fitness part of the performance primarily in the military part of physical exam. PLAN OF PROCESSING After extensive research of the available documents the package of the exercises will be created. KEYWORDS Army Physical Fitness, Rope ladder climbing, Load carrying, Special Physical Preparation

Title: The Choice of Universal Abseiling Aids for the Requirements of the Czech Armed Forces Objectives: Choosing abseiling - belaying aids in accordance with the needs of the Czech Armed Forces. Methods: A mixed empirical research was involved. In order to analyse the results, closed questionnaires created in MS Excel were produced and evaluated later on. They were split into two phases. The analysis of the relationships of the variables was carried out using methods of descriptive statistics. To collect data, the Delphi research method was used. The survey was conducted in cooperation with chief instructors of military climbing. Respondents were selected according to their qualifications. Results: It was chosen ATC Guide like the most acceptable abseiling aid for the requirements of the Czech armed forces by informant with help research method Delphi. Keywords: Research method Delphi, Special physical education, Army climbing, Descent, ATC Guide. J. STRNAD 10.4. 2011