Determinar curvas a partir de uma série da pontos é uma tarefa importante e muito utilizada em CAD. Este trabalho propõe um algoritmo para determinar uma curva aproximadora representada por diversas curvas de Bézier em sequência a partir de uma sequência de pontos. É utilizada uma abordagem de curvas de Bézier por trechos, onde cada trecho possui continuidade C1-fraca. A otimização é feita pelo recozimento simulado com vizinhança adaptativa que minimiza a soma das distâncias de cada ponto da sequência à curva aproximadora e utiliza o comprimento da curva aproximadora como um fator de regularização. Adicionalmente, é utilizado o recozimento simulado multi-objetivo que avalia a influência da soma das distâncias de cada ponto à curva e do comprimento da curva separadamente. Também é feita uma comparação entre a técnica de ajuste de curvas e a técnica de interpolação de curvas. / The task of determining a curve from a set of points is very important in CAD. This work proposes an algorithm to determine a sequence of Bézier curves that approximate a sequence of points. The piecewise Bézier curve is used, where each curve has C1- weak continuity. The optimization is done using the simulated annealing with adaptive neighborhood aiming at minimizing the sum of the distances from each point of the sequence to the generated curve. The length of this curve is used as a regularization factor. In addition, it is used a multi-objective simulated annealing that evaluates the influence of the sum of the distances from each point to the generated curve, and the curves length. It is also done a comparison between curve fitting and curve interpolation techniques.

abstract: Diophantine arithmetic is one of the oldest branches of mathematics, the search for integer or rational solutions of algebraic equations. Pythagorean triangles are an early instance. Diophantus of Alexandria wrote the first related treatise in the fourth century; it was an area extensively studied by the great mathematicians of the seventeenth century, including Euler and Fermat. The modern approach is to treat the equations as defining geometric objects, curves, surfaces, etc. The theory of elliptic curves (or curves of genus 1, which are much used in modern cryptography) was developed extensively in the twentieth century, and has had great application to Diophantine equations. This theory is used in application to the problems studied in this thesis. This thesis studies some curves of high genus, and possible solutions in both rationals and in algebraic number fields, generalizes some old results and gives answers to some open problems in the literature. The methods involve known techniques together with some ingenious tricks. For example, the equations $y^2=x^6+k$, $k=-39,\,-47$, the two previously unsolved cases for $|k|<50$, are solved using algebraic number theory and the ‘elliptic Chabauty’ method. The thesis also studies the genus three quartic curves $F(x^2,y^2,z^2)=0$ where F is a homogeneous quadratic form, and extend old results of Cassels, and Bremner. It is a very delicate matter to find such curves that have no rational points, yet which do have points in odd-degree extension fields of the rationals. The principal results of the thesis are related to surfaces where the theory is much less well known. In particular, the thesis studies some specific families of surfaces, and give a negative answer to a question in the literature regarding representation of integers n in the form $n=(x+y+z+w)(1/x+1/y+1/z+1/w).$ Further, an example, the first such known, of a quartic surface $x^4+7y^4=14z^4+18w^4$ is given with remarkable properties: it is everywhere locally solvable, yet has no non-zero rational point, despite having a point in (non-trivial) odd-degree extension fields of the rationals. The ideas here involve manipulation of the Hilbert symbol, together with the theory of elliptic curves. / Dissertation/Thesis / Doctoral Dissertation Mathematics 2019

Implementation of elliptic and hyperelliptic curve cryptographic algorithms has been the focus of a great deal of recent research directed at increasing efficiency. Elliptic curve cryptography (ECC) was introduced independently by Koblitz and Miller in the 1980s. Hyperelliptic curve cryptography (HECC), a generalization of the elliptic curve case, allows a decreasing field size as the genus increases. The work presented in this thesis examines the problems created by limited area, power, and computation time when elliptic and hyperelliptic curves are integrated into constrained devices such as wireless sensor network (WSN) and smart cards. The lack of a battery in wireless sensor network limits the processing power of these devices, but they still require security. It was widely believed that devices with such constrained resources cannot incorporate a strong HECC processor for performing cryptographic operations such as elliptic curve scalar multiplication (ECSM) or hyperelliptic curve divisor multiplication (HCDM). However, the work presented in this thesis has demonstrated the feasibility of integrating an HECC processor into such devices through the use of the proposed architecture synthesis and optimization techniques for several inversion-free algorithms. The goal of this work is to develop a hardware implementation of binary elliptic and hyperelliptic curves. The focus is on the modeling of three factors: register allocation, operation scheduling, and storage binding. These factors were then integrated into architecture synthesis and optimization techniques in order to determine the best overall implementation suitable for constrained devices. The main purpose of the optimization is to reduce the area and power. Through analysis of the architecture optimization techniques for both datapath and control unit synthesis, the number of registers was reduced by an average of 30%. The use of the proposed efficient explicit formula for the different algorithms also enabled a reduction in the number of read/write operations from/to the register file, which reduces the processing power consumption. As a result, an overall HECC processor requires from 1843 to 3595 slices for a Xilinix XC4VLX200 and the total computation time is limited to between 10.08 ms to 15.82 ms at a maximum frequency of 50 MHz for a varity of inversion-free coordinate systems in hyperelliptic curves. The value of the new model has been demonstrated with respect to its implementation in elliptic and hyperelliptic curve crypogrpahic algorithms, through both synthesis and simulations. In summary, a framework has been provided for consideration of interactions with synthesis and optimization through architecture modeling for constrained enviroments. Insights have also been presented with respect to improving the design process for cryptogrpahic algorithms through datapath and control unit analysis.

In this study, we apply "the equilibrium price" to investigate the efficiency and the elasticity of Taiwan securities trading market. The "the equilibrium price" of each transaction are used to represent the true price of the security. The intra-daily tick-by-tick data of the Taiwan security market is used to obtain the equilibrium prices. Empirical transaction of the two companies Uni-President Enterprises Corporation and Formosa Plastics Corporation are studied. Time-series models of the equilibrium price and the transaction price are established. The time lengths returning to the equilibrium status are also studied, called the efficiency time. Based on the results, we discuss the efficiency of the two stocks. In order to understand the impact of the efficiency time, linear regression models of the efficiency time are built. Furthermore, the variance ratios of the two stocks are also investigated to study their market efficiency. Finally, the elasticity of demand and the elasticity of supply are studied and their Markov chain models are established. The results show that the two companies stay more time in the inelastic states.

The design of multi-dimensional access methods is difficult as compared to those of one-dimensional case because of no total ordering that preserves spatial locality. One way is to look for the total order that preserves spatial proximity at least to some extent. A space-filling curve is a continuous path which passes through every point in a space once so giving a one-to-one correspondence between the coordinates of the points and the 1D-sequence numbers of points on the curve. The Hilbert curve is a famous space filling curve, since it has been shown to have strong locality preserving properties; that is, it is the best space-filling curve in minimizing the number of clusters. Hence, it has been extensively used to maintain spatial locality of multidimensional data in a wide variety of applications. A window query is an important query operation in spatial (image) databases. Given a Hilbert curve, a window query reports its corresponding orders without the need to decode all the points inside this window into the corresponding Hilbert orders. Chung et al. have proposed an algorithm for decomposing a window into the corresponding Hilbert orders. However, the Hilbert curve requires that the region is of size 2^k x 2^k, where k∈N. The intuitive method such as Chung et al.¡¦s algorithm is to directly use Hilbert curves in the decomposed areas and then connect them. They must generate a sequence of the scanned quadrants additionally before encoding and decoding the Hilbert order of one pixel and scan this sequence one time while encoding and decoding one pixel. In this dissertation, on the design of methods for window queries on a Hilbert curve, we propose an efficient algorithm, named as Quad-Splitting, for decomposing a window into the corresponding Hilbert orders on a Hilbert curve without individual sorting and merging steps. The proposed algorithm does not perform individual sorting and merging steps which are needed in Chung et al.¡¦s algorithm. From our experimental results, we show that the Quad-Splitting algorithm outperforms Chung et al.¡¦s algorithm. On the design of the methods for generating the Hilbert curve of an arbitrary-sized image, we propose approximately even partition approach to generate a pseudo Hilbert curve of an arbitrary-sized image. From our experimental results, we show that our proposed pseudo Hilbert curve preserves the similar strong locality property to the Hilbert curve. On the design of the methods for coding Hilbert curve of an arbitrary-sized image, we propose encoding and decoding algorithms. From our experimental results, we show that our encoding and decoding algorithms outperform the Chung et al.¡¦s algorithms.

The aim of this study is to design and build a miniature spray cooling system, in which the manufactured and adopted chamber, pump and heat exchanger are smaller than the conventional ones. An experiment was conducted to explore the cooling performance of the spray cooling system after its size has been minimized. In the experiment, copper was used to make the heated surface and different working media, such as DI water, as nanofludics with silver and multi-walled carbon nanotubes powder were sprayed on the heated surface to enhance the heat dissipation efficiency of the system. The experiment in this study was set according to two conditions: transient and steady state, with Weber number as the main parameter, to observe the boiling phenomenon of different working media on heated surface and to record the temperature changes of the heated surface. The results were shown in boiling curve and cooling curve. The ultimate goal of this study was to obtain a better understanding of the cooling performance of the miniature spray cooling system in order to apply it to micro-electronic cooling devices, thereby solving the problem of the sharp increase in heating power per unit area on electronic components.

A new normal form x2 + y2 = c2(1 + x2y2) of elliptic curves was introduced by M. Harold Edwards in 2007 over the field k having characteristic different than 2. This new form has very special and important properties such that addition operation is strongly unified and complete for properly chosen parameter c . In other words, doubling can be done by using the addition formula and any two points on the curve can be added by the addition formula without exception. D. Bernstein and T. Lange added one more parameter d to the normal form to cover a large class of elliptic curves, x2 + y2 = c2(1 + dx2y2) over the same field. In this thesis, an expository overview of the literature on Edwards curves is given. First, the types of Edwards curves over the nonbinary field k are introduced, addition and doubling over the curves are derived and efficient algorithms for addition and doubling are stated with their costs. Finally, known elliptic curves and Edwards curves are compared according to their cryptographic applications. The way to choose the Edwards curve which is most appropriate for cryptographic applications is also explained.

Lorenz curves are extensively used in economics to analyze income inequality metrics. In this thesis, we discuss confidence interval estimation methods for generalized Lorenz curve. We first obtain normal approximation (NA) and empirical likelihood (EL) based confidence intervals for generalized Lorenz curves. Then we perform simulation studies to compare coverage probabilities and lengths of the proposed EL-based confidence interval with the NA-based confidence interval for generalized Lorenz curve. Simulation results show that the EL-based confidence intervals have better coverage probabilities and shorter lengths than the NA-based intervals at 100p-th percentiles when p is greater than 0.50. Finally, two real examples on income are used to evaluate the applicability of these methods: the first example is the 2001 income data from the Panel Study of Income Dynamics (PSID) and the second example makes use of households’ median income for the USA by counties for the years 1999 and 2006

The purpose of this paper is to investigate the correlation between income inequality and economic growth in a cross-section of 90 countries from 2002 to 2006. The controversial Kuznets Hypothesis, the economic model that hypothesizes the relationship between inequality and per capita income is an inverted U-shaped curve, is scrutinized and investigated to consider its viability and accuracy. A multiple linear regression model is estimated and the viability of the regression model is supported by several statistical tests. Based on the estimated model, a negative correlation between growth and inequality has been found.

Implementation of elliptic and hyperelliptic curve cryptographic algorithms has been the focus of a great deal of recent research directed at increasing efficiency. Elliptic curve cryptography (ECC) was introduced independently by Koblitz and Miller in the 1980s. Hyperelliptic curve cryptography (HECC), a generalization of the elliptic curve case, allows a decreasing field size as the genus increases. The work presented in this thesis examines the problems created by limited area, power, and computation time when elliptic and hyperelliptic curves are integrated into constrained devices such as wireless sensor network (WSN) and smart cards. The lack of a battery in wireless sensor network limits the processing power of these devices, but they still require security. It was widely believed that devices with such constrained resources cannot incorporate a strong HECC processor for performing cryptographic operations such as elliptic curve scalar multiplication (ECSM) or hyperelliptic curve divisor multiplication (HCDM). However, the work presented in this thesis has demonstrated the feasibility of integrating an HECC processor into such devices through the use of the proposed architecture synthesis and optimization techniques for several inversion-free algorithms. The goal of this work is to develop a hardware implementation of binary elliptic and hyperelliptic curves. The focus is on the modeling of three factors: register allocation, operation scheduling, and storage binding. These factors were then integrated into architecture synthesis and optimization techniques in order to determine the best overall implementation suitable for constrained devices. The main purpose of the optimization is to reduce the area and power. Through analysis of the architecture optimization techniques for both datapath and control unit synthesis, the number of registers was reduced by an average of 30%. The use of the proposed efficient explicit formula for the different algorithms also enabled a reduction in the number of read/write operations from/to the register file, which reduces the processing power consumption. As a result, an overall HECC processor requires from 1843 to 3595 slices for a Xilinix XC4VLX200 and the total computation time is limited to between 10.08 ms to 15.82 ms at a maximum frequency of 50 MHz for a varity of inversion-free coordinate systems in hyperelliptic curves. The value of the new model has been demonstrated with respect to its implementation in elliptic and hyperelliptic curve crypogrpahic algorithms, through both synthesis and simulations. In summary, a framework has been provided for consideration of interactions with synthesis and optimization through architecture modeling for constrained enviroments. Insights have also been presented with respect to improving the design process for cryptogrpahic algorithms through datapath and control unit analysis.