Topology optimization of composite hyperelastic material using SPIMFO-method

Meccanica - Fiber reinforced materials are used in assorted engineering application and for this reason, new additive manufacturing technologies have been developed for this type of materials. With...     

Enhancing signal-to-noise ratio and resolution in low-field NMR relaxation measurements using post-acquisition digital filters

The traditional way to enhance signal-to-noise ratio (SNR) of nuclear magnetic resonance (NMR) signals is to increase the number of scans. However, this procedure increases the measuring time that can be prohibitive for some applications. Therefore, we have tested the use of several post-acquisition digital filters to enhance SNR up to one order of magnitude in time domain NMR (TD-NMR) relaxation measurements. The procedures were studied using continuous wave free precession (CWFP-T₁) signals, acquired with very low flip angles that contain six times more noise than the Carr–Purcell–Meiboom–Gill (CPMG) signal of the same sample and experimental time. Linear (LI) and logarithmic (LO) data compression, low-pass infinity impulse response (LP), Savitzky–Golay (SG), and wavelet transform (WA) post-acquisition filters enhanced the SNR of the CWFP-T₁ signals by at least six times. The best filters were LO, SG, and WA that have high enhancement in SNR without significant distortions in the ILT relaxation distribution data. Therefore, it was demonstrated that these post-acquisition digital filters could be a useful way to denoise CWFP-T₁, as well as CPMG noisy signals, and consequently reducing the experimental time. It was also demonstrated that filtered CWFP-T₁ method has the potential to be a rapid and nondestructive method to measure fat content in beef and certainly in other meat samples.     

Heisenberg-limited Measurements and Sub-Planck Structures in Phase Space

It is shown how sub-Planck phase-space structures can be used to achieve Heisenberg-limited sensitivity in weak force measurements. Nonclassical states of harmonic oscillators, such as superpositions of coherent states, are shown to be useful for the measurement of weak forces that cause translations or rotations in phase space, which is done by entangling the quantum oscillator with a two-level system. This method is closely related to the Loschmidt echo techniques employed in nuclear magnetic resonance experiments. Implementations of this strategy in cavity QED and ion traps are described.     

Interface-related effects on confined excitons in GaAs/AlxGa1−xAs single quantum wells

Confined excitons in non-abrupt GaAs/Al_xGa_1−xAs single quantum wells are studied. The graded interfaces are described taking into account fluctuations in their thickness a and positioning with respect to the abrupt interface picture. Numerical results for confined (0,0),(1,1) and (0,2) excitons in GaAs/Al_0.3Ga_0.7As quantum wells show that while the interfacial fluctuations produce small changes (<0.5 meV) in the exciton binding energies, the confined exciton energies can be red- or blue-shifted as much as 25 meV for wells with mean width of 50 Å and 2 ML wide interfaces.     

Extremes of deterministic sub‐sampled moving averages with heavy‐tailed innovations

Let {X_k}_k?1 be a strictly stationary time series. For a strictly increasing sampling function g:?→? define Y_k=X_g(k) as the deterministic sub‐sampled time series. In this paper, the extreme value theory of {Y_k} is studied when X_k has representation as a moving average driven by heavy‐tailed innovations. Under mild conditions, convergence results for a sequence of point processes based on {Y_k} are proved and extremal properties of the deterministic sub‐sampled time series are derived. In particular, we obtain the limiting distribution of the maximum and the corresponding extremal index. Copyright © 2003 John Wiley & Sons, Ltd.     

Affine Arithmetic: Concepts and Applications

Affine arithmetic is a model for self-validated numerical computation that keeps track of first-order correlations between computed and input quantities. We explain the main concepts in affine arithmetic and how it handles the dependency problem in standard interval arithmetic. We also describe some of its applications.     

Entangled Bell states of two electrons in coupled quantum dots—phonon decoherence

We demonstrate coupling and entangling of quantum states in a pair of vertically aligned self assembled quantum dots by studying the dynamics of two interacting electrons driven by external electric field. The present entanglement involves the spatial degree of freedom for the two electrons system. We show that system of two interacting electrons initially delocalized (localized each in one dot) oscillate slowly in response to electric field, since the strong Coulomb repulsion makes them behaving so. We use an explicit formula for the entanglement of formation of two qubit in terms of the concurrence of the density operator. In ideal situations, entangled quantum states would not decohere during processing and transmission of quantum information. However, real quantum systems will inevitably be influenced by surrounding environments. We discuss the degree of entanglement of this system in which we introduce the decoherence effect caused by the acoustic phonon. In this entangled states proposal, the decohering time depends on the external parameters.     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.