Thesis (PhD (Civil Engineering))--University of Stellenbosch, 2007. / The current codes of practice for the design of structures which were studied during this investigation do not explicitly account for the flexibilities and interactions of the Electric Overhead Travelling Crane (EOHTC) and the crane support structure. This leads to analysing the EOHTC and the gantry structure as a decoupled system for ease of computation. Thus, the interaction of the various components of the EOHTC and gantry structure is ignored, which may result in an incorrect assessment of the forces computed in the gantry structure’s members. This led to a study to determine the effects of a EOHTC on the gantry structure. The research was conducted through a series of limited experimental tests and extensive advanced Finite Element Analysis (FEA) simulations. This resulted in developing a computationally efficient FEA model of the full scale experimental EOHTC testing facility in the structural engineering laboratory at Stellenbosch University. The FEA model was developed to conduct simulations for the various load models, namely, vertical wheel load, horizontal longitudinal load and the horizontal lateral load models, as prescribed by the various codes. The research was then focussed at determining the maximum end buffer impact force responses when the crane runs into the end stops. The other load models were investigated by another researcher using the same FEA model. The results from the experimental tests were used to calibrate the FEA simulations. This proved exceptionally challenging due to the various structural response phenomena which occur during the impact of the crane against the end stops. A good correlation between the experimental values and the values predicted by the FEA simulations was achieved for the first impact. Modal analysis and modal superposition methods of analysis were used to determine the effect of the modes of vibration on the structural response to the end buffer impact. A FEA sensitivity analysis was conducted on a set of identified parameters which have a significant effect on the structural response to the end buffer impact. The maximum end buffer impact force was determined for a chosen level of reliability based on the responses from the sensitivity analysis using the Lagrange Multiplier method. These maximum end buffer impact forces are then compared with the forces prescribed by the codes. SABS 0160 slightly underestimates, while SANS 10160 severely overestimates the end buffer impact force obtained from the constraint optimization technique for a target level of reliability of β =3.

by Liang Fa Ming. / Publication date from spine. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 49-53). / ABSTRACT --- p.1 / Chapter CHAPTER 1 : --- Introduction --- p.2 / Chapter 1.1 ： --- The TSP Problem --- p.2 / Chapter 1.2: --- Application --- p.3 / Chapter CHAPTER 2 : --- Review of Exact and Approximate Algorithms for TSP --- p.4 / Chapter 2.1 : --- Exact Algorithm --- p.4 / Chapter 2.2 : --- Heuristic Algorithms --- p.8 / Chapter CHAPTER 3 : --- Markov Chain Monte Carlo Methods --- p.16 / Chapter 3.1: --- Markov Chain Monte Carlo --- p.16 / Chapter 3.2 : --- Conditioning and Gibbs Sampler --- p.17 / Chapter 3.3: --- The Metropolis-Hasting Algorithm --- p.18 / Chapter 3.4: --- Auxiliary Variable Methods --- p.21 / Chapter CHAPTER 4: --- Weighted Markov Chain Monte Carlo Method --- p.24 / Chapter CHAPTER 5 : --- Traveling Salesman Problem --- p.31 / Chapter 5.1: --- Buildup Order --- p.33 / Chapter 5.2: --- Path Construction through a Group of Points --- p.34 / Chapter 5.3: --- Solving TSP Using the Weighted Markov Chain Method --- p.38 / Chapter 5.4: --- Temperature Scheme --- p.40 / Chapter 5.5 : --- How to Adjust the Constant Prior-Ratio --- p.41 / Chapter 5.6: --- Validation of Our Algorithm by a Simple Example --- p.41 / Chapter 5.7 : --- Adding/Deleting Blockwise --- p.42 / Chapter 5.8: --- The sequential Optimal Method and Post Optimization --- p.43 / Chapter 5. 9 : --- Composite Algorithm --- p.44 / Chapter 5.10: --- Numerical Comparisons and Tests --- p.45 / Chapter CHAPTER 6 : --- Conclusion --- p.48 / REFERENCES --- p.49 / APPENDIX A --- p.54 / APPENDIX B --- p.58 / APPENDIX C --- p.61

<p>Brain connectome network visualization could help the neurologists inspect the brain structure easily and quickly. In the thesis, the model of the brain connectome network is visualized in both three dimensions (3D) environment and two dimensions (2D) environment. One is named “Brain Explorer for Connectomic Analysis” (BECA) developed by the previous research already. It could present the 3D model of brain structure with region of interests (ROIs) in different colors [5]. The other is mainly for the information visualization of brain connectome in 2D. It adopts the force-directed layout to visualize the network. However, the brain network visualization could not bring the user intuitively ideas about brain structure. Sometimes, with the increasing scales of ROIs (nodes), the visualization would bring more visual clutter for readers [3]. So, brain connectome network properties visualization becomes a useful complement to brain network visualization. For a better understanding of the effect of Alzheimer’s disease on the brain nerves, the thesis introduces several methods about the brain graph properties visualization. There are the five selected graph properties discussed in the thesis. The degree and closeness are node properties. The shortest path, maximum flow, and clique are edge properties. Except for clique, the other properties are visualized in both 3D and 2D. The clique is visualized only in 2D. For the clique, a new hypergraph visualization method is proposed with three different algorithms. Instead of using an extra node to present a clique, the thesis uses a “belt” to connect all nodes within the same clique. The methods of node connections are based on the traveling salesman problem (TSP) and Law of cosines. In addition, the thesis also applies the result of the clique to adjust the force-directed layout of brain graph in 2D to dramatically eliminate the visual clutter. Therefore, with the support of the graph properties visualization, the brain connectome network visualization tools become more flexible.</p>

Thesis. 1978. M.S.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING / Includes bibliographical references. / M.S.

Este trabalho é dedicado a entender alguns aspectos matemáticos dos seguintes modelos não lineares: a equação de Schrödinger não linear com potência dupla, isto é iu t + u xx + u|u| 2 + u|u| 4 = 0, (1) e uma perturbação de tipo delta deste modelo, à saber, iu t + u xx + Z(x)u + u|u| 2 + u|u| 4 = 0. (2) Para o primeiro modelo em (1), usando a teoria de integrais elpticas de Jacobi e o teorema da função implcita, obtemos uma famlia de ondas estacionárias u(x, t) = e iwt w (x), onde w : R R é uma função positiva e periódica de perodo L > 0, conhecida como o perfil da onda. Para L , mostramos que as ondas esta- cionárias periódicas tendem uniformemente sobre intervalos compactos à onda so- litária. Usando uma extensão da teoria de Angulo&Natali assim como as idéias de- senvolvidas por Weinstein, Bona, Grillakis, Shatah e Strauss, mostramos estabilidade orbital desas ondas por perturbações do mesmo perodo que a onda. Por fim, provamos um resultado de instabilidade orbital por perturbações subharmônicas. Para o segundo modelo em (2), usando a onda solitária w,0 no caso em que Z = 0, obtemos duas famlias de picos solitários. Nós observamos que quando Z 0, temos que w,Z w,0 , onde w,0 denota a onda solitária. Então, usando a teoria de perturbação analtica para operadores lineares não limitados, obtemos um resultado detalhado da estabilidade orbital de picos solitários. Além disto, apresentamos alguns problemas naturais que podem ser resolvidos fu- turamente. Em particular, nós propomos uma nova abordagem para resolver questões de estabilidade linear de soluções de equilbrio para certo tipo de equações parabólicas. / This work is devoted to understand some mathematical aspects of the following nonlinear models: the nonlinear Schrödinger equation with double power in its non-linearity, that is iu t + u xx + u|u| 2 + u|u| 4 = 0, (3) and a perturbation of delta type of this model, namely iu t + u xx + Z(x)u + u|u| 2 + u|u| 4 = 0. (4) For the first model, by using the theory of Jacobi elliptic integrals and the implicit function theorem, we obtain a family of standing waves u(x, t) = e iwt w (x), where w : R R is a positive periodic function of period L > 0, known as the wave profile. When L , we show that the periodic standing waves converge uniformly on compact intervals to the solitary waves. Moreover, using an extension of the Angulo&Natali stability theory, as well as, the stability ideas developed by Weinstein, Bona, Grillakis, Shatah and Strauss, we show the orbital stability of the standing waves for perturbations of the same period of the wave profile. Finally, an orbital instability result by subharmonic perturbations is proved. For the second model, by using the existence of the solitary wave w,0 in the case Z = 0, we obtain two families of solitary peaks. We observe that when Z 0, we have that w,Z w,0 , where w,0 denotes the solitary wave. Then, using the analytic perturbation theory of unbounded linear operators, we obtain an accurate result about orbital stability of solitary peaks. Furthermore, we give some natural problems that can be solved futurely. In par- ticular, we propose a new approach to solve question of linear stability of equilibrium solutions for certain type of parabolic equations.

An algorithm for solving the large-scale Traveling Salesman Problem is presented. Research into past work in the area of Hopfield neural network use in solving the Traveling Salesman Problem has yielded design ideas that have been incorporated into this work. The algorithm consists of an unsupervised learning algorithm and a recursive Hopfield neural network. The unsupervised learning algorithm was used to decompose the problem into clusters. The recursive Hopfield neural network was applied to the centroids of the clusters, then to the cities in each cluster, in order to find an optimal path. An improvement in both computation speed and solution accuracy is shown by the proposed algorithm over the straight use of the Hopfield neural network.

Charles Edward Muehe, Jr. / "October 16, 1952." "This report is based on a thesis submitted to the Department of Electrical Engineering, M.I.T. ... August 1952." / Bibliography: p. 38. / Army Signal Corps Contract DA36-039 sc-100 Project 8-102B-0 Dept. of the Army Project 3-99-10-022

L.D. Smullin. / Errata inserted. "October 24, 1949." / Bibliography: p. 9.

[by] L.A. Harris ... [et al.]. / 3665947 Archives / "January 21, 1949." / Bibliography: p. 11. / Army Signal Corps Contract No. W36-039-sc-32037 Project No. 102B Dept. of the Army Project No. 3-99-10-022

By combining new robot control systems with piezoelectric motors and micromechanics, we propose creating micromechanical systems which are small, cheap and completely autonomous. We have fabricated small - a few millimeters in diameter - piezoelectric motors using ferroelectric thin films and consisting of two pieces: a stator and a rotor. The stationary stator includes a piezoelectric film in which we induce bending in the form of a traveling wave. Anything which sits atop the stator is propelled by the wave. A small glass lens placed upon the stator becomes the spinning rotor. Using thin films of PZT on silicon nitride memebranes, various types of actuator structures have been fabricated.