nÃo hà / Este trabalho tem como objetivo mostrar algumas aplicaÃÃes de matemÃtica na realidade. Tem, tambÃm o objetivo de responder, pelo menos em parte as seguintes perguntas: Professor para que serve isso? Onde vou usar isso? Porque devo estudar isso? Neste trabalho mostra-se algumas dessas aplicaÃÃes da matemÃtica para que o estudante saiba que a matemÃtica està presente onde menos se imagina. Tais perguntas, que muitas vezes ficam sem resposta, causam falta de estÃmulo e entusiasmo nos estudantes, pois estes nÃo conseguem ver utilidade nos conteÃdos ministrados. A matemÃtica aplicada à uma valiosa ferramenta para quem quer ver a matemÃtica em funcionamento. Inicialmente mostra-se uma aplicaÃÃo à localizaÃÃo de um robà mÃvel atravÃs coordenadas no plano e medidas de arcos, depois mostrar-se-à uma linda aplicaÃÃo das tÃo estudadas transformaÃÃes ( Ãlgebra Linear ) e das matrizes, agora aplicadas no espaÃo, para a movimentaÃÃo e localizaÃÃo da extremidade final de um robà manipulador. Estas aplicaÃÃes da matemÃtica sÃo apenas algumas, pois hà uma infinidade de outras mais. / This work has as objective shows some applications of the mathematics in the reality. He has, also the objective of answering, for the less partly the following questions: Teacher so that it serves that? Where will I use that? Because I should study that? In this work it is shown some of those applications of the mathematics so that the student knows that the mathematics is present where less if imagine. Such questions, that a lot of times are without answer, they cause incentive lack in the students, because these donât get to see usefulness in the supplied contents. The applied mathematics is one valuable tool for who wants to see the mathematics operation. Initially an application is shown to a movable robotâs location through coordinates in the plan and measures of arches, later it will be shown a beautiful application of the so studied transformations (Algebra Lineal) and of the head offices, now applied in the space, for the movement and location of a robot manipulatorâs final extremity. These applications of the mathematics are just some, because there is an infinity of other more.

From the requirements of the Ionosonde digitisation project, undertaken by Rhodes University Antarctic Research Group, it was decided to use the Fast Fourier Transform to compute the spectrum analysis. Several FFT algorithms are reviewed and properties discussed, and the Ccoley Tukey algorithm chosen for utilization. The hardware implementation of this algorithm, and the microprogram control of the whole system are discussed in detail, and such design aspects that required computer simulation are also treated in detail. The final testing of the analyser is shown, and includes a test using data from an ionosonde sounding. The conclusions contain details of extensions to the analysers present operation, required by plans to place the whole Chirpsounder under microprocessor control

If r > 1 is an integer then U(r) denotes the vector space of r-fold symmetric tensors and Pr[U] is the set of rank 1 tensors in U(r). Let U be a finite-dimensional vector space over an algebraically closed field of characteristic not a prime p if r = p[formula omitted] for some positive integer k. We first determine the maximal subspaces of rank 1 symmetric tensors. Suppose h is a linear mapping of U(r) such that h(Pr[U]) ⊆ Pr[U] and ker h ⋂ Pr[U] = 0. We have shown that every such h is induced by a non-singular linear mapping of U, provided dim U > r+1 . This work partially answers a question raised by Marcus and Newman (Ann. of Math., 75, (1962) p.62.). / Science, Faculty of / Mathematics, Department of / Graduate

Une pression accrue s'exerce sur les compilateurs pour mettre en œuvre des transformations de programmes de plus en plus complexes délivrant le potentiel de performance des processeurs multicœurs et des accélérateurs hétérogènes. L'espace de recherche des optimisations de programmes possibles est gigantesque est manque de structure. La recherche de la meilleure transformation, qui inclut la prédiction des gains estimés de performance offerts par cette transformation, constitue le problème le plus difficiles pour les compilateurs optimisants modernes. Nous avons choisi de nous concentrer sur les transformations de boucles et sur leur automatisation, exprimées dans le modèle polyédrique. Les méthodes d'optimisation de programmes dans le modèle polyédrique se répartissent grossièrement en deux classes. La première repose sur l'optimisation linéaire d'une fonction de analytique de coût. La deuxième classe de méthodes met en œuvre une recherche itérative. La première approche est rapide, mais elle est facilement mise en défaut en ce qui concerne la découverte de la solution optimale. L'approche itérative est plus précise, mais le temps de compilation peut devenir prohibitif. Cette thèse contribue une approche nouvelle de la recherche itérative de transformations de programmes dans le modèle polyédrique. La nouvelle méthode proposée possède la précision et la capacité effective à extraire des transformations profitables des méthodes itératives, tout en en minimisant les faiblesses. Notre approche repose sur l'évaluation systématique d'une fonction de coût et de prédiction de performances non-linéaire. Par ailleurs, la parallélisation automatique dans le modèle polyédrique est actuellement dominée par des outils de compilation source-à-source. Nous avons choisi au contraire d'implémenter nos techniques dans la plateforme GCC, en opérant sur une représentation de code de bas niveau, à trois adresses. Nous montrons que le niveau d'abstraction de la représentation intermédiaire choisie engendre des difficultés de passage à l'échelle, et nous montrons comment les surmonter. À l'inverse, nous montrons qu'une représentation intermédiaire de bas niveau ouvre de nouveaux degrés de liberté, bénéficiant à notre stratégie itérative de recherche de transformations, et à la compilation polyédrique de manière générale. / In order to take the performance advantages of the current multicore and heterogeneous architectures the compilers are required to perform more and more complex program transformations. The search space of the possible program optimizations is huge and unstructured. Selecting the best transformation and predicting the potential performance benefits of that transformation is the major problem in today's optimizing compilers. The promising approach to handling the program optimizations is to focus on the automatic loop optimizations expressed in the polyhedral model. The current approaches for optimizing programs in the polyhedral model broadly fall into two classes. The first class of the methods is based on the linear optimization of the analytical cost function. The second class is based on the exhaustive iterative search. While the first approach is fast, it can easily miss the optimal solution. The iterative approach is more precise, but its running time might be prohibitively expensive. In this thesis we present a novel search-based approach to program transformations in the polyhedral model. The new method combines the benefits - effectiveness and precision - of the current approaches, while it tries to minimize their drawbacks. Our approach is based on enumerating the evaluations of the precise, nonlinear performance predicting cost-function. The current practice is to use the polyhedral model in the context of source-to-source compilers. We have implemented our techniques in a GCC framework that is based on the low level three address code representation. We show that the chosen level of abstraction for the intermediate representation poses scalability challenges, and we show the ways to overcome those problems. On the other hand, it is shown that the low level IR abstraction opens new degrees of freedom that are beneficial for the search-based transformation strategies and for the polyhedral compilation in general.

This thesis proposes a new approach to formalize refactorings, principally at the UML class diagram design level (but incorporating a limited amount of code-level information—basic access-related information). A set of abstract and atomic fine-grain transformations (FGTs) is defined as prototypical building blocks for constructing refactorings. The semantics of each FGT is specified in terms of its pre- and postcondition conjuncts. Various logical relationships between FGT pre- and postcondition conjuncts are fully catalogued. These include uni- and bidirectional sequential dependency relationships; absorbing and cancelling reduction relationships; and uni- and bi-directional conflict relationships. The principle container for FGTs is an FGT-list in which the ordering of FGTs respects the sequential relationships between them. Such a list is characterised by the set of FGT precondition conjuncts (which a system should satisfy if the FGTs are to be sequentially applied to the system) as well as the resulting postcondition conjuncts (that describe the effect of applying the list). In the thesis, twenty-nine commonly used primitive refactorings are specified as such FGT-lists, together with their associated FGT-enabling precondition conjuncts. Refactoring-level pre- and postconditions are also identified for each primitive refactoring FGT-list. These are, of course, required to guarantee behaviour preservation.<p. An alternative container for FGTs is defined, called an FGT-DAG. It is a directed acyclic graph with FGTs as nodes, and with arcs that reflect the sequential dependency relationships between constituent FGTs. An algorithm is provided to convert a list of FGTs into a corresponding set of FGT-DAGs. Thus design level refactorings specified as FGT-lists can be also be converted to corresponding sets of FGT-DAGs. The precondition for applying such a refactoring to a given system is specified at two levels: the FGT-enabling precondition conjuncts that apply to each FGT-DAG, and the refactoring-level precondition conjuncts. The thesis provides various algorithms that operate on FGT-DAGs. These include an algorithm to remove redundancies from an FGT-DAG. It also includes algorithms that operate on the elements of a set of FGT-DAGs: to detect sequential dependencies between these elements, to detect whether they are in deadlock, and to detect and possibly remove or modify FGTs causing conflicts between them. In addition, an algorithm is provided to build composite refactorings from primitive refactorings. It indicates how composite-level and FGT-enabling precondition conjuncts can be derived and utilised to avoid the rollback problem. A Prolog prototype FGT-based refactoring tool has been implemented. The tool stores all of the above-mentioned catalogued information as Prolog rules and facts. This includes the twenty-nine commonly used primitive refactorings (stored as Prolog FGT-lists) and their associated refactoring-level pre- and postcondition conjuncts. The tool also implements all the previously mentioned algorithms as Prolog procedures. The thesis thus establishes the foundations for a tool in which end users can create (and apply without rollback) not only composite refactorings, but also completely new refactorings whose semantics is constrained only by the fine-grained semantics of FGTs, rather than by the more course-grained semantics of primitive refactorings. Furthermore, using FGTs as refactoring building blocks (i.e. instead of primitive refactorings) means that redundancies and conflicts can be more accurately pin-pointed and removed; and opportunities for parallel execution are exposed at a more fine-grained level. These advantages come at the cost of having to carry out more computations because analysis has to take place at the FGT-level rather than at the refactoring-level. / Thesis (PhD)--University of Pretoria, 2009. / Computer Science / unrestricted

Selected economic and legal aspects of mergers and acquisitions in the Czech Republic Abstract The aim of this diploma thesis is to describe selected economic and legal aspects of mergers and acquisitions and assess them. In the first part, the diploma thesis focuses on defining the terms of mergers and acquisitions and their classification. Forms of mergers and acquisitions are distinguished and their types based on market position of participating companies are explained. In the second part, the diploma thesis describes motives leading to mergers and acquisitions. The main motive is synergy, a phenomenon of increasing the value of participating companies by merging them. Furthermore, the waves in which mergers and acquisitions were emerging are listed, including the seventh wave which peaked last year. The third part of the diploma thesis focuses on mergers and acquisitions on the Czech market. At first the comparison within the region is provided and afterwards the thesis deals with development over time, mix of industries and largest transactions of last years. Czech Republic is one of the most active countries in the region from the perspective of value of transactions. The value of transactions in years 2011-2017 grew on average significantly faster than the Czech gross domestic product. Largest Czech...

Submitted in accordance with the requirements for the degree of Doctor of Philosophy in Communication Science University of Zululand, 2011. / The rapid increase in business globalisation has brought with it an increased need for effective international working. As a result, businesses demand a global mindset from their workforce in order for the organisation to efficiently reach their goals (Chaney & Martin, 2011:4). This study aims to assist international organisations and their employees, by providing guidelines for conducting business specifically in Japan and South Africa. It focuses on existing models and theories regarding intercultural communication and compares cultures in South Africa and Japan with a special focus on the work practice. It examines areas of culture, communication, globalisation and cultural transformations in today‟s society. Social customs and business etiquette are also outlined and some specialties for each country are specified. This study also explores how advanced technology and the media are vital components of intercultural communication, used to influence communication across cultures and across geographical locations (Steinberg, 2007:15). The findings of this study aim to improve intercultural competence in both national and international organisations. Hence, management within these organisations should examine the limitations pointed out in this research study and change their policies and procedures to promote and encapsulate a more intercultural and global environment.

No description available.

No description available.

This thesis describes a Master of science research program of duration May, I960 to April, 1961 inclusive. It represents part of an extensive research program designed to investigate the thermodynamic aspects of phase transformations. A great deal of effort has been devoted to the application of multicomponent diffusion theory to (de)carburisation, pearlite, and segregation reactions; particularly in ferrous alloys. This fundamental research program is here extended to a general study of the morphological aspects of phase transformation interfaces. Substantially all industrial metallurgical phase transformations are accompanied by the development of non-planar morphologies with attendant segregation. Previous investigations have demonstrated that the factors controlling the type and degree of morphological development are varied and complex. It is apparent that the structural character of an interface is determined, to a large extent, by the system’s phasial constitution in terms of the concentration, temperature, and pressure variables. Therefore, an examination of the relation between these parameters and the structural form of non-planar interfaces was suggested as a potentially valuable field of endeavour. / Thesis / Master of Science (MSc)