Correlations, quantum entanglement and interference in nanoscopic systems

Several of the most interesting quantum effects can or could be observed in nanoscopic systems. For example, the effect of strong correlations between electrons and of quantum interference can be measured in transport experiments through quantum dots, wires, individual molecules and rings formed by large molecules or arrays of quantum dots. In addition, quantum coherence and entanglement can be clearly observed in quantum corrals. In this paper we present calculations of transport properties through Aharonov-Bohm strongly correlated rings where the characteristic phenomenon of charge-spin separation is clearly observed. Additionally quantum interference effects show up in transport through pi-conjugated annulene molecules producing important effects on the conductance for different source-drain configurations, leading to the possibility of an interesting switching effect. Finally, elliptic quantum corrals offer an ideal system to study quantum entanglement due to their focalizing properties. Because of an enhanced interaction between impurities localized at the foci, these systems also show interesting quantum dynamical behaviour and offer a challenging scenario for quantum information experiments.

The stochastic exit problem for dynamical systems

The problem of "exit against a flow" for dynamical systems subject to small Gaussian white noise excitation is studied. Here the word "flow" refers to the behavior in phase space of the unperturbed system's state variables. "Exit against a flow" occurs if a perturbation causes the phase point to leave a phase space region within which it would normally be confined. In particular, there are two components of the problem of exit against a flow:

i) the mean exit time

ii) the phase-space distribution of exit locations.

When the noise perturbing the dynamical systems is small, the solution of each component of the problem of exit against a flow is, in general, the solution of a singularly perturbed, degenerate elliptic-parabolic boundary value problem.

Singular perturbation techniques are used to express the asymptotic solution in terms of an unknown parameter. The unknown parameter is determined using the solution of the adjoint boundary value problem.

The problem of exit against a flow for several dynamical systems of physical interest is considered, and the mean exit times and distributions of exit positions are calculated. The systems are then simulated numerically, using Monte Carlo techniques, in order to determine the validity of the asymptotic solutions.

Probing the high density behavior of the symmetry energy by using proton elliptic flow

Based on the isospin- and momentum-dependent transport model IBUU04, we calculated the reaction of the Sn-132+Sn-124 systems in semi-central collisions at beam energies of 400/A MeV, 600/A MeV and 800/A MeV by adopting two different density dependent symmetry energies. It was found that the proton differential elliptic flow as a function of transverse momentum is quite sensitive to the density dependence of symmetry energy, especially for the considered beam energy range. Therefore the proton differential elliptic flow may be considered as a robust probe for investigating the high density behavior of symmetry energy in intermediate energy heavy ion collisions.

Cryptographic coprocessors for embedded systems

In the field of embedded systems design, coprocessors play an important role as a component to increase performance. Many embedded systems are built around a small General Purpose Processor (GPP). If the GPP cannot meet the performance requirements for a certain operation, a coprocessor can be included in the design. The GPP can then offload the computationally intensive operation to the coprocessor; thus increasing the performance of the overall system. A common application of coprocessors is the acceleration of cryptographic algorithms. The work presented in this thesis discusses coprocessor architectures for various cryptographic algorithms that are found in many cryptographic protocols. Their performance is then analysed on a Field Programmable Gate Array (FPGA) platform. Firstly, the acceleration of Elliptic Curve Cryptography (ECC) algorithms is investigated through the use of instruction set extension of a GPP. The performance of these algorithms in a full hardware implementation is then investigated, and an architecture for the acceleration the ECC based digital signature algorithm is developed. Hash functions are also an important component of a cryptographic system. The FPGA implementation of recent hash function designs from the SHA-3 competition are discussed and a fair comparison methodology for hash functions presented. Many cryptographic protocols involve the generation of random data, for keys or nonces. This requires a True Random Number Generator (TRNG) to be present in the system. Various TRNG designs are discussed and a secure implementation, including post-processing and failure detection, is introduced. Finally, a coprocessor for the acceleration of operations at the protocol level will be discussed, where, a novel aspect of the design is the secure method in which private-key data is handled

Hardware elliptic curve cryptographic processor over GF(p)

A novel hardware architecture for elliptic curve cryptography (ECC) over GF(p) is introduced. This can perform the main prime field arithmetic functions needed in these cryptosystems including modular inversion and multiplication. This is based on a new unified modular inversion algorithm that offers considerable improvement over previous ECC techniques that use Fermat's Little Theorem for this operation. The processor described uses a full-word multiplier which requires much fewer clock cycles than previous methods, while still maintaining a competitive critical path delay. The benefits of the approach have been demonstrated by utilizing these techniques to create a field-programmable gate array (FPGA) design. This can perform a 256-bit prime field scalar point multiplication in 3.86 ms, the fastest FPGA time reported to date. The ECC architecture described can also perform four different types of modular inversion, making it suitable for use in many different ECC applications. © 2006 IEEE.

Multiplicity results for some classes of Schrödinger-Poisson systems

In this thesis, we study the existence and multiplicity of solutions of the following class of Schr odinger-Poisson systems: u + u + l(x) u = (x; u) in R3; = l(x)u2 in R3; where l 2 L2(R3) or l 2 L1(R3). And we consider that the nonlinearity satis es the following three kinds of cases: (i) a subcritical exponent with (x; u) = k(x)jujp 2u + h(x)u (4 p < 2 ) under an inde nite case; (ii) a general inde nite nonlinearity with (x; u) = k(x)g(u) + h(x)u; (iii) a critical growth exponent with (x; u) = k(x)juj2 2u + h(x)jujq 2u (2 q < 2 ). It is worth mentioning that the thesis contains three main innovations except overcoming several di culties, which are generated by the systems themselves. First, as an unknown referee said in his report, we are the rst authors concerning the existence of multiple positive solutions for Schr odinger- Poisson systems with an inde nite nonlinearity. Second, we nd an interesting phenomenon in Chapter 2 and Chapter 3 that we do not need the condition R R3 k(x)ep 1dx < 0 with an inde nite noncoercive case, where e1 is the rst eigenfunction of +id in H1(R3) with weight function h. A similar condition has been shown to be a su cient and necessary condition to the existence of positive solutions for semilinear elliptic equations with inde nite nonlinearity for a bounded domain (see e.g. Alama-Tarantello, Calc. Var. PDE 1 (1993), 439{475), or to be a su cient condition to the existence of positive solutions for semilinear elliptic equations with inde nite nonlinearity in RN (see e.g. Costa-Tehrani, Calc. Var. PDE 13 (2001), 159{189). Moreover, the process used in this case can be applied to study other aspects of the Schr odinger-Poisson systems and it gives a way to study the Kirchho system and quasilinear Schr odinger system. Finally, to get sign changing solutions in Chapter 5, we follow the spirit of Hirano-Shioji, Proc. Roy. Soc. Edinburgh Sect. A 137 (2007), 333, but the procedure is simpler than that they have proposed in their paper.

Algebraic Geometric Codes and their relation to Cryptography using Elliptic Curves

Communication is the process of transmitting data across channel. Whenever data is transmitted across a channel, errors are likely to occur. Coding theory is a stream of science that deals with finding efficient ways to encode and decode data, so that any likely errors can be detected and corrected. There are many methods to achieve coding and decoding. One among them is Algebraic Geometric Codes that can be constructed from curves. Cryptography is the science ol‘ security of transmitting messages from a sender to a receiver. The objective is to encrypt message in such a way that an eavesdropper would not be able to read it. A eryptosystem is a set of algorithms for encrypting and decrypting for the purpose of the process of encryption and decryption. Public key eryptosystem such as RSA and DSS are traditionally being prel‘en‘ec| for the purpose of secure communication through the channel. llowever Elliptic Curve eryptosystem have become a viable altemative since they provide greater security and also because of their usage of key of smaller length compared to other existing crypto systems. Elliptic curve cryptography is based on group of points on an elliptic curve over a finite field. This thesis deals with Algebraic Geometric codes and their relation to Cryptography using elliptic curves. Here Goppa codes are used and the curves used are elliptic curve over a finite field. We are relating Algebraic Geometric code to Cryptography by developing a cryptographic algorithm, which includes the process of encryption and decryption of messages. We are making use of fundamental properties of Elliptic curve cryptography for generating the algorithm and is used here to relate both.

Certified Rapid Solution of Parametrized Linear Elliptic Equations: Application to Parameter Estimation

We present a technique for the rapid and reliable evaluation of linear-functional output of elliptic partial differential equations with affine parameter dependence. The essential components are (i) rapidly uniformly convergent reduced-basis approximations — Galerkin projection onto a space WN spanned by solutions of the governing partial differential equation at N (optimally) selected points in parameter space; (ii) a posteriori error estimation — relaxations of the residual equation that provide inexpensive yet sharp and rigorous bounds for the error in the outputs; and (iii) offline/online computational procedures — stratagems that exploit affine parameter dependence to de-couple the generation and projection stages of the approximation process. The operation count for the online stage — in which, given a new parameter value, we calculate the output and associated error bound — depends only on N (typically small) and the parametric complexity of the problem. The method is thus ideally suited to the many-query and real-time contexts. In this paper, based on the technique we develop a robust inverse computational method for very fast solution of inverse problems characterized by parametrized partial differential equations. The essential ideas are in three-fold: first, we apply the technique to the forward problem for the rapid certified evaluation of PDE input-output relations and associated rigorous error bounds; second, we incorporate the reduced-basis approximation and error bounds into the inverse problem formulation; and third, rather than regularize the goodness-of-fit objective, we may instead identify all (or almost all, in the probabilistic sense) system configurations consistent with the available experimental data — well-posedness is reflected in a bounded "possibility region" that furthermore shrinks as the experimental error is decreased.

Integrating Hamiltonian systems defined on the Lie groups SO(4) and SO(1,3)

This paper examines optimal solutions of control systems with drift defined on the orthonormal frame bundle of particular Riemannian manifolds of constant curvature. The manifolds considered here are the space forms Euclidean space E³, the spheres S³ and the hyperboloids H³ with the corresponding frame bundles equal to the Euclidean group of motions SE(3), the rotation group SO(4) and the Lorentz group SO(1,3). The optimal controls of these systems are solved explicitly in terms of elliptic functions. In this paper, a geometric interpretation of the extremal solutions is given with particular emphasis to a singularity in the explicit solutions. Using a reduced form of the Casimir functions the geometry of these solutions is illustrated.

Reaction-diffusion systems coupled at the boundary and the Morse-Smale property

We study an one-dimensional nonlinear reaction-diffusion system coupled on the boundary. Such system comes from modeling problems of temperature distribution on two bars of same length, jointed together, with different diffusion coefficients. We prove the transversality property of unstable and stable manifolds assuming all equilibrium points are hyperbolic. To this end, we write the system as an equation with noncontinuous diffusion coefficient. We then study the nonincreasing property of the number of zeros of a linearized nonautonomous equation as well as the Sturm-Liouville properties of the solutions of a linear elliptic problem. (C) 2008 Elsevier Inc. All rights reserved.

Measurement of the elliptic anisotropy of charged particles produced in PbPb collisions at √sNN=2.76 TeV

The anisotropy of the azimuthal distributions of charged particles produced in √sNN=2.76 TeV PbPb collisions is studied with the CMS experiment at the LHC. The elliptic anisotropy parameter, v2, defined as the second coefficient in a Fourier expansion of the particle invariant yields, is extracted using the event-plane method, two- and four-particle cumulants, and Lee-Yang zeros. The anisotropy is presented as a function of transverse momentum (pT), pseudorapidity (η) over a broad kinematic range, 0.3elliptic anisotropy is found to obey a universal scaling with the transverse particle density for different collision systems and center-of-mass energies. © 2013 CERN. Published by the American Physical Society under the terms of the Creative Commons Attribution 3.0 License. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Dynamics of classical particles in oval or elliptic billiards with a dispersing mechanism

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Matrix-vector multiplication and triangular linear solver using GPGPU for symmetric positive definite matrices derived from elliptic equations

The modern GPUs are well suited for intensive computational tasks and massive parallel computation. Sparse matrix multiplication and linear triangular solver are the most important and heavily used kernels in scientific computation, and several challenges in developing a high performance kernel with the two modules is investigated. The main interest it to solve linear systems derived from the elliptic equations with triangular elements. The resulting linear system has a symmetric positive definite matrix. The sparse matrix is stored in the compressed sparse row (CSR) format. It is proposed a CUDA algorithm to execute the matrix vector multiplication using directly the CSR format. A dependence tree algorithm is used to determine which variables the linear triangular solver can determine in parallel. To increase the number of the parallel threads, a coloring graph algorithm is implemented to reorder the mesh numbering in a pre-processing phase. The proposed method is compared with parallel and serial available libraries. The results show that the proposed method improves the computation cost of the matrix vector multiplication. The pre-processing associated with the triangular solver needs to be executed just once in the proposed method. The conjugate gradient method was implemented and showed similar convergence rate for all the compared methods. The proposed method showed significant smaller execution time.

Mixed finite-element methods for elliptic convection-dominated problems arising in semiconductor physics

In this work we develop and analyze an adaptive numerical scheme for simulating a class of macroscopic semiconductor models. At first the numerical modelling of semiconductors is reviewed in order to classify the Energy-Transport models for semiconductors that are later simulated in 2D. In this class of models the flow of charged particles, that are negatively charged electrons and so-called holes, which are quasi-particles of positive charge, as well as their energy distributions are described by a coupled system of nonlinear partial differential equations. A considerable difficulty in simulating these convection-dominated equations is posed by the nonlinear coupling as well as due to the fact that the local phenomena such as "hot electron effects" are only partially assessable through the given data. The primary variables that are used in the simulations are the particle density and the particle energy density. The user of these simulations is mostly interested in the current flow through parts of the domain boundary - the contacts. The numerical method considered here utilizes mixed finite-elements as trial functions for the discrete solution. The continuous discretization of the normal fluxes is the most important property of this discretization from the users perspective. It will be proven that under certain assumptions on the triangulation the particle density remains positive in the iterative solution algorithm. Connected to this result an a priori error estimate for the discrete solution of linear convection-diffusion equations is derived. The local charge transport phenomena will be resolved by an adaptive algorithm, which is based on a posteriori error estimators. At that stage a comparison of different estimations is performed. Additionally a method to effectively estimate the error in local quantities derived from the solution, so-called "functional outputs", is developed by transferring the dual weighted residual method to mixed finite elements. For a model problem we present how this method can deliver promising results even when standard error estimator fail completely to reduce the error in an iterative mesh refinement process.

Applications of elliptic functions to solve differential equations

In questa tesi si mostrano alcune applicazioni degli integrali ellittici nella meccanica Hamiltoniana, allo scopo di risolvere i sistemi integrabili. Vengono descritte le funzioni ellittiche, in particolare la funzione ellittica di Weierstrass, ed elenchiamo i tipi di integrali ellittici costruendoli dalle funzioni di Weierstrass. Dopo aver considerato le basi della meccanica Hamiltoniana ed il teorema di Arnold Liouville, studiamo un esempio preso dal libro di Moser-Integrable Hamiltonian Systems and Spectral Theory, dove si prendono in considerazione i sistemi integrabili lungo la geodetica di un'ellissoide, e il sistema di Von Neumann. In particolare vediamo che nel caso n=2 abbiamo un integrale ellittico.