Institute of Applied Mathematics

Heidelberg, Germany

Institute of Applied Mathematics

Heidelberg, Germany

Time filter

Source Type

Weber G.-W.,Institute of Applied Mathematics
Communications in Computer and Information Science | Year: 2015

Desirability functions (DFs) play an increasing role for solving the optimization of process or product quality problems having various quality characteristics to obtain a good compromise between these characteristics. There are many alternative formulations to these functions and solution strategies suggested for handling their weaknesses and improving their strength. Although the DFs of Derringer and Suich are the most popular ones in multiple-response optimization literature, there is a limited number of solution strategies to their optimization which need to be updated with new research results obtained in the area of nonlinear optimization. © Springer International Publishing Switzerland 2015.

Akleylek S.,Ondokuz Mayis University | Akleylek S.,TU Darmstadt | Dagdelen O.,BridgingIT GmbH | Tok Z.Y.,Institute of Applied Mathematics
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2016

Polynomial multiplication is the most time-consuming part of cryptographic schemes whose security is based on ideal lattices. Thus, any efficiency improvement on this building block has great impact on the practicability of lattice-based cryptography. In this work, we investigate several algorithms for polynomial multiplication on a graphical processing unit (GPU), and implement them in both serial and parallel way on the GPU using the compute unified device architecture (CUDA) platform. Moreover, we focus on the quotient ring (ℤ/pℤ) [x]/(xn + 1), where p is a prime number and n is a power of 2. We stress that this ring constitutes the most common setting in lattice-based cryptography for efficiency reasons. As an application we integrate the different implementations of polynomial multiplications into a lattice-based signature scheme proposed by Güneysu et al. (CHES 2012) and identify which algorithm is the preferable choice with respect to the ring of degree n. © Springer International Publishing Switzerland 2016.

Arous G.B.,New York University | Kirkpatrick K.,University of Illinois at Urbana - Champaign | Schlein B.,Institute of Applied Mathematics
Communications in Mathematical Physics | Year: 2013

We study the many body quantum evolution of bosonic systems in the mean field limit. The dynamics is known to be well approximated by the Hartree equation. So far, the available results have the form of a law of large numbers. In this paper we go one step further and we show that the fluctuations around the Hartree evolution satisfy a central limit theorem. Interestingly, the variance of the limiting Gaussian distribution is determined by a time-dependent Bogoliubov transformation describing the dynamics of initial coherent states in a Fock space representation of the system. © 2013 Springer-Verlag Berlin Heidelberg.

Mercker M.,BioQuant | Richter T.,Institute of Applied Mathematics | Hartmann D.,BioQuant | Hartmann D.,Siemens AG
Journal of Physical Chemistry B | Year: 2011

A continuous model of two coupled monolayers constituting a fluid bilayer membrane is presented. The model is based on the minimization of a membrane free energy considering in both monolayer leaflets two different molecule types, undergoing lateral phase separation. Differences in the mechanical properties of the molecules, such as shape, stiffness, and length are accounted explicitly by the model. In the presented model, coupling between monolayers is realized via an energy-based model depending on the local distance between the two monolayers as well as the lengths of molecules constituting the local monolayer region. We numerically study different passive mechanisms for molecule sorting and correlation across the bilayer induced by first-order mechanical constraints. Here, we focus on three aspects: First, we find that stretching of the two monolayers in the normal direction yields a sorting of molecules according to their length. Furthermore, we show that the length of molecules can be used to synchronize phases across the bilayer membrane. Moreover, we find that generating curvature in one layer (induced by different curvature creating mechanisms) sorts molecules of the other layer according to their shape and stiffness. Many recent experimental data indicate the importance of specific lipid-protein interactions and the role of the bilayer thickness in membrane protein function and sorting. The presented model proposes different mechanisms leading to a colocalization of different components in different monolayers at the same place at the same time. © 2011 American Chemical Society.

Bilgin B.,Institute of Applied Mathematics | Kavun E.B.,Institute of Applied Mathematics | Yalcin T.,Institute of Applied Mathematics
Proceedings - 2011 Workshop on Lightweight Security and Privacy: Devices, Protocols, and Applications, LightSec 2011 | Year: 2011

In this paper, a lightweight processor suitable for lightweight cryptographic applications is presented. The processor instruction set is based on the stack-based ZPU architecture. In addition, a simple generic plug-in interface is implemented in order to allow integration of application specific coprocessors to the main processor core. In the current version of the processor, a simple direct memory access engine and a serialized Klein cipher coprocessor are implemented and connected to the processor core. Through these engines, it is possible to implement various lightweight security and authentication schemes in a code and area effective way. A simple assembler code is written and tested on the processor in order to verify the functionality of the processor core and coprocessors. The code implements a Davies-Meyer coding scheme and uses the Klein block cipher as a hash function. The GCC toolset originally written for the 32-bit ZPU is being adapted to work with the 8-bit processor core. The designed processor is synthesized using VeriSilicon GSMC 0.13um low-power process high-density standard cell library for a target operating frequency of 100 KHz, and the resultant gate count is 4.5K GE. © 2011 IEEE.

Kavun E.B.,Institute of Applied Mathematics | Yalcin T.,Institute of Applied Mathematics
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2010

In this paper, we present a lightweight implementation of the permutation Keccak-f[200] and Keccak-f[400] of the SHA-3 candidate hash function Keccak. Our design is well suited for radio-frequency identification (RFID) applications that have limited resources and demand lightweight cryptographic hardware. Besides its low-area and low-power, our design gives a decent throughput. To the best of our knowledge, it is also the first lightweight implementation of a sponge function, which differentiates it from the previous works. By implementing the new hash algorithm Keccak, we have utilized unique advantages of the sponge construction. Although the implementation is targeted for Application Specific Integrated Circuit (ASIC) platforms, it is also suitable for Field Programmable Gate Arrays (FPGA). To obtain a compact design, serialized data processing principles are exploited together with algorithm-specific optimizations. The design requires only 2.52K gates with a throughput of 8 Kbps at 100 KHz system clock based on 0.13-μm CMOS standard cell library. © 2010 Springer-Verlag.

Sospedra-Alfonso R.,Institute of Applied Mathematics | Shizgal B.D.,Institute of Applied Mathematics
Transport Theory and Statistical Physics | Year: 2012

We study the relaxation of Li + ions dilutely dispersed in He at equilibrium. We employ the Henyey-Greenstein phase function to model the angular dependence of the differential scattering cross section for Li +-He collisions. We solve the spatially homogeneous linear Boltzmann equation for this model cross section with the collision operator explicitly given in terms of the scattering kernel. With the Quadrature Discretization Method based on the speed polynomials, the Boltzmann equation is reduced to a set of ordinary differential equations. This numerical method provides a rapid convergence for the Li + distribution function. We study the relaxation of the shape of the Li + distribution function in terms of the Kullback-Leibler information relative to the steady state and local in time Maxwellians. A comparison of the relaxation times of these two functionals show that there is no formation of a local Maxwellian during the relaxation process. This was verified for several values of the g-parameter in the Henyey-Greenstein phase function model and the initial average energies investigated. © 2012 Copyright Taylor and Francis Group, LLC.

McLeod J.B.,University of Oxford | Niethammer B.,University of Oxford | Velazquez J.J.L.,Institute of Applied Mathematics
Journal of Statistical Physics | Year: 2011

We consider mass-conserving self-similar solutions for Smoluchowski's coagulation equation with kernel K(ξ, η) = (ξη) λ with λ ∈ (0, 1/2). It is known that such self-similar solutions g(x) satisfy that x -1+2λg(x) is bounded above and below as x → 0. In this paper we describe in detail via formal asymptotics the qualitative behavior of a suitably rescaled function h(x) = h λx -1+2λg(x) in the limit λ → 0. It turns out that, as x → 0. As x becomes larger h develops peaks of height 1/λ that are separated by large regions where h is small. Finally, h converges to zero exponentially fast as x → ∞. Our analysis is based on different approximations of a nonlocal operator, that reduces the original equation in certain regimes to a system of ODE. © 2011 Springer Science+Business Media, LLC.

Daya B.,Lebanese University | Akoum A.P.,Institute of Applied Mathematics | Chauvet H.,Institute of Applied Mathematics
Proceedings - 2010 International Conference on Computational Intelligence and Communication Networks, CICN 2010 | Year: 2010

This paper represents a framework for multiclass vehicle type identification based on several geometrical parameters. The system of identification of object must thus have a very great adaptability. We represent a system of identification of the type (model) of vehicles per vision. Several geometrical parameters (distance, surface, ratio ...) of decision, on bases of images taken in real conditions, were tested and analyzed. The details of preprocessing as well as the features represented above are described in this paper. According to these parameters, the rate of identification can reach 95% on a basis of images made up of 9 classes of the type of vehicles. Then artificial neural network (ANNE) was used to verify and to classify the different types of the vehicles, and a ratio of identification of about 97% was obtained. The details of the implementation and results of the simulation are discussed in this paper. © 2010 IEEE.

Sospedra-Alfonso R.,Institute of Applied Mathematics | Shizgal B.D.,Institute of Applied Mathematics
Physical Review E - Statistical, Nonlinear, and Soft Matter Physics | Year: 2011

We study the thermalization of energetic electrons dilutely dispersed in inert gas atomic moderators, with and without the presence of an external electric field. We investigate the shape relaxation of the electron distribution function relative to the steady-state distribution by means of the Kullback-Leibler entropy. The departure of the distribution function from a local Maxwellian parametrized by the temperature of the electrons is also considered with a functional analogous to the Kullback-Leibler entropy. For neon and argon as moderators, we found no evidence for the formation of a local Maxwellian followed by a slower relaxation to equilibrium. The momentum-transfer cross section for e-Ne collisions is almost constant with energy, whereas the e-Ar momentum-transfer cross section has a deep Ramsauer-Townsend minimum and a strong energy dependence. The role of the Ramsauer minimum in the relaxation processes is investigated. The time-dependent Lorentz-Fokker-Planck equation is solved for the speed distribution of the electrons with a finite difference method. A pseudospectral method is also used to investigate the spectral properties of the Fokker-Planck operator. In spite of the multi-exponential time dependence of the speed distribution function, we show that a single average relaxation time can be defined to characterize the relaxation to equilibrium. © 2011 American Physical Society.

Loading Institute of Applied Mathematics collaborators
Loading Institute of Applied Mathematics collaborators