• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 47
  • 32
  • 4
  • 3
  • 3
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 103
  • 103
  • 59
  • 22
  • 15
  • 13
  • 12
  • 12
  • 10
  • 10
  • 9
  • 9
  • 9
  • 9
  • 8
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
41

Linking Geometry, Algebra and Calculus with GeoGebra

Böhm, Josef 12 April 2012 (has links)
GeoGebra is a free, open-source, and multi-platform software that combines dynamic geometry, algebra and calculus in one easy-to-use package. Students from middle-school to university can use it in classrooms and at home. In this workshop, we will introduce the features of GeoGebra with a special focus on not very common applications of a dynamic geometry program. We will inform about plans for developing training and research networks connected to GeoGebra. We can expect that at the time of the conference a spreadsheet will be integrated into GeoGebra which offers new ways teaching mathematics using the interplay between the features of a spreadsheet and the objects of dynamic geometry.
42

CONVERSION FROM ENGINEERING UNITS TO TELEMETRY COUNTS ON DRYDEN FLIGHT SIMULATORS

Fantini, Jay A. 10 1900 (has links)
International Telemetering Conference Proceedings / October 26-29, 1998 / Town & Country Resort Hotel and Convention Center, San Diego, California / Dryden real-time flight simulators encompass the simulation of pulse code modulation (PCM) telemetry signals. This paper presents a new method whereby the calibration polynomial (from first to sixth order), representing the conversion from counts to engineering units (EU), is numerically inverted in real time. The result is less than onecount error for valid EU inputs. The Newton-Raphson method is used to numerically invert the polynomial. A reverse linear interpolation between the EU limits is used to obtain an initial value for the desired telemetry count. The method presented here is not new. What is new is how classical numerical techniques are optimized to take advantage of modern computer power to perform the desired calculations in real time. This technique makes the method simple to understand and implement. There are no interpolation tables to store in memory as in traditional methods. The NASA F-15 simulation converts and transmits over 1000 parameters at 80 times/sec. This paper presents algorithm development, FORTRAN code, and performance results.
43

Comparison of Power Flow Algorithms for inclusion in On-line Power Systems Operation Tools

Bokka, Naveen 17 December 2010 (has links)
The goal of this thesis is to develop a new, fast, adaptive load flow algorithm that "automatically alternates" numerical methods including Newton-Raphson method, Gauss-Seidel method and Gauss method for a load flow run to achieve less run time. Unlike the proposed method, the traditional load flow analysis uses only one numerical method at a time. This adaptive algorithm performs all the computation for finding the bus voltage angles and magnitudes, real and reactive powers for the given generation and load values, while keeping track of the proximity to convergence of a solution. This work focuses on finding the algorithm that uses multiple numerical techniques, rather than investigating programming techniques and programming languages. The convergence time is compared with those from using each of the numerical techniques. The proposed method is implemented on the IEEE 39-bus system with different contingencies and the solutions obtained are verified with PowerWorld Simulator, a commercial software for load flow analysis.
44

Modelo analítico para linhas de transmissão de energia elétrica : aplicação em linhas trifásicas com plano de simetria vertical /

Carvalho, Carolina Goulart de. January 2013 (has links)
Orientador: Sérgio Kurokawa / Banca: Ailton Akira Shinoda / Banca: Mariangela Carvalho Bovolato / Banca: Marcos de Araujo Paz / Banca: Damásio Fernandes Júnior / Resumo: Este trabalho apresenta um modelo analítico para uma linha de transmissão trifásica com plano de simetria vertical. Devido às características físicas dessa linha, é possível representá-la por um sistema constituído por uma linha monofásica e por uma linha bifásica. Nesse sistema, as equações que descrevem o comportamento das grandezas nos terminais da linha monofásica são conhecidas, enquanto que as equações da linha bifásica foram obtidas utilizando uma matriz de transformação escrita explicitamente em função dos parâmetros da linha trifásica. Em seguida, as grandezas modais da linha trifásica foram convertidas para o domínio das fases e as equações resultantes representam um modelo analítico desenvolvido diretamente no domínio das fases dessa linha. Para verificar o desempenho do modelo, foram realizadas simulações considerando a energização e a incidência de uma descarga atmosférica em uma linha trifásica de 440 kV. Esses resultados foram comparados aos resultados obtidos com a linha representada por meio de um método clássico (representação nos modos) e as simulações mostraram que o modelo responde adequadamente na faixa de frequência correspondente aos procedimentos de manobra e chaveamento. O modelo desenvolvido leva em conta o efeito da frequência sobre os parâmetros longitudinais da linha e também o fato de que os parâmetros da linha são distribuídos ao longo de seu comprimento. Acredita-se que a análise das matrizes, que dão suporte ao modelo, e a validação do modelo no domínio do tempo possa dar origem, futuramente, a um modelo de linha de transmissão desenvolvido diretamente no domínio do tempo. Tal modelo, pelo fato de ser obtido diretamente das equações de propagação da linha, permitirá a obtenção de resultados de simulações, de transitórios eletromagnéticos que ocorrem... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: This paper presents an analytical model to a three-phase transmission line with vertical symmetry plane. Because of physical characteristics of this line, it is possible to represent it by a system consisting of a single-phase and a two-phase line. In this system, the equations that describe the behavior of single-phase terminals quantities are known, while the two-phase equations were obtained using a transformation matrix written explicitly in terms of the parameters of three-phase line. Then, the modal quantities of three-phase line were converted into phase domain and the resulting equations represent an analytical model developed directly in phase domain of this line. To verify the performance of the model, were performed simulations considering the energization and impact of a lighting surge in a 440 kV three-phase line. These results were compared to results obtained with the line represented by a classical method (presentation modes) and simulations show that the model responds appropriately in the frequency range corresponding to the operation and switching procedures. The model developed takes into account the frequency effect on the longitudinal line parameters and also the fact that the line parameters are distributed along their length. It is believed that the matrix analysis, that support the model and the model validation in time domain may give rise in the future to a transmission line model developed directly in time domain. Such a model, because it is obtained directly from the propagation equations of line, will enable the more accurate results of simulations of electromagnetic transients that... (Complete abstract click electronic access below) / Doutor
45

The inexact Newton-like method for inverse eigenvalue problem and a DCT based watermarking scheme for copyright protection of images.

January 2002 (has links)
by Hau-Leung Chung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 41-42). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.5 / Chapter 1.1 --- Paper I --- p.5 / Chapter 1.2 --- Paper II --- p.6 / Chapter 2 --- The Inexact Newton-Like Method for Inverse Eigen- value Problem --- p.8 / Chapter 2.1 --- Introduction --- p.8 / Chapter 2.2 --- The Newton-Like Method --- p.9 / Chapter 2.3 --- The Inexact Newton-Like Method --- p.11 / Chapter 2.4 --- Convergence Analysis --- p.14 / Chapter 2.5 --- Numerical Experiments --- p.22 / Chapter 3 --- A DCT Based Watermarking Scheme for Copyright Protection of Images --- p.26 / Chapter 3.1 --- Introduction --- p.26 / Chapter 3.2 --- Preliminary --- p.28 / Chapter 3.2.1 --- Gray-level image --- p.28 / Chapter 3.2.2 --- Color image --- p.29 / Chapter 3.2.3 --- The Discrete Cosine transform --- p.30 / Chapter 3.3 --- Watermarking Approaches --- p.31 / Chapter 3.3.1 --- Insertion procedures --- p.31 / Chapter 3.3.2 --- Retrieval procedures --- p.33 / Chapter 3.4 --- Experimental results --- p.34 / Chapter 3.5 --- Other Applications --- p.38 / Chapter 3.5.1 --- Data Hiding --- p.38 / Chapter 3.5.2 --- Authentication --- p.39 / Chapter 3.5.3 --- Fingerprinting --- p.39 / Chapter 3.5.4 --- Copy Control --- p.39 / Chapter 3.6 --- Conclusion --- p.40 / Bibliography --- p.41
46

Implementation and evaluation of a polynomial-based division algorithm / Implementering och utvärdering av en polynombaserad divisionsalgoritm

Pettersson, Stefan January 2003 (has links)
<p>In comparison to other basic arithmetic operations, such as addition, subtraction and multiplication,division is far more complex and expensive. Many division algorithms, except for lookup tables, rely on recursion with usually complex operations in the loop. Even if the cost in terms of area and computational complexity sometimes can be made low, the latency is usually high anyway, due to the number of iterations required. Therefore, in order to find a faster method and a method that provides better precision, a non-recursive polynomial-based algorithm was developed by the Department of Electrical Engineering at Linköping University. </p><p>After having performed high-level modelling in Matlab, promising results were achieved for up to 32 bits of accuracy. However, since the cost model did not take in account other factors that are important when implementing in hardware, the question remained whether the division algorithm was also competitive in practice or not. Therefore, in order to investigate that, this thesis work was initiated. </p><p>This report describes the hardware implementation, the optimization and the evaluation of this division algorithm, regarding latency and hardware cost for numbers with different precisions. In addition to this algorithm, the common Newton-Raphson algorithm has also been implemented, to serve as a reference.</p>
47

Inversion of Vandermonde Matrices in FPGAs / Invertering av Vandermondematriser i FPGA

Hu, ShiQiang, Yan, Qingxin January 2004 (has links)
<p>In this thesis, we explore different algorithms for the inversion of Vandermonde matrices and the corresponding suitable architectures for implement in FPGA. The inversion of Vandermonde matrix is one of the three master projects of the topic, Implementation of a digital error correction algorithm for time-interleaved analog-to-digital converters. The project is divided into two major parts: algorithm comparison and optimization for inversion of Vandermonde matrix; architecture selection for implementation. A CORDIC algorithm for sine and cosine and Newton-Raphson based division are implemented as functional blocks.</p>
48

Implementation and evaluation of a polynomial-based division algorithm / Implementering och utvärdering av en polynombaserad divisionsalgoritm

Pettersson, Stefan January 2003 (has links)
In comparison to other basic arithmetic operations, such as addition, subtraction and multiplication,division is far more complex and expensive. Many division algorithms, except for lookup tables, rely on recursion with usually complex operations in the loop. Even if the cost in terms of area and computational complexity sometimes can be made low, the latency is usually high anyway, due to the number of iterations required. Therefore, in order to find a faster method and a method that provides better precision, a non-recursive polynomial-based algorithm was developed by the Department of Electrical Engineering at Linköping University. After having performed high-level modelling in Matlab, promising results were achieved for up to 32 bits of accuracy. However, since the cost model did not take in account other factors that are important when implementing in hardware, the question remained whether the division algorithm was also competitive in practice or not. Therefore, in order to investigate that, this thesis work was initiated. This report describes the hardware implementation, the optimization and the evaluation of this division algorithm, regarding latency and hardware cost for numbers with different precisions. In addition to this algorithm, the common Newton-Raphson algorithm has also been implemented, to serve as a reference.
49

Inversion of Vandermonde Matrices in FPGAs / Invertering av Vandermondematriser i FPGA

Hu, ShiQiang, Yan, Qingxin January 2004 (has links)
In this thesis, we explore different algorithms for the inversion of Vandermonde matrices and the corresponding suitable architectures for implement in FPGA. The inversion of Vandermonde matrix is one of the three master projects of the topic, Implementation of a digital error correction algorithm for time-interleaved analog-to-digital converters. The project is divided into two major parts: algorithm comparison and optimization for inversion of Vandermonde matrix; architecture selection for implementation. A CORDIC algorithm for sine and cosine and Newton-Raphson based division are implemented as functional blocks.
50

Time performance comparison in determining the weak parts in wooden logs

Akhtar, Naeem, Alzghoul, Ahmad January 2009 (has links)
<p>The steadily increasing demand of wood forces sawmills to increase the efficiency and effectiveness of their equipments. The weak parts and the twist in wooden logs have been documented as the most common and crucial defect in sawn lumber.</p><p>In this thesis we are going to implement a program which is able to determine the weak parts in wooden logs. The implementation will be in two languages C++ and Matlab. Parts of the program are going to be implemented sometimes by C++ and sometimes by Matlab therefore different designs are going to be tested. The aim of this thesis is to check whether these designs will meet the real time bound of 10 m/s.</p><p>The result shows that there is a huge difference in time performance for the different designs. Therefore, different discretization levels were used in order to meet the deadline of 10m/s. We found that in order to get better speed one should calculate the matrix for the function <em>F </em>and the Jacobian function <em>J </em>by using C++ not by Matlab. Also we found that when we called functions from one language to another an extra time is added.</p>

Page generated in 0.0256 seconds