Reinforcement Learning with Orthonormal Basis Adaptation Based on Activity-Oriented Index Allocation

NASA Astrophysics Data System (ADS)

Satoh, Hideki

An orthonormal basis adaptation method for function approximation was developed and applied to reinforcement learning with multi-dimensional continuous state space. First, a basis used for linear function approximation of a control function is set to an orthonormal basis. Next, basis elements with small activities are replaced with other candidate elements as learning progresses. As this replacement is repeated, the number of basis elements with large activities increases. Example chaos control problems for multiple logistic maps were solved, demonstrating that the method for adapting an orthonormal basis can modify a basis while holding the orthonormality in accordance with changes in the environment to improve the performance of reinforcement learning and to eliminate the adverse effects of redundant noisy states.

Discrete fourier transform (DFT) analysis for applications using iterative transform methods

NASA Technical Reports Server (NTRS)

Dean, Bruce H. (Inventor)

2012-01-01

According to various embodiments, a method is provided for determining aberration data for an optical system. The method comprises collecting a data signal, and generating a pre-transformation algorithm. The data is pre-transformed by multiplying the data with the pre-transformation algorithm. A discrete Fourier transform of the pre-transformed data is performed in an iterative loop. The method further comprises back-transforming the data to generate aberration data.

A method of power analysis based on piecewise discrete Fourier transform

NASA Astrophysics Data System (ADS)

Xin, Miaomiao; Zhang, Yanchi; Xie, Da

2018-04-01

The paper analyzes the existing feature extraction methods. The characteristics of discrete Fourier transform and piecewise aggregation approximation are analyzed. Combining with the advantages of the two methods, a new piecewise discrete Fourier transform is proposed. And the method is used to analyze the lighting power of a large customer in this paper. The time series feature maps of four different cases are compared with the original data, discrete Fourier transform, piecewise aggregation approximation and piecewise discrete Fourier transform. This new method can reflect both the overall trend of electricity change and its internal changes in electrical analysis.

Superfast algorithms of multidimensional discrete k-wave transforms and Volterra filtering based on superfast radon transform

NASA Astrophysics Data System (ADS)

Labunets, Valeri G.; Labunets-Rundblad, Ekaterina V.; Astola, Jaakko T.

2001-12-01

Fast algorithms for a wide class of non-separable n-dimensional (nD) discrete unitary K-transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix-2 FFT-type approach. The method utilizes a decomposition of the nD K-transform into the product of a new nD discrete Radon transform and of a set of parallel/independ 1D K-transforms. If the nD K-transform has a separable kernel (e.g., the case of the discrete Fourier transform) our approach leads to decrease of multiplicative complexity by the factor of n comparing to the classical row/column separable approach. It is well known that an n-th order Volterra filter of one dimensional signal can be evaluated by an appropriate nD linear convolution. This work describes new superfast algorithm for Volterra filtering. New approach is based on the superfast discrete Radon and Nussbaumer polynomial transforms.

Discrete wavelet transform: a tool in smoothing kinematic data.

PubMed

Ismail, A R; Asfour, S S

1999-03-01

Motion analysis systems typically introduce noise to the displacement data recorded. Butterworth digital filters have been used to smooth the displacement data in order to obtain smoothed velocities and accelerations. However, this technique does not yield satisfactory results, especially when dealing with complex kinematic motions that occupy the low- and high-frequency bands. The use of the discrete wavelet transform, as an alternative to digital filters, is presented in this paper. The transform passes the original signal through two complementary low- and high-pass FIR filters and decomposes the signal into an approximation function and a detail function. Further decomposition of the signal results in transforming the signal into a hierarchy set of orthogonal approximation and detail functions. A reverse process is employed to perfectly reconstruct the signal (inverse transform) back from its approximation and detail functions. The discrete wavelet transform was applied to the displacement data recorded by Pezzack et al., 1977. The smoothed displacement data were twice differentiated and compared to Pezzack et al.'s acceleration data in order to choose the most appropriate filter coefficients and decomposition level on the basis of maximizing the percentage of retained energy (PRE) and minimizing the root mean square error (RMSE). Daubechies wavelet of the fourth order (Db4) at the second decomposition level showed better results than both the biorthogonal and Coiflet wavelets (PRE = 97.5%, RMSE = 4.7 rad s-2). The Db4 wavelet was then used to compress complex displacement data obtained from a noisy mathematically generated function. Results clearly indicate superiority of this new smoothing approach over traditional filters.

Grey's orthonormal optimization: a 50-year retrospective

NASA Astrophysics Data System (ADS)

Hayford, Michael J.

2014-12-01

The method of Grey's orthonormal optimization is reviewed. Aspects of the method that contributed to its success are reviewed, and factors limiting its application are discussed. Current status of the method is summarized.

Fitting by Orthonormal Polynomials of Silver Nanoparticles Spectroscopic Data

NASA Astrophysics Data System (ADS)

Bogdanova, Nina; Koleva, Mihaela

2018-02-01

Our original Orthonormal Polynomial Expansion Method (OPEM) in one-dimensional version is applied for first time to describe the silver nanoparticles (NPs) spectroscopic data. The weights for approximation include experimental errors in variables. In this way we construct orthonormal polynomial expansion for approximating the curve on a non equidistant point grid. The corridors of given data and criteria define the optimal behavior of searched curve. The most important subinterval of spectra data is investigated, where the minimum (surface plasmon resonance absorption) is looking for. This study describes the Ag nanoparticles produced by laser approach in a ZnO medium forming a AgNPs/ZnO nanocomposite heterostructure.

Symmetric convolution of asymmetric multidimensional sequences using discrete trigonometric transforms.

PubMed

Foltz, T M; Welsh, B M

1999-01-01

This paper uses the fact that the discrete Fourier transform diagonalizes a circulant matrix to provide an alternate derivation of the symmetric convolution-multiplication property for discrete trigonometric transforms. Derived in this manner, the symmetric convolution-multiplication property extends easily to multiple dimensions using the notion of block circulant matrices and generalizes to multidimensional asymmetric sequences. The symmetric convolution of multidimensional asymmetric sequences can then be accomplished by taking the product of the trigonometric transforms of the sequences and then applying an inverse trigonometric transform to the result. An example is given of how this theory can be used for applying a two-dimensional (2-D) finite impulse response (FIR) filter with nonlinear phase which models atmospheric turbulence.

Image compression-encryption algorithms by combining hyper-chaotic system with discrete fractional random transform

NASA Astrophysics Data System (ADS)

Gong, Lihua; Deng, Chengzhi; Pan, Shumin; Zhou, Nanrun

2018-07-01

Based on hyper-chaotic system and discrete fractional random transform, an image compression-encryption algorithm is designed. The original image is first transformed into a spectrum by the discrete cosine transform and the resulting spectrum is compressed according to the method of spectrum cutting. The random matrix of the discrete fractional random transform is controlled by a chaotic sequence originated from the high dimensional hyper-chaotic system. Then the compressed spectrum is encrypted by the discrete fractional random transform. The order of DFrRT and the parameters of the hyper-chaotic system are the main keys of this image compression and encryption algorithm. The proposed algorithm can compress and encrypt image signal, especially can encrypt multiple images once. To achieve the compression of multiple images, the images are transformed into spectra by the discrete cosine transform, and then the spectra are incised and spliced into a composite spectrum by Zigzag scanning. Simulation results demonstrate that the proposed image compression and encryption algorithm is of high security and good compression performance.

A discrete Fourier transform for virtual memory machines

NASA Technical Reports Server (NTRS)

Galant, David C.

1992-01-01

An algebraic theory of the Discrete Fourier Transform is developed in great detail. Examination of the details of the theory leads to a computationally efficient fast Fourier transform for the use on computers with virtual memory. Such an algorithm is of great use on modern desktop machines. A FORTRAN coded version of the algorithm is given for the case when the sequence of numbers to be transformed is a power of two.

Uncertainty relation for the discrete Fourier transform.

PubMed

Massar, Serge; Spindel, Philippe

2008-05-16

We derive an uncertainty relation for two unitary operators which obey a commutation relation of the form UV=e(i phi) VU. Its most important application is to constrain how much a quantum state can be localized simultaneously in two mutually unbiased bases related by a discrete fourier transform. It provides an uncertainty relation which smoothly interpolates between the well-known cases of the Pauli operators in two dimensions and the continuous variables position and momentum. This work also provides an uncertainty relation for modular variables, and could find applications in signal processing. In the finite dimensional case the minimum uncertainty states, discrete analogues of coherent and squeezed states, are minimum energy solutions of Harper's equation, a discrete version of the harmonic oscillator equation.

The Karhunen-Loeve, discrete cosine, and related transforms obtained via the Hadamard transform. [for data compression

NASA Technical Reports Server (NTRS)

Jones, H. W.; Hein, D. N.; Knauer, S. C.

1978-01-01

A general class of even/odd transforms is presented that includes the Karhunen-Loeve transform, the discrete cosine transform, the Walsh-Hadamard transform, and other familiar transforms. The more complex even/odd transforms can be computed by combining a simpler even/odd transform with a sparse matrix multiplication. A theoretical performance measure is computed for some even/odd transforms, and two image compression experiments are reported.

Orthonormal aberration polynomials for anamorphic optical imaging systems with circular pupils.

PubMed

Mahajan, Virendra N

2012-06-20

In a recent paper, we considered the classical aberrations of an anamorphic optical imaging system with a rectangular pupil, representing the terms of a power series expansion of its aberration function. These aberrations are inherently separable in the Cartesian coordinates (x,y) of a point on the pupil. Accordingly, there is x-defocus and x-coma, y-defocus and y-coma, and so on. We showed that the aberration polynomials orthonormal over the pupil and representing balanced aberrations for such a system are represented by the products of two Legendre polynomials, one for each of the two Cartesian coordinates of the pupil point; for example, L(l)(x)L(m)(y), where l and m are positive integers (including zero) and L(l)(x), for example, represents an orthonormal Legendre polynomial of degree l in x. The compound two-dimensional (2D) Legendre polynomials, like the classical aberrations, are thus also inherently separable in the Cartesian coordinates of the pupil point. Moreover, for every orthonormal polynomial L(l)(x)L(m)(y), there is a corresponding orthonormal polynomial L(l)(y)L(m)(x) obtained by interchanging x and y. These polynomials are different from the corresponding orthogonal polynomials for a system with rotational symmetry but a rectangular pupil. In this paper, we show that the orthonormal aberration polynomials for an anamorphic system with a circular pupil, obtained by the Gram-Schmidt orthogonalization of the 2D Legendre polynomials, are not separable in the two coordinates. Moreover, for a given polynomial in x and y, there is no corresponding polynomial obtained by interchanging x and y. For example, there are polynomials representing x-defocus, balanced x-coma, and balanced x-spherical aberration, but no corresponding y-aberration polynomials. The missing y-aberration terms are contained in other polynomials. We emphasize that the Zernike circle polynomials, although orthogonal over a circular pupil, are not suitable for an anamorphic system as

Discrete linear canonical transforms based on dilated Hermite functions.

PubMed

Pei, Soo-Chang; Lai, Yun-Chiu

2011-08-01

Linear canonical transform (LCT) is very useful and powerful in signal processing and optics. In this paper, discrete LCT (DLCT) is proposed to approximate LCT by utilizing the discrete dilated Hermite functions. The Wigner distribution function is also used to investigate DLCT performances in the time-frequency domain. Compared with the existing digital computation of LCT, our proposed DLCT possess additivity and reversibility properties with no oversampling involved. In addition, the length of input/output signals will not be changed before and after the DLCT transformations, which is consistent with the time-frequency area-preserving nature of LCT; meanwhile, the proposed DLCT has very good approximation of continuous LCT.

Discrete Fourier transforms of nonuniformly spaced data

NASA Technical Reports Server (NTRS)

Swan, P. R.

1982-01-01

Time series or spatial series of measurements taken with nonuniform spacings have failed to yield fully to analysis using the Discrete Fourier Transform (DFT). This is due to the fact that the formal DFT is the convolution of the transform of the signal with the transform of the nonuniform spacings. Two original methods are presented for deconvolving such transforms for signals containing significant noise. The first method solves a set of linear equations relating the observed data to values defined at uniform grid points, and then obtains the desired transform as the DFT of the uniform interpolates. The second method solves a set of linear equations relating the real and imaginary components of the formal DFT directly to those of the desired transform. The results of numerical experiments with noisy data are presented in order to demonstrate the capabilities and limitations of the methods.

Discrete shearlet transform: faithful digitization concept and its applications

NASA Astrophysics Data System (ADS)

Lim, Wang-Q.

2011-09-01

Over the past years, various representation systems which sparsely approximate functions governed by anisotropic features such as edges in images have been proposed. Alongside the theoretical development of these systems, algorithmic realizations of the associated transforms were provided. However, one of the most common short-comings of these frameworks is the lack of providing a unified treatment of the continuum and digital world, i.e., allowing a digital theory to be a natural digitization of the continuum theory. Shearlets were introduced as means to sparsely encode anisotropic singularities of multivariate data while providing a unified treatment of the continuous and digital realm. In this paper, we introduce a discrete framework which allows a faithful digitization of the continuum domain shearlet transform based on compactly supported shearlets. Finally, we show numerical experiments demonstrating the potential of the discrete shearlet transform in several image processing applications.

Discrete Fourier Transform in a Complex Vector Space

NASA Technical Reports Server (NTRS)

Dean, Bruce H. (Inventor)

2015-01-01

An image-based phase retrieval technique has been developed that can be used on board a space based iterative transformation system. Image-based wavefront sensing is computationally demanding due to the floating-point nature of the process. The discrete Fourier transform (DFT) calculation is presented in "diagonal" form. By diagonal we mean that a transformation of basis is introduced by an application of the similarity transform of linear algebra. The current method exploits the diagonal structure of the DFT in a special way, particularly when parts of the calculation do not have to be repeated at each iteration to converge to an acceptable solution in order to focus an image.

Error estimates of Lagrange interpolation and orthonormal expansions for Freud weights

NASA Astrophysics Data System (ADS)

Kwon, K. H.; Lee, D. W.

2001-08-01

Let Sn[f] be the nth partial sum of the orthonormal polynomials expansion with respect to a Freud weight. Then we obtain sufficient conditions for the boundedness of Sn[f] and discuss the speed of the convergence of Sn[f] in weighted Lp space. We also find sufficient conditions for the boundedness of the Lagrange interpolation polynomial Ln[f], whose nodal points are the zeros of orthonormal polynomials with respect to a Freud weight. In particular, if W(x)=e-(1/2)x2 is the Hermite weight function, then we obtain sufficient conditions for the inequalities to hold:andwhere and k=0,1,2...,r.

Double Density Dual Tree Discrete Wavelet Transform implementation for Degraded Image Enhancement

NASA Astrophysics Data System (ADS)

Vimala, C.; Aruna Priya, P.

2018-04-01

Wavelet transform is a main tool for image processing applications in modern existence. A Double Density Dual Tree Discrete Wavelet Transform is used and investigated for image denoising. Images are considered for the analysis and the performance is compared with discrete wavelet transform and the Double Density DWT. Peak Signal to Noise Ratio values and Root Means Square error are calculated in all the three wavelet techniques for denoised images and the performance has evaluated. The proposed techniques give the better performance when comparing other two wavelet techniques.

Fast parallel approach for 2-D DHT-based real-valued discrete Gabor transform.

PubMed

Tao, Liang; Kwan, Hon Keung

2009-12-01

Two-dimensional fast Gabor transform algorithms are useful for real-time applications due to the high computational complexity of the traditional 2-D complex-valued discrete Gabor transform (CDGT). This paper presents two block time-recursive algorithms for 2-D DHT-based real-valued discrete Gabor transform (RDGT) and its inverse transform and develops a fast parallel approach for the implementation of the two algorithms. The computational complexity of the proposed parallel approach is analyzed and compared with that of the existing 2-D CDGT algorithms. The results indicate that the proposed parallel approach is attractive for real time image processing.

Infrared and visual image fusion method based on discrete cosine transform and local spatial frequency in discrete stationary wavelet transform domain

NASA Astrophysics Data System (ADS)

Jin, Xin; Jiang, Qian; Yao, Shaowen; Zhou, Dongming; Nie, Rencan; Lee, Shin-Jye; He, Kangjian

2018-01-01

In order to promote the performance of infrared and visual image fusion and provide better visual effects, this paper proposes a hybrid fusion method for infrared and visual image by the combination of discrete stationary wavelet transform (DSWT), discrete cosine transform (DCT) and local spatial frequency (LSF). The proposed method has three key processing steps. Firstly, DSWT is employed to decompose the important features of the source image into a series of sub-images with different levels and spatial frequencies. Secondly, DCT is used to separate the significant details of the sub-images according to the energy of different frequencies. Thirdly, LSF is applied to enhance the regional features of DCT coefficients, and it can be helpful and useful for image feature extraction. Some frequently-used image fusion methods and evaluation metrics are employed to evaluate the validity of the proposed method. The experiments indicate that the proposed method can achieve good fusion effect, and it is more efficient than other conventional image fusion methods.

Photoinduced transformations of stiff-stilbene-based discrete metallacycles to metallosupramolecular polymers

PubMed Central

Yan, Xuzhou; Xu, Jiang-Fei; Cook, Timothy R.; Huang, Feihe; Yang, Qing-Zheng; Tung, Chen-Ho; Stang, Peter J.

2014-01-01

Control over structural transformations in supramolecular entities by external stimuli is critical for the development of adaptable and functional soft materials. Herein, we have designed and synthesized a dipyridyl donor containing a central Z-configured stiff-stilbene unit that self-assembles in the presence of two 180° di-Pt(II) acceptors to produce size-controllable discrete organoplatinum(II) metallacycles with high efficiency by means of the directional-bonding approach. These discrete metallacycles undergo transformation into extended metallosupramolecular polymers upon the conformational switching of the dipyridyl ligand from Z-configured (0°) to E-configured (180°) when photoirradiated. This transformation is accompanied by interesting morphological changes at nanoscopic length scales. The discrete metallacycles aggregate to spherical nanoparticles that evolve into long nanofibers upon polymer formation. These fibers can be reversibly converted to cyclic oligomers by changing the wavelength of irradiation, which reintroduces Z-configured building blocks owing to the reversible nature of stiff-stilbene photoisomerization. The design strategy defined here represents a novel self-assembly pathway to deliver advanced supramolecular assemblies by means of photocontrol. PMID:24889610

An Automatic Orthonormalization Method for Solving Stiff Boundary-Value Problems

NASA Astrophysics Data System (ADS)

Davey, A.

1983-08-01

A new initial-value method is described, based on a remark by Drury, for solving stiff linear differential two-point cigenvalue and boundary-value problems. The method is extremely reliable, it is especially suitable for high-order differential systems, and it is capable of accommodating realms of stiffness which other methods cannot reach. The key idea behind the method is to decompose the stiff differential operator into two non-stiff operators, one of which is nonlinear. The nonlinear one is specially chosen so that it advances an orthonormal frame, indeed the method is essentially a kind of automatic orthonormalization; the second is auxiliary but it is needed to determine the required function. The usefulness of the method is demonstrated by calculating some eigenfunctions for an Orr-Sommerfeld problem when the Reynolds number is as large as 10°.

Discrete Haar transform and protein structure.

PubMed

Morosetti, S

1997-12-01

The discrete Haar transform of the sequence of the backbone dihedral angles (phi and psi) was performed over a set of X-ray protein structures of high resolution from the Brookhaven Protein Data Bank. Afterwards, the new dihedral angles were calculated by the inverse transform, using a growing number of Haar functions, from the lower to the higher degree. New structures were obtained using these dihedral angles, with standard values for bond lengths and angles, and with omega = 0 degree. The reconstructed structures were compared with the experimental ones, and analyzed by visual inspection and statistical analysis. When half of the Haar coefficients were used, all the reconstructed structures were not yet collapsed to a tertiary folding, but they showed yet realized most of the secondary motifs. These results indicate a substantial separation of structural information in the space of Haar transform, with the secondary structural information mainly present in the Haar coefficients of lower degrees, and the tertiary one present in the higher degree coefficients. Because of this separation, the representation of the folded structures in the space of Haar transform seems a promising candidate to encompass the problem of premature convergence in genetic algorithms.

Invariant object recognition based on the generalized discrete radon transform

NASA Astrophysics Data System (ADS)

Easley, Glenn R.; Colonna, Flavia

2004-04-01

We introduce a method for classifying objects based on special cases of the generalized discrete Radon transform. We adjust the transform and the corresponding ridgelet transform by means of circular shifting and a singular value decomposition (SVD) to obtain a translation, rotation and scaling invariant set of feature vectors. We then use a back-propagation neural network to classify the input feature vectors. We conclude with experimental results and compare these with other invariant recognition methods.

Inversion and approximation of Laplace transforms

NASA Technical Reports Server (NTRS)

Lear, W. M.

1980-01-01

A method of inverting Laplace transforms by using a set of orthonormal functions is reported. As a byproduct of the inversion, approximation of complicated Laplace transforms by a transform with a series of simple poles along the left half plane real axis is shown. The inversion and approximation process is simple enough to be put on a programmable hand calculator.

Use of switched capacitor filters to implement the discrete wavelet transform

NASA Technical Reports Server (NTRS)

Kaiser, Kraig E.; Peterson, James N.

1993-01-01

This paper analyzes the use of IIR switched capacitor filters to implement the discrete wavelet transform and the inverse transform, using quadrature mirror filters (QMF) which have the necessary symmetry for reconstruction of the data. This is done by examining the sensitivity of the QMF transforms to the manufacturing variance in the desired capacitances. The performance is evaluated at the outputs of the separate filter stages and the error in the reconstruction of the inverse transform is compared with the desired results.

Comparison of algorithms for computing the two-dimensional discrete Hartley transform

NASA Technical Reports Server (NTRS)

Reichenbach, Stephen E.; Burton, John C.; Miller, Keith W.

1989-01-01

Three methods have been described for computing the two-dimensional discrete Hartley transform. Two of these employ a separable transform, the third method, the vector-radix algorithm, does not require separability. In-place computation of the vector-radix method is described. Operation counts and execution times indicate that the vector-radix method is fastest.

Discrete Fourier Transform Analysis in a Complex Vector Space

NASA Technical Reports Server (NTRS)

Dean, Bruce H.

2009-01-01

Alternative computational strategies for the Discrete Fourier Transform (DFT) have been developed using analysis of geometric manifolds. This approach provides a general framework for performing DFT calculations, and suggests a more efficient implementation of the DFT for applications using iterative transform methods, particularly phase retrieval. The DFT can thus be implemented using fewer operations when compared to the usual DFT counterpart. The software decreases the run time of the DFT in certain applications such as phase retrieval that iteratively call the DFT function. The algorithm exploits a special computational approach based on analysis of the DFT as a transformation in a complex vector space. As such, this approach has the potential to realize a DFT computation that approaches N operations versus Nlog(N) operations for the equivalent Fast Fourier Transform (FFT) calculation.

Discrete Ramanujan transform for distinguishing the protein coding regions from other regions.

PubMed

Hua, Wei; Wang, Jiasong; Zhao, Jian

2014-01-01

Based on the study of Ramanujan sum and Ramanujan coefficient, this paper suggests the concepts of discrete Ramanujan transform and spectrum. Using Voss numerical representation, one maps a symbolic DNA strand as a numerical DNA sequence, and deduces the discrete Ramanujan spectrum of the numerical DNA sequence. It is well known that of discrete Fourier power spectrum of protein coding sequence has an important feature of 3-base periodicity, which is widely used for DNA sequence analysis by the technique of discrete Fourier transform. It is performed by testing the signal-to-noise ratio at frequency N/3 as a criterion for the analysis, where N is the length of the sequence. The results presented in this paper show that the property of 3-base periodicity can be only identified as a prominent spike of the discrete Ramanujan spectrum at period 3 for the protein coding regions. The signal-to-noise ratio for discrete Ramanujan spectrum is defined for numerical measurement. Therefore, the discrete Ramanujan spectrum and the signal-to-noise ratio of a DNA sequence can be used for distinguishing the protein coding regions from the noncoding regions. All the exon and intron sequences in whole chromosomes 1, 2, 3 and 4 of Caenorhabditis elegans have been tested and the histograms and tables from the computational results illustrate the reliability of our method. In addition, we have analyzed theoretically and gotten the conclusion that the algorithm for calculating discrete Ramanujan spectrum owns the lower computational complexity and higher computational accuracy. The computational experiments show that the technique by using discrete Ramanujan spectrum for classifying different DNA sequences is a fast and effective method. Copyright © 2014 Elsevier Ltd. All rights reserved.

Orthonormal filters for identification in active control systems

NASA Astrophysics Data System (ADS)

Mayer, Dirk

2015-12-01

Many active noise and vibration control systems require models of the control paths. When the controlled system changes slightly over time, adaptive digital filters for the identification of the models are useful. This paper aims at the investigation of a special class of adaptive digital filters: orthonormal filter banks possess the robust and simple adaptation of the widely applied finite impulse response (FIR) filters, but at a lower model order, which is important when considering implementation on embedded systems. However, the filter banks require prior knowledge about the resonance frequencies and damping of the structure. This knowledge can be supposed to be of limited precision, since in many practical systems, uncertainties in the structural parameters exist. In this work, a procedure using a number of training systems to find the fixed parameters for the filter banks is applied. The effect of uncertainties in the prior knowledge on the model error is examined both with a basic example and in an experiment. Furthermore, the possibilities to compensate for the imprecise prior knowledge by a higher filter order are investigated. Also comparisons with FIR filters are implemented in order to assess the possible advantages of the orthonormal filter banks. Numerical and experimental investigations show that significantly lower computational effort can be reached by the filter banks under certain conditions.

Towards discrete wavelet transform-based human activity recognition

NASA Astrophysics Data System (ADS)

Khare, Manish; Jeon, Moongu

2017-06-01

Providing accurate recognition of human activities is a challenging problem for visual surveillance applications. In this paper, we present a simple and efficient algorithm for human activity recognition based on a wavelet transform. We adopt discrete wavelet transform (DWT) coefficients as a feature of human objects to obtain advantages of its multiresolution approach. The proposed method is tested on multiple levels of DWT. Experiments are carried out on different standard action datasets including KTH and i3D Post. The proposed method is compared with other state-of-the-art methods in terms of different quantitative performance measures. The proposed method is found to have better recognition accuracy in comparison to the state-of-the-art methods.

Surface Design Based on Discrete Conformal Transformations

NASA Astrophysics Data System (ADS)

Duque, Carlos; Santangelo, Christian; Vouga, Etienne

Conformal transformations are angle-preserving maps from one domain to another. Although angles are preserved, the lengths between arbitrary points are not generally conserved. As a consequence there is always a given amount of distortion associated to any conformal map. Different uses of such transformations can be found in various fields, but have been used by us to program non-uniformly swellable gel sheets to buckle into prescribed three dimensional shapes. In this work we apply circle packings as a kind of discrete conformal map in order to find conformal maps from the sphere to the plane that can be used as nearly uniform swelling patterns to program non-Euclidean sheets to buckle into spheres. We explore the possibility of tuning the area distortion to fit the experimental range of minimum and maximum swelling by modifying the boundary of the planar domain through the introduction of different cutting schemes.

A difference tracking algorithm based on discrete sine transform

NASA Astrophysics Data System (ADS)

Liu, HaoPeng; Yao, Yong; Lei, HeBing; Wu, HaoKun

2018-04-01

Target tracking is an important field of computer vision. The template matching tracking algorithm based on squared difference matching (SSD) and standard correlation coefficient (NCC) matching is very sensitive to the gray change of image. When the brightness or gray change, the tracking algorithm will be affected by high-frequency information. Tracking accuracy is reduced, resulting in loss of tracking target. In this paper, a differential tracking algorithm based on discrete sine transform is proposed to reduce the influence of image gray or brightness change. The algorithm that combines the discrete sine transform and the difference algorithm maps the target image into a image digital sequence. The Kalman filter predicts the target position. Using the Hamming distance determines the degree of similarity between the target and the template. The window closest to the template is determined the target to be tracked. The target to be tracked updates the template. Based on the above achieve target tracking. The algorithm is tested in this paper. Compared with SSD and NCC template matching algorithms, the algorithm tracks target stably when image gray or brightness change. And the tracking speed can meet the read-time requirement.

Multirate-based fast parallel algorithms for 2-D DHT-based real-valued discrete Gabor transform.

PubMed

Tao, Liang; Kwan, Hon Keung

2012-07-01

Novel algorithms for the multirate and fast parallel implementation of the 2-D discrete Hartley transform (DHT)-based real-valued discrete Gabor transform (RDGT) and its inverse transform are presented in this paper. A 2-D multirate-based analysis convolver bank is designed for the 2-D RDGT, and a 2-D multirate-based synthesis convolver bank is designed for the 2-D inverse RDGT. The parallel channels in each of the two convolver banks have a unified structure and can apply the 2-D fast DHT algorithm to speed up their computations. The computational complexity of each parallel channel is low and is independent of the Gabor oversampling rate. All the 2-D RDGT coefficients of an image are computed in parallel during the analysis process and can be reconstructed in parallel during the synthesis process. The computational complexity and time of the proposed parallel algorithms are analyzed and compared with those of the existing fastest algorithms for 2-D discrete Gabor transforms. The results indicate that the proposed algorithms are the fastest, which make them attractive for real-time image processing.

Fast localized orthonormal virtual orbitals which depend smoothly on nuclear coordinates.

PubMed

Subotnik, Joseph E; Dutoi, Anthony D; Head-Gordon, Martin

2005-09-15

We present here an algorithm for computing stable, well-defined localized orthonormal virtual orbitals which depend smoothly on nuclear coordinates. The algorithm is very fast, limited only by diagonalization of two matrices with dimension the size of the number of virtual orbitals. Furthermore, we require no more than quadratic (in the number of electrons) storage. The basic premise behind our algorithm is that one can decompose any given atomic-orbital (AO) vector space as a minimal basis space (which includes the occupied and valence virtual spaces) and a hard-virtual (HV) space (which includes everything else). The valence virtual space localizes easily with standard methods, while the hard-virtual space is constructed to be atom centered and automatically local. The orbitals presented here may be computed almost as quickly as projecting the AO basis onto the virtual space and are almost as local (according to orbital variance), while our orbitals are orthonormal (rather than redundant and nonorthogonal). We expect this algorithm to find use in local-correlation methods.

3-D discrete shearlet transform and video processing.

PubMed

Negi, Pooran Singh; Labate, Demetrio

2012-06-01

In this paper, we introduce a digital implementation of the 3-D shearlet transform and illustrate its application to problems of video denoising and enhancement. The shearlet representation is a multiscale pyramid of well-localized waveforms defined at various locations and orientations, which was introduced to overcome the limitations of traditional multiscale systems in dealing with multidimensional data. While the shearlet approach shares the general philosophy of curvelets and surfacelets, it is based on a very different mathematical framework, which is derived from the theory of affine systems and uses shearing matrices rather than rotations. This allows a natural transition from the continuous setting to the digital setting and a more flexible mathematical structure. The 3-D digital shearlet transform algorithm presented in this paper consists in a cascade of a multiscale decomposition and a directional filtering stage. The filters employed in this decomposition are implemented as finite-length filters, and this ensures that the transform is local and numerically efficient. To illustrate its performance, the 3-D discrete shearlet transform is applied to problems of video denoising and enhancement, and compared against other state-of-the-art multiscale techniques, including curvelets and surfacelets.

Discrete shear-transformation-zone plasticity modeling of notched bars

NASA Astrophysics Data System (ADS)

Kondori, Babak; Amine Benzerga, A.; Needleman, Alan

2018-02-01

Plane strain tension analyses of un-notched and notched bars are carried out using discrete shear transformation zone plasticity. In this framework, the carriers of plastic deformation are shear transformation zones (STZs) which are modeled as Eshelby inclusions. Superposition is used to represent a boundary value problem solution in terms of discretely modeled Eshelby inclusions, given analytically for an infinite elastic medium, and an image solution that enforces the prescribed boundary conditions. The image problem is a standard linear elastic boundary value problem that is solved by the finite element method. Potential STZ activation sites are randomly distributed in the bars and constitutive relations are specified for their evolution. Results are presented for un-notched bars, for bars with blunt notches and for bars with sharp notches. The computed stress-strain curves are serrated with the magnitude of the associated stress-drops depending on bar size, notch acuity and STZ evolution. Cooperative deformation bands (shear bands) emerge upon straining and, in some cases, high stress levels occur within the bands. Effects of specimen geometry and size on the stress-strain curves are explored. Depending on STZ kinetics, notch strengthening, notch insensitivity or notch weakening are obtained. The analyses provide a rationale for some conflicting findings regarding notch effects on the mechanical response of metallic glasses.

ASIC implementation of recursive scaled discrete cosine transform algorithm

NASA Astrophysics Data System (ADS)

On, Bill N.; Narasimhan, Sam; Huang, Victor K.

1994-05-01

A program to implement the Recursive Scaled Discrete Cosine Transform (DCT) algorithm as proposed by H. S. Hou has been undertaken at the Institute of Microelectronics. Implementation of the design was done using top-down design methodology with VHDL (VHSIC Hardware Description Language) for chip modeling. When the VHDL simulation has been satisfactorily completed, the design is synthesized into gates using a synthesis tool. The architecture of the design consists of two processing units together with a memory module for data storage and transpose. Each processing unit is composed of four pipelined stages which allow the internal clock to run at one-eighth (1/8) the speed of the pixel clock. Each stage operates on eight pixels in parallel. As the data flows through each stage, there are various adders and multipliers to transform them into the desired coefficients. The Scaled IDCT was implemented in a similar fashion with the adders and multipliers rearranged to perform the inverse DCT algorithm. The chip has been verified using Field Programmable Gate Array devices. The design is operational. The combination of fewer multiplications required and pipelined architecture give Hou's Recursive Scaled DCT good potential of achieving high performance at a low cost in using Very Large Scale Integration implementation.

Transformation of nonlinear discrete-time system into the extended observer form

NASA Astrophysics Data System (ADS)

Kaparin, V.; Kotta, Ü.

2018-04-01

The paper addresses the problem of transforming discrete-time single-input single-output nonlinear state equations into the extended observer form, which, besides the input and output, also depends on a finite number of their past values. Necessary and sufficient conditions for the existence of both the extended coordinate and output transformations, solving the problem, are formulated in terms of differential one-forms, associated with the input-output equation, corresponding to the state equations. An algorithm for transformation of state equations into the extended observer form is proposed and illustrated by an example. Moreover, the considered approach is compared with the method of dynamic observer error linearisation, which likewise is intended to enlarge the class of systems transformable into an observer form.

Investigation of magneto-hemodynamic flow in a semi-porous channel using orthonormal Bernstein polynomials

NASA Astrophysics Data System (ADS)

Hosseini, E.; Loghmani, G. B.; Heydari, M.; Rashidi, M. M.

2017-07-01

In this paper, the problem of the magneto-hemodynamic laminar viscous flow of a conducting physiological fluid in a semi-porous channel under a transverse magnetic field is investigated numerically. Using a Berman's similarity transformation, the two-dimensional momentum conservation partial differential equations can be written as a system of nonlinear ordinary differential equations incorporating Lorentizian magneto-hydrodynamic body force terms. A new computational method based on the operational matrix of derivative of orthonormal Bernstein polynomials for solving the resulting differential systems is introduced. Moreover, by using the residual correction process, two types of error estimates are provided and reported to show the strength of the proposed method. Graphical and tabular results are presented to investigate the influence of the Hartmann number ( Ha) and the transpiration Reynolds number ( Re on velocity profiles in the channel. The results are compared with those obtained by previous works to confirm the accuracy and efficiency of the proposed scheme.

Classification of three-particle states according to an orthonormal SU(3) ⊃ SO(3) basis

NASA Astrophysics Data System (ADS)

del Aguila, F.

1980-09-01

In this paper we generalize Dragt's approach to classifying three-particle states. Using his formalism of creation and annihilation operators, we obtain explicitly a complete set of orthonormal functions YλμRLM on S5. This set of functions carries all the irreducible representations of the group SU(3) reduced according to SO(3). The YλμRLM, which are eigenvectors of the togetherness and angular momentum operators, have very simple properties under three-particle permutations. We obtain also explicitly the coefficients ''3ν'' which reduce the products of these functions.

A Parallel Framework with Block Matrices of a Discrete Fourier Transform for Vector-Valued Discrete-Time Signals.

PubMed

Soto-Quiros, Pablo

2015-01-01

This paper presents a parallel implementation of a kind of discrete Fourier transform (DFT): the vector-valued DFT. The vector-valued DFT is a novel tool to analyze the spectra of vector-valued discrete-time signals. This parallel implementation is developed in terms of a mathematical framework with a set of block matrix operations. These block matrix operations contribute to analysis, design, and implementation of parallel algorithms in multicore processors. In this work, an implementation and experimental investigation of the mathematical framework are performed using MATLAB with the Parallel Computing Toolbox. We found that there is advantage to use multicore processors and a parallel computing environment to minimize the high execution time. Additionally, speedup increases when the number of logical processors and length of the signal increase.

Video compression of coronary angiograms based on discrete wavelet transform with block classification.

PubMed

Ho, B T; Tsai, M J; Wei, J; Ma, M; Saipetch, P

1996-01-01

A new method of video compression for angiographic images has been developed to achieve high compression ratio (~20:1) while eliminating block artifacts which leads to loss of diagnostic accuracy. This method adopts motion picture experts group's (MPEGs) motion compensated prediction to takes advantage of frame to frame correlation. However, in contrast to MPEG, the error images arising from mismatches in the motion estimation are encoded by discrete wavelet transform (DWT) rather than block discrete cosine transform (DCT). Furthermore, the authors developed a classification scheme which label each block in an image as intra, error, or background type and encode it accordingly. This hybrid coding can significantly improve the compression efficiency in certain eases. This method can be generalized for any dynamic image sequences applications sensitive to block artifacts.

Discrete Radon transform has an exact, fast inverse and generalizes to operations other than sums along lines

PubMed Central

Press, William H.

2006-01-01

Götz, Druckmüller, and, independently, Brady have defined a discrete Radon transform (DRT) that sums an image's pixel values along a set of aptly chosen discrete lines, complete in slope and intercept. The transform is fast, O(N2log N) for an N × N image; it uses only addition, not multiplication or interpolation, and it admits a fast, exact algorithm for the adjoint operation, namely backprojection. This paper shows that the transform additionally has a fast, exact (although iterative) inverse. The inverse reproduces to machine accuracy the pixel-by-pixel values of the original image from its DRT, without artifacts or a finite point-spread function. Fourier or fast Fourier transform methods are not used. The inverse can also be calculated from sampled sinograms and is well conditioned in the presence of noise. Also introduced are generalizations of the DRT that combine pixel values along lines by operations other than addition. For example, there is a fast transform that calculates median values along all discrete lines and is able to detect linear features at low signal-to-noise ratios in the presence of pointlike clutter features of arbitrarily large amplitude. PMID:17159155

Discrete Radon transform has an exact, fast inverse and generalizes to operations other than sums along lines.

PubMed

Press, William H

2006-12-19

Götz, Druckmüller, and, independently, Brady have defined a discrete Radon transform (DRT) that sums an image's pixel values along a set of aptly chosen discrete lines, complete in slope and intercept. The transform is fast, O(N2log N) for an N x N image; it uses only addition, not multiplication or interpolation, and it admits a fast, exact algorithm for the adjoint operation, namely backprojection. This paper shows that the transform additionally has a fast, exact (although iterative) inverse. The inverse reproduces to machine accuracy the pixel-by-pixel values of the original image from its DRT, without artifacts or a finite point-spread function. Fourier or fast Fourier transform methods are not used. The inverse can also be calculated from sampled sinograms and is well conditioned in the presence of noise. Also introduced are generalizations of the DRT that combine pixel values along lines by operations other than addition. For example, there is a fast transform that calculates median values along all discrete lines and is able to detect linear features at low signal-to-noise ratios in the presence of pointlike clutter features of arbitrarily large amplitude.

Integrable Semi-discrete Kundu-Eckhaus Equation: Darboux Transformation, Breather, Rogue Wave and Continuous Limit Theory

NASA Astrophysics Data System (ADS)

Zhao, Hai-qiong; Yuan, Jinyun; Zhu, Zuo-nong

2018-02-01

To get more insight into the relation between discrete model and continuous counterpart, a new integrable semi-discrete Kundu-Eckhaus equation is derived from the reduction in an extended Ablowitz-Ladik hierarchy. The integrability of the semi-discrete model is confirmed by showing the existence of Lax pair and infinite number of conservation laws. The dynamic characteristics of the breather and rational solutions have been analyzed in detail for our semi-discrete Kundu-Eckhaus equation to reveal some new interesting phenomena which was not found in continuous one. It is shown that the theory of the discrete system including Lax pair, Darboux transformation and explicit solutions systematically yields their continuous counterparts in the continuous limit.

Accurate phase extraction algorithm based on Gram–Schmidt orthonormalization and least square ellipse fitting method

NASA Astrophysics Data System (ADS)

Lei, Hebing; Yao, Yong; Liu, Haopeng; Tian, Yiting; Yang, Yanfu; Gu, Yinglong

2018-06-01

An accurate algorithm by combing Gram-Schmidt orthonormalization and least square ellipse fitting technology is proposed, which could be used for phase extraction from two or three interferograms. The DC term of background intensity is suppressed by subtraction operation on three interferograms or by high-pass filter on two interferograms. Performing Gram-Schmidt orthonormalization on pre-processing interferograms, the phase shift error is corrected and a general ellipse form is derived. Then the background intensity error and the corrected error could be compensated by least square ellipse fitting method. Finally, the phase could be extracted rapidly. The algorithm could cope with the two or three interferograms with environmental disturbance, low fringe number or small phase shifts. The accuracy and effectiveness of the proposed algorithm are verified by both of the numerical simulations and experiments.

A hardware implementation of the discrete Pascal transform for image processing

NASA Astrophysics Data System (ADS)

Goodman, Thomas J.; Aburdene, Maurice F.

2006-02-01

The discrete Pascal transform is a polynomial transform with applications in pattern recognition, digital filtering, and digital image processing. It already has been shown that the Pascal transform matrix can be decomposed into a product of binary matrices. Such a factorization leads to a fast and efficient hardware implementation without the use of multipliers, which consume large amounts of hardware. We recently developed a field-programmable gate array (FPGA) implementation to compute the Pascal transform. Our goal was to demonstrate the computational efficiency of the transform while keeping hardware requirements at a minimum. Images are uploaded into memory from a remote computer prior to processing, and the transform coefficients can be offloaded from the FPGA board for analysis. Design techniques like as-soon-as-possible scheduling and adder sharing allowed us to develop a fast and efficient system. An eight-point, one-dimensional transform completes in 13 clock cycles and requires only four adders. An 8x8 two-dimensional transform completes in 240 cycles and requires only a top-level controller in addition to the one-dimensional transform hardware. Finally, through minor modifications to the controller, the transform operations can be pipelined to achieve 100% utilization of the four adders, allowing one eight-point transform to complete every seven clock cycles.

Fast discrete cosine transform structure suitable for implementation with integer computation

NASA Astrophysics Data System (ADS)

Jeong, Yeonsik; Lee, Imgeun

2000-10-01

The discrete cosine transform (DCT) has wide applications in speech and image coding. We propose a fast DCT scheme with the property of reduced multiplication stages and fewer additions and multiplications. The proposed algorithm is structured so that most multiplications are performed at the final stage, which reduces the propagation error that could occur in the integer computation.

A Study of Derivative Filters Using the Discrete Fourier Transform. Final Report M. S. Thesis

NASA Technical Reports Server (NTRS)

Ioup, G. E.

1980-01-01

Important properties of derivative (difference) filters using the discrete Fourier transform are investigated. The filters are designed using the derivative theorem of Fourier analysis. Because physical data are generally degraded by noise, the derivative filter is modified to diminish the effects of the noise, especially the noise amplification which normally occurs while differencing. The basis for these modifications is the reduction of those Fourier components for which the noise most dominates the data. The various filters are tested by applying them to find differences of two-dimensional data to which various amounts of signal dependent noise, as measured by a root mean square value, have been added. The modifications, circular and square ideal low-pass filters and a cut-off pyramid filter, are all found to reduce noise in the derivative without significantly degrading the result.

Discrete Cosine Transform Image Coding With Sliding Block Codes

NASA Astrophysics Data System (ADS)

Divakaran, Ajay; Pearlman, William A.

1989-11-01

A transform trellis coding scheme for images is presented. A two dimensional discrete cosine transform is applied to the image followed by a search on a trellis structured code. This code is a sliding block code that utilizes a constrained size reproduction alphabet. The image is divided into blocks by the transform coding. The non-stationarity of the image is counteracted by grouping these blocks in clusters through a clustering algorithm, and then encoding the clusters separately. Mandela ordered sequences are formed from each cluster i.e identically indexed coefficients from each block are grouped together to form one dimensional sequences. A separate search ensues on each of these Mandela ordered sequences. Padding sequences are used to improve the trellis search fidelity. The padding sequences absorb the error caused by the building up of the trellis to full size. The simulations were carried out on a 256x256 image ('LENA'). The results are comparable to any existing scheme. The visual quality of the image is enhanced considerably by the padding and clustering.

Identification of large geomorphological anomalies based on 2D discrete wavelet transform

NASA Astrophysics Data System (ADS)

Doglioni, A.; Simeone, V.

2012-04-01

The identification and analysis based on quantitative evidences of large geomorphological anomalies is an important stage for the study of large landslides. Numerical geomorphic analyses represent an interesting approach to this kind of studies, allowing for a detailed and pretty accurate identification of hidden topographic anomalies that may be related to large landslides. Here a geomorphic numerical analyses of the Digital Terrain Model (DTM) is presented. The introduced approach is based on 2D discrete wavelet transform (Antoine et al., 2003; Bruun and Nilsen, 2003, Booth et al., 2009). The 2D wavelet decomposition of the DTM, and in particular the analysis of the detail coefficients of the wavelet transform can provide evidences of anomalies or singularities, i.e. discontinuities of the land surface. These discontinuities are not very evident from the DTM as it is, while 2D wavelet transform allows for grid-based analysis of DTM and for mapping the decomposition. In fact, the grid-based DTM can be assumed as a matrix, where a discrete wavelet transform (Daubechies, 1992) is performed columnwise and linewise, which basically represent horizontal and vertical directions. The outcomes of this analysis are low-frequency approximation coefficients and high-frequency detail coefficients. Detail coefficients are analyzed, since their variations are associated to discontinuities of the DTM. Detailed coefficients are estimated assuming to perform 2D wavelet transform both for the horizontal direction (east-west) and for the vertical direction (north-south). Detail coefficients are then mapped for both the cases, thus allowing to visualize and quantify potential anomalies of the land surface. Moreover, wavelet decomposition can be pushed to further levels, assuming a higher scale number of the transform. This may potentially return further interesting results, in terms of identification of the anomalies of land surface. In this kind of approach, the choice of a proper

Uniform sparse bounds for discrete quadratic phase Hilbert transforms

NASA Astrophysics Data System (ADS)

Kesler, Robert; Arias, Darío Mena

2017-09-01

For each α \\in T consider the discrete quadratic phase Hilbert transform acting on finitely supported functions f : Z → C according to H^{α }f(n):= \\sum _{m ≠ 0} e^{iα m^2} f(n - m)/m. We prove that, uniformly in α \\in T , there is a sparse bound for the bilinear form < H^{α } f , g > for every pair of finitely supported functions f,g : Z→ C . The sparse bound implies several mapping properties such as weighted inequalities in an intersection of Muckenhoupt and reverse Hölder classes.

Geometry and dynamics in the fractional discrete Fourier transform.

PubMed

Wolf, Kurt Bernardo; Krötzsch, Guillermo

2007-03-01

The N x N Fourier matrix is one distinguished element within the group U(N) of all N x N unitary matrices. It has the geometric property of being a fourth root of unity and is close to the dynamics of harmonic oscillators. The dynamical correspondence is exact only in the N-->infinity contraction limit for the integral Fourier transform and its fractional powers. In the finite-N case, several options have been considered in the literature. We compare their fidelity in reproducing the classical harmonic motion of discrete coherent states.

Novel image encryption algorithm based on multiple-parameter discrete fractional random transform

NASA Astrophysics Data System (ADS)

Zhou, Nanrun; Dong, Taiji; Wu, Jianhua

2010-08-01

A new method of digital image encryption is presented by utilizing a new multiple-parameter discrete fractional random transform. Image encryption and decryption are performed based on the index additivity and multiple parameters of the multiple-parameter fractional random transform. The plaintext and ciphertext are respectively in the spatial domain and in the fractional domain determined by the encryption keys. The proposed algorithm can resist statistic analyses effectively. The computer simulation results show that the proposed encryption algorithm is sensitive to the multiple keys, and that it has considerable robustness, noise immunity and security.

The parallel algorithm for the 2D discrete wavelet transform

NASA Astrophysics Data System (ADS)

Barina, David; Najman, Pavel; Kleparnik, Petr; Kula, Michal; Zemcik, Pavel

2018-04-01

The discrete wavelet transform can be found at the heart of many image-processing algorithms. Until now, the transform on general-purpose processors (CPUs) was mostly computed using a separable lifting scheme. As the lifting scheme consists of a small number of operations, it is preferred for processing using single-core CPUs. However, considering a parallel processing using multi-core processors, this scheme is inappropriate due to a large number of steps. On such architectures, the number of steps corresponds to the number of points that represent the exchange of data. Consequently, these points often form a performance bottleneck. Our approach appropriately rearranges calculations inside the transform, and thereby reduces the number of steps. In other words, we propose a new scheme that is friendly to parallel environments. When evaluating on multi-core CPUs, we consistently overcome the original lifting scheme. The evaluation was performed on 61-core Intel Xeon Phi and 8-core Intel Xeon processors.

Multifocus watermarking approach based on discrete cosine transform.

PubMed

Waheed, Safa Riyadh; Alkawaz, Mohammed Hazim; Rehman, Amjad; Almazyad, Abdulaziz S; Saba, Tanzila

2016-05-01

Image fusion process consolidates data and information from various images of same sight into a solitary image. Each of the source images might speak to a fractional perspective of the scene, and contains both "pertinent" and "immaterial" information. In this study, a new image fusion method is proposed utilizing the Discrete Cosine Transform (DCT) to join the source image into a solitary minimized image containing more exact depiction of the sight than any of the individual source images. In addition, the fused image comes out with most ideal quality image without bending appearance or loss of data. DCT algorithm is considered efficient in image fusion. The proposed scheme is performed in five steps: (1) RGB colour image (input image) is split into three channels R, G, and B for source images. (2) DCT algorithm is applied to each channel (R, G, and B). (3) The variance values are computed for the corresponding 8 × 8 blocks of each channel. (4) Each block of R of source images is compared with each other based on the variance value and then the block with maximum variance value is selected to be the block in the new image. This process is repeated for all channels of source images. (5) Inverse discrete cosine transform is applied on each fused channel to convert coefficient values to pixel values, and then combined all the channels to generate the fused image. The proposed technique can potentially solve the problem of unwanted side effects such as blurring or blocking artifacts by reducing the quality of the subsequent image in image fusion process. The proposed approach is evaluated using three measurement units: the average of Q(abf), standard deviation, and peak Signal Noise Rate. The experimental results of this proposed technique have shown good results as compared with older techniques. © 2016 Wiley Periodicals, Inc.

Simulating first order optical systems—algorithms for and composition of discrete linear canonical transforms

NASA Astrophysics Data System (ADS)

Healy, John J.

2018-01-01

The linear canonical transforms (LCTs) are a parameterised group of linear integral transforms. The LCTs encompass a number of well-known transformations as special cases, including the Fourier transform, fractional Fourier transform, and the Fresnel integral. They relate the scalar wave fields at the input and output of systems composed of thin lenses and free space, along with other quadratic phase systems. In this paper, we perform a systematic search of all algorithms based on up to five stages of magnification, chirp multiplication and Fourier transforms. Based on that search, we propose a novel algorithm, for which we present numerical results. We compare the sampling requirements of three algorithms. Finally, we discuss some issues surrounding the composition of discrete LCTs.

SSAW: A new sequence similarity analysis method based on the stationary discrete wavelet transform.

PubMed

Lin, Jie; Wei, Jing; Adjeroh, Donald; Jiang, Bing-Hua; Jiang, Yue

2018-05-02

Alignment-free sequence similarity analysis methods often lead to significant savings in computational time over alignment-based counterparts. A new alignment-free sequence similarity analysis method, called SSAW is proposed. SSAW stands for Sequence Similarity Analysis using the Stationary Discrete Wavelet Transform (SDWT). It extracts k-mers from a sequence, then maps each k-mer to a complex number field. Then, the series of complex numbers formed are transformed into feature vectors using the stationary discrete wavelet transform. After these steps, the original sequence is turned into a feature vector with numeric values, which can then be used for clustering and/or classification. Using two different types of applications, namely, clustering and classification, we compared SSAW against the the-state-of-the-art alignment free sequence analysis methods. SSAW demonstrates competitive or superior performance in terms of standard indicators, such as accuracy, F-score, precision, and recall. The running time was significantly better in most cases. These make SSAW a suitable method for sequence analysis, especially, given the rapidly increasing volumes of sequence data required by most modern applications.

Design of the Coordinate Transformation Function for Cylindrical Acoustic Cloaks with a Quantity of Discrete Layers

NASA Astrophysics Data System (ADS)

Cai, Li; Wen, Ji-Hong; Yu, Dian-Long; Lu, Zhi-Miao; Wen, Xi-Sen

2014-09-01

Acoustic cloak based on coordinate transformation is of great topical interest and has promise in potential applications such as sound transparency and insulation. The frequency response of acoustic cloaks with a quantity of discrete homogeneous layers is analyzed by the acoustic scattering theory. The effect of coordinate transformation function on the acoustic total scattering cross section is discussed to achieve low scattering with only a few layers of anisotropic metamaterials. Also, the physics of acoustic wave interaction with the interfaces between the discrete layers inside the cloak shell is discussed. These results provide a better way of designing a multilayered acoustic cloak with fewer layers.

State transformations and Hamiltonian structures for optimal control in discrete systems

NASA Astrophysics Data System (ADS)

Sieniutycz, S.

2006-04-01

Preserving usual definition of Hamiltonian H as the scalar product of rates and generalized momenta we investigate two basic classes of discrete optimal control processes governed by the difference rather than differential equations for the state transformation. The first class, linear in the time interval θ, secures the constancy of optimal H and satisfies a discrete Hamilton-Jacobi equation. The second class, nonlinear in θ, does not assure the constancy of optimal H and satisfies only a relationship that may be regarded as an equation of Hamilton-Jacobi type. The basic question asked is if and when Hamilton's canonical structures emerge in optimal discrete systems. For a constrained discrete control, general optimization algorithms are derived that constitute powerful theoretical and computational tools when evaluating extremum properties of constrained physical systems. The mathematical basis is Bellman's method of dynamic programming (DP) and its extension in the form of the so-called Carathéodory-Boltyanski (CB) stage optimality criterion which allows a variation of the terminal state that is otherwise fixed in Bellman's method. For systems with unconstrained intervals of the holdup time θ two powerful optimization algorithms are obtained: an unconventional discrete algorithm with a constant H and its counterpart for models nonlinear in θ. We also present the time-interval-constrained extension of the second algorithm. The results are general; namely, one arrives at: discrete canonical equations of Hamilton, maximum principles, and (at the continuous limit of processes with free intervals of time) the classical Hamilton-Jacobi theory, along with basic results of variational calculus. A vast spectrum of applications and an example are briefly discussed with particular attention paid to models nonlinear in the time interval θ.

A 16X16 Discrete Cosine Transform Chip

NASA Astrophysics Data System (ADS)

Sun, M. T.; Chen, T. C.; Gottlieb, A.; Wu, L.; Liou, M. L.

1987-10-01

Among various transform coding techniques for image compression the Discrete Cosine Transform (DCT) is considered to be the most effective method and has been widely used in the laboratory as well as in the market, place. DCT is computationally intensive. For video application at 14.3 MHz sample rate, a direct implementation of a 16x16 DCT requires a throughput, rate of approximately half a billion multiplications per second. In order to reduce the cost of hardware implementation, a single chip DCT implementation is highly desirable. In this paper, the implementation of a 16x16 DCT chip using a concurrent architecture will be presented. The chip is designed for real-time processing of 14.3 MHz sampled video data. It uses row-column decomposition to implement the two-dimensional transform. Distributed arithmetic combined with hit-serial and hit-parallel structures is used to implement the required vector inner products concurrently. Several schemes are utilized to reduce the size of required memory. The resultant circuit only uses memory, shift registers, and adders. No multipliers are required. It achieves high speed performance with a very regular and efficient integrated circuit realization. The chip accepts 0-bit input and produces 14-bit DCT coefficients. 12 bits are maintained after the first one-dimensional transform. The circuit has been laid out using a 2-μm CMOS technology with a symbolic design tool MULGA. The core contains approximately 73,000 transistors in an area of 7.2 x 7.0

Design and application of discrete wavelet packet transform based multiresolution controller for liquid level system.

PubMed

Paul, Rimi; Sengupta, Anindita

2017-11-01

A new controller based on discrete wavelet packet transform (DWPT) for liquid level system (LLS) has been presented here. This controller generates control signal using node coefficients of the error signal which interprets many implicit phenomena such as process dynamics, measurement noise and effect of external disturbances. Through simulation results on LLS problem, this controller is shown to perform faster than both the discrete wavelet transform based controller and conventional proportional integral controller. Also, it is more efficient in terms of its ability to provide better noise rejection. To overcome the wind up phenomenon by considering the saturation due to presence of actuator, anti-wind up technique is applied to the conventional PI controller and compared to the wavelet packet transform based controller. In this case also, packet controller is found better than the other ones. This similar work has been extended for analogous first order RC plant as well as second order plant also. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Estimation of phase derivatives using discrete chirp-Fourier-transform-based method.

PubMed

Gorthi, Sai Siva; Rastogi, Pramod

2009-08-15

Estimation of phase derivatives is an important task in many interferometric measurements in optical metrology. This Letter introduces a method based on discrete chirp-Fourier transform for accurate and direct estimation of phase derivatives, even in the presence of noise. The method is introduced in the context of the analysis of reconstructed interference fields in digital holographic interferometry. We present simulation and experimental results demonstrating the utility of the proposed method.

Low-power hardware implementation of movement decoding for brain computer interface with reduced-resolution discrete cosine transform.

PubMed

Minho Won; Albalawi, Hassan; Xin Li; Thomas, Donald E

2014-01-01

This paper describes a low-power hardware implementation for movement decoding of brain computer interface. Our proposed hardware design is facilitated by two novel ideas: (i) an efficient feature extraction method based on reduced-resolution discrete cosine transform (DCT), and (ii) a new hardware architecture of dual look-up table to perform discrete cosine transform without explicit multiplication. The proposed hardware implementation has been validated for movement decoding of electrocorticography (ECoG) signal by using a Xilinx FPGA Zynq-7000 board. It achieves more than 56× energy reduction over a reference design using band-pass filters for feature extraction.

Fast Fourier transform discrete dislocation dynamics

NASA Astrophysics Data System (ADS)

Graham, J. T.; Rollett, A. D.; LeSar, R.

2016-12-01

Discrete dislocation dynamics simulations have been generally limited to modeling systems described by isotropic elasticity. Effects of anisotropy on dislocation interactions, which can be quite large, have generally been ignored because of the computational expense involved when including anisotropic elasticity. We present a different formalism of dislocation dynamics in which the dislocations are represented by the deformation tensor, which is a direct measure of the slip in the lattice caused by the dislocations and can be considered as an eigenstrain. The stresses arising from the dislocations are calculated with a fast Fourier transform (FFT) method, from which the forces are determined and the equations of motion are solved. Use of the FFTs means that the stress field is only available at the grid points, which requires some adjustments/regularizations to be made to the representation of the dislocations and the calculation of the force on individual segments, as is discussed hereinafter. A notable advantage of this approach is that there is no computational penalty for including anisotropic elasticity. We review the method and apply it in a simple dislocation dynamics calculation.

Decision support system for diabetic retinopathy using discrete wavelet transform.

PubMed

Noronha, K; Acharya, U R; Nayak, K P; Kamath, S; Bhandary, S V

2013-03-01

Prolonged duration of the diabetes may affect the tiny blood vessels of the retina causing diabetic retinopathy. Routine eye screening of patients with diabetes helps to detect diabetic retinopathy at the early stage. It is very laborious and time-consuming for the doctors to go through many fundus images continuously. Therefore, decision support system for diabetic retinopathy detection can reduce the burden of the ophthalmologists. In this work, we have used discrete wavelet transform and support vector machine classifier for automated detection of normal and diabetic retinopathy classes. The wavelet-based decomposition was performed up to the second level, and eight energy features were extracted. Two energy features from the approximation coefficients of two levels and six energy values from the details in three orientations (horizontal, vertical and diagonal) were evaluated. These features were fed to the support vector machine classifier with various kernel functions (linear, radial basis function, polynomial of orders 2 and 3) to evaluate the highest classification accuracy. We obtained the highest average classification accuracy, sensitivity and specificity of more than 99% with support vector machine classifier (polynomial kernel of order 3) using three discrete wavelet transform features. We have also proposed an integrated index called Diabetic Retinopathy Risk Index using clinically significant wavelet energy features to identify normal and diabetic retinopathy classes using just one number. We believe that this (Diabetic Retinopathy Risk Index) can be used as an adjunct tool by the doctors during the eye screening to cross-check their diagnosis.

Implementation in an FPGA circuit of Edge detection algorithm based on the Discrete Wavelet Transforms

NASA Astrophysics Data System (ADS)

Bouganssa, Issam; Sbihi, Mohamed; Zaim, Mounia

2017-07-01

The 2D Discrete Wavelet Transform (DWT) is a computationally intensive task that is usually implemented on specific architectures in many imaging systems in real time. In this paper, a high throughput edge or contour detection algorithm is proposed based on the discrete wavelet transform. A technique for applying the filters on the three directions (Horizontal, Vertical and Diagonal) of the image is used to present the maximum of the existing contours. The proposed architectures were designed in VHDL and mapped to a Xilinx Sparten6 FPGA. The results of the synthesis show that the proposed architecture has a low area cost and can operate up to 100 MHz, which can perform 2D wavelet analysis for a sequence of images while maintaining the flexibility of the system to support an adaptive algorithm.

Children's multiplicative transformations of discrete and continuous quantities.

PubMed

Barth, Hilary; Baron, Andrew; Spelke, Elizabeth; Carey, Susan

2009-08-01

Recent studies have documented an evolutionarily primitive, early emerging cognitive system for the mental representation of numerical quantity (the analog magnitude system). Studies with nonhuman primates, human infants, and preschoolers have shown this system to support computations of numerical ordering, addition, and subtraction involving whole number concepts prior to arithmetic training. Here we report evidence that this system supports children's predictions about the outcomes of halving and perhaps also doubling transformations. A total of 138 kindergartners and first graders were asked to reason about the quantity resulting from the doubling or halving of an initial numerosity (of a set of dots) or an initial length (of a bar). Controls for dot size, total dot area, and dot density ensured that children were responding to the number of dots in the arrays. Prior to formal instruction in symbolic multiplication, division, or rational number, halving (and perhaps doubling) computations appear to be deployed over discrete and possibly continuous quantities. The ability to apply simple multiplicative transformations to analog magnitude representations of quantity may form a part of the toolkit that children use to construct later concepts of rational number.

Direct linearizing transform for three-dimensional discrete integrable systems: the lattice AKP, BKP and CKP equations.

PubMed

Fu, Wei; Nijhoff, Frank W

2017-07-01

A unified framework is presented for the solution structure of three-dimensional discrete integrable systems, including the lattice AKP, BKP and CKP equations. This is done through the so-called direct linearizing transform, which establishes a general class of integral transforms between solutions. As a particular application, novel soliton-type solutions for the lattice CKP equation are obtained.

Novel structures for Discrete Hartley Transform based on first-order moments

NASA Astrophysics Data System (ADS)

Xiong, Jun; Zheng, Wenjuan; Wang, Hao; Liu, Jianguo

2018-03-01

Discrete Hartley Transform (DHT) is an important tool in digital signal processing. In the present paper, the DHT is firstly transformed into the first-order moments-based form, then a new fast algorithm is proposed to calculate the first-order moments without multiplication. Based on the algorithm theory, the corresponding hardware architecture for DHT is proposed, which only contains shift operations and additions with no need for multipliers and large memory. To verify the availability and effectiveness, the proposed design is implemented with hardware description language and synthesized by Synopsys Design Compiler with 0.18-μm SMIC library. A series of experiments have proved that the proposed architecture has better performance in terms of the product of the hardware consumption and computation time.

Analysis of spike-wave discharges in rats using discrete wavelet transform.

PubMed

Ubeyli, Elif Derya; Ilbay, Gül; Sahin, Deniz; Ateş, Nurbay

2009-03-01

A feature is a distinctive or characteristic measurement, transform, structural component extracted from a segment of a pattern. Features are used to represent patterns with the goal of minimizing the loss of important information. The discrete wavelet transform (DWT) as a feature extraction method was used in representing the spike-wave discharges (SWDs) records of Wistar Albino Glaxo/Rijswijk (WAG/Rij) rats. The SWD records of WAG/Rij rats were decomposed into time-frequency representations using the DWT and the statistical features were calculated to depict their distribution. The obtained wavelet coefficients were used to identify characteristics of the signal that were not apparent from the original time domain signal. The present study demonstrates that the wavelet coefficients are useful in determining the dynamics in the time-frequency domain of SWD records.

Animation Strategies for Smooth Transformations Between Discrete Lods of 3d Building Models

NASA Astrophysics Data System (ADS)

Kada, Martin; Wichmann, Andreas; Filippovska, Yevgeniya; Hermes, Tobias

2016-06-01

The cartographic 3D visualization of urban areas has experienced tremendous progress over the last years. An increasing number of applications operate interactively in real-time and thus require advanced techniques to improve the quality and time response of dynamic scenes. The main focus of this article concentrates on the discussion of strategies for smooth transformation between two discrete levels of detail (LOD) of 3D building models that are represented as restricted triangle meshes. Because the operation order determines the geometrical and topological properties of the transformation process as well as its visual perception by a human viewer, three different strategies are proposed and subsequently analyzed. The simplest one orders transformation operations by the length of the edges to be collapsed, while the other two strategies introduce a general transformation direction in the form of a moving plane. This plane either pushes the nodes that need to be removed, e.g. during the transformation of a detailed LOD model to a coarser one, towards the main building body, or triggers the edge collapse operations used as transformation paths for the cartographic generalization.

Distributed mean curvature on a discrete manifold for Regge calculus

NASA Astrophysics Data System (ADS)

Conboye, Rory; Miller, Warner A.; Ray, Shannon

2015-09-01

The integrated mean curvature of a simplicial manifold is well understood in both Regge Calculus and Discrete Differential Geometry. However, a well motivated pointwise definition of curvature requires a careful choice of the volume over which to uniformly distribute the local integrated curvature. We show that hybrid cells formed using both the simplicial lattice and its circumcentric dual emerge as a remarkably natural structure for the distribution of this local integrated curvature. These hybrid cells form a complete tessellation of the simplicial manifold, contain a geometric orthonormal basis, and are also shown to give a pointwise mean curvature with a natural interpretation as the fractional rate of change of the normal vector.

Review of finite fields: Applications to discrete Fourier, transforms and Reed-Solomon coding

NASA Technical Reports Server (NTRS)

Wong, J. S. L.; Truong, T. K.; Benjauthrit, B.; Mulhall, B. D. L.; Reed, I. S.

1977-01-01

An attempt is made to provide a step-by-step approach to the subject of finite fields. Rigorous proofs and highly theoretical materials are avoided. The simple concepts of groups, rings, and fields are discussed and developed more or less heuristically. Examples are used liberally to illustrate the meaning of definitions and theories. Applications include discrete Fourier transforms and Reed-Solomon coding.

Plasma plume oscillations monitoring during laser welding of stainless steel by discrete wavelet transform application.

PubMed

Sibillano, Teresa; Ancona, Antonio; Rizzi, Domenico; Lupo, Valentina; Tricarico, Luigi; Lugarà, Pietro Mario

2010-01-01

The plasma optical radiation emitted during CO2 laser welding of stainless steel samples has been detected with a Si-PIN photodiode and analyzed under different process conditions. The discrete wavelet transform (DWT) has been used to decompose the optical signal into various discrete series of sequences over different frequency bands. The results show that changes of the process settings may yield different signal features in the range of frequencies between 200 Hz and 30 kHz. Potential applications of this method to monitor in real time the laser welding processes are also discussed.

Construction of Orthonormal Wavelets Using Symbolic Algebraic Methods

NASA Astrophysics Data System (ADS)

Černá, Dana; Finěk, Václav

2009-09-01

Our contribution is concerned with the solution of nonlinear algebraic equations systems arising from the computation of scaling coefficients of orthonormal wavelets with compact support. Specifically Daubechies wavelets, symmlets, coiflets, and generalized coiflets. These wavelets are defined as a solution of equation systems which are partly linear and partly nonlinear. The idea of presented methods consists in replacing those equations for scaling coefficients by equations for scaling moments. It enables us to eliminate some quadratic conditions in the original system and then simplify it. The simplified system is solved with the aid of the Gröbner basis method. The advantage of our approach is that in some cases, it provides all possible solutions and these solutions can be computed to arbitrary precision. For small systems, we are even able to find explicit solutions. The computation was carried out by symbolic algebra software Maple.

Rapid update of discrete Fourier transform for real-time signal processing

NASA Astrophysics Data System (ADS)

Sherlock, Barry G.; Kakad, Yogendra P.

2001-10-01

In many identification and target recognition applications, the incoming signal will have properties that render it amenable to analysis or processing in the Fourier domain. In such applications, however, it is usually essential that the identification or target recognition be performed in real time. An important constraint upon real-time processing in the Fourier domain is the time taken to perform the Discrete Fourier Transform (DFT). Ideally, a new Fourier transform should be obtained after the arrival of every new data point. However, the Fast Fourier Transform (FFT) algorithm requires on the order of N log2 N operations, where N is the length of the transform, and this usually makes calculation of the transform for every new data point computationally prohibitive. In this paper, we develop an algorithm to update the existing DFT to represent the new data series that results when a new signal point is received. Updating the DFT in this way uses less computational order by a factor of log2 N. The algorithm can be modified to work in the presence of data window functions. This is a considerable advantage, because windowing is often necessary to reduce edge effects that occur because the implicit periodicity of the Fourier transform is not exhibited by the real-world signal. Versions are developed in this paper for use with the boxcar window, the split triangular, Hanning, Hamming, and Blackman windows. Generalization of these results to 2D is also presented.

A Discussion of the Discrete Fourier Transform Execution on a Typical Desktop PC

NASA Technical Reports Server (NTRS)

White, Michael J.

2006-01-01

This paper will discuss and compare the execution times of three examples of the Discrete Fourier Transform (DFT). The first two examples will demonstrate the direct implementation of the algorithm. In the first example, the Fourier coefficients are generated at the execution of the DFT. In the second example, the coefficients are generated prior to execution and the DFT coefficients are indexed at execution. The last example will demonstrate the Cooley- Tukey algorithm, better known as the Fast Fourier Transform. All examples were written in C executed on a PC using a Pentium 4 running at 1.7 Ghz. As a function of N, the total complex data size, the direct implementation DFT executes, as expected at order of N2 and the FFT executes at order of N log2 N. At N=16K, there is an increase in processing time beyond what is expected. This is not caused by implementation but is a consequence of the effect that machine architecture and memory hierarchy has on implementation. This paper will include a brief overview of digital signal processing, along with a discussion of contemporary work with discrete Fourier processing.

Discrete Wavelet Transform for Fault Locations in Underground Distribution System

NASA Astrophysics Data System (ADS)

Apisit, C.; Ngaopitakkul, A.

2010-10-01

In this paper, a technique for detecting faults in underground distribution system is presented. Discrete Wavelet Transform (DWT) based on traveling wave is employed in order to detect the high frequency components and to identify fault locations in the underground distribution system. The first peak time obtained from the faulty bus is employed for calculating the distance of fault from sending end. The validity of the proposed technique is tested with various fault inception angles, fault locations and faulty phases. The result is found that the proposed technique provides satisfactory result and will be very useful in the development of power systems protection scheme.

Orthonormal vector polynomials in a unit circle, Part I: Basis set derived from gradients of Zernike polynomials.

PubMed

Zhao, Chunyu; Burge, James H

2007-12-24

Zernike polynomials provide a well known, orthogonal set of scalar functions over a circular domain, and are commonly used to represent wavefront phase or surface irregularity. A related set of orthogonal functions is given here which represent vector quantities, such as mapping distortion or wavefront gradient. These functions are generated from gradients of Zernike polynomials, made orthonormal using the Gram- Schmidt technique. This set provides a complete basis for representing vector fields that can be defined as a gradient of some scalar function. It is then efficient to transform from the coefficients of the vector functions to the scalar Zernike polynomials that represent the function whose gradient was fit. These new vector functions have immediate application for fitting data from a Shack-Hartmann wavefront sensor or for fitting mapping distortion for optical testing. A subsequent paper gives an additional set of vector functions consisting only of rotational terms with zero divergence. The two sets together provide a complete basis that can represent all vector distributions in a circular domain.

Study on the algorithm of computational ghost imaging based on discrete fourier transform measurement matrix

NASA Astrophysics Data System (ADS)

Zhang, Leihong; Liang, Dong; Li, Bei; Kang, Yi; Pan, Zilan; Zhang, Dawei; Gao, Xiumin; Ma, Xiuhua

2016-07-01

On the basis of analyzing the cosine light field with determined analytic expression and the pseudo-inverse method, the object is illuminated by a presetting light field with a determined discrete Fourier transform measurement matrix, and the object image is reconstructed by the pseudo-inverse method. The analytic expression of the algorithm of computational ghost imaging based on discrete Fourier transform measurement matrix is deduced theoretically, and compared with the algorithm of compressive computational ghost imaging based on random measurement matrix. The reconstruction process and the reconstruction error are analyzed. On this basis, the simulation is done to verify the theoretical analysis. When the sampling measurement number is similar to the number of object pixel, the rank of discrete Fourier transform matrix is the same as the one of the random measurement matrix, the PSNR of the reconstruction image of FGI algorithm and PGI algorithm are similar, the reconstruction error of the traditional CGI algorithm is lower than that of reconstruction image based on FGI algorithm and PGI algorithm. As the decreasing of the number of sampling measurement, the PSNR of reconstruction image based on FGI algorithm decreases slowly, and the PSNR of reconstruction image based on PGI algorithm and CGI algorithm decreases sharply. The reconstruction time of FGI algorithm is lower than that of other algorithms and is not affected by the number of sampling measurement. The FGI algorithm can effectively filter out the random white noise through a low-pass filter and realize the reconstruction denoising which has a higher denoising capability than that of the CGI algorithm. The FGI algorithm can improve the reconstruction accuracy and the reconstruction speed of computational ghost imaging.

Proportional exponentiated link transformed hazards (ELTH) models for discrete time survival data with application

PubMed Central

Joeng, Hee-Koung; Chen, Ming-Hui; Kang, Sangwook

2015-01-01

Discrete survival data are routinely encountered in many fields of study including behavior science, economics, epidemiology, medicine, and social science. In this paper, we develop a class of proportional exponentiated link transformed hazards (ELTH) models. We carry out a detailed examination of the role of links in fitting discrete survival data and estimating regression coefficients. Several interesting results are established regarding the choice of links and baseline hazards. We also characterize the conditions for improper survival functions and the conditions for existence of the maximum likelihood estimates under the proposed ELTH models. An extensive simulation study is conducted to examine the empirical performance of the parameter estimates under the Cox proportional hazards model by treating discrete survival times as continuous survival times, and the model comparison criteria, AIC and BIC, in determining links and baseline hazards. A SEER breast cancer dataset is analyzed in details to further demonstrate the proposed methodology. PMID:25772374

A study of renal blood flow regulation using the discrete wavelet transform

NASA Astrophysics Data System (ADS)

Pavlov, Alexey N.; Pavlova, Olga N.; Mosekilde, Erik; Sosnovtseva, Olga V.

2010-02-01

In this paper we provide a way to distinguish features of renal blood flow autoregulation mechanisms in normotensive and hypertensive rats based on the discrete wavelet transform. Using the variability of the wavelet coefficients we show distinctions that occur between the normal and pathological states. A reduction of this variability in hypertension is observed on the microscopic level of the blood flow in efferent arteriole of single nephrons. This reduction is probably associated with higher flexibility of healthy cardiovascular system.

Segmentation-based wavelet transform for still-image compression

NASA Astrophysics Data System (ADS)

Mozelle, Gerard; Seghier, Abdellatif; Preteux, Francoise J.

1996-10-01

In order to address simultaneously the two functionalities, content-based scalability required by MPEG-4, we introduce a segmentation-based wavelet transform (SBWT). SBWT takes into account both the mathematical properties of multiresolution analysis and the flexibility of region-based approaches for image compression. The associated methodology has two stages: 1) image segmentation into convex and polygonal regions; 2) 2D-wavelet transform of the signal corresponding to each region. In this paper, we have mathematically studied a method for constructing a multiresolution analysis (VjOmega)j (epsilon) N adapted to a polygonal region which provides an adaptive region-based filtering. The explicit construction of scaling functions, pre-wavelets and orthonormal wavelets bases defined on a polygon is carried out by using scaling functions is established by using the theory of Toeplitz operators. The corresponding expression can be interpreted as a location property which allow defining interior and boundary scaling functions. Concerning orthonormal wavelets and pre-wavelets, a similar expansion is obtained by taking advantage of the properties of the orthogonal projector P(V(j(Omega )) perpendicular from the space Vj(Omega ) + 1 onto the space (Vj(Omega )) perpendicular. Finally the mathematical results provide a simple and fast algorithm adapted to polygonal regions.

Coloured computational imaging with single-pixel detectors based on a 2D discrete cosine transform

NASA Astrophysics Data System (ADS)

Liu, Bao-Lei; Yang, Zhao-Hua; Liu, Xia; Wu, Ling-An

2017-02-01

We propose and demonstrate a computational imaging technique that uses structured illumination based on a two-dimensional discrete cosine transform to perform imaging with a single-pixel detector. A scene is illuminated by a projector with two sets of orthogonal patterns, then by applying an inverse cosine transform to the spectra obtained from the single-pixel detector a full-colour image is retrieved. This technique can retrieve an image from sub-Nyquist measurements, and the background noise is easily cancelled to give excellent image quality. Moreover, the experimental set-up is very simple.

Lattice functions, wavelet aliasing, and SO(3) mappings of orthonormal filters

NASA Astrophysics Data System (ADS)

John, Sarah

1998-01-01

A formulation of multiresolution in terms of a family of dyadic lattices {Sj;j∈Z} and filter matrices Mj⊂U(2)⊂GL(2,C) illuminates the role of aliasing in wavelets and provides exact relations between scaling and wavelet filters. By showing the {DN;N∈Z+} collection of compactly supported, orthonormal wavelet filters to be strictly SU(2)⊂U(2), its representation in the Euler angles of the rotation group SO(3) establishes several new results: a 1:1 mapping of the {DN} filters onto a set of orbits on the SO(3) manifold; an equivalence of D∞ to the Shannon filter; and a simple new proof for a criterion ruling out pathologically scaled nonorthonormal filters.

Long memory analysis by using maximal overlapping discrete wavelet transform

NASA Astrophysics Data System (ADS)

Shafie, Nur Amalina binti; Ismail, Mohd Tahir; Isa, Zaidi

2015-05-01

Long memory process is the asymptotic decay of the autocorrelation or spectral density around zero. The main objective of this paper is to do a long memory analysis by using the Maximal Overlapping Discrete Wavelet Transform (MODWT) based on wavelet variance. In doing so, stock market of Malaysia, China, Singapore, Japan and United States of America are used. The risk of long term and short term investment are also being looked into. MODWT can be analyzed with time domain and frequency domain simultaneously and decomposing wavelet variance to different scales without loss any information. All countries under studied show that they have long memory. Subprime mortgage crisis in 2007 is occurred in the United States of America are possible affect to the major trading countries. Short term investment is more risky than long term investment.

Discrete Walsh Hadamard transform based visible watermarking technique for digital color images

NASA Astrophysics Data System (ADS)

Santhi, V.; Thangavelu, Arunkumar

2011-10-01

As the size of the Internet is growing enormously the illegal manipulation of digital multimedia data become very easy with the advancement in technology tools. In order to protect those multimedia data from unauthorized access the digital watermarking system is used. In this paper a new Discrete walsh Hadamard Transform based visible watermarking system is proposed. As the watermark is embedded in transform domain, the system is robust to many signal processing attacks. Moreover in this proposed method the watermark is embedded in tiling manner in all the range of frequencies to make it robust to compression and cropping attack. The robustness of the algorithm is tested against noise addition, cropping, compression, Histogram equalization and resizing attacks. The experimental results show that the algorithm is robust to common signal processing attacks and the observed peak signal to noise ratio (PSNR) of watermarked image is varying from 20 to 30 db depends on the size of the watermark.

Ocean Domains and Maximum Degree of Spherical Harmonic and Orthonormal Expansions

NASA Technical Reports Server (NTRS)

Rapp, R.

1999-01-01

Ocean domains used for the orthonormal (ON) systems are studied to determine the maximum degree of spherical harmonic and orthonormal expansions that can be constructed. Although it was shown that one domain was restricted to degree 24, others were shown could be constructed to determine expansions to at least degree 36. Since 1991 the maximum degree expansion used for several Ohio State studies has been 24. In this report it is shown that the maximum degree for the ocean domain used by Wang and Rapp [1994] was 32 and 29 for the domain used by Rapp, Zhang, Yi [1996]. A modification of the former domain was developed (D1e) that enabled a solution to degree 36 to be determined. A modification of the Rapp, Zhang, Yi domain (D7d) enabled a degree 30 solution to be made. Combination coefficients were developed for domain D1e, to degree 36, and to degree 30 for domain D7d. The degree 30 spherical harmonic expansion provided by Pavlis [1998] of the POCM_4B dynamic ocean topography (DOT), and the degree 30 part of the degree 360 expansion [Rapp. 1998] of the POCM_4B model was converted to an ON expansion valid for the D7d domain. The degree 36 part of the degree 360 expansion was converted to the ON expansion for the D1e domain. The square root of the degree variances of the various solutions were compared. The root mean square value of DOT from the Pai,lis expansion, after conversion to the ON system, was + or - 66.52 cm (D7d domain). The value from the degree 30 part of the 360 expansion was + or - 66.65 cm. The value based on the actual POCM-4B data, in the D7d domain, was + or - 66.74 cm showing excellent agreement with the ON results. If the spherical harmonic coefficients had been used the implied root mean square value was + or - 60.76 cm [Pavlis] and + or -59.70 cm [Rapp].

Speckle noise reduction in quantitative optical metrology techniques by application of the discrete wavelet transformation

NASA Astrophysics Data System (ADS)

Furlong, Cosme; Pryputniewicz, Ryszard J.

2002-06-01

Effective suppression of speckle noise content in interferometric data images can help in improving accuracy and resolution of the results obtained with interferometric optical metrology techniques. In this paper, novel speckle noise reduction algorithms based on the discrete wavelet transformation are presented. The algorithms proceed by: (a) estimating the noise level contained in the interferograms of interest, (b) selecting wavelet families, (c) applying the wavelet transformation using the selected families, (d) wavelet thresholding, and (e) applying the inverse wavelet transformation, producing denoised interferograms. The algorithms are applied to the different stages of the processing procedures utilized for generation of quantitative speckle correlation interferometry data of fiber-optic based opto-electronic holography (FOBOEH) techniques, allowing identification of optimal processing conditions. It is shown that wavelet algorithms are effective for speckle noise reduction while preserving image features otherwise faded with other algorithms.

An automatic frequency control loop using overlapping DFTs (Discrete Fourier Transforms)

NASA Technical Reports Server (NTRS)

Aguirre, S.

1988-01-01

An automatic frequency control (AFC) loop is introduced and analyzed in detail. The new scheme is a generalization of the well known Cross Product AFC loop that uses running overlapping discrete Fourier transforms (DFTs) to create a discriminator curve. Linear analysis is included and supported with computer simulations. The algorithm is tested in a low carrier to noise ratio (CNR) dynamic environment, and the probability of loss of lock is estimated via computer simulations. The algorithm discussed is a suboptimum tracking scheme with a larger frequency error variance compared to an optimum strategy, but offers simplicity of implementation and a very low operating threshold CNR. This technique can be applied during the carrier acquisition and re-acquisition process in the Advanced Receiver.

Reactive scattering with row-orthonormal hyperspherical coordinates. 4. Four-dimensional-space Wigner rotation function for pentaatomic systems.

PubMed

Kuppermann, Aron

2011-05-14

The row-orthonormal hyperspherical coordinate (ROHC) approach to calculating state-to-state reaction cross sections and bound state levels of N-atom systems requires the use of angular momentum tensors and Wigner rotation functions in a space of dimension N - 1. The properties of those tensors and functions are discussed for arbitrary N and determined for N = 5 in terms of the 6 Euler angles involved in 4-dimensional space.

Damage detection on sudden stiffness reduction based on discrete wavelet transform.

PubMed

Chen, Bo; Chen, Zhi-wei; Wang, Gan-jun; Xie, Wei-ping

2014-01-01

The sudden stiffness reduction in a structure may cause the signal discontinuity in the acceleration responses close to the damage location at the damage time instant. To this end, the damage detection on sudden stiffness reduction of building structures has been actively investigated in this study. The signal discontinuity of the structural acceleration responses of an example building is extracted based on the discrete wavelet transform. It is proved that the variation of the first level detail coefficients of the wavelet transform at damage instant is linearly proportional to the magnitude of the stiffness reduction. A new damage index is proposed and implemented to detect the damage time instant, location, and severity of a structure due to a sudden change of structural stiffness. Numerical simulation using a five-story shear building under different types of excitation is carried out to assess the effectiveness and reliability of the proposed damage index for the building at different damage levels. The sensitivity of the damage index to the intensity and frequency range of measurement noise is also investigated. The made observations demonstrate that the proposed damage index can accurately identify the sudden damage events if the noise intensity is limited.

A new stationary gridline artifact suppression method based on the 2D discrete wavelet transform

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tang, Hui, E-mail: corinna@seu.edu.cn; Key Laboratory of Computer Network and Information Integration; Centre de Recherche en Information Biomédicale sino-français, Laboratoire International Associé, Inserm, Université de Rennes 1, Rennes 35000

2015-04-15

Purpose: In digital x-ray radiography, an antiscatter grid is inserted between the patient and the image receptor to reduce scattered radiation. If the antiscatter grid is used in a stationary way, gridline artifacts will appear in the final image. In most of the gridline removal image processing methods, the useful information with spatial frequencies close to that of the gridline is usually lost or degraded. In this study, a new stationary gridline suppression method is designed to preserve more of the useful information. Methods: The method is as follows. The input image is first recursively decomposed into several smaller subimagesmore » using a multiscale 2D discrete wavelet transform. The decomposition process stops when the gridline signal is found to be greater than a threshold in one or several of these subimages using a gridline detection module. An automatic Gaussian band-stop filter is then applied to the detected subimages to remove the gridline signal. Finally, the restored image is achieved using the corresponding 2D inverse discrete wavelet transform. Results: The processed images show that the proposed method can remove the gridline signal efficiently while maintaining the image details. The spectra of a 1D Fourier transform of the processed images demonstrate that, compared with some existing gridline removal methods, the proposed method has better information preservation after the removal of the gridline artifacts. Additionally, the performance speed is relatively high. Conclusions: The experimental results demonstrate the efficiency of the proposed method. Compared with some existing gridline removal methods, the proposed method can preserve more information within an acceptable execution time.« less

Discrete rational and breather solution in the spatial discrete complex modified Korteweg-de Vries equation and continuous counterparts.

PubMed

Zhao, Hai-Qiong; Yu, Guo-Fu

2017-04-01

In this paper, a spatial discrete complex modified Korteweg-de Vries equation is investigated. The Lax pair, conservation laws, Darboux transformations, and breather and rational wave solutions to the semi-discrete system are presented. The distinguished feature of the model is that the discrete rational solution can possess new W-shape rational periodic-solitary waves that were not reported before. In addition, the first-order rogue waves reach peak amplitudes which are at least three times of the background amplitude, whereas their continuous counterparts are exactly three times the constant background. Finally, the integrability of the discrete system, including Lax pair, conservation laws, Darboux transformations, and explicit solutions, yields the counterparts of the continuous system in the continuum limit.

BOOK REVIEW: The Illustrated Wavelet Transform Handbook: Introductory Theory and Applications in Science, Engineering, Medicine and Finance

NASA Astrophysics Data System (ADS)

Ng, J.; Kingsbury, N. G.

2004-02-01

This book provides an overview of the theory and practice of continuous and discrete wavelet transforms. Divided into seven chapters, the first three chapters of the book are introductory, describing the various forms of the wavelet transform and their computation, while the remaining chapters are devoted to applications in fluids, engineering, medicine and miscellaneous areas. Each chapter is well introduced, with suitable examples to demonstrate key concepts. Illustrations are included where appropriate, thus adding a visual dimension to the text. A noteworthy feature is the inclusion, at the end of each chapter, of a list of further resources from the academic literature which the interested reader can consult. The first chapter is purely an introduction to the text. The treatment of wavelet transforms begins in the second chapter, with the definition of what a wavelet is. The chapter continues by defining the continuous wavelet transform and its inverse and a description of how it may be used to interrogate signals. The continuous wavelet transform is then compared to the short-time Fourier transform. Energy and power spectra with respect to scale are also discussed and linked to their frequency counterparts. Towards the end of the chapter, the two-dimensional continuous wavelet transform is introduced. Examples of how the continuous wavelet transform is computed using the Mexican hat and Morlet wavelets are provided throughout. The third chapter introduces the discrete wavelet transform, with its distinction from the discretized continuous wavelet transform having been made clear at the end of the second chapter. In the first half of the chapter, the logarithmic discretization of the wavelet function is described, leading to a discussion of dyadic grid scaling, frames, orthogonal and orthonormal bases, scaling functions and multiresolution representation. The fast wavelet transform is introduced and its computation is illustrated with an example using the Haar

Introduction to Quantum Information/Computing

DTIC Science & Technology

2005-06-01

SUBTITLE INTRODUCTION TO QUANTUM INFORMATION/COMPUTING 6. AUTHOR( S ) Peter J. Costianes 5. FUNDING NUMBERS C - N/A PE - 62702F PR...concept is an important concept in Quantum Mechanics and will be further applied later in this report. 2.8 Discrete Orthonormal Bases in F. 2.8.1...index i in defining the coordinates of the wavevector. Many quantum systems may be represented by both a continuous and discrete set of bases

An asymptotic formula for polynomials orthonormal with respect to a varying weight. II

DOE Office of Scientific and Technical Information (OSTI.GOV)

Komlov, A V; Suetin, S P

2014-09-30

This paper gives a proof of the theorem announced by the authors in the preceding paper with the same title. The theorem states that asymptotically the behaviour of the polynomials which are orthonormal with respect to the varying weight e{sup −2nQ(x)}p{sub g}(x)/√(∏{sub j=1}{sup 2p}(x−e{sub j})) coincides with the asymptotic behaviour of the Nuttall psi-function, which solves a special boundary-value problem on the relevant hyperelliptic Riemann surface of genus g=p−1. Here e{sub 1}

A new Watermarking System based on Discrete Cosine Transform (DCT) in color biometric images.

PubMed

Dogan, Sengul; Tuncer, Turker; Avci, Engin; Gulten, Arif

2012-08-01

This paper recommend a biometric color images hiding approach An Watermarking System based on Discrete Cosine Transform (DCT), which is used to protect the security and integrity of transmitted biometric color images. Watermarking is a very important hiding information (audio, video, color image, gray image) technique. It is commonly used on digital objects together with the developing technology in the last few years. One of the common methods used for hiding information on image files is DCT method which used in the frequency domain. In this study, DCT methods in order to embed watermark data into face images, without corrupting their features.

The Wronskian solution of the constrained discrete Kadomtsev-Petviashvili hierarchy

NASA Astrophysics Data System (ADS)

Li, Maohua; He, Jingsong

2016-05-01

From the constrained discrete Kadomtsev-Petviashvili (cdKP) hierarchy, the discrete nonlinear Schrödinger (DNLS) equations have been derived. By means of the gauge transformation, the Wronskian solution of DNLS equations have been given. The u1 of the cdKP hierarchy is a Y-type soliton solution for odd times of the gauge transformation, but it becomes a dark-bright soliton solution for even times of the gauge transformation. The role of the discrete variable n in the profile of the u1 is discussed.

Fast Fourier and discrete wavelet transforms applied to sensorless vector control induction motor for rotor bar faults diagnosis.

PubMed

Talhaoui, Hicham; Menacer, Arezki; Kessal, Abdelhalim; Kechida, Ridha

2014-09-01

This paper presents new techniques to evaluate faults in case of broken rotor bars of induction motors. Procedures are applied with closed-loop control. Electrical and mechanical variables are treated using fast Fourier transform (FFT), and discrete wavelet transform (DWT) at start-up and steady state. The wavelet transform has proven to be an excellent mathematical tool for the detection of the faults particularly broken rotor bars type. As a performance, DWT can provide a local representation of the non-stationary current signals for the healthy machine and with fault. For sensorless control, a Luenberger observer is applied; the estimation rotor speed is analyzed; the effect of the faults in the speed pulsation is compensated; a quadratic current appears and used for fault detection. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

Shift-invariant discrete wavelet transform analysis for retinal image classification.

PubMed

Khademi, April; Krishnan, Sridhar

2007-12-01

This work involves retinal image classification and a novel analysis system was developed. From the compressed domain, the proposed scheme extracts textural features from wavelet coefficients, which describe the relative homogeneity of localized areas of the retinal images. Since the discrete wavelet transform (DWT) is shift-variant, a shift-invariant DWT was explored to ensure that a robust feature set was extracted. To combat the small database size, linear discriminant analysis classification was used with the leave one out method. 38 normal and 48 abnormal (exudates, large drusens, fine drusens, choroidal neovascularization, central vein and artery occlusion, histoplasmosis, arteriosclerotic retinopathy, hemi-central retinal vein occlusion and more) were used and a specificity of 79% and sensitivity of 85.4% were achieved (the average classification rate is 82.2%). The success of the system can be accounted to the highly robust feature set which included translation, scale and semi-rotational, features. Additionally, this technique is database independent since the features were specifically tuned to the pathologies of the human eye.

Fluorescence molecular tomography reconstruction via discrete cosine transform-based regularization

NASA Astrophysics Data System (ADS)

Shi, Junwei; Liu, Fei; Zhang, Jiulou; Luo, Jianwen; Bai, Jing

2015-05-01

Fluorescence molecular tomography (FMT) as a noninvasive imaging modality has been widely used for biomedical preclinical applications. However, FMT reconstruction suffers from severe ill-posedness, especially when a limited number of projections are used. In order to improve the quality of FMT reconstruction results, a discrete cosine transform (DCT) based reweighted L1-norm regularization algorithm is proposed. In each iteration of the reconstruction process, different reweighted regularization parameters are adaptively assigned according to the values of DCT coefficients to suppress the reconstruction noise. In addition, the permission region of the reconstructed fluorophores is adaptively constructed to increase the convergence speed. In order to evaluate the performance of the proposed algorithm, physical phantom and in vivo mouse experiments with a limited number of projections are carried out. For comparison, different L1-norm regularization strategies are employed. By quantifying the signal-to-noise ratio (SNR) of the reconstruction results in the phantom and in vivo mouse experiments with four projections, the proposed DCT-based reweighted L1-norm regularization shows higher SNR than other L1-norm regularizations employed in this work.

A new time-adaptive discrete bionic wavelet transform for enhancing speech from adverse noise environment

NASA Astrophysics Data System (ADS)

Palaniswamy, Sumithra; Duraisamy, Prakash; Alam, Mohammad Showkat; Yuan, Xiaohui

2012-04-01

Automatic speech processing systems are widely used in everyday life such as mobile communication, speech and speaker recognition, and for assisting the hearing impaired. In speech communication systems, the quality and intelligibility of speech is of utmost importance for ease and accuracy of information exchange. To obtain an intelligible speech signal and one that is more pleasant to listen, noise reduction is essential. In this paper a new Time Adaptive Discrete Bionic Wavelet Thresholding (TADBWT) scheme is proposed. The proposed technique uses Daubechies mother wavelet to achieve better enhancement of speech from additive non- stationary noises which occur in real life such as street noise and factory noise. Due to the integration of human auditory system model into the wavelet transform, bionic wavelet transform (BWT) has great potential for speech enhancement which may lead to a new path in speech processing. In the proposed technique, at first, discrete BWT is applied to noisy speech to derive TADBWT coefficients. Then the adaptive nature of the BWT is captured by introducing a time varying linear factor which updates the coefficients at each scale over time. This approach has shown better performance than the existing algorithms at lower input SNR due to modified soft level dependent thresholding on time adaptive coefficients. The objective and subjective test results confirmed the competency of the TADBWT technique. The effectiveness of the proposed technique is also evaluated for speaker recognition task under noisy environment. The recognition results show that the TADWT technique yields better performance when compared to alternate methods specifically at lower input SNR.

A case study on Discrete Wavelet Transform based Hurst exponent for epilepsy detection.

PubMed

Madan, Saiby; Srivastava, Kajri; Sharmila, A; Mahalakshmi, P

2018-01-01

Epileptic seizures are manifestations of epilepsy. Careful analysis of EEG records can provide valuable insight and improved understanding of the mechanism causing epileptic disorders. The detection of epileptic form discharges in EEG is an important component in the diagnosis of epilepsy. As EEG signals are non-stationary, the conventional frequency and time domain analysis does not provide better accuracy. So, in this work an attempt has been made to provide an overview of the determination of epilepsy by implementation of Hurst exponent (HE)-based discrete wavelet transform techniques for feature extraction from EEG data sets obtained during ictal and pre ictal stages of affected person and finally classifying EEG signals using SVM and KNN Classifiers. The The highest accuracy of 99% is obtained using SVM.

On E-discretization of tori of compact simple Lie groups. II

NASA Astrophysics Data System (ADS)

Hrivnák, Jiří; Juránek, Michal

2017-10-01

Ten types of discrete Fourier transforms of Weyl orbit functions are developed. Generalizing one-dimensional cosine, sine, and exponential, each type of the Weyl orbit function represents an exponential symmetrized with respect to a subgroup of the Weyl group. Fundamental domains of even affine and dual even affine Weyl groups, governing the argument and label symmetries of the even orbit functions, are determined. The discrete orthogonality relations are formulated on finite sets of points from the refinements of the dual weight lattices. Explicit counting formulas for the number of points of the discrete transforms are deduced. Real-valued Hartley orbit functions are introduced, and all ten types of the corresponding discrete Hartley transforms are detailed.

A discrete polar Stockwell transform for enhanced characterization of tissue structure using MRI.

PubMed

Pridham, Glen; Steenwijk, Martijn D; Geurts, Jeroen J G; Zhang, Yunyan

2018-05-02

The purpose of this study was to present an effective algorithm for computing the discrete polar Stockwell transform (PST), investigate its unique multiscale and multi-orientation features, and explore potentially new applications including denoising and tissue segmentation. We investigated PST responses using both synthetic and MR images. Moreover, we compared the features of PST with both Gabor and Morlet wavelet transforms, and compared the PST with two wavelet approaches for denoising using MRI. Using a synthetic image, we also tested the edge effect of PST through signal-padding. Then, we constructed a partially supervised classifier using radial, marginal PST spectra of T2-weighted MRI, acquired from postmortem brains with multiple sclerosis. The classification involved three histology-verified tissue types: normal appearing white matter (NAWM), lesion, or other, along with 5-fold cross-validation. The PST generated a series of images with varying orientations or rotation-invariant scales. Radial frequencies highlighted image structures of different size, and angular frequencies enhanced structures by orientation. Signal-padding helped suppress boundary artifacts but required attention to incidental artifacts. In comparison, the Gabor transform produced more redundant images and the wavelet spectra appeared less spatially smooth than the PST. In addition, the PST demonstrated lower root-mean-square errors than other transforms in denoising and achieved a 93% accuracy for NAWM pixels (296/317), and 88% accuracy for lesion pixels (165/188) in MRI segmentation. The PST is a unique local spectral density-assessing tool which is sensitive to both structure orientations and scales. This may facilitate multiple new applications including advanced characterization of tissue structure in standard MRI. © 2018 International Society for Magnetic Resonance in Medicine.

Exploring biorthonormal transformations of pair-correlation functions in atomic structure variational calculations

NASA Astrophysics Data System (ADS)

Verdebout, S.; Jönsson, P.; Gaigalas, G.; Godefroid, M.; Froese Fischer, C.

2010-04-01

Multiconfiguration expansions frequently target valence correlation and correlation between valence electrons and the outermost core electrons. Correlation within the core is often neglected. A large orbital basis is needed to saturate both the valence and core-valence correlation effects. This in turn leads to huge numbers of configuration state functions (CSFs), many of which are unimportant. To avoid the problems inherent to the use of a single common orthonormal orbital basis for all correlation effects in the multiconfiguration Hartree-Fock (MCHF) method, we propose to optimize independent MCHF pair-correlation functions (PCFs), bringing their own orthonormal one-electron basis. Each PCF is generated by allowing single- and double-excitations from a multireference (MR) function. This computational scheme has the advantage of using targeted and optimally localized orbital sets for each PCF. These pair-correlation functions are coupled together and with each component of the MR space through a low dimension generalized eigenvalue problem. Nonorthogonal orbital sets being involved, the interaction and overlap matrices are built using biorthonormal transformation of the coupled basis sets followed by a counter-transformation of the PCF expansions. Applied to the ground state of beryllium, the new method gives total energies that are lower than the ones from traditional complete active space (CAS)-MCHF calculations using large orbital active sets. It is fair to say that we now have the possibility to account for, in a balanced way, correlation deep down in the atomic core in variational calculations.

Assessment of Power Quality based on Fuzzy Logic and Discrete Wavelet Transform for Nonstationary Disturbances

NASA Astrophysics Data System (ADS)

Sinha, Pampa; Nath, Sudipta

2010-10-01

The main aspects of power system delivery are reliability and quality. If all the customers of a power system get uninterrupted power through the year then the system is considered to be reliable. The term power quality may be referred to as maintaining near sinusoidal voltage at rated frequency at the consumers end. The power component definitions are defined according to the IEEE Standard 1459-2000 both for single phase and three phase unbalanced systems based on Fourier Transform (FFT). In the presence of nonstationary power quality (PQ) disturbances results in accurate values due to its sensitivity to the spectral leakage problem. To overcome these limitations the power quality components are calculated using Discrete Wavelet Transform (DWT). In order to handle the uncertainties associated with electric power systems operations fuzzy logic has been incorporated in this paper. A new power quality index has been introduced here which can assess the power quality under nonstationary disturbances.

High-speed real-time image compression based on all-optical discrete cosine transformation

NASA Astrophysics Data System (ADS)

Guo, Qiang; Chen, Hongwei; Wang, Yuxi; Chen, Minghua; Yang, Sigang; Xie, Shizhong

2017-02-01

In this paper, we present a high-speed single-pixel imaging (SPI) system based on all-optical discrete cosine transform (DCT) and demonstrate its capability to enable noninvasive imaging of flowing cells in a microfluidic channel. Through spectral shaping based on photonic time stretch (PTS) and wavelength-to-space conversion, structured illumination patterns are generated at a rate (tens of MHz) which is three orders of magnitude higher than the switching rate of a digital micromirror device (DMD) used in a conventional single-pixel camera. Using this pattern projector, high-speed image compression based on DCT can be achieved in the optical domain. In our proposed system, a high compression ratio (approximately 10:1) and a fast image reconstruction procedure are both achieved, which implicates broad applications in industrial quality control and biomedical imaging.

The shift-invariant discrete wavelet transform and application to speech waveform analysis.

PubMed

Enders, Jörg; Geng, Weihua; Li, Peijun; Frazier, Michael W; Scholl, David J

2005-04-01

The discrete wavelet transform may be used as a signal-processing tool for visualization and analysis of nonstationary, time-sampled waveforms. The highly desirable property of shift invariance can be obtained at the cost of a moderate increase in computational complexity, and accepting a least-squares inverse (pseudoinverse) in place of a true inverse. A new algorithm for the pseudoinverse of the shift-invariant transform that is easier to implement in array-oriented scripting languages than existing algorithms is presented together with self-contained proofs. Representing only one of the many and varied potential applications, a recorded speech waveform illustrates the benefits of shift invariance with pseudoinvertibility. Visualization shows the glottal modulation of vowel formants and frication noise, revealing secondary glottal pulses and other waveform irregularities. Additionally, performing sound waveform editing operations (i.e., cutting and pasting sections) on the shift-invariant wavelet representation automatically produces quiet, click-free section boundaries in the resulting sound. The capabilities of this wavelet-domain editing technique are demonstrated by changing the rate of a recorded spoken word. Individual pitch periods are repeated to obtain a half-speed result, and alternate individual pitch periods are removed to obtain a double-speed result. The original pitch and formant frequencies are preserved. In informal listening tests, the results are clear and understandable.

The shift-invariant discrete wavelet transform and application to speech waveform analysis

NASA Astrophysics Data System (ADS)

Enders, Jörg; Geng, Weihua; Li, Peijun; Frazier, Michael W.; Scholl, David J.

2005-04-01

The discrete wavelet transform may be used as a signal-processing tool for visualization and analysis of nonstationary, time-sampled waveforms. The highly desirable property of shift invariance can be obtained at the cost of a moderate increase in computational complexity, and accepting a least-squares inverse (pseudoinverse) in place of a true inverse. A new algorithm for the pseudoinverse of the shift-invariant transform that is easier to implement in array-oriented scripting languages than existing algorithms is presented together with self-contained proofs. Representing only one of the many and varied potential applications, a recorded speech waveform illustrates the benefits of shift invariance with pseudoinvertibility. Visualization shows the glottal modulation of vowel formants and frication noise, revealing secondary glottal pulses and other waveform irregularities. Additionally, performing sound waveform editing operations (i.e., cutting and pasting sections) on the shift-invariant wavelet representation automatically produces quiet, click-free section boundaries in the resulting sound. The capabilities of this wavelet-domain editing technique are demonstrated by changing the rate of a recorded spoken word. Individual pitch periods are repeated to obtain a half-speed result, and alternate individual pitch periods are removed to obtain a double-speed result. The original pitch and formant frequencies are preserved. In informal listening tests, the results are clear and understandable. .

Simulation study and experimental results for detection and classification of the transient capacitor inrush current using discrete wavelet transform and artificial intelligence

NASA Astrophysics Data System (ADS)

Patcharoen, Theerasak; Yoomak, Suntiti; Ngaopitakkul, Atthapol; Pothisarn, Chaichan

2018-04-01

This paper describes the combination of discrete wavelet transforms (DWT) and artificial intelligence (AI), which are efficient techniques to identify the type of inrush current, analyze the origin and possible cause on the capacitor bank switching. The experiment setup used to verify the proposed techniques can be detected and classified the transient inrush current from normal capacitor rated current. The discrete wavelet transforms are used to detect and classify the inrush current. Then, output from wavelet is acted as input of fuzzy inference system for discriminating the type of switching transient inrush current. The proposed technique shows enhanced performance with a discrimination accuracy of 90.57%. Both simulation study and experimental results are quite satisfactory with providing the high accuracy and reliability which can be developed and implemented into a numerical overcurrent (50/51) and unbalanced current (60C) protection relay for an application of shunt capacitor bank protection in the future.

Approximation for discrete Fourier transform and application in study of three-dimensional interacting electron gas.

PubMed

Yan, Xin-Zhong

2011-07-01

The discrete Fourier transform is approximated by summing over part of the terms with corresponding weights. The approximation reduces significantly the requirement for computer memory storage and enhances the numerical computation efficiency with several orders without losing accuracy. As an example, we apply the algorithm to study the three-dimensional interacting electron gas under the renormalized-ring-diagram approximation where the Green's function needs to be self-consistently solved. We present the results for the chemical potential, compressibility, free energy, entropy, and specific heat of the system. The ground-state energy obtained by the present calculation is compared with the existing results of Monte Carlo simulation and random-phase approximation.

Tight-binding approach to overdamped Brownian motion on a bichromatic periodic potential.

PubMed

Nguyen, P T T; Challis, K J; Jack, M W

2016-02-01

We present a theoretical treatment of overdamped Brownian motion on a time-independent bichromatic periodic potential with spatially fast- and slow-changing components. In our approach, we generalize the Wannier basis commonly used in the analysis of periodic systems to define a basis of S states that are localized at local minima of the potential. We demonstrate that the S states are orthonormal and complete on the length scale of the periodicity of the fast-changing potential, and we use the S-state basis to transform the continuous Smoluchowski equation for the system to a discrete master equation describing hopping between local minima. We identify the parameter regime where the master equation description is valid and show that the interwell hopping rates are well approximated by Kramers' escape rate in the limit of deep potential minima. Finally, we use the master equation to explore the system dynamics and determine the drift and diffusion for the system.

A hybrid group method of data handling with discrete wavelet transform for GDP forecasting

NASA Astrophysics Data System (ADS)

Isa, Nadira Mohamed; Shabri, Ani

2013-09-01

This study is proposed the application of hybridization model using Group Method of Data Handling (GMDH) and Discrete Wavelet Transform (DWT) in time series forecasting. The objective of this paper is to examine the flexibility of the hybridization GMDH in time series forecasting by using Gross Domestic Product (GDP). A time series data set is used in this study to demonstrate the effectiveness of the forecasting model. This data are utilized to forecast through an application aimed to handle real life time series. This experiment compares the performances of a hybrid model and a single model of Wavelet-Linear Regression (WR), Artificial Neural Network (ANN), and conventional GMDH. It is shown that the proposed model can provide a promising alternative technique in GDP forecasting.

Offline Signature Verification Using the Discrete Radon Transform and a Hidden Markov Model

NASA Astrophysics Data System (ADS)

Coetzer, J.; Herbst, B. M.; du Preez, J. A.

2004-12-01

We developed a system that automatically authenticates offline handwritten signatures using the discrete Radon transform (DRT) and a hidden Markov model (HMM). Given the robustness of our algorithm and the fact that only global features are considered, satisfactory results are obtained. Using a database of 924 signatures from 22 writers, our system achieves an equal error rate (EER) of 18% when only high-quality forgeries (skilled forgeries) are considered and an EER of 4.5% in the case of only casual forgeries. These signatures were originally captured offline. Using another database of 4800 signatures from 51 writers, our system achieves an EER of 12.2% when only skilled forgeries are considered. These signatures were originally captured online and then digitally converted into static signature images. These results compare well with the results of other algorithms that consider only global features.

Digital double random amplitude image encryption method based on the symmetry property of the parametric discrete Fourier transform

NASA Astrophysics Data System (ADS)

Bekkouche, Toufik; Bouguezel, Saad

2018-03-01

We propose a real-to-real image encryption method. It is a double random amplitude encryption method based on the parametric discrete Fourier transform coupled with chaotic maps to perform the scrambling. The main idea behind this method is the introduction of a complex-to-real conversion by exploiting the inherent symmetry property of the transform in the case of real-valued sequences. This conversion allows the encrypted image to be real-valued instead of being a complex-valued image as in all existing double random phase encryption methods. The advantage is to store or transmit only one image instead of two images (real and imaginary parts). Computer simulation results and comparisons with the existing double random amplitude encryption methods are provided for peak signal-to-noise ratio, correlation coefficient, histogram analysis, and key sensitivity.

Content Based Image Retrieval by Using Color Descriptor and Discrete Wavelet Transform.

PubMed

Ashraf, Rehan; Ahmed, Mudassar; Jabbar, Sohail; Khalid, Shehzad; Ahmad, Awais; Din, Sadia; Jeon, Gwangil

2018-01-25

Due to recent development in technology, the complexity of multimedia is significantly increased and the retrieval of similar multimedia content is a open research problem. Content-Based Image Retrieval (CBIR) is a process that provides a framework for image search and low-level visual features are commonly used to retrieve the images from the image database. The basic requirement in any image retrieval process is to sort the images with a close similarity in term of visually appearance. The color, shape and texture are the examples of low-level image features. The feature plays a significant role in image processing. The powerful representation of an image is known as feature vector and feature extraction techniques are applied to get features that will be useful in classifying and recognition of images. As features define the behavior of an image, they show its place in terms of storage taken, efficiency in classification and obviously in time consumption also. In this paper, we are going to discuss various types of features, feature extraction techniques and explaining in what scenario, which features extraction technique will be better. The effectiveness of the CBIR approach is fundamentally based on feature extraction. In image processing errands like object recognition and image retrieval feature descriptor is an immense among the most essential step. The main idea of CBIR is that it can search related images to an image passed as query from a dataset got by using distance metrics. The proposed method is explained for image retrieval constructed on YCbCr color with canny edge histogram and discrete wavelet transform. The combination of edge of histogram and discrete wavelet transform increase the performance of image retrieval framework for content based search. The execution of different wavelets is additionally contrasted with discover the suitability of specific wavelet work for image retrieval. The proposed algorithm is prepared and tried to implement for

Techniques for computing the discrete Fourier transform using the quadratic residue Fermat number systems

NASA Technical Reports Server (NTRS)

Truong, T. K.; Chang, J. J.; Hsu, I. S.; Pei, D. Y.; Reed, I. S.

1986-01-01

The complex integer multiplier and adder over the direct sum of two copies of finite field developed by Cozzens and Finkelstein (1985) is specialized to the direct sum of the rings of integers modulo Fermat numbers. Such multiplication over the rings of integers modulo Fermat numbers can be performed by means of two integer multiplications, whereas the complex integer multiplication requires three integer multiplications. Such multiplications and additions can be used in the implementation of a discrete Fourier transform (DFT) of a sequence of complex numbers. The advantage of the present approach is that the number of multiplications needed to compute a systolic array of the DFT can be reduced substantially. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

Evaluation of cardiac signals using discrete wavelet transform with MATLAB graphical user interface.

PubMed

John, Agnes Aruna; Subramanian, Aruna Priyadharshni; Jaganathan, Saravana Kumar; Sethuraman, Balasubramanian

2015-01-01

To process the electrocardiogram (ECG) signals using MATLAB-based graphical user interface (GUI) and to classify the signals based on heart rate. The subject condition was identified using R-peak detection based on discrete wavelet transform followed by a Bayes classifier that classifies the ECG signals. The GUI was designed to display the ECG signal plot. Obtained from MIT database 18 patients had normal heart rate and 9 patients had abnormal heart rate; 14.81% of the patients suffered from tachycardia and 18.52% of the patients have bradycardia. The proposed GUI display was found useful to analyze the digitized ECG signal by a non-technical user and may help in diagnostics. Further improvement can be done by employing field programmable gate array for the real time processing of cardiac signals. Copyright © 2015 Cardiological Society of India. Published by Elsevier B.V. All rights reserved.

The discrete Fourier transform algorithm for determining decay constants—Implementation using a field programmable gate array

NASA Astrophysics Data System (ADS)

Bostrom, G.; Atkinson, D.; Rice, A.

2015-04-01

Cavity ringdown spectroscopy (CRDS) uses the exponential decay constant of light exiting a high-finesse resonance cavity to determine analyte concentration, typically via absorption. We present a high-throughput data acquisition system that determines the decay constant in near real time using the discrete Fourier transform algorithm on a field programmable gate array (FPGA). A commercially available, high-speed, high-resolution, analog-to-digital converter evaluation board system is used as the platform for the system, after minor hardware and software modifications. The system outputs decay constants at maximum rate of 4.4 kHz using an 8192-point fast Fourier transform by processing the intensity decay signal between ringdown events. We present the details of the system, including the modifications required to adapt the evaluation board to accurately process the exponential waveform. We also demonstrate the performance of the system, both stand-alone and incorporated into our existing CRDS system. Details of FPGA, microcontroller, and circuitry modifications are provided in the Appendix and computer code is available upon request from the authors.

Identification of safety-critical events using kinematic vehicle data and the discrete fourier transform.

PubMed

Kluger, Robert; Smith, Brian L; Park, Hyungjun; Dailey, Daniel J

2016-11-01

Recent technological advances have made it both feasible and practical to identify unsafe driving behaviors using second-by-second trajectory data. Presented in this paper is a unique approach to detecting safety-critical events using vehicles' longitudinal accelerations. A Discrete Fourier Transform is used in combination with K-means clustering to flag patterns in the vehicles' accelerations in time-series that are likely to be crashes or near-crashes. The algorithm was able to detect roughly 78% of crasjavascript:void(0)hes and near-crashes (71 out of 91 validated events in the Naturalistic Driving Study data used), while generating about 1 false positive every 2.7h. In addition to presenting the promising results, an implementation strategy is discussed and further research topics that can improve this method are suggested in the paper. Copyright © 2016 Elsevier Ltd. All rights reserved.

A Discussion of Using a Reconfigurable Processor to Implement the Discrete Fourier Transform

NASA Technical Reports Server (NTRS)

White, Michael J.

2004-01-01

This paper presents the design and implementation of the Discrete Fourier Transform (DFT) algorithm on a reconfigurable processor system. While highly applicable to many engineering problems, the DFT is an extremely computationally intensive algorithm. Consequently, the eventual goal of this work is to enhance the execution of a floating-point precision DFT algorithm by off loading the algorithm from the computing system. This computing system, within the context of this research, is a typical high performance desktop computer with an may of field programmable gate arrays (FPGAs). FPGAs are hardware devices that are configured by software to execute an algorithm. If it is desired to change the algorithm, the software is changed to reflect the modification, then download to the FPGA, which is then itself modified. This paper will discuss methodology for developing the DFT algorithm to be implemented on the FPGA. We will discuss the algorithm, the FPGA code effort, and the results to date.

Orthogonal fast spherical Bessel transform on uniform grid

NASA Astrophysics Data System (ADS)

Serov, Vladislav V.

2017-07-01

We propose an algorithm for the orthogonal fast discrete spherical Bessel transform on a uniform grid. Our approach is based upon the spherical Bessel transform factorization into the two subsequent orthogonal transforms, namely the fast Fourier transform and the orthogonal transform founded on the derivatives of the discrete Legendre orthogonal polynomials. The method utility is illustrated by its implementation for the problem of a two-atomic molecule in a time-dependent external field simulating the one utilized in the attosecond streaking technique.

Designing an Algorithm for Cancerous Tissue Segmentation Using Adaptive K-means Cluttering and Discrete Wavelet Transform.

PubMed

Rezaee, Kh; Haddadnia, J

2013-09-01

Breast cancer is currently one of the leading causes of death among women worldwide. The diagnosis and separation of cancerous tumors in mammographic images require accuracy, experience and time, and it has always posed itself as a major challenge to the radiologists and physicians. This paper proposes a new algorithm which draws on discrete wavelet transform and adaptive K-means techniques to transmute the medical images implement the tumor estimation and detect breast cancer tumors in mammograms in early stages. It also allows the rapid processing of the input data. In the first step, after designing a filter, the discrete wavelet transform is applied to the input images and the approximate coefficients of scaling components are constructed. Then, the different parts of image are classified in continuous spectrum. In the next step, by using adaptive K-means algorithm for initializing and smart choice of clusters' number, the appropriate threshold is selected. Finally, the suspicious cancerous mass is separated by implementing the image processing techniques. We Received 120 mammographic images in LJPEG format, which had been scanned in Gray-Scale with 50 microns size, 3% noise and 20% INU from clinical data taken from two medical databases (mini-MIAS and DDSM). The proposed algorithm detected tumors at an acceptable level with an average accuracy of 92.32% and sensitivity of 90.24%. Also, the Kappa coefficient was approximately 0.85, which proved the suitable reliability of the system performance. The exact positioning of the cancerous tumors allows the radiologist to determine the stage of disease progression and suggest an appropriate treatment in accordance with the tumor growth. The low PPV and high NPV of the system is a warranty of the system and both clinical specialists and patients can trust its output.

Designing an Algorithm for Cancerous Tissue Segmentation Using Adaptive K-means Cluttering and Discrete Wavelet Transform

PubMed Central

Rezaee, Kh.; Haddadnia, J.

2013-01-01

Background: Breast cancer is currently one of the leading causes of death among women worldwide. The diagnosis and separation of cancerous tumors in mammographic images require accuracy, experience and time, and it has always posed itself as a major challenge to the radiologists and physicians. Objective: This paper proposes a new algorithm which draws on discrete wavelet transform and adaptive K-means techniques to transmute the medical images implement the tumor estimation and detect breast cancer tumors in mammograms in early stages. It also allows the rapid processing of the input data. Method: In the first step, after designing a filter, the discrete wavelet transform is applied to the input images and the approximate coefficients of scaling components are constructed. Then, the different parts of image are classified in continuous spectrum. In the next step, by using adaptive K-means algorithm for initializing and smart choice of clusters’ number, the appropriate threshold is selected. Finally, the suspicious cancerous mass is separated by implementing the image processing techniques. Results: We Received 120 mammographic images in LJPEG format, which had been scanned in Gray-Scale with 50 microns size, 3% noise and 20% INU from clinical data taken from two medical databases (mini-MIAS and DDSM). The proposed algorithm detected tumors at an acceptable level with an average accuracy of 92.32% and sensitivity of 90.24%. Also, the Kappa coefficient was approximately 0.85, which proved the suitable reliability of the system performance. Conclusion: The exact positioning of the cancerous tumors allows the radiologist to determine the stage of disease progression and suggest an appropriate treatment in accordance with the tumor growth. The low PPV and high NPV of the system is a warranty of the system and both clinical specialists and patients can trust its output. PMID:25505753

S-EMG signal compression based on domain transformation and spectral shape dynamic bit allocation

PubMed Central

2014-01-01

Background Surface electromyographic (S-EMG) signal processing has been emerging in the past few years due to its non-invasive assessment of muscle function and structure and because of the fast growing rate of digital technology which brings about new solutions and applications. Factors such as sampling rate, quantization word length, number of channels and experiment duration can lead to a potentially large volume of data. Efficient transmission and/or storage of S-EMG signals are actually a research issue. That is the aim of this work. Methods This paper presents an algorithm for the data compression of surface electromyographic (S-EMG) signals recorded during isometric contractions protocol and during dynamic experimental protocols such as the cycling activity. The proposed algorithm is based on discrete wavelet transform to proceed spectral decomposition and de-correlation, on a dynamic bit allocation procedure to code the wavelets transformed coefficients, and on an entropy coding to minimize the remaining redundancy and to pack all data. The bit allocation scheme is based on mathematical decreasing spectral shape models, which indicates a shorter digital word length to code high frequency wavelets transformed coefficients. Four bit allocation spectral shape methods were implemented and compared: decreasing exponential spectral shape, decreasing linear spectral shape, decreasing square-root spectral shape and rotated hyperbolic tangent spectral shape. Results The proposed method is demonstrated and evaluated for an isometric protocol and for a dynamic protocol using a real S-EMG signal data bank. Objective performance evaluations metrics are presented. In addition, comparisons with other encoders proposed in scientific literature are shown. Conclusions The decreasing bit allocation shape applied to the quantized wavelet coefficients combined with arithmetic coding results is an efficient procedure. The performance comparisons of the proposed S-EMG data

Analysis of the pathological severity degree of aortic stenosis (AS) and mitral stenosis (MS) using the discrete wavelet transform (DWT).

PubMed

Meziani, F; Debbal, S M; Atbi, A

2013-01-01

The heart is the principal organ that circulates blood. In normal conditions it produces four sounds for each cardiac cycle. However, most often only two sounds appear essential: S1 and S2. Two other sounds: S3 and S4, with lower amplitude than S1 or S2, appear occasionally in the cardiac cycle by the effect of disease or age. The presence of abnormal sounds in one cardiac cycle provide valuable information on various diseases. The aortic stenosis (AS), as being a valvular pathology, is characterized by a systolic murmur due to a narrowing of the aortic valve. The mitral stenosis (MS) is characterized by a diastolic murmur due to a reduction in the mitral valve. Early screening of these diseases is necessary; it's done by a simple technique known as: phonocardiography. Analysis of phonocardiograms signals using signal processing techniques can provide for clinicians useful information considered as a platform for significant decisions in their medical diagnosis. In this work two types of diseases were studied: aortic stenosis (AS) and mitral stenosis (MS). Each one presents six different cases. The application of the discrete wavelet transform (DWT) to analyse pathological severity of the (AS and MS was presented. Then, the calculation of various parameters was performed for each patient. This study examines the possibility of using the DWT in the analysis of pathological severity of AS and MS.

Application of complex discrete wavelet transform in classification of Doppler signals using complex-valued artificial neural network.

PubMed

Ceylan, Murat; Ceylan, Rahime; Ozbay, Yüksel; Kara, Sadik

2008-09-01

In biomedical signal classification, due to the huge amount of data, to compress the biomedical waveform data is vital. This paper presents two different structures formed using feature extraction algorithms to decrease size of feature set in training and test data. The proposed structures, named as wavelet transform-complex-valued artificial neural network (WT-CVANN) and complex wavelet transform-complex-valued artificial neural network (CWT-CVANN), use real and complex discrete wavelet transform for feature extraction. The aim of using wavelet transform is to compress data and to reduce training time of network without decreasing accuracy rate. In this study, the presented structures were applied to the problem of classification in carotid arterial Doppler ultrasound signals. Carotid arterial Doppler ultrasound signals were acquired from left carotid arteries of 38 patients and 40 healthy volunteers. The patient group included 22 males and 16 females with an established diagnosis of the early phase of atherosclerosis through coronary or aortofemoropopliteal (lower extremity) angiographies (mean age, 59 years; range, 48-72 years). Healthy volunteers were young non-smokers who seem to not bear any risk of atherosclerosis, including 28 males and 12 females (mean age, 23 years; range, 19-27 years). Sensitivity, specificity and average detection rate were calculated for comparison, after training and test phases of all structures finished. These parameters have demonstrated that training times of CVANN and real-valued artificial neural network (RVANN) were reduced using feature extraction algorithms without decreasing accuracy rate in accordance to our aim.

Polyphase-discrete Fourier transform spectrum analysis for the Search for Extraterrestrial Intelligence sky survey

NASA Technical Reports Server (NTRS)

Zimmerman, G. A.; Gulkis, S.

1991-01-01

The sensitivity of a matched filter-detection system to a finite-duration continuous wave (CW) tone is compared with the sensitivities of a windowed discrete Fourier transform (DFT) system and an ideal bandpass filter-bank system. These comparisons are made in the context of the NASA Search for Extraterrestrial Intelligence (SETI) microwave observing project (MOP) sky survey. A review of the theory of polyphase-DFT filter banks and its relationship to the well-known windowed-DFT process is presented. The polyphase-DFT system approximates the ideal bandpass filter bank by using as few as eight filter taps per polyphase branch. An improvement in sensitivity of approx. 3 dB over a windowed-DFT system can be obtained by using the polyphase-DFT approach. Sidelobe rejection of the polyphase-DFT system is vastly superior to the windowed-DFT system, thereby improving its performance in the presence of radio frequency interference (RFI).

Epileptic seizure classification of EEG time-series using rational discrete short-time fourier transform.

PubMed

Samiee, Kaveh; Kovács, Petér; Gabbouj, Moncef

2015-02-01

A system for epileptic seizure detection in electroencephalography (EEG) is described in this paper. One of the challenges is to distinguish rhythmic discharges from nonstationary patterns occurring during seizures. The proposed approach is based on an adaptive and localized time-frequency representation of EEG signals by means of rational functions. The corresponding rational discrete short-time Fourier transform (DSTFT) is a novel feature extraction technique for epileptic EEG data. A multilayer perceptron classifier is fed by the coefficients of the rational DSTFT in order to separate seizure epochs from seizure-free epochs. The effectiveness of the proposed method is compared with several state-of-art feature extraction algorithms used in offline epileptic seizure detection. The results of the comparative evaluations show that the proposed method outperforms competing techniques in terms of classification accuracy. In addition, it provides a compact representation of EEG time-series.

22 CFR 51.45 - Department discretion to require evidence of U.S. citizenship or non-citizen nationality.

Code of Federal Regulations, 2013 CFR

2013-04-01

... 22 Foreign Relations 1 2013-04-01 2013-04-01 false Department discretion to require evidence of U.S. citizenship or non-citizen nationality. 51.45 Section 51.45 Foreign Relations DEPARTMENT OF STATE NATIONALITY AND PASSPORTS PASSPORTS Evidence of U.S. Citizenship or Nationality § 51.45 Department discretion...

22 CFR 51.45 - Department discretion to require evidence of U.S. citizenship or non-citizen nationality.

Code of Federal Regulations, 2014 CFR

2014-04-01

... 22 Foreign Relations 1 2014-04-01 2014-04-01 false Department discretion to require evidence of U.S. citizenship or non-citizen nationality. 51.45 Section 51.45 Foreign Relations DEPARTMENT OF STATE NATIONALITY AND PASSPORTS PASSPORTS Evidence of U.S. Citizenship or Nationality § 51.45 Department discretion...

22 CFR 51.45 - Department discretion to require evidence of U.S. citizenship or non-citizen nationality.

Code of Federal Regulations, 2012 CFR

2012-04-01

... 22 Foreign Relations 1 2012-04-01 2012-04-01 false Department discretion to require evidence of U.S. citizenship or non-citizen nationality. 51.45 Section 51.45 Foreign Relations DEPARTMENT OF STATE NATIONALITY AND PASSPORTS PASSPORTS Evidence of U.S. Citizenship or Nationality § 51.45 Department discretion...

22 CFR 51.45 - Department discretion to require evidence of U.S. citizenship or non-citizen nationality.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Department discretion to require evidence of U.S. citizenship or non-citizen nationality. 51.45 Section 51.45 Foreign Relations DEPARTMENT OF STATE NATIONALITY AND PASSPORTS PASSPORTS Evidence of U.S. Citizenship or Nationality § 51.45 Department discretion...

22 CFR 51.45 - Department discretion to require evidence of U.S. citizenship or non-citizen nationality.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 22 Foreign Relations 1 2011-04-01 2011-04-01 false Department discretion to require evidence of U.S. citizenship or non-citizen nationality. 51.45 Section 51.45 Foreign Relations DEPARTMENT OF STATE NATIONALITY AND PASSPORTS PASSPORTS Evidence of U.S. Citizenship or Nationality § 51.45 Department discretion...

Hybrid Discrete Wavelet Transform and Gabor Filter Banks Processing for Features Extraction from Biomedical Images

PubMed Central

Lahmiri, Salim; Boukadoum, Mounir

2013-01-01

A new methodology for automatic feature extraction from biomedical images and subsequent classification is presented. The approach exploits the spatial orientation of high-frequency textural features of the processed image as determined by a two-step process. First, the two-dimensional discrete wavelet transform (DWT) is applied to obtain the HH high-frequency subband image. Then, a Gabor filter bank is applied to the latter at different frequencies and spatial orientations to obtain new Gabor-filtered image whose entropy and uniformity are computed. Finally, the obtained statistics are fed to a support vector machine (SVM) binary classifier. The approach was validated on mammograms, retina, and brain magnetic resonance (MR) images. The obtained classification accuracies show better performance in comparison to common approaches that use only the DWT or Gabor filter banks for feature extraction. PMID:27006906

Multiresolution analysis (discrete wavelet transform) through Daubechies family for emotion recognition in speech.

NASA Astrophysics Data System (ADS)

Campo, D.; Quintero, O. L.; Bastidas, M.

2016-04-01

We propose a study of the mathematical properties of voice as an audio signal. This work includes signals in which the channel conditions are not ideal for emotion recognition. Multiresolution analysis- discrete wavelet transform - was performed through the use of Daubechies Wavelet Family (Db1-Haar, Db6, Db8, Db10) allowing the decomposition of the initial audio signal into sets of coefficients on which a set of features was extracted and analyzed statistically in order to differentiate emotional states. ANNs proved to be a system that allows an appropriate classification of such states. This study shows that the extracted features using wavelet decomposition are enough to analyze and extract emotional content in audio signals presenting a high accuracy rate in classification of emotional states without the need to use other kinds of classical frequency-time features. Accordingly, this paper seeks to characterize mathematically the six basic emotions in humans: boredom, disgust, happiness, anxiety, anger and sadness, also included the neutrality, for a total of seven states to identify.

Single and two-shot quantitative phase imaging using Hilbert-Huang Transform based fringe pattern analysis

NASA Astrophysics Data System (ADS)

Trusiak, Maciej; Micó, Vicente; Patorski, Krzysztof; García-Monreal, Javier; Sluzewski, Lukasz; Ferreira, Carlos

2016-08-01

In this contribution we propose two Hilbert-Huang Transform based algorithms for fast and accurate single-shot and two-shot quantitative phase imaging applicable in both on-axis and off-axis configurations. In the first scheme a single fringe pattern containing information about biological phase-sample under study is adaptively pre-filtered using empirical mode decomposition based approach. Further it is phase demodulated by the Hilbert Spiral Transform aided by the Principal Component Analysis for the local fringe orientation estimation. Orientation calculation enables closed fringes efficient analysis and can be avoided using arbitrary phase-shifted two-shot Gram-Schmidt Orthonormalization scheme aided by Hilbert-Huang Transform pre-filtering. This two-shot approach is a trade-off between single-frame and temporal phase shifting demodulation. Robustness of the proposed techniques is corroborated using experimental digital holographic microscopy studies of polystyrene micro-beads and red blood cells. Both algorithms compare favorably with the temporal phase shifting scheme which is used as a reference method.

A simple procedure for construction of the orthonormal basis vectors of irreducible representations of O(5) in the OT (3) ⊗ON (2) basis

NASA Astrophysics Data System (ADS)

Pan, Feng; Ding, Xiaoxue; Launey, Kristina D.; Draayer, J. P.

2018-06-01

A simple and effective algebraic isospin projection procedure for constructing orthonormal basis vectors of irreducible representations of O (5) ⊃OT (3) ⊗ON (2) from those in the canonical O (5) ⊃ SUΛ (2) ⊗ SUI (2) basis is outlined. The expansion coefficients are components of null space vectors of the projection matrix with four nonzero elements in each row in general. Explicit formulae for evaluating OT (3)-reduced matrix elements of O (5) generators are derived.

Application of the Sumudu Transform to Discrete Dynamic Systems

ERIC Educational Resources Information Center

Asiru, Muniru Aderemi

2003-01-01

The Sumudu transform is an integral transform introduced to solve differential equations and control engineering problems. The transform possesses many interesting properties that make visualization easier and application has been demonstrated in the solution of partial differential equations, integral equations, integro-differential equations and…

A new discrete dipole kernel for quantitative susceptibility mapping.

PubMed

Milovic, Carlos; Acosta-Cabronero, Julio; Pinto, José Miguel; Mattern, Hendrik; Andia, Marcelo; Uribe, Sergio; Tejos, Cristian

2018-09-01

Most approaches for quantitative susceptibility mapping (QSM) are based on a forward model approximation that employs a continuous Fourier transform operator to solve a differential equation system. Such formulation, however, is prone to high-frequency aliasing. The aim of this study was to reduce such errors using an alternative dipole kernel formulation based on the discrete Fourier transform and discrete operators. The impact of such an approach on forward model calculation and susceptibility inversion was evaluated in contrast to the continuous formulation both with synthetic phantoms and in vivo MRI data. The discrete kernel demonstrated systematically better fits to analytic field solutions, and showed less over-oscillations and aliasing artifacts while preserving low- and medium-frequency responses relative to those obtained with the continuous kernel. In the context of QSM estimation, the use of the proposed discrete kernel resulted in error reduction and increased sharpness. This proof-of-concept study demonstrated that discretizing the dipole kernel is advantageous for QSM. The impact on small or narrow structures such as the venous vasculature might by particularly relevant to high-resolution QSM applications with ultra-high field MRI - a topic for future investigations. The proposed dipole kernel has a straightforward implementation to existing QSM routines. Copyright © 2018 Elsevier Inc. All rights reserved.

Fast quantum nD Fourier and radon transforms

NASA Astrophysics Data System (ADS)

Labunets, Valeri G.; Labunets-Rundblad, Ekaterina V.; Astola, Jaakko T.

2001-07-01

Fast Classical and quantum algorithms are introduced for a wide class of non-separable nD discrete unitary K- transforms(DKT)KNn. They require a number of 1D DKT Kn smaller than in the Cooley-Tukey radix-p FFT-type approach. The method utilizes a decomposition of the nDK- transform into a product of original nD discrete Radon Transform and of a family parallel/independ 1DK-transforms. If the nDK-transform has a separable kernel, that again in this case our approach leads to decrease of multiplicative complexity by factor of n compared to the tow/column separable Cooley-Tukey p-radix approach.

Generating chaos for discrete time-delayed systems via impulsive control.

PubMed

Guan, Zhi-Hong; Liu, Na

2010-03-01

Generating chaos for a class of discrete time-delayed systems via impulsive control is investigated in this paper. With the augmented matrix method, the time-delay impulsive systems can be transformed into a new class of linear discrete impulsive systems. Based on the largest Lyapunov exponent and the boundedness of the systems, some theoretical results about the chaotification for the discrete impulsive systems with time delay are derived and an example is given to visualize the satisfactory control performance.

A comparison of orthogonal transformations for digital speech processing.

NASA Technical Reports Server (NTRS)

Campanella, S. J.; Robinson, G. S.

1971-01-01

Discrete forms of the Fourier, Hadamard, and Karhunen-Loeve transforms are examined for their capacity to reduce the bit rate necessary to transmit speech signals. To rate their effectiveness in accomplishing this goal the quantizing error (or noise) resulting for each transformation method at various bit rates is computed and compared with that for conventional companded PCM processing. Based on this comparison, it is found that Karhunen-Loeve provides a reduction in bit rate of 13.5 kbits/s, Fourier 10 kbits/s, and Hadamard 7.5 kbits/s as compared with the bit rate required for companded PCM. These bit-rate reductions are shown to be somewhat independent of the transmission bit rate.

Hybridization, agency discretion, and implementation of the U.S. Endangered Species Act.

PubMed

Lind-Riehl, Jennifer F; Mayer, Audrey L; Wellstead, Adam M; Gailing, Oliver

2016-12-01

The U.S. Endangered Species Act (ESA) requires that the "best available scientific and commercial data" be used to protect imperiled species from extinction and preserve biodiversity. However, it does not provide specific guidance on how to apply this mandate. Scientific data can be uncertain and controversial, particularly regarding species delineation and hybridization issues. The U.S. Fish and Wildlife Service (FWS) had an evolving hybrid policy to guide protection decisions for individuals of hybrid origin. Currently, this policy is in limbo because it resulted in several controversial conservation decisions in the past. Biologists from FWS must interpret and apply the best available science to their recommendations and likely use considerable discretion in making recommendations for what species to list, how to define those species, and how to recover them. We used semistructured interviews to collect data on FWS biologists' use of discretion to make recommendations for listed species with hybridization issues. These biologists had a large amount of discretion to determine the best available science and how to interpret it but generally deferred to the scientific consensus on the taxonomic status of an organism. Respondents viewed hybridization primarily as a problem in the context of the ESA, although biologists who had experience with hybridization issues were more likely to describe it in more nuanced terms. Many interviewees expressed a desire to continue the current case-by-case approach for handling hybridization issues, but some wanted more guidance on procedures (i.e., a "flexible" hybrid policy). Field-level information can provide critical insight into which policies are working (or not working) and why. The FWS biologists' we interviewed had a high level of discretion, which greatly influenced ESA implementation, particularly in the context of hybridization. © 2016 Society for Conservation Biology.

A parallel 3-D discrete wavelet transform architecture using pipelined lifting scheme approach for video coding

NASA Astrophysics Data System (ADS)

Hegde, Ganapathi; Vaya, Pukhraj

2013-10-01

This article presents a parallel architecture for 3-D discrete wavelet transform (3-DDWT). The proposed design is based on the 1-D pipelined lifting scheme. The architecture is fully scalable beyond the present coherent Daubechies filter bank (9, 7). This 3-DDWT architecture has advantages such as no group of pictures restriction and reduced memory referencing. It offers low power consumption, low latency and high throughput. The computing technique is based on the concept that lifting scheme minimises the storage requirement. The application specific integrated circuit implementation of the proposed architecture is done by synthesising it using 65 nm Taiwan Semiconductor Manufacturing Company standard cell library. It offers a speed of 486 MHz with a power consumption of 2.56 mW. This architecture is suitable for real-time video compression even with large frame dimensions.

The Roadmaker's algorithm for the discrete pulse transform.

PubMed

Laurie, Dirk P

2011-02-01

The discrete pulse transform (DPT) is a decomposition of an observed signal into a sum of pulses, i.e., signals that are constant on a connected set and zero elsewhere. Originally developed for 1-D signal processing, the DPT has recently been generalized to more dimensions. Applications in image processing are currently being investigated. The time required to compute the DPT as originally defined via the successive application of LULU operators (members of a class of minimax filters studied by Rohwer) has been a severe drawback to its applicability. This paper introduces a fast method for obtaining such a decomposition, called the Roadmaker's algorithm because it involves filling pits and razing bumps. It acts selectively only on those features actually present in the signal, flattening them in order of increasing size by subtracing an appropriate positive or negative pulse, which is then appended to the decomposition. The implementation described here covers 1-D signal as well as two and 3-D image processing in a single framework. This is achieved by considering the signal or image as a function defined on a graph, with the geometry specified by the edges of the graph. Whenever a feature is flattened, nodes in the graph are merged, until eventually only one node remains. At that stage, a new set of edges for the same nodes as the graph, forming a tree structure, defines the obtained decomposition. The Roadmaker's algorithm is shown to be equivalent to the DPT in the sense of obtaining the same decomposition. However, its simpler operators are not in general equivalent to the LULU operators in situations where those operators are not applied successively. A by-product of the Roadmaker's algorithm is that it yields a proof of the so-called Highlight Conjecture, stated as an open problem in 2006. We pay particular attention to algorithmic details and complexity, including a demonstration that in the 1-D case, and also in the case of a complete graph, the Roadmaker

Progressive sparse representation-based classification using local discrete cosine transform evaluation for image recognition

NASA Astrophysics Data System (ADS)

Song, Xiaoning; Feng, Zhen-Hua; Hu, Guosheng; Yang, Xibei; Yang, Jingyu; Qi, Yunsong

2015-09-01

This paper proposes a progressive sparse representation-based classification algorithm using local discrete cosine transform (DCT) evaluation to perform face recognition. Specifically, the sum of the contributions of all training samples of each subject is first taken as the contribution of this subject, then the redundant subject with the smallest contribution to the test sample is iteratively eliminated. Second, the progressive method aims at representing the test sample as a linear combination of all the remaining training samples, by which the representation capability of each training sample is exploited to determine the optimal "nearest neighbors" for the test sample. Third, the transformed DCT evaluation is constructed to measure the similarity between the test sample and each local training sample using cosine distance metrics in the DCT domain. The final goal of the proposed method is to determine an optimal weighted sum of nearest neighbors that are obtained under the local correlative degree evaluation, which is approximately equal to the test sample, and we can use this weighted linear combination to perform robust classification. Experimental results conducted on the ORL database of faces (created by the Olivetti Research Laboratory in Cambridge), the FERET face database (managed by the Defense Advanced Research Projects Agency and the National Institute of Standards and Technology), AR face database (created by Aleix Martinez and Robert Benavente in the Computer Vision Center at U.A.B), and USPS handwritten digit database (gathered at the Center of Excellence in Document Analysis and Recognition at SUNY Buffalo) demonstrate the effectiveness of the proposed method.

Discrete Fourier Transform-Based Multivariate Image Analysis: Application to Modeling of Aromatase Inhibitory Activity.

PubMed

Barigye, Stephen J; Freitas, Matheus P; Ausina, Priscila; Zancan, Patricia; Sola-Penna, Mauro; Castillo-Garit, Juan A

2018-02-12

We recently generalized the formerly alignment-dependent multivariate image analysis applied to quantitative structure-activity relationships (MIA-QSAR) method through the application of the discrete Fourier transform (DFT), allowing for its application to noncongruent and structurally diverse chemical compound data sets. Here we report the first practical application of this method in the screening of molecular entities of therapeutic interest, with human aromatase inhibitory activity as the case study. We developed an ensemble classification model based on the two-dimensional (2D) DFT MIA-QSAR descriptors, with which we screened the NCI Diversity Set V (1593 compounds) and obtained 34 chemical compounds with possible aromatase inhibitory activity. These compounds were docked into the aromatase active site, and the 10 most promising compounds were selected for in vitro experimental validation. Of these compounds, 7419 (nonsteroidal) and 89 201 (steroidal) demonstrated satisfactory antiproliferative and aromatase inhibitory activities. The obtained results suggest that the 2D-DFT MIA-QSAR method may be useful in ligand-based virtual screening of new molecular entities of therapeutic utility.

A high-throughput two channel discrete wavelet transform architecture for the JPEG2000 standard

NASA Astrophysics Data System (ADS)

Badakhshannoory, Hossein; Hashemi, Mahmoud R.; Aminlou, Alireza; Fatemi, Omid

2005-07-01

The Discrete Wavelet Transform (DWT) is increasingly recognized in image and video compression standards, as indicated by its use in JPEG2000. The lifting scheme algorithm is an alternative DWT implementation that has a lower computational complexity and reduced resource requirement. In the JPEG2000 standard two lifting scheme based filter banks are introduced: the 5/3 and 9/7. In this paper a high throughput, two channel DWT architecture for both of the JPEG2000 DWT filters is presented. The proposed pipelined architecture has two separate input channels that process the incoming samples simultaneously with minimum memory requirement for each channel. The architecture had been implemented in VHDL and synthesized on a Xilinx Virtex2 XCV1000. The proposed architecture applies DWT on a 2K by 1K image at 33 fps with a 75 MHZ clock frequency. This performance is achieved with 70% less resources than two independent single channel modules. The high throughput and reduced resource requirement has made this architecture the proper choice for real time applications such as Digital Cinema.

Speckle noise reduction in ultrasound images using a discrete wavelet transform-based image fusion technique.

PubMed

Choi, Hyun Ho; Lee, Ju Hwan; Kim, Sung Min; Park, Sung Yun

2015-01-01

Here, the speckle noise in ultrasonic images is removed using an image fusion-based denoising method. To optimize the denoising performance, each discrete wavelet transform (DWT) and filtering technique was analyzed and compared. In addition, the performances were compared in order to derive the optimal input conditions. To evaluate the speckle noise removal performance, an image fusion algorithm was applied to the ultrasound images, and comparatively analyzed with the original image without the algorithm. As a result, applying DWT and filtering techniques caused information loss and noise characteristics, and did not represent the most significant noise reduction performance. Conversely, an image fusion method applying SRAD-original conditions preserved the key information in the original image, and the speckle noise was removed. Based on such characteristics, the input conditions of SRAD-original had the best denoising performance with the ultrasound images. From this study, the best denoising technique proposed based on the results was confirmed to have a high potential for clinical application.

Discrete-time model reduction in limited frequency ranges

NASA Technical Reports Server (NTRS)

Horta, Lucas G.; Juang, Jer-Nan; Longman, Richard W.

1991-01-01

A mathematical formulation for model reduction of discrete time systems such that the reduced order model represents the system in a particular frequency range is discussed. The algorithm transforms the full order system into balanced coordinates using frequency weighted discrete controllability and observability grammians. In this form a criterion is derived to guide truncation of states based on their contribution to the frequency range of interest. Minimization of the criterion is accomplished without need for numerical optimization. Balancing requires the computation of discrete frequency weighted grammians. Close form solutions for the computation of frequency weighted grammians are developed. Numerical examples are discussed to demonstrate the algorithm.

Methods for performing fast discrete curvelet transforms of data

DOEpatents

Candes, Emmanuel; Donoho, David; Demanet, Laurent

2010-11-23

Fast digital implementations of the second generation curvelet transform for use in data processing are disclosed. One such digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while another is based on the wrapping of specially selected Fourier samples. Both digital transformations return a table of digital curvelet coefficients indexed by a scale parameter, an orientation parameter, and a spatial location parameter. Both implementations are fast in the sense that they run in about O(n.sup.2 log n) flops for n by n Cartesian arrays or about O(N log N) flops for Cartesian arrays of size N=n.sup.3; in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.

Properties of wavelet discretization of Black-Scholes equation

NASA Astrophysics Data System (ADS)

Finěk, Václav

2017-07-01

Using wavelet methods, the continuous problem is transformed into a well-conditioned discrete problem. And once a non-symmetric problem is given, squaring yields a symmetric positive definite formulation. However squaring usually makes the condition number of discrete problems substantially worse. This note is concerned with a wavelet based numerical solution of the Black-Scholes equation for pricing European options. We show here that in wavelet coordinates a symmetric part of the discretized equation dominates over an unsymmetric part in the standard economic environment with low interest rates. It provides some justification for using a fractional step method with implicit treatment of the symmetric part of the weak form of the Black-Scholes operator and with explicit treatment of its unsymmetric part. Then a well-conditioned discrete problem is obtained.

Tomography Reconstruction of Ionospheric Electron Density with Empirical Orthonormal Functions Using Korea GNSS Network

NASA Astrophysics Data System (ADS)

Hong, Junseok; Kim, Yong Ha; Chung, Jong-Kyun; Ssessanga, Nicholas; Kwak, Young-Sil

2017-03-01

In South Korea, there are about 80 Global Positioning System (GPS) monitoring stations providing total electron content (TEC) every 10 min, which can be accessed through Korea Astronomy and Space Science Institute (KASI) for scientific use. We applied the computerized ionospheric tomography (CIT) algorithm to the TEC dataset from this GPS network for monitoring the regional ionosphere over South Korea. The algorithm utilizes multiplicative algebraic reconstruction technique (MART) with an initial condition of the latest International Reference Ionosphere-2016 model (IRI-2016). In order to reduce the number of unknown variables, the vertical profiles of electron density are expressed with a linear combination of empirical orthonormal functions (EOFs) that were derived from the IRI empirical profiles. Although the number of receiver sites is much smaller than that of Japan, the CIT algorithm yielded reasonable structure of the ionosphere over South Korea. We verified the CIT results with NmF2 from ionosondes in Icheon and Jeju and also with GPS TEC at the center of South Korea. In addition, the total time required for CIT calculation was only about 5 min, enabling the exploration of the vertical ionospheric structure in near real time.

An optical Fourier transform coprocessor with direct phase determination.

PubMed

Macfaden, Alexander J; Gordon, George S D; Wilkinson, Timothy D

2017-10-20

The Fourier transform is a ubiquitous mathematical operation which arises naturally in optics. We propose and demonstrate a practical method to optically evaluate a complex-to-complex discrete Fourier transform. By implementing the Fourier transform optically we can overcome the limiting O(nlogn) complexity of fast Fourier transform algorithms. Efficiently extracting the phase from the well-known optical Fourier transform is challenging. By appropriately decomposing the input and exploiting symmetries of the Fourier transform we are able to determine the phase directly from straightforward intensity measurements, creating an optical Fourier transform with O(n) apparent complexity. Performing larger optical Fourier transforms requires higher resolution spatial light modulators, but the execution time remains unchanged. This method could unlock the potential of the optical Fourier transform to permit 2D complex-to-complex discrete Fourier transforms with a performance that is currently untenable, with applications across information processing and computational physics.

Piagetian conservation of discrete quantities in bonobos (Pan paniscus), chimpanzees (Pan troglodytes), and orangutans (Pongo pygmaeus).

PubMed

Suda, Chikako; Call, Josep

2005-10-01

This study investigated whether physical discreteness helps apes to understand the concept of Piagetian conservation (i.e. the invariance of quantities). Subjects were four bonobos, three chimpanzees, and five orangutans. Apes were tested on their ability to conserve discrete/continuous quantities in an over-conservation procedure in which two unequal quantities of edible rewards underwent various transformations in front of subjects. Subjects were examined to determine whether they could track the larger quantity of reward after the transformation. Comparison between the two types of conservation revealed that tests with bonobos supported the discreteness hypothesis. Bonobos, but neither chimpanzees nor orangutans, performed significantly better with discrete quantities than with continuous ones. The results suggest that at least bonobos could benefit from the discreteness of stimuli in their acquisition of conservation skills.

Discretization and Numerical Solution of a Plane Problem in the Mechanics of Interfacial Cracks

NASA Astrophysics Data System (ADS)

Khoroshun, L. P.

2017-01-01

The Fourier transform is used to reduce the linear plane problem of the tension of a body with an interfacial crack to a system of dual equations for the transformed stresses and, then, to a system of integro-differential equations for the difference of displacements of the crack faces. After discretization, this latter system transforms into a system of algebraic equations for displacements of the crack faces. The effect of the bielastic constant and the number of discretization points on the half-length of the crack faces and the distribution of stresses at the interface is studied

Resonant tunneling through discrete quantum states in stacked atomic-layered MoS2.

PubMed

Nguyen, Linh-Nam; Lan, Yann-Wen; Chen, Jyun-Hong; Chang, Tay-Rong; Zhong, Yuan-Liang; Jeng, Horng-Tay; Li, Lain-Jong; Chen, Chii-Dong

2014-05-14

Two-dimensional crystals can be assembled into three-dimensional stacks with atomic layer precision, which have already shown plenty of fascinating physical phenomena and been used for prototype vertical-field-effect-transistors.1,2 In this work, interlayer electron tunneling in stacked high-quality crystalline MoS2 films were investigated. A trilayered MoS2 film was sandwiched between top and bottom electrodes with an adjacent bottom gate, and the discrete energy levels in each layer could be tuned by bias and gate voltages. When the discrete energy levels aligned, a resonant tunneling peak appeared in the current-voltage characteristics. The peak position shifts linearly with perpendicular magnetic field, indicating formation of Landau levels. From this linear dependence, the effective mass and Fermi velocity are determined and are confirmed by electronic structure calculations. These fundamental parameters are useful for exploitation of its unique properties.

Analysis on Behaviour of Wavelet Coefficient during Fault Occurrence in Transformer

NASA Astrophysics Data System (ADS)

Sreewirote, Bancha; Ngaopitakkul, Atthapol

2018-03-01

The protection system for transformer has play significant role in avoiding severe damage to equipment when disturbance occur and ensure overall system reliability. One of the methodology that widely used in protection scheme and algorithm is discrete wavelet transform. However, characteristic of coefficient under fault condition must be analyzed to ensure its effectiveness. So, this paper proposed study and analysis on wavelet coefficient characteristic when fault occur in transformer in both high- and low-frequency component from discrete wavelet transform. The effect of internal and external fault on wavelet coefficient of both fault and normal phase has been taken into consideration. The fault signal has been simulate using transmission connected to transformer experimental setup on laboratory level that modelled after actual system. The result in term of wavelet coefficient shown a clearly differentiate between wavelet characteristic in both high and low frequency component that can be used to further design and improve detection and classification algorithm that based on discrete wavelet transform methodology in the future.

Recent Advances in Compressed Sensing: Discrete Uncertainty Principles and Fast Hyperspectral Imaging

DTIC Science & Technology

2015-03-26

Fourier Analysis and Applications, vol. 14, pp. 838–858, 2008. 11. D. J. Cooke, “A discrete X - ray transform for chromotomographic hyperspectral imaging ... medical imaging , e.g., magnetic resonance imaging (MRI). Since the early 1980s, MRI has granted doctors the ability to distinguish between healthy tissue...i.e., at most K entries of x are nonzero. In many settings, this is a valid signal model; for example, JPEG2000 exploits the fact that natural images

Dynamical error bounds for continuum discretisation via Gauss quadrature rules—A Lieb-Robinson bound approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Woods, M. P.; Centre for Quantum Technologies, National University of Singapore; QuTech, Delft University of Technology, Lorentzweg 1, 2611 CJ Delft

2016-02-15

Instances of discrete quantum systems coupled to a continuum of oscillators are ubiquitous in physics. Often the continua are approximated by a discrete set of modes. We derive error bounds on expectation values of system observables that have been time evolved under such discretised Hamiltonians. These bounds take on the form of a function of time and the number of discrete modes, where the discrete modes are chosen according to Gauss quadrature rules. The derivation makes use of tools from the field of Lieb-Robinson bounds and the theory of orthonormal polynomials.

Chrestenson transform FPGA embedded factorizations.

PubMed

Corinthios, Michael J

2016-01-01

Chrestenson generalized Walsh transform factorizations for parallel processing imbedded implementations on field programmable gate arrays are presented. This general base transform, sometimes referred to as the Discrete Chrestenson transform, has received special attention in recent years. In fact, the Discrete Fourier transform and Walsh-Hadamard transform are but special cases of the Chrestenson generalized Walsh transform. Rotations of a base-p hypercube, where p is an arbitrary integer, are shown to produce dynamic contention-free memory allocation, in processor architecture. The approach is illustrated by factorizations involving the processing of matrices of the transform which are function of four variables. Parallel operations are implemented matrix multiplications. Each matrix, of dimension N × N, where N = p (n) , n integer, has a structure that depends on a variable parameter k that denotes the iteration number in the factorization process. The level of parallelism, in the form of M = p (m) processors can be chosen arbitrarily by varying m between zero to its maximum value of n - 1. The result is an equation describing the generalised parallelism factorization as a function of the four variables n, p, k and m. Applications of the approach are shown in relation to configuring field programmable gate arrays for digital signal processing applications.

Discrete cosine transform and hash functions toward implementing a (robust-fragile) watermarking scheme

NASA Astrophysics Data System (ADS)

Al-Mansoori, Saeed; Kunhu, Alavi

2013-10-01

This paper proposes a blind multi-watermarking scheme based on designing two back-to-back encoders. The first encoder is implemented to embed a robust watermark into remote sensing imagery by applying a Discrete Cosine Transform (DCT) approach. Such watermark is used in many applications to protect the copyright of the image. However, the second encoder embeds a fragile watermark using `SHA-1' hash function. The purpose behind embedding a fragile watermark is to prove the authenticity of the image (i.e. tamper-proof). Thus, the proposed technique was developed as a result of new challenges with piracy of remote sensing imagery ownership. This led researchers to look for different means to secure the ownership of satellite imagery and prevent the illegal use of these resources. Therefore, Emirates Institution for Advanced Science and Technology (EIAST) proposed utilizing existing data security concept by embedding a digital signature, "watermark", into DubaiSat-1 satellite imagery. In this study, DubaiSat-1 images with 2.5 meter resolution are used as a cover and a colored EIAST logo is used as a watermark. In order to evaluate the robustness of the proposed technique, a couple of attacks are applied such as JPEG compression, rotation and synchronization attacks. Furthermore, tampering attacks are applied to prove image authenticity.

Luminance sticker based facial expression recognition using discrete wavelet transform for physically disabled persons.

PubMed

Nagarajan, R; Hariharan, M; Satiyan, M

2012-08-01

Developing tools to assist physically disabled and immobilized people through facial expression is a challenging area of research and has attracted many researchers recently. In this paper, luminance stickers based facial expression recognition is proposed. Recognition of facial expression is carried out by employing Discrete Wavelet Transform (DWT) as a feature extraction method. Different wavelet families with their different orders (db1 to db20, Coif1 to Coif 5 and Sym2 to Sym8) are utilized to investigate their performance in recognizing facial expression and to evaluate their computational time. Standard deviation is computed for the coefficients of first level of wavelet decomposition for every order of wavelet family. This standard deviation is used to form a set of feature vectors for classification. In this study, conventional validation and cross validation are performed to evaluate the efficiency of the suggested feature vectors. Three different classifiers namely Artificial Neural Network (ANN), k-Nearest Neighborhood (kNN) and Linear Discriminant Analysis (LDA) are used to classify a set of eight facial expressions. The experimental results demonstrate that the proposed method gives very promising classification accuracies.

Wavelet transforms as solutions of partial differential equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zweig, G.

This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Wavelet transforms are useful in representing transients whose time and frequency structure reflect the dynamics of an underlying physical system. Speech sound, pressure in turbulent fluid flow, or engine sound in automobiles are excellent candidates for wavelet analysis. This project focused on (1) methods for choosing the parent wavelet for a continuous wavelet transform in pattern recognition applications and (2) the more efficient computation of continuous wavelet transforms by understanding the relationship between discrete wavelet transforms and discretized continuousmore » wavelet transforms. The most interesting result of this research is the finding that the generalized wave equation, on which the continuous wavelet transform is based, can be used to understand phenomena that relate to the process of hearing.« less

Infrared and visible image fusion using discrete cosine transform and swarm intelligence for surveillance applications

NASA Astrophysics Data System (ADS)

Paramanandham, Nirmala; Rajendiran, Kishore

2018-01-01

A novel image fusion technique is presented for integrating infrared and visible images. Integration of images from the same or various sensing modalities can deliver the required information that cannot be delivered by viewing the sensor outputs individually and consecutively. In this paper, a swarm intelligence based image fusion technique using discrete cosine transform (DCT) domain is proposed for surveillance application which integrates the infrared image with the visible image for generating a single informative fused image. Particle swarm optimization (PSO) is used in the fusion process for obtaining the optimized weighting factor. These optimized weighting factors are used for fusing the DCT coefficients of visible and infrared images. Inverse DCT is applied for obtaining the initial fused image. An enhanced fused image is obtained through adaptive histogram equalization for a better visual understanding and target detection. The proposed framework is evaluated using quantitative metrics such as standard deviation, spatial frequency, entropy and mean gradient. The experimental results demonstrate the outperformance of the proposed algorithm over many other state- of- the- art techniques reported in literature.

Adaptive NN controller design for a class of nonlinear MIMO discrete-time systems.

PubMed

Liu, Yan-Jun; Tang, Li; Tong, Shaocheng; Chen, C L Philip

2015-05-01

An adaptive neural network tracking control is studied for a class of multiple-input multiple-output (MIMO) nonlinear systems. The studied systems are in discrete-time form and the discretized dead-zone inputs are considered. In addition, the studied MIMO systems are composed of N subsystems, and each subsystem contains unknown functions and external disturbance. Due to the complicated framework of the discrete-time systems, the existence of the dead zone and the noncausal problem in discrete-time, it brings about difficulties for controlling such a class of systems. To overcome the noncausal problem, by defining the coordinate transformations, the studied systems are transformed into a special form, which is suitable for the backstepping design. The radial basis functions NNs are utilized to approximate the unknown functions of the systems. The adaptation laws and the controllers are designed based on the transformed systems. By using the Lyapunov method, it is proved that the closed-loop system is stable in the sense that the semiglobally uniformly ultimately bounded of all the signals and the tracking errors converge to a bounded compact set. The simulation examples and the comparisons with previous approaches are provided to illustrate the effectiveness of the proposed control algorithm.

MRS3D: 3D Spherical Wavelet Transform on the Sphere

NASA Astrophysics Data System (ADS)

Lanusse, F.; Rassat, A.; Starck, J.-L.

2011-12-01

Future cosmological surveys will provide 3D large scale structure maps with large sky coverage, for which a 3D Spherical Fourier-Bessel (SFB) analysis is natural. Wavelets are particularly well-suited to the analysis and denoising of cosmological data, but a spherical 3D isotropic wavelet transform does not currently exist to analyse spherical 3D data. We present a new fast Discrete Spherical Fourier-Bessel Transform (DSFBT) based on both a discrete Bessel Transform and the HEALPIX angular pixelisation scheme. We tested the 3D wavelet transform and as a toy-application, applied a denoising algorithm in wavelet space to the Virgo large box cosmological simulations and found we can successfully remove noise without much loss to the large scale structure. The new spherical 3D isotropic wavelet transform, called MRS3D, is ideally suited to analysing and denoising future 3D spherical cosmological surveys; it uses a novel discrete spherical Fourier-Bessel Transform. MRS3D is based on two packages, IDL and Healpix and can be used only if these two packages have been installed.

Induction motors airgap-eccentricity detection through the discrete wavelet transform of the apparent power signal under non-stationary operating conditions.

PubMed

Yahia, K; Cardoso, A J M; Ghoggal, A; Zouzou, S E

2014-03-01

Fast Fourier transform (FFT) analysis has been successfully used for fault diagnosis in induction machines. However, this method does not always provide good results for the cases of load torque, speed and voltages variation, leading to a variation of the motor-slip and the consequent FFT problems that appear due to the non-stationary nature of the involved signals. In this paper, the discrete wavelet transform (DWT) of the apparent-power signal for the airgap-eccentricity fault detection in three-phase induction motors is presented in order to overcome the above FFT problems. The proposed method is based on the decomposition of the apparent-power signal from which wavelet approximation and detail coefficients are extracted. The energy evaluation of a known bandwidth permits to define a fault severity factor (FSF). Simulation as well as experimental results are provided to illustrate the effectiveness and accuracy of the proposed method presented even for the case of load torque variations. Copyright © 2013 ISA. Published by Elsevier Ltd. All rights reserved.

Generation Algorithm of Discrete Line in Multi-Dimensional Grids

NASA Astrophysics Data System (ADS)

Du, L.; Ben, J.; Li, Y.; Wang, R.

2017-09-01

Discrete Global Grids System (DGGS) is a kind of digital multi-resolution earth reference model, in terms of structure, it is conducive to the geographical spatial big data integration and mining. Vector is one of the important types of spatial data, only by discretization, can it be applied in grids system to make process and analysis. Based on the some constraint conditions, this paper put forward a strict definition of discrete lines, building a mathematic model of the discrete lines by base vectors combination method. Transforming mesh discrete lines issue in n-dimensional grids into the issue of optimal deviated path in n-minus-one dimension using hyperplane, which, therefore realizing dimension reduction process in the expression of mesh discrete lines. On this basis, we designed a simple and efficient algorithm for dimension reduction and generation of the discrete lines. The experimental results show that our algorithm not only can be applied in the two-dimensional rectangular grid, also can be applied in the two-dimensional hexagonal grid and the three-dimensional cubic grid. Meanwhile, when our algorithm is applied in two-dimensional rectangular grid, it can get a discrete line which is more similar to the line in the Euclidean space.

Using a new discretization approach to design a delayed LQG controller

NASA Astrophysics Data System (ADS)

Haraguchi, M.; Hu, H. Y.

2008-07-01

In general, discrete-time controls have become more and more preferable in engineering because of their easy implementation and simple computations. However, the available discretization approaches for the systems having time delays increase the system dimensions and have a high computational cost. This paper presents an effective discretization approach for the continuous-time systems with an input delay. The approach enables one to transform the input-delay system into a delay-free system, but retain the system dimensions unchanged in the state transformation. To demonstrate an application of the approach, this paper presents the design of an LQ regulator for continuous-time systems with an input delay and gives a state observer with a Kalman filter for estimating the full-state vector from some measurements of the system as well. The case studies in the paper well support the efficacy and efficiency of the proposed approach applied to the vibration control of a three-story structure model with the actuator delay taken into account.

OBS Data Denoising Based on Compressed Sensing Using Fast Discrete Curvelet Transform

NASA Astrophysics Data System (ADS)

Nan, F.; Xu, Y.

2017-12-01

OBS (Ocean Bottom Seismometer) data denoising is an important step of OBS data processing and inversion. It is necessary to get clearer seismic phases for further velocity structure analysis. Traditional methods for OBS data denoising include band-pass filter, Wiener filter and deconvolution etc. (Liu, 2015). Most of these filtering methods are based on Fourier Transform (FT). Recently, the multi-scale transform methods such as wavelet transform (WT) and Curvelet transform (CvT) are widely used for data denoising in various applications. The FT, WT and CvT could represent signal sparsely and separate noise in transform domain. They could be used in different cases. Compared with Curvelet transform, the FT has Gibbs phenomenon and it cannot handle points discontinuities well. WT is well localized and multi scale, but it has poor orientation selectivity and could not handle curves discontinuities well. CvT is a multiscale directional transform that could represent curves with only a small number of coefficients. It provide an optimal sparse representation of objects with singularities along smooth curves, which is suitable for seismic data processing. As we know, different seismic phases in OBS data are showed as discontinuous curves in time domain. Hence, we promote to analysis the OBS data via CvT and separate the noise in CvT domain. In this paper, our sparsity-promoting inversion approach is restrained by L1 condition and we solve this L1 problem by using modified iteration thresholding. Results show that the proposed method could suppress the noise well and give sparse results in Curvelet domain. Figure 1 compares the Curvelet denoising method with Wavelet method on the same iterations and threshold through synthetic example. a)Original data. b) Add-noise data. c) Denoised data using CvT. d) Denoised data using WT. The CvT can well eliminate the noise and has better result than WT. Further we applied the CvT denoise method for the OBS data processing. Figure 2a

EnvironmentalWaveletTool: Continuous and discrete wavelet analysis and filtering for environmental time series

NASA Astrophysics Data System (ADS)

Galiana-Merino, J. J.; Pla, C.; Fernandez-Cortes, A.; Cuezva, S.; Ortiz, J.; Benavente, D.

2014-10-01

A MATLAB-based computer code has been developed for the simultaneous wavelet analysis and filtering of several environmental time series, particularly focused on the analyses of cave monitoring data. The continuous wavelet transform, the discrete wavelet transform and the discrete wavelet packet transform have been implemented to provide a fast and precise time-period examination of the time series at different period bands. Moreover, statistic methods to examine the relation between two signals have been included. Finally, the entropy of curves and splines based methods have also been developed for segmenting and modeling the analyzed time series. All these methods together provide a user-friendly and fast program for the environmental signal analysis, with useful, practical and understandable results.

An extension of the OpenModelica compiler for using Modelica models in a discrete event simulation

DOE PAGES

Nutaro, James

2014-11-03

In this article, a new back-end and run-time system is described for the OpenModelica compiler. This new back-end transforms a Modelica model into a module for the adevs discrete event simulation package, thereby extending adevs to encompass complex, hybrid dynamical systems. The new run-time system that has been built within the adevs simulation package supports models with state-events and time-events and that comprise differential-algebraic systems with high index. Finally, although the procedure for effecting this transformation is based on adevs and the Discrete Event System Specification, it can be adapted to any discrete event simulation package.

Nonautonomous discrete bright soliton solutions and interaction management for the Ablowitz-Ladik equation.

PubMed

Yu, Fajun

2015-03-01

We present the nonautonomous discrete bright soliton solutions and their interactions in the discrete Ablowitz-Ladik (DAL) equation with variable coefficients, which possesses complicated wave propagation in time and differs from the usual bright soliton waves. The differential-difference similarity transformation allows us to relate the discrete bright soliton solutions of the inhomogeneous DAL equation to the solutions of the homogeneous DAL equation. Propagation and interaction behaviors of the nonautonomous discrete solitons are analyzed through the one- and two-soliton solutions. We study the discrete snaking behaviors, parabolic behaviors, and interaction behaviors of the discrete solitons. In addition, the interaction management with free functions and dynamic behaviors of these solutions is investigated analytically, which have certain applications in electrical and optical systems.

An efficient and secure partial image encryption for wireless multimedia sensor networks using discrete wavelet transform, chaotic maps and substitution box

NASA Astrophysics Data System (ADS)

Khan, Muazzam A.; Ahmad, Jawad; Javaid, Qaisar; Saqib, Nazar A.

2017-03-01

Wireless Sensor Networks (WSN) is widely deployed in monitoring of some physical activity and/or environmental conditions. Data gathered from WSN is transmitted via network to a central location for further processing. Numerous applications of WSN can be found in smart homes, intelligent buildings, health care, energy efficient smart grids and industrial control systems. In recent years, computer scientists has focused towards findings more applications of WSN in multimedia technologies, i.e. audio, video and digital images. Due to bulky nature of multimedia data, WSN process a large volume of multimedia data which significantly increases computational complexity and hence reduces battery time. With respect to battery life constraints, image compression in addition with secure transmission over a wide ranged sensor network is an emerging and challenging task in Wireless Multimedia Sensor Networks. Due to the open nature of the Internet, transmission of data must be secure through a process known as encryption. As a result, there is an intensive demand for such schemes that is energy efficient as well as highly secure since decades. In this paper, discrete wavelet-based partial image encryption scheme using hashing algorithm, chaotic maps and Hussain's S-Box is reported. The plaintext image is compressed via discrete wavelet transform and then the image is shuffled column-wise and row wise-wise via Piece-wise Linear Chaotic Map (PWLCM) and Nonlinear Chaotic Algorithm, respectively. To get higher security, initial conditions for PWLCM are made dependent on hash function. The permuted image is bitwise XORed with random matrix generated from Intertwining Logistic map. To enhance the security further, final ciphertext is obtained after substituting all elements with Hussain's substitution box. Experimental and statistical results confirm the strength of the anticipated scheme.

Higuchi’s Method applied to detection of changes in timbre of digital sound synthesis of string instruments with the functional transformation method

NASA Astrophysics Data System (ADS)

Kanjanapen, Manorth; Kunsombat, Cherdsak; Chiangga, Surasak

2017-09-01

The functional transformation method (FTM) is a powerful tool for detailed investigation of digital sound synthesis by the physical modeling method, the resulting sound or measured vibrational characteristics at discretized points on real instruments directly solves the underlying physical effect of partial differential equation (PDE). In this paper, we present the Higuchi’s method to examine the difference between the timbre of tone and estimate fractal dimension of musical signals which contains information about their geometrical structure that synthesizes by FTM. With the Higuchi’s method we obtain the whole process is not complicated, fast processing, with the ease of analysis without expertise in the physics or virtuoso musicians and the easiest way for the common people can judge that sounds similarly presented.

Family of columns isospectral to gravity-loaded columns with tip force: A discrete approach

NASA Astrophysics Data System (ADS)

Ramachandran, Nirmal; Ganguli, Ranjan

2018-06-01

A discrete model is introduced to analyze transverse vibration of straight, clamped-free (CF) columns of variable cross-sectional geometry under the influence of gravity and a constant axial force at the tip. The discrete model is used to determine critical combinations of loading parameters - a gravity parameter and a tip force parameter - that cause onset of dynamic instability in the CF column. A methodology, based on matrix-factorization, is described to transform the discrete model into a family of models corresponding to weightless and unloaded clamped-free (WUCF) columns, each with a transverse vibration spectrum isospectral to the original model. Characteristics of models in this isospectral family are dependent on three transformation parameters. A procedure is discussed to convert the isospectral discrete model description into geometric description of realistic columns i.e. from the discrete model, we construct isospectral WUCF columns with rectangular cross-sections varying in width and depth. As part of numerical studies to demonstrate efficacy of techniques presented, frequency parameters of a uniform column and three types of tapered CF columns under different combinations of loading parameters are obtained from the discrete model. Critical combinations of these parameters for a typical tapered column are derived. These results match with published results. Example CF columns, under arbitrarily-chosen combinations of loading parameters are considered and for each combination, isospectral WUCF columns are constructed. Role of transformation parameters in determining characteristics of isospectral columns is discussed and optimum values are deduced. Natural frequencies of these WUCF columns computed using Finite Element Method (FEM) match well with those of the given gravity-loaded CF column with tip force, hence confirming isospectrality.

SPECIAL ISSUE DEVOTED TO THE 80TH BIRTHDAY OF S.A. AKHMANOV: Discrete conical emission rings observed upon filamentation of a femtosecond laser pulse in quartz

NASA Astrophysics Data System (ADS)

Dormidonov, A. E.; Kandidov, V. P.; Kompanets, V. O.; Chekalin, Sergei V.

2009-07-01

Supercontinuum emission observed upon filamentation of transform-limited collimated femtosecond laser pulses in a transparent condensed medium (fused KU-1 quartz) is studied experimentally and numerically. The splitting of diverging conical supercontinuum emission into discrete rings was observed with increasing the pulse energy.

A high-performance seizure detection algorithm based on Discrete Wavelet Transform (DWT) and EEG

PubMed Central

Chen, Duo; Wan, Suiren; Xiang, Jing; Bao, Forrest Sheng

2017-01-01

In the past decade, Discrete Wavelet Transform (DWT), a powerful time-frequency tool, has been widely used in computer-aided signal analysis of epileptic electroencephalography (EEG), such as the detection of seizures. One of the important hurdles in the applications of DWT is the settings of DWT, which are chosen empirically or arbitrarily in previous works. The objective of this study aimed to develop a framework for automatically searching the optimal DWT settings to improve accuracy and to reduce computational cost of seizure detection. To address this, we developed a method to decompose EEG data into 7 commonly used wavelet families, to the maximum theoretical level of each mother wavelet. Wavelets and decomposition levels providing the highest accuracy in each wavelet family were then searched in an exhaustive selection of frequency bands, which showed optimal accuracy and low computational cost. The selection of frequency bands and features removed approximately 40% of redundancies. The developed algorithm achieved promising performance on two well-tested EEG datasets (accuracy >90% for both datasets). The experimental results of the developed method have demonstrated that the settings of DWT affect its performance on seizure detection substantially. Compared with existing seizure detection methods based on wavelet, the new approach is more accurate and transferable among datasets. PMID:28278203

The incorrect usage of singular spectral analysis and discrete wavelet transform in hybrid models to predict hydrological time series

NASA Astrophysics Data System (ADS)

Du, Kongchang; Zhao, Ying; Lei, Jiaqiang

2017-09-01

In hydrological time series prediction, singular spectrum analysis (SSA) and discrete wavelet transform (DWT) are widely used as preprocessing techniques for artificial neural network (ANN) and support vector machine (SVM) predictors. These hybrid or ensemble models seem to largely reduce the prediction error. In current literature researchers apply these techniques to the whole observed time series and then obtain a set of reconstructed or decomposed time series as inputs to ANN or SVM. However, through two comparative experiments and mathematical deduction we found the usage of SSA and DWT in building hybrid models is incorrect. Since SSA and DWT adopt 'future' values to perform the calculation, the series generated by SSA reconstruction or DWT decomposition contain information of 'future' values. These hybrid models caused incorrect 'high' prediction performance and may cause large errors in practice.

Convergence of discrete Aubry–Mather model in the continuous limit

NASA Astrophysics Data System (ADS)

Su, Xifeng; Thieullen, Philippe

2018-05-01

We develop two approximation schemes for solving the cell equation and the discounted cell equation using Aubry–Mather–Fathi theory. The Hamiltonian is supposed to be Tonelli, time-independent and periodic in space. By Legendre transform it is equivalent to find a fixed point of some nonlinear operator, called Lax-Oleinik operator, which may be discounted or not. By discretizing in time, we are led to solve an additive eigenvalue problem involving a discrete Lax–Oleinik operator. We show how to approximate the effective Hamiltonian and some weak KAM solutions by letting the time step in the discrete model tend to zero. We also obtain a selected discrete weak KAM solution as in Davini et al (2016 Invent. Math. 206 29–55), and show that it converges to a particular solution of the cell equation. In order to unify the two settings, continuous and discrete, we develop a more general formalism of the short-range interactions.

Accurate artificial boundary conditions for the semi-discretized linear Schrödinger and heat equations on rectangular domains

NASA Astrophysics Data System (ADS)

Ji, Songsong; Yang, Yibo; Pang, Gang; Antoine, Xavier

2018-01-01

The aim of this paper is to design some accurate artificial boundary conditions for the semi-discretized linear Schrödinger and heat equations in rectangular domains. The Laplace transform in time and discrete Fourier transform in space are applied to get Green's functions of the semi-discretized equations in unbounded domains with single-source. An algorithm is given to compute these Green's functions accurately through some recurrence relations. Furthermore, the finite-difference method is used to discretize the reduced problem with accurate boundary conditions. Numerical simulations are presented to illustrate the accuracy of our method in the case of the linear Schrödinger and heat equations. It is shown that the reflection at the corners is correctly eliminated.

Stable discrete representation of relativistically drifting plasmas

DOE PAGES

Kirchen, M.; Lehe, R.; Godfrey, B. B.; ...

2016-10-10

Representing the electrodynamics of relativistically drifting particle ensembles in discrete, co-propagating Galilean coordinates enables the derivation of a Particle-In-Cell algorithm that is intrinsically free of the numerical Cherenkov instability for plasmas flowing at a uniform velocity. Application of the method is shown by modeling plasma accelerators in a Lorentz-transformed optimal frame of reference.

Stable discrete representation of relativistically drifting plasmas

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kirchen, M.; Lehe, R.; Godfrey, B. B.

Representing the electrodynamics of relativistically drifting particle ensembles in discrete, co-propagating Galilean coordinates enables the derivation of a Particle-In-Cell algorithm that is intrinsically free of the numerical Cherenkov instability for plasmas flowing at a uniform velocity. Application of the method is shown by modeling plasma accelerators in a Lorentz-transformed optimal frame of reference.

Exact Solution of Gas Dynamics Equations Through Reduced Differential Transform and Sumudu Transform Linked with Pades Approximants

NASA Astrophysics Data System (ADS)

Rao, T. R. Ramesh

2018-04-01

In this paper, we study the analytical method based on reduced differential transform method coupled with sumudu transform through Pades approximants. The proposed method may be considered as alternative approach for finding exact solution of Gas dynamics equation in an effective manner. This method does not require any discretization, linearization and perturbation.

Features of control systems analysis with discrete control devices using mathematical packages

NASA Astrophysics Data System (ADS)

Yakovleva, E. M.; Faerman, V. A.

2017-02-01

The article contains presentation of basic provisions of the theory of automatic pulse control systems as well as methods of analysis of such systems using the mathematical software widespread in the academic environment. The pulse systems under research are considered as analogues systems interacting among themselves, including sensors, amplifiers, controlled objects, and discrete parts. To describe such systems, one uses a mathematical apparatus of difference equations as well as discrete transfer functions. To obtain a transfer function of the open-loop system, being important from the point of view of the analysis of control systems, one uses mathematical packages Mathcad and Matlab. Despite identity of the obtained result, the way of its achievement from the point of view of user’s action is various for the specified means. In particular, Matlab uses a structural model of the control system while Mathcad allows only execution of a chain of operator transforms. It is worth noting that distinctions taking place allow considering transformation of signals during interaction of the linear and continuous parts of the control system from different sides. The latter can be used in an educational process for the best assimilation of the course of the control system theory by students.

Implementation of the 2-D Wavelet Transform into FPGA for Image

NASA Astrophysics Data System (ADS)

León, M.; Barba, L.; Vargas, L.; Torres, C. O.

2011-01-01

This paper presents a hardware system implementation of the of discrete wavelet transform algoritm in two dimensions for FPGA, using the Daubechies filter family of order 2 (db2). The decomposition algorithm of this transform is designed and simulated with the Hardware Description Language VHDL and is implemented in a programmable logic device (FPGA) XC3S1200E reference, Spartan IIIE family, by Xilinx, take advantage the parallels properties of these gives us and speeds processing that can reach them. The architecture is evaluated using images input of different sizes. This implementation is done with the aim of developing a future images encryption hardware system using wavelet transform for security information.

Image restoration for three-dimensional fluorescence microscopy using an orthonormal basis for efficient representation of depth-variant point-spread functions

PubMed Central

Patwary, Nurmohammed; Preza, Chrysanthe

2015-01-01

A depth-variant (DV) image restoration algorithm for wide field fluorescence microscopy, using an orthonormal basis decomposition of DV point-spread functions (PSFs), is investigated in this study. The efficient PSF representation is based on a previously developed principal component analysis (PCA), which is computationally intensive. We present an approach developed to reduce the number of DV PSFs required for the PCA computation, thereby making the PCA-based approach computationally tractable for thick samples. Restoration results from both synthetic and experimental images show consistency and that the proposed algorithm addresses efficiently depth-induced aberration using a small number of principal components. Comparison of the PCA-based algorithm with a previously-developed strata-based DV restoration algorithm demonstrates that the proposed method improves performance by 50% in terms of accuracy and simultaneously reduces the processing time by 64% using comparable computational resources. PMID:26504634

The modified semi-discrete two-dimensional Toda lattice with self-consistent sources

NASA Astrophysics Data System (ADS)

Gegenhasi

2017-07-01

In this paper, we derive the Grammian determinant solutions to the modified semi-discrete two-dimensional Toda lattice equation, and then construct the semi-discrete two-dimensional Toda lattice equation with self-consistent sources via source generation procedure. The algebraic structure of the resulting coupled modified differential-difference equation is clarified by presenting its Grammian determinant solutions and Casorati determinant solutions. As an application of the Grammian determinant and Casorati determinant solution, the explicit one-soliton and two-soliton solution of the modified semi-discrete two-dimensional Toda lattice equation with self-consistent sources are given. We also construct another form of the modified semi-discrete two-dimensional Toda lattice equation with self-consistent sources which is the Bäcklund transformation for the semi-discrete two-dimensional Toda lattice equation with self-consistent sources.

Auto-Bäcklund transformations for a matrix partial differential equation

NASA Astrophysics Data System (ADS)

Gordoa, P. R.; Pickering, A.

2018-07-01

We derive auto-Bäcklund transformations, analogous to those of the matrix second Painlevé equation, for a matrix partial differential equation. We also then use these auto-Bäcklund transformations to derive matrix equations involving shifts in a discrete variable, a process analogous to the use of the auto-Bäcklund transformations of the matrix second Painlevé equation to derive a discrete matrix first Painlevé equation. The equations thus derived then include amongst other examples a semidiscrete matrix equation which can be considered to be an extension of this discrete matrix first Painlevé equation. The application of this technique to the auto-Bäcklund transformations of the scalar case of our partial differential equation has not been considered before, and so the results obtained here in this scalar case are also new. Other equations obtained here using this technique include a scalar semidiscrete equation which arises in the case of the second Painlevé equation, and which does not seem to have been thus derived previously.

A frequency-based window width optimized two-dimensional S-Transform profilometry

NASA Astrophysics Data System (ADS)

Zhong, Min; Chen, Feng; Xiao, Chao

2017-11-01

A new scheme is proposed to as a frequency-based window width optimized two-dimensional S-Transform profilometry, in which parameters pu and pv are introduced to control the width of a two-dimensional Gaussian window. Unlike the standard two-dimensional S-transform using the Gaussian window with window width proportional to the reciprocal local frequency of the tested signal, the size of window width for the optimized two-dimensional S-Transform varies with the pu th (pv th) power of the reciprocal local frequency fx (fy) in x (y) direction. The paper gives a detailed theoretical analysis of optimized two-dimensional S-Transform in fringe analysis as well as the characteristics of the modified Gauss window. Simulations are applied to evaluate the proposed scheme, the results show that the new scheme has better noise reduction ability and can extract phase distribution more precise in comparison with the standard two-dimensional S-transform even though the surface of the measured object varies sharply. Finally, the proposed scheme is demonstrated on three-dimensional surface reconstruction for a complex plastic cat mask to show its effectiveness.

Discrete shaped strain sensors for intelligent structures

NASA Technical Reports Server (NTRS)

Andersson, Mark S.; Crawley, Edward F.

1992-01-01

Design of discrete, highly distributed sensor systems for intelligent structures has been studied. Data obtained indicate that discrete strain-averaging sensors satisfy the functional requirements for distributed sensing of intelligent structures. Bartlett and Gauss-Hanning sensors, in particular, provide good wavenumber characteristics while meeting the functional requirements. They are characterized by good rolloff rates and positive Fourier transforms for all wavenumbers. For the numerical integration schemes, Simpson's rule is considered to be very simple to implement and consistently provides accurate results for five sensors or more. It is shown that a sensor system that satisfies the functional requirements can be applied to a structure that supports mode shapes with purely sinusoidal curvature.

Phase retrieval with the transport-of-intensity equation in an arbitrarily-shaped aperture by iterative discrete cosine transforms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Huang, Lei; Zuo, Chao; Idir, Mourad

A novel transport-of-intensity equation (TIE) based phase retrieval method is proposed with putting an arbitrarily-shaped aperture into the optical wavefield. In this arbitrarily-shaped aperture, the TIE can be solved under non-uniform illuminations and even non-homogeneous boundary conditions by iterative discrete cosine transforms with a phase compensation mechanism. Simulation with arbitrary phase, arbitrary aperture shape, and non-uniform intensity distribution verifies the effective compensation and high accuracy of the proposed method. Experiment is also carried out to check the feasibility of the proposed method in real measurement. Comparing to the existing methods, the proposed method is applicable for any types of phasemore » distribution under non-uniform illumination and non-homogeneous boundary conditions within an arbitrarily-shaped aperture, which enables the technique of TIE with hard aperture become a more flexible phase retrieval tool in practical measurements.« less

Phase retrieval with the transport-of-intensity equation in an arbitrarily-shaped aperture by iterative discrete cosine transforms

DOE PAGES

Huang, Lei; Zuo, Chao; Idir, Mourad; ...

2015-04-21

A novel transport-of-intensity equation (TIE) based phase retrieval method is proposed with putting an arbitrarily-shaped aperture into the optical wavefield. In this arbitrarily-shaped aperture, the TIE can be solved under non-uniform illuminations and even non-homogeneous boundary conditions by iterative discrete cosine transforms with a phase compensation mechanism. Simulation with arbitrary phase, arbitrary aperture shape, and non-uniform intensity distribution verifies the effective compensation and high accuracy of the proposed method. Experiment is also carried out to check the feasibility of the proposed method in real measurement. Comparing to the existing methods, the proposed method is applicable for any types of phasemore » distribution under non-uniform illumination and non-homogeneous boundary conditions within an arbitrarily-shaped aperture, which enables the technique of TIE with hard aperture become a more flexible phase retrieval tool in practical measurements.« less

Image secure transmission for optical orthogonal frequency-division multiplexing visible light communication systems using chaotic discrete cosine transform

NASA Astrophysics Data System (ADS)

Wang, Zhongpeng; Zhang, Shaozhong; Chen, Fangni; Wu, Ming-Wei; Qiu, Weiwei

2017-11-01

A physical encryption scheme for orthogonal frequency-division multiplexing (OFDM) visible light communication (VLC) systems using chaotic discrete cosine transform (DCT) is proposed. In the scheme, the row of the DCT matrix is permutated by a scrambling sequence generated by a three-dimensional (3-D) Arnold chaos map. Furthermore, two scrambling sequences, which are also generated from a 3-D Arnold map, are employed to encrypt the real and imaginary parts of the transmitted OFDM signal before the chaotic DCT operation. The proposed scheme enhances the physical layer security and improves the bit error rate (BER) performance for OFDM-based VLC. The simulation results prove the efficiency of the proposed encryption method. The experimental results show that the proposed security scheme not only protects image data from eavesdroppers but also keeps the good BER and peak-to-average power ratio performances for image-based OFDM-VLC systems.

A Short-Segment Fourier Transform Methodology

DTIC Science & Technology

2009-03-01

defined sampling of the continuous-valued discrete-time Fourier transform, superresolution in the frequency domain and allowance of Dirac delta functions associated with pure sinusoidal input data components.

Fast and Scalable Computation of the Forward and Inverse Discrete Periodic Radon Transform.

PubMed

Carranza, Cesar; Llamocca, Daniel; Pattichis, Marios

2016-01-01

The discrete periodic radon transform (DPRT) has extensively been used in applications that involve image reconstructions from projections. Beyond classic applications, the DPRT can also be used to compute fast convolutions that avoids the use of floating-point arithmetic associated with the use of the fast Fourier transform. Unfortunately, the use of the DPRT has been limited by the need to compute a large number of additions and the need for a large number of memory accesses. This paper introduces a fast and scalable approach for computing the forward and inverse DPRT that is based on the use of: a parallel array of fixed-point adder trees; circular shift registers to remove the need for accessing external memory components when selecting the input data for the adder trees; an image block-based approach to DPRT computation that can fit the proposed architecture to available resources; and fast transpositions that are computed in one or a few clock cycles that do not depend on the size of the input image. As a result, for an N × N image (N prime), the proposed approach can compute up to N(2) additions per clock cycle. Compared with the previous approaches, the scalable approach provides the fastest known implementations for different amounts of computational resources. For example, for a 251×251 image, for approximately 25% fewer flip-flops than required for a systolic implementation, we have that the scalable DPRT is computed 36 times faster. For the fastest case, we introduce optimized just 2N + ⌈log(2) N⌉ + 1 and 2N + 3 ⌈log(2) N⌉ + B + 2 cycles, architectures that can compute the DPRT and its inverse in respectively, where B is the number of bits used to represent each input pixel. On the other hand, the scalable DPRT approach requires more 1-b additions than for the systolic implementation and provides a tradeoff between speed and additional 1-b additions. All of the proposed DPRT architectures were implemented in VHSIC Hardware Description Language

On a new semi-discrete integrable combination of Burgers and Sharma-Tasso-Olver equation

NASA Astrophysics Data System (ADS)

Zhao, Hai-qiong

2017-02-01

In this paper, a new semi-discrete integrable combination of Burgers and Sharma-Tasso-Olver equation is investigated. The underlying integrable structures like the Lax pair, the infinite number of conservation laws, the Darboux-Bäcklund transformation, and the solutions are presented in the explicit form. The theory of the semi-discrete equation including integrable properties yields the corresponding theory of the continuous counterpart in the continuous limit. Finally, numerical experiments are provided to demonstrate the effectiveness of the developed integrable semi-discretization algorithms.

Linking entanglement and discrete anomaly

NASA Astrophysics Data System (ADS)

Hung, Ling-Yan; Wu, Yong-Shi; Zhou, Yang

2018-05-01

In 3 d Chern-Simons theory, there is a discrete one-form symmetry, whose symmetry group is isomorphic to the center of the gauge group. We study the `t Hooft anomaly associated to this discrete one-form symmetry in theories with generic gauge groups, A, B, C, D-types. We propose to detect the discrete anomaly by computing the Hopf state entanglement in the subspace spanned by the symmetry generators and develop a systematical way based on the truncated modular S matrix. We check our proposal for many examples.

Optical chirp z-transform processor with a simplified architecture.

PubMed

Ngo, Nam Quoc

2014-12-29

Using a simplified chirp z-transform (CZT) algorithm based on the discrete-time convolution method, this paper presents the synthesis of a simplified architecture of a reconfigurable optical chirp z-transform (OCZT) processor based on the silica-based planar lightwave circuit (PLC) technology. In the simplified architecture of the reconfigurable OCZT, the required number of optical components is small and there are no waveguide crossings which make fabrication easy. The design of a novel type of optical discrete Fourier transform (ODFT) processor as a special case of the synthesized OCZT is then presented to demonstrate its effectiveness. The designed ODFT can be potentially used as an optical demultiplexer at the receiver of an optical fiber orthogonal frequency division multiplexing (OFDM) transmission system.

A FFT-based formulation for efficient mechanical fields computation in isotropic and anisotropic periodic discrete dislocation dynamics

NASA Astrophysics Data System (ADS)

Bertin, N.; Upadhyay, M. V.; Pradalier, C.; Capolungo, L.

2015-09-01

In this paper, we propose a novel full-field approach based on the fast Fourier transform (FFT) technique to compute mechanical fields in periodic discrete dislocation dynamics (DDD) simulations for anisotropic materials: the DDD-FFT approach. By coupling the FFT-based approach to the discrete continuous model, the present approach benefits from the high computational efficiency of the FFT algorithm, while allowing for a discrete representation of dislocation lines. It is demonstrated that the computational time associated with the new DDD-FFT approach is significantly lower than that of current DDD approaches when large number of dislocation segments are involved for isotropic and anisotropic elasticity, respectively. Furthermore, for fine Fourier grids, the treatment of anisotropic elasticity comes at a similar computational cost to that of isotropic simulation. Thus, the proposed approach paves the way towards achieving scale transition from DDD to mesoscale plasticity, especially due to the method’s ability to incorporate inhomogeneous elasticity.

Integer cosine transform for image compression

NASA Technical Reports Server (NTRS)

Cheung, K.-M.; Pollara, F.; Shahshahani, M.

1991-01-01

This article describes a recently introduced transform algorithm called the integer cosine transform (ICT), which is used in transform-based data compression schemes. The ICT algorithm requires only integer operations on small integers and at the same time gives a rate-distortion performance comparable to that offered by the floating-point discrete cosine transform (DCT). The article addresses the issue of implementation complexity, which is of prime concern for source coding applications of interest in deep-space communications. Complexity reduction in the transform stage of the compression scheme is particularly relevant, since this stage accounts for most (typically over 80 percent) of the computational load.

Structural-functional lung imaging using a combined CT-EIT and a Discrete Cosine Transformation reconstruction method.

PubMed

Schullcke, Benjamin; Gong, Bo; Krueger-Ziolek, Sabine; Soleimani, Manuchehr; Mueller-Lisse, Ullrich; Moeller, Knut

2016-05-16

Lung EIT is a functional imaging method that utilizes electrical currents to reconstruct images of conductivity changes inside the thorax. This technique is radiation free and applicable at the bedside, but lacks of spatial resolution compared to morphological imaging methods such as X-ray computed tomography (CT). In this article we describe an approach for EIT image reconstruction using morphologic information obtained from other structural imaging modalities. This leads to recon- structed images of lung ventilation that can easily be superimposed with structural CT or MRI images, which facilitates image interpretation. The approach is based on a Discrete Cosine Transformation (DCT) of an image of the considered transversal thorax slice. The use of DCT enables reduction of the dimensionality of the reconstruction and ensures that only conductivity changes of the lungs are reconstructed and displayed. The DCT based approach is well suited to fuse morphological image information with functional lung imaging at low computational costs. Results on simulated data indicate that this approach preserves the morphological structures of the lungs and avoids blurring of the solution. Images from patient measurements reveal the capabilities of the method and demonstrate benefits in possible applications.

Structural-functional lung imaging using a combined CT-EIT and a Discrete Cosine Transformation reconstruction method

PubMed Central

Schullcke, Benjamin; Gong, Bo; Krueger-Ziolek, Sabine; Soleimani, Manuchehr; Mueller-Lisse, Ullrich; Moeller, Knut

2016-01-01

Lung EIT is a functional imaging method that utilizes electrical currents to reconstruct images of conductivity changes inside the thorax. This technique is radiation free and applicable at the bedside, but lacks of spatial resolution compared to morphological imaging methods such as X-ray computed tomography (CT). In this article we describe an approach for EIT image reconstruction using morphologic information obtained from other structural imaging modalities. This leads to recon- structed images of lung ventilation that can easily be superimposed with structural CT or MRI images, which facilitates image interpretation. The approach is based on a Discrete Cosine Transformation (DCT) of an image of the considered transversal thorax slice. The use of DCT enables reduction of the dimensionality of the reconstruction and ensures that only conductivity changes of the lungs are reconstructed and displayed. The DCT based approach is well suited to fuse morphological image information with functional lung imaging at low computational costs. Results on simulated data indicate that this approach preserves the morphological structures of the lungs and avoids blurring of the solution. Images from patient measurements reveal the capabilities of the method and demonstrate benefits in possible applications. PMID:27181695

Classical integrable defects as quasi Bäcklund transformations

NASA Astrophysics Data System (ADS)

Doikou, Anastasia

2016-10-01

We consider the algebraic setting of classical defects in discrete and continuous integrable theories. We derive the ;equations of motion; on the defect point via the space-like and time-like description. We then exploit the structural similarity of these equations with the discrete and continuous Bäcklund transformations. And although these equations are similar they are not exactly the same to the Bäcklund transformations. We also consider specific examples of integrable models to demonstrate our construction, i.e. the Toda chain and the sine-Gordon model. The equations of the time (space) evolution of the defect (discontinuity) degrees of freedom for these models are explicitly derived.

Single-crossover recombination in discrete time.

PubMed

von Wangenheim, Ute; Baake, Ellen; Baake, Michael

2010-05-01

Modelling the process of recombination leads to a large coupled nonlinear dynamical system. Here, we consider a particular case of recombination in discrete time, allowing only for single crossovers. While the analogous dynamics in continuous time admits a closed solution (Baake and Baake in Can J Math 55:3-41, 2003), this no longer works for discrete time. A more general model (i.e. without the restriction to single crossovers) has been studied before (Bennett in Ann Hum Genet 18:311-317, 1954; Dawson in Theor Popul Biol 58:1-20, 2000; Linear Algebra Appl 348:115-137, 2002) and was solved algorithmically by means of Haldane linearisation. Using the special formalism introduced by Baake and Baake (Can J Math 55:3-41, 2003), we obtain further insight into the single-crossover dynamics and the particular difficulties that arise in discrete time. We then transform the equations to a solvable system in a two-step procedure: linearisation followed by diagonalisation. Still, the coefficients of the second step must be determined in a recursive manner, but once this is done for a given system, they allow for an explicit solution valid for all times.

Noncoherent parallel optical processor for discrete two-dimensional linear transformations.

PubMed

Glaser, I

1980-10-01

We describe a parallel optical processor, based on a lenslet array, that provides general linear two-dimensional transformations using noncoherent light. Such a processor could become useful in image- and signal-processing applications in which the throughput requirements cannot be adequately satisfied by state-of-the-art digital processors. Experimental results that illustrate the feasibility of the processor by demonstrating its use in parallel optical computation of the two-dimensional Walsh-Hadamard transformation are presented.

Fixed interval smoothing with discrete measurements.

NASA Technical Reports Server (NTRS)

Bierman, G. J.

1972-01-01

Smoothing equations for a linear continuous dynamic system with linear discrete measurements, derived from the discrete results of Rauch, Tung, and Striebel (1965), (R-T-S), are used to extend, through recursive updating, the previously published results of Bryson and Frazier (1963), (B-F), and yield a modified Bryson and Frazier, (M-B-F), algorithm. A comparison of the (M-B-F) and (R-T-S) algorithms leads to the conclusion that the former is to be preferred because it entails less computation, less storage, and less instability. It is felt that the presented (M-B-F) smoothing algorithm is a practical mechanization and should be of value in smoothing discretely observed dynamic linear systems.

Self-assembled fibre optoelectronics with discrete translational symmetry

PubMed Central

Rein, Michael; Levy, Etgar; Gumennik, Alexander; Abouraddy, Ayman F.; Joannopoulos, John; Fink, Yoel

2016-01-01

Fibres with electronic and photonic properties are essential building blocks for functional fabrics with system level attributes. The scalability of thermal fibre drawing approach offers access to large device quantities, while constraining the devices to be translational symmetric. Lifting this symmetry to create discrete devices in fibres will increase their utility. Here, we draw, from a macroscopic preform, fibres that have three parallel internal non-contacting continuous domains; a semiconducting glass between two conductors. We then heat the fibre and generate a capillary fluid instability, resulting in the selective transformation of the cylindrical semiconducting domain into discrete spheres while keeping the conductive domains unchanged. The cylindrical-to-spherical expansion bridges the continuous conducting domains to create ∼104 self-assembled, electrically contacted and entirely packaged discrete spherical devices per metre of fibre. The photodetection and Mie resonance dependent response are measured by illuminating the fibre while connecting its ends to an electrical readout. PMID:27698454

Self-assembled fibre optoelectronics with discrete translational symmetry.

PubMed

Rein, Michael; Levy, Etgar; Gumennik, Alexander; Abouraddy, Ayman F; Joannopoulos, John; Fink, Yoel

2016-10-04

Fibres with electronic and photonic properties are essential building blocks for functional fabrics with system level attributes. The scalability of thermal fibre drawing approach offers access to large device quantities, while constraining the devices to be translational symmetric. Lifting this symmetry to create discrete devices in fibres will increase their utility. Here, we draw, from a macroscopic preform, fibres that have three parallel internal non-contacting continuous domains; a semiconducting glass between two conductors. We then heat the fibre and generate a capillary fluid instability, resulting in the selective transformation of the cylindrical semiconducting domain into discrete spheres while keeping the conductive domains unchanged. The cylindrical-to-spherical expansion bridges the continuous conducting domains to create ∼10 4 self-assembled, electrically contacted and entirely packaged discrete spherical devices per metre of fibre. The photodetection and Mie resonance dependent response are measured by illuminating the fibre while connecting its ends to an electrical readout.

Discretization of Continuous Time Discrete Scale Invariant Processes: Estimation and Spectra

NASA Astrophysics Data System (ADS)

Rezakhah, Saeid; Maleki, Yasaman

2016-07-01

Imposing some flexible sampling scheme we provide some discretization of continuous time discrete scale invariant (DSI) processes which is a subsidiary discrete time DSI process. Then by introducing some simple random measure we provide a second continuous time DSI process which provides a proper approximation of the first one. This enables us to provide a bilateral relation between covariance functions of the subsidiary process and the new continuous time processes. The time varying spectral representation of such continuous time DSI process is characterized, and its spectrum is estimated. Also, a new method for estimation time dependent Hurst parameter of such processes is provided which gives a more accurate estimation. The performance of this estimation method is studied via simulation. Finally this method is applied to the real data of S & P500 and Dow Jones indices for some special periods.

Noniterative MAP reconstruction using sparse matrix representations.

PubMed

Cao, Guangzhi; Bouman, Charles A; Webb, Kevin J

2009-09-01

We present a method for noniterative maximum a posteriori (MAP) tomographic reconstruction which is based on the use of sparse matrix representations. Our approach is to precompute and store the inverse matrix required for MAP reconstruction. This approach has generally not been used in the past because the inverse matrix is typically large and fully populated (i.e., not sparse). In order to overcome this problem, we introduce two new ideas. The first idea is a novel theory for the lossy source coding of matrix transformations which we refer to as matrix source coding. This theory is based on a distortion metric that reflects the distortions produced in the final matrix-vector product, rather than the distortions in the coded matrix itself. The resulting algorithms are shown to require orthonormal transformations of both the measurement data and the matrix rows and columns before quantization and coding. The second idea is a method for efficiently storing and computing the required orthonormal transformations, which we call a sparse-matrix transform (SMT). The SMT is a generalization of the classical FFT in that it uses butterflies to compute an orthonormal transform; but unlike an FFT, the SMT uses the butterflies in an irregular pattern, and is numerically designed to best approximate the desired transforms. We demonstrate the potential of the noniterative MAP reconstruction with examples from optical tomography. The method requires offline computation to encode the inverse transform. However, once these offline computations are completed, the noniterative MAP algorithm is shown to reduce both storage and computation by well over two orders of magnitude, as compared to a linear iterative reconstruction methods.

A semi-discrete Kadomtsev-Petviashvili equation and its coupled integrable system

NASA Astrophysics Data System (ADS)

Li, Chun-Xia; Lafortune, Stéphane; Shen, Shou-Feng

2016-05-01

We establish connections between two cascades of integrable systems generated from the continuum limits of the Hirota-Miwa equation and its remarkable nonlinear counterpart under the Miwa transformation, respectively. Among these equations, we are mainly concerned with the semi-discrete bilinear Kadomtsev-Petviashvili (KP) equation which is seldomly studied in literature. We present both of its Casorati and Grammian determinant solutions. Through the Pfaffianization procedure proposed by Hirota and Ohta, we are able to derive the coupled integrable system for the semi-discrete KP equation.

Statistical Analysis of Large Scale Structure by the Discrete Wavelet Transform

NASA Astrophysics Data System (ADS)

Pando, Jesus

1997-10-01

The discrete wavelet transform (DWT) is developed as a general statistical tool for the study of large scale structures (LSS) in astrophysics. The DWT is used in all aspects of structure identification including cluster analysis, spectrum and two-point correlation studies, scale-scale correlation analysis and to measure deviations from Gaussian behavior. The techniques developed are demonstrated on 'academic' signals, on simulated models of the Lymanα (Lyα) forests, and on observational data of the Lyα forests. This technique can detect clustering in the Ly-α clouds where traditional techniques such as the two-point correlation function have failed. The position and strength of these clusters in both real and simulated data is determined and it is shown that clusters exist on scales as large as at least 20 h-1 Mpc at significance levels of 2-4 σ. Furthermore, it is found that the strength distribution of the clusters can be used to distinguish between real data and simulated samples even where other traditional methods have failed to detect differences. Second, a method for measuring the power spectrum of a density field using the DWT is developed. All common features determined by the usual Fourier power spectrum can be calculated by the DWT. These features, such as the index of a power law or typical scales, can be detected even when the samples are geometrically complex, the samples are incomplete, or the mean density on larger scales is not known (the infrared uncertainty). Using this method the spectra of Ly-α forests in both simulated and real samples is calculated. Third, a method for measuring hierarchical clustering is introduced. Because hierarchical evolution is characterized by a set of rules of how larger dark matter halos are formed by the merging of smaller halos, scale-scale correlations of the density field should be one of the most sensitive quantities in determining the merging history. We show that these correlations can be completely

Discrete breathers dynamic in a model for DNA chain with a finite stacking enthalpy

NASA Astrophysics Data System (ADS)

Gninzanlong, Carlos Lawrence; Ndjomatchoua, Frank Thomas; Tchawoua, Clément

2018-04-01

The nonlinear dynamics of a homogeneous DNA chain based on site-dependent finite stacking and pairing enthalpies is studied. A new variant of extended discrete nonlinear Schrödinger equation describing the dynamics of modulated wave is derived. The regions of discrete modulational instability of plane carrier waves are studied, and it appears that these zones depend strongly on the phonon frequency of Fourier's mode. The staggered/unstaggered discrete breather (SDB/USDB) is obtained straightforwardly without the staggering transformation, and it is demonstrated that SDBs are less unstable than USDB. The instability of discrete multi-humped SDB/USDB solution does not depend on the number of peaks of the discrete breather (DB). By using the concept of Peierls-Nabarro energy barrier, it appears that the low-frequency DBs are more mobile.

Large-scale chromosome folding versus genomic DNA sequences: A discrete double Fourier transform technique.

PubMed

Chechetkin, V R; Lobzin, V V

2017-08-07

Using state-of-the-art techniques combining imaging methods and high-throughput genomic mapping tools leaded to the significant progress in detailing chromosome architecture of various organisms. However, a gap still remains between the rapidly growing structural data on the chromosome folding and the large-scale genome organization. Could a part of information on the chromosome folding be obtained directly from underlying genomic DNA sequences abundantly stored in the databanks? To answer this question, we developed an original discrete double Fourier transform (DDFT). DDFT serves for the detection of large-scale genome regularities associated with domains/units at the different levels of hierarchical chromosome folding. The method is versatile and can be applied to both genomic DNA sequences and corresponding physico-chemical parameters such as base-pairing free energy. The latter characteristic is closely related to the replication and transcription and can also be used for the assessment of temperature or supercoiling effects on the chromosome folding. We tested the method on the genome of E. coli K-12 and found good correspondence with the annotated domains/units established experimentally. As a brief illustration of further abilities of DDFT, the study of large-scale genome organization for bacteriophage PHIX174 and bacterium Caulobacter crescentus was also added. The combined experimental, modeling, and bioinformatic DDFT analysis should yield more complete knowledge on the chromosome architecture and genome organization. Copyright © 2017 Elsevier Ltd. All rights reserved.

Discretization analysis of bifurcation based nonlinear amplifiers

NASA Astrophysics Data System (ADS)

Feldkord, Sven; Reit, Marco; Mathis, Wolfgang

2017-09-01

Recently, for modeling biological amplification processes, nonlinear amplifiers based on the supercritical Andronov-Hopf bifurcation have been widely analyzed analytically. For technical realizations, digital systems have become the most relevant systems in signal processing applications. The underlying continuous-time systems are transferred to the discrete-time domain using numerical integration methods. Within this contribution, effects on the qualitative behavior of the Andronov-Hopf bifurcation based systems concerning numerical integration methods are analyzed. It is shown exemplarily that explicit Runge-Kutta methods transform the truncated normalform equation of the Andronov-Hopf bifurcation into the normalform equation of the Neimark-Sacker bifurcation. Dependent on the order of the integration method, higher order terms are added during this transformation.A rescaled normalform equation of the Neimark-Sacker bifurcation is introduced that allows a parametric design of a discrete-time system which corresponds to the rescaled Andronov-Hopf system. This system approximates the characteristics of the rescaled Hopf-type amplifier for a large range of parameters. The natural frequency and the peak amplitude are preserved for every set of parameters. The Neimark-Sacker bifurcation based systems avoid large computational effort that would be caused by applying higher order integration methods to the continuous-time normalform equations.

Differential utilization and transformation of sulfur allotropes, μ-S and α-S8, by moderate thermoacidophile Sulfobacillus thermosulfidooxidans.

PubMed

Nie, Zhen-yuan; Liu, Hong-chang; Xia, Jin-lan; Zhu, Hong-rui; Ma, Chen-yan; Zheng, Lei; Zhao, Yi-dong; Qiu, Guan-zhou

2014-10-01

The utilization of amorphous μ-S and orthorhombic α-S8 by thermoacidophile Sulfobacillus thermosulfidooxidans was firstly investigated in terms of cell growth and sulfur oxidation behavior. The morphology and surface sulfur speciation transformation were evaluated by using scanning electron microscopy (SEM), X-ray diffraction (XRD), Fourier transform-infrared spectroscopy (FT-IR), Raman spectroscopy and sulfur K-edge X-ray absorption near edge structure (XANES) spectroscopy. The results showed that the strain grown on μ-S entered slower (about 1 day later) into the exponential phase, while grew faster in exponential phase and attained higher maximal cell density and lower pH than on α-S8. After bio-corrosion, both sulfur samples were evidently eroded, but only μ-S surface presented much porosity, while α-S8 maintained glabrous. μ-S began to be gradually converted into α-S8 from day 2 when the bacterial cells entered the exponential phase, with a final composition of 62.3% μ-S and 37.7% α-S8 on day 4 at the stationary phase. α-S8 was not found to transform into other species in the experiments with or without bacteria. These data indicated S. thermosulfidooxidans oxidized amorphous μ-S faster than orthorhombic α-S8, but the chain-like μ-S was transformed into cyclic α-S8 by S. thermosulfidooxidans. Copyright © 2014 Institut Pasteur. Published by Elsevier Masson SAS. All rights reserved.

USMC Inventory Control Using Optimization Modeling and Discrete Event Simulation

DTIC Science & Technology

2016-09-01

release. Distribution is unlimited. USMC INVENTORY CONTROL USING OPTIMIZATION MODELING AND DISCRETE EVENT SIMULATION by Timothy A. Curling...USING OPTIMIZATION MODELING AND DISCRETE EVENT SIMULATION 5. FUNDING NUMBERS 6. AUTHOR(S) Timothy A. Curling 7. PERFORMING ORGANIZATION NAME(S...optimization and discrete -event simulation. This construct can potentially provide an effective means in improving order management decisions. However

REPETITA: detection and discrimination of the periodicity of protein solenoid repeats by discrete Fourier transform

PubMed Central

Marsella, Luca; Sirocco, Francesco; Trovato, Antonio; Seno, Flavio; Tosatto, Silvio C.E.

2009-01-01

Motivation: Proteins with solenoid repeats evolve more quickly than non-repetitive ones and their periodicity may be rapidly hidden at sequence level, while still evident in structure. In order to identify these repeats, we propose here a novel method based on a metric characterizing amino-acid properties (polarity, secondary structure, molecular volume, codon diversity, electric charge) using five previously derived numerical functions. Results: The five spectra of the candidate sequences coding for structural repeats, obtained by Discrete Fourier Transform (DFT), show common features allowing determination of repeat periodicity with excellent results. Moreover it is possible to introduce a phase space parameterized by two quantities related to the Fourier spectra which allow for a clear distinction between a non-homologous set of globular proteins and proteins with solenoid repeats. The DFT method is shown to be competitive with other state of the art methods in the detection of solenoid structures, while improving its performance especially in the identification of periodicities, since it is able to recognize the actual repeat length in most cases. Moreover it highlights the relevance of local structural propensities in determining solenoid repeats. Availability: A web tool implementing the algorithm presented in the article (REPETITA) is available with additional details on the data sets at the URL: http://protein.bio.unipd.it/repetita/. Contact: silvio.tosatto@unipd.it PMID:19478001

Fetal heart rate deceleration detection using a discrete cosine transform implementation of singular spectrum analysis.

PubMed

Warrick, P A; Precup, D; Hamilton, E F; Kearney, R E

2007-01-01

To develop a singular-spectrum analysis (SSA) based change-point detection algorithm applicable to fetal heart rate (FHR) monitoring to improve the detection of deceleration events. We present a method for decomposing a signal into near-orthogonal components via the discrete cosine transform (DCT) and apply this in a novel online manner to change-point detection based on SSA. The SSA technique forms models of the underlying signal that can be compared over time; models that are sufficiently different indicate signal change points. To adapt the algorithm to deceleration detection where many successive similar change events can occur, we modify the standard SSA algorithm to hold the reference model constant under such conditions, an approach that we term "base-hold SSA". The algorithm is applied to a database of 15 FHR tracings that have been preprocessed to locate candidate decelerations and is compared to the markings of an expert obstetrician. Of the 528 true and 1285 false decelerations presented to the algorithm, the base-hold approach improved on standard SSA, reducing the number of missed decelerations from 64 to 49 (21.9%) while maintaining the same reduction in false-positives (278). The standard SSA assumption that changes are infrequent does not apply to FHR analysis where decelerations can occur successively and in close proximity; our base-hold SSA modification improves detection of these types of event series.

Disease-induced mortality in density-dependent discrete-time S-I-S epidemic models.

PubMed

Franke, John E; Yakubu, Abdul-Aziz

2008-12-01

The dynamics of simple discrete-time epidemic models without disease-induced mortality are typically characterized by global transcritical bifurcation. We prove that in corresponding models with disease-induced mortality a tiny number of infectious individuals can drive an otherwise persistent population to extinction. Our model with disease-induced mortality supports multiple attractors. In addition, we use a Ricker recruitment function in an SIS model and obtained a three component discrete Hopf (Neimark-Sacker) cycle attractor coexisting with a fixed point attractor. The basin boundaries of the coexisting attractors are fractal in nature, and the example exhibits sensitive dependence of the long-term disease dynamics on initial conditions. Furthermore, we show that in contrast to corresponding models without disease-induced mortality, the disease-free state dynamics do not drive the disease dynamics.

Electromyography (EMG) signal recognition using combined discrete wavelet transform based adaptive neuro-fuzzy inference systems (ANFIS)

NASA Astrophysics Data System (ADS)

Arozi, Moh; Putri, Farika T.; Ariyanto, Mochammad; Khusnul Ari, M.; Munadi, Setiawan, Joga D.

2017-01-01

People with disabilities are increasing from year to year either due to congenital factors, sickness, accident factors and war. One form of disability is the case of interruptions of hand function. The condition requires and encourages the search for solutions in the form of creating an artificial hand with the ability as a human hand. The development of science in the field of neuroscience currently allows the use of electromyography (EMG) to control the motion of artificial prosthetic hand into the necessary use of EMG as an input signal to control artificial prosthetic hand. This study is the beginning of a significant research planned in the development of artificial prosthetic hand with EMG signal input. This initial research focused on the study of EMG signal recognition. Preliminary results show that the EMG signal recognition using combined discrete wavelet transform and Adaptive Neuro-Fuzzy Inference System (ANFIS) produces accuracy 98.3 % for training and 98.51% for testing. Thus the results can be used as an input signal for Simulink block diagram of a prosthetic hand that will be developed on next study. The research will proceed with the construction of artificial prosthetic hand along with Simulink program controlling and integrating everything into one system.

An integrable semi-discrete Degasperis-Procesi equation

NASA Astrophysics Data System (ADS)

Feng, Bao-Feng; Maruno, Ken-ichi; Ohta, Yasuhiro

2017-06-01

Based on our previous work on the Degasperis-Procesi equation (Feng et al J. Phys. A: Math. Theor. 46 045205) and the integrable semi-discrete analogue of its short wave limit (Feng et al J. Phys. A: Math. Theor. 48 135203), we derive an integrable semi-discrete Degasperis-Procesi equation by Hirota’s bilinear method. Furthermore, N-soliton solution to the semi-discrete Degasperis-Procesi equation is constructed. It is shown that both the proposed semi-discrete Degasperis-Procesi equation, and its N-soliton solution converge to ones of the original Degasperis-Procesi equation in the continuum limit.

Hydrocarbon Reservoir Prediction Using Bi-Gaussian S Transform Based Time-Frequency Analysis Approach

NASA Astrophysics Data System (ADS)

Cheng, Z.; Chen, Y.; Liu, Y.; Liu, W.; Zhang, G.

2015-12-01

Among those hydrocarbon reservoir detection techniques, the time-frequency analysis based approach is one of the most widely used approaches because of its straightforward indication of low-frequency anomalies from the time-frequency maps, that is to say, the low-frequency bright spots usually indicate the potential hydrocarbon reservoirs. The time-frequency analysis based approach is easy to implement, and more importantly, is usually of high fidelity in reservoir prediction, compared with the state-of-the-art approaches, and thus is of great interest to petroleum geologists, geophysicists, and reservoir engineers. The S transform has been frequently used in obtaining the time-frequency maps because of its better performance in controlling the compromise between the time and frequency resolutions than the alternatives, such as the short-time Fourier transform, Gabor transform, and continuous wavelet transform. The window function used in the majority of previous S transform applications is the symmetric Gaussian window. However, one problem with the symmetric Gaussian window is the degradation of time resolution in the time-frequency map due to the long front taper. In our study, a bi-Gaussian S transform that substitutes the symmetric Gaussian window with an asymmetry bi-Gaussian window is proposed to analyze the multi-channel seismic data in order to predict hydrocarbon reservoirs. The bi-Gaussian window introduces asymmetry in the resultant time-frequency spectrum, with time resolution better in the front direction, as compared with the back direction. It is the first time that the bi-Gaussian S transform is used for analyzing multi-channel post-stack seismic data in order to predict hydrocarbon reservoirs since its invention in 2003. The superiority of the bi-Gaussian S transform over traditional S transform is tested on a real land seismic data example. The performance shows that the enhanced temporal resolution can help us depict more clearly the edge of the

Clebsch-Gordan coefficients of discrete groups in subgroup bases

NASA Astrophysics Data System (ADS)

Chen, Gaoli

2018-04-01

We express each Clebsch-Gordan (CG) coefficient of a discrete group as a product of a CG coefficient of its subgroup and a factor, which we call an embedding factor. With an appropriate definition, such factors are fixed up to phase ambiguities. Particularly, they are invariant under basis transformations of irreducible representations of both the group and its subgroup. We then impose on the embedding factors constraints, which relate them to their counterparts under complex conjugate and therefore restrict the phases of embedding factors. In some cases, the phase ambiguities are reduced to sign ambiguities. We describe the procedure of obtaining embedding factors and then calculate CG coefficients of the group 𝒫𝒮ℒ2(7) in terms of embedding factors of its subgroups S4 and 𝒯7.

The fractional Fourier transform and applications

NASA Technical Reports Server (NTRS)

Bailey, David H.; Swarztrauber, Paul N.

1991-01-01

This paper describes the 'fractional Fourier transform', which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity e exp -2(pi)i/n, the fractional Fourier transform is based on fractional roots of unity e exp -2(pi)i(alpha), where alpha is arbitrary. The fractional Fourier transform and the corresponding fast algorithm are useful for such applications as computing DFTs of sequences with prime lengths, computing DFTs of sparse sequences, analyzing sequences with noninteger periodicities, performing high-resolution trigonometric interpolation, detecting lines in noisy images, and detecting signals with linearly drifting frequencies. In many cases, the resulting algorithms are faster by arbitrarily large factors than conventional techniques.

S{sub 2}SA preconditioning for the S{sub n} equations with strictly non negative spatial discretization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bruss, D. E.; Morel, J. E.; Ragusa, J. C.

2013-07-01

Preconditioners based upon sweeps and diffusion-synthetic acceleration have been constructed and applied to the zeroth and first spatial moments of the 1-D S{sub n} transport equation using a strictly non negative nonlinear spatial closure. Linear and nonlinear preconditioners have been analyzed. The effectiveness of various combinations of these preconditioners are compared. In one dimension, nonlinear sweep preconditioning is shown to be superior to linear sweep preconditioning, and DSA preconditioning using nonlinear sweeps in conjunction with a linear diffusion equation is found to be essentially equivalent to nonlinear sweeps in conjunction with a nonlinear diffusion equation. The ability to use amore » linear diffusion equation has important implications for preconditioning the S{sub n} equations with a strictly non negative spatial discretization in multiple dimensions. (authors)« less

Network Science Research Laboratory (NSRL) Discrete Event Toolkit

DTIC Science & Technology

2016-01-01

ARL-TR-7579 ● JAN 2016 US Army Research Laboratory Network Science Research Laboratory (NSRL) Discrete Event Toolkit by...Laboratory (NSRL) Discrete Event Toolkit by Theron Trout and Andrew J Toth Computational and Information Sciences Directorate, ARL...Research Laboratory (NSRL) Discrete Event Toolkit 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Theron Trout

The Senior Leader’s Responsibility for Leading Military Change and Transformation

DTIC Science & Technology

2007-03-30

RESPONSIBILITY FOR LEADING MILITARY CHANGE AND TRANSFORMATION We live in a world of constant change. Corporations , academic institutions... corporal ”33 and “pentathlete.”34 Vision and inspiration distinguish the heart of a military leader’s responsibility to motivate the men and women...USAWC STRATEGY RESEARCH PROJECT THE SENIOR LEADER’S RESPONSIBILITY FOR LEADING MILITARY CHANGE AND TRANSFORMATION

The inverse of winnowing: a FORTRAN subroutine and discussion of unwinnowing discrete data

USGS Publications Warehouse

Bracken, Robert E.

2004-01-01

This report describes an unwinnowing algorithm that utilizes a discrete Fourier transform, and a resulting Fortran subroutine that winnows or unwinnows a 1-dimensional stream of discrete data; the source code is included. The unwinnowing algorithm effectively increases (by integral factors) the number of available data points while maintaining the original frequency spectrum of a data stream. This has utility when an increased data density is required together with an availability of higher order derivatives that honor the original data.

Directional dual-tree complex wavelet packet transforms for processing quadrature signals.

PubMed

Serbes, Gorkem; Gulcur, Halil Ozcan; Aydin, Nizamettin

2016-03-01

Quadrature signals containing in-phase and quadrature-phase components are used in many signal processing applications in every field of science and engineering. Specifically, Doppler ultrasound systems used to evaluate cardiovascular disorders noninvasively also result in quadrature format signals. In order to obtain directional blood flow information, the quadrature outputs have to be preprocessed using methods such as asymmetrical and symmetrical phasing filter techniques. These resultant directional signals can be employed in order to detect asymptomatic embolic signals caused by small emboli, which are indicators of a possible future stroke, in the cerebral circulation. Various transform-based methods such as Fourier and wavelet were frequently used in processing embolic signals. However, most of the times, the Fourier and discrete wavelet transforms are not appropriate for the analysis of embolic signals due to their non-stationary time-frequency behavior. Alternatively, discrete wavelet packet transform can perform an adaptive decomposition of the time-frequency axis. In this study, directional discrete wavelet packet transforms, which have the ability to map directional information while processing quadrature signals and have less computational complexity than the existing wavelet packet-based methods, are introduced. The performances of proposed methods are examined in detail by using single-frequency, synthetic narrow-band, and embolic quadrature signals.

Double image encryption in Fresnel domain using wavelet transform, gyrator transform and spiral phase masks

NASA Astrophysics Data System (ADS)

Kumar, Ravi; Bhaduri, Basanta

2017-06-01

In this paper, we propose a new technique for double image encryption in the Fresnel domain using wavelet transform (WT), gyrator transform (GT) and spiral phase masks (SPMs). The two input mages are first phase encoded and each of them are then multiplied with SPMs and Fresnel propagated with distances d1 and d2, respectively. The single-level discrete WT is applied to Fresnel propagated complex images to decompose each into sub-band matrices i.e. LL, HL, LH and HH. Further, the sub-band matrices of two complex images are interchanged after modulation with random phase masks (RPMs) and subjected to inverse discrete WT. The resulting images are then both added and subtracted to get intermediate images which are further Fresnel propagated with distances d3 and d4, respectively. These outputs are finally gyrator transformed with the same angle α to get the encrypted images. The proposed technique provides enhanced security in terms of a large set of security keys. The sensitivity of security keys such as SPM parameters, GT angle α, Fresnel propagation distances are investigated. The robustness of the proposed techniques against noise and occlusion attacks are also analysed. The numerical simulation results are shown in support of the validity and effectiveness of the proposed technique.

Research of generalized wavelet transformations of Haar correctness in remote sensing of the Earth

NASA Astrophysics Data System (ADS)

Kazaryan, Maretta; Shakhramanyan, Mihail; Nedkov, Roumen; Richter, Andrey; Borisova, Denitsa; Stankova, Nataliya; Ivanova, Iva; Zaharinova, Mariana

2017-10-01

In this paper, Haar's generalized wavelet functions are applied to the problem of ecological monitoring by the method of remote sensing of the Earth. We study generalized Haar wavelet series and suggest the use of Tikhonov's regularization method for investigating them for correctness. In the solution of this problem, an important role is played by classes of functions that were introduced and described in detail by I.M. Sobol for studying multidimensional quadrature formulas and it contains functions with rapidly convergent series of wavelet Haar. A theorem on the stability and uniform convergence of the regularized summation function of the generalized wavelet-Haar series of a function from this class with approximate coefficients is proved. The article also examines the problem of using orthogonal transformations in Earth remote sensing technologies for environmental monitoring. Remote sensing of the Earth allows to receive from spacecrafts information of medium, high spatial resolution and to conduct hyperspectral measurements. Spacecrafts have tens or hundreds of spectral channels. To process the images, the device of discrete orthogonal transforms, and namely, wavelet transforms, was used. The aim of the work is to apply the regularization method in one of the problems associated with remote sensing of the Earth and subsequently to process the satellite images through discrete orthogonal transformations, in particular, generalized Haar wavelet transforms. General methods of research. In this paper, Tikhonov's regularization method, the elements of mathematical analysis, the theory of discrete orthogonal transformations, and methods for decoding of satellite images are used. Scientific novelty. The task of processing of archival satellite snapshots (images), in particular, signal filtering, was investigated from the point of view of an incorrectly posed problem. The regularization parameters for discrete orthogonal transformations were determined.

Precise and fast spatial-frequency analysis using the iterative local Fourier transform.

PubMed

Lee, Sukmock; Choi, Heejoo; Kim, Dae Wook

2016-09-19

The use of the discrete Fourier transform has decreased since the introduction of the fast Fourier transform (fFT), which is a numerically efficient computing process. This paper presents the iterative local Fourier transform (ilFT), a set of new processing algorithms that iteratively apply the discrete Fourier transform within a local and optimal frequency domain. The new technique achieves 2¹⁰ times higher frequency resolution than the fFT within a comparable computation time. The method's superb computing efficiency, high resolution, spectrum zoom-in capability, and overall performance are evaluated and compared to other advanced high-resolution Fourier transform techniques, such as the fFT combined with several fitting methods. The effectiveness of the ilFT is demonstrated through the data analysis of a set of Talbot self-images (1280 × 1024 pixels) obtained with an experimental setup using grating in a diverging beam produced by a coherent point source.

Singular perturbation and time scale approaches in discrete control systems

NASA Technical Reports Server (NTRS)

Naidu, D. S.; Price, D. B.

1988-01-01

After considering a singularly perturbed discrete control system, a singular perturbation approach is used to obtain outer and correction subsystems. A time scale approach is then applied via block diagonalization transformations to decouple the system into slow and fast subsystems. To a zeroth-order approximation, the singular perturbation and time-scale approaches are found to yield equivalent results.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.

PubMed

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A

2016-08-25

There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

PubMed Central

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A.

2016-01-01

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of “maximum flow-minimum cut” graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174

Efficiency and Flexibility of Fingerprint Scheme Using Partial Encryption and Discrete Wavelet Transform to Verify User in Cloud Computing.

PubMed

Yassin, Ali A

2014-01-01

Now, the security of digital images is considered more and more essential and fingerprint plays the main role in the world of image. Furthermore, fingerprint recognition is a scheme of biometric verification that applies pattern recognition techniques depending on image of fingerprint individually. In the cloud environment, an adversary has the ability to intercept information and must be secured from eavesdroppers. Unluckily, encryption and decryption functions are slow and they are often hard. Fingerprint techniques required extra hardware and software; it is masqueraded by artificial gummy fingers (spoof attacks). Additionally, when a large number of users are being verified at the same time, the mechanism will become slow. In this paper, we employed each of the partial encryptions of user's fingerprint and discrete wavelet transform to obtain a new scheme of fingerprint verification. Moreover, our proposed scheme can overcome those problems; it does not require cost, reduces the computational supplies for huge volumes of fingerprint images, and resists well-known attacks. In addition, experimental results illustrate that our proposed scheme has a good performance of user's fingerprint verification.

Efficiency and Flexibility of Fingerprint Scheme Using Partial Encryption and Discrete Wavelet Transform to Verify User in Cloud Computing

PubMed Central

Yassin, Ali A.

2014-01-01

Now, the security of digital images is considered more and more essential and fingerprint plays the main role in the world of image. Furthermore, fingerprint recognition is a scheme of biometric verification that applies pattern recognition techniques depending on image of fingerprint individually. In the cloud environment, an adversary has the ability to intercept information and must be secured from eavesdroppers. Unluckily, encryption and decryption functions are slow and they are often hard. Fingerprint techniques required extra hardware and software; it is masqueraded by artificial gummy fingers (spoof attacks). Additionally, when a large number of users are being verified at the same time, the mechanism will become slow. In this paper, we employed each of the partial encryptions of user's fingerprint and discrete wavelet transform to obtain a new scheme of fingerprint verification. Moreover, our proposed scheme can overcome those problems; it does not require cost, reduces the computational supplies for huge volumes of fingerprint images, and resists well-known attacks. In addition, experimental results illustrate that our proposed scheme has a good performance of user's fingerprint verification. PMID:27355051

Iterative Correction Scheme Based on Discrete Cosine Transform and L1 Regularization for Fluorescence Molecular Tomography With Background Fluorescence.

PubMed

Zhang, Jiulou; Shi, Junwei; Guang, Huizhi; Zuo, Simin; Liu, Fei; Bai, Jing; Luo, Jianwen

2016-06-01

High-intensity background fluorescence is generally encountered in fluorescence molecular tomography (FMT), because of the accumulation of fluorescent probes in nontarget tissues or the existence of autofluorescence in biological tissues. The reconstruction results are affected or even distorted by the background fluorescence, especially when the distribution of fluorescent targets is relatively sparse. The purpose of this paper is to reduce the negative effect of background fluorescence on FMT reconstruction. After each iteration of the Tikhonov regularization algorithm, 3-D discrete cosine transform is adopted to filter the intermediate results. And then, a sparsity constraint step based on L1 regularization is applied to restrain the energy of the objective function. Phantom experiments with different fluorescence intensities of homogeneous and heterogeneous background are carried out to validate the performance of the proposed scheme. The results show that the reconstruction quality can be improved with the proposed iterative correction scheme. The influence of background fluorescence in FMT can be reduced effectively because of the filtering of the intermediate results, the detail preservation, and noise suppression of L1 regularization.

Nonlinear dynamic range transformation in visual communication channels.

PubMed

Alter-Gartenberg, R

1996-01-01

The article evaluates nonlinear dynamic range transformation in the context of the end-to-end continuous-input/discrete processing/continuous-display imaging process. Dynamic range transformation is required when we have the following: (i) the wide dynamic range encountered in nature is compressed into the relatively narrow dynamic range of the display, particularly for spatially varying irradiance (e.g., shadow); (ii) coarse quantization is expanded to the wider dynamic range of the display; and (iii) nonlinear tone scale transformation compensates for the correction in the camera amplifier.

Causal Correlation Functions and Fourier Transforms: Application in Calculating Pressure Induced Shifts

NASA Technical Reports Server (NTRS)

Ma, Q.; Tipping, R. H.; Lavrentieva, N. N.

2012-01-01

By adopting a concept from signal processing, instead of starting from the correlation functions which are even, one considers the causal correlation functions whose Fourier transforms become complex. Their real and imaginary parts multiplied by 2 are the Fourier transforms of the original correlations and the subsequent Hilbert transforms, respectively. Thus, by taking this step one can complete the two previously needed transforms. However, to obviate performing the Cauchy principal integrations required in the Hilbert transforms is the greatest advantage. Meanwhile, because the causal correlations are well-bounded within the time domain and band limited in the frequency domain, one can replace their Fourier transforms by the discrete Fourier transforms and the latter can be carried out with the FFT algorithm. This replacement is justified by sampling theory because the Fourier transforms can be derived from the discrete Fourier transforms with the Nyquis rate without any distortions. We apply this method in calculating pressure induced shifts of H2O lines and obtain more reliable values. By comparing the calculated shifts with those in HITRAN 2008 and by screening both of them with the pair identity and the smooth variation rules, one can conclude many of shift values in HITRAN are not correct.

Secure Hashing of Dynamic Hand Signatures Using Wavelet-Fourier Compression with BioPhasor Mixing and [InlineEquation not available: see fulltext.] Discretization

NASA Astrophysics Data System (ADS)

Wai Kuan, Yip; Teoh, Andrew B. J.; Ngo, David C. L.

2006-12-01

We introduce a novel method for secure computation of biometric hash on dynamic hand signatures using BioPhasor mixing and[InlineEquation not available: see fulltext.] discretization. The use of BioPhasor as the mixing process provides a one-way transformation that precludes exact recovery of the biometric vector from compromised hashes and stolen tokens. In addition, our user-specific[InlineEquation not available: see fulltext.] discretization acts both as an error correction step as well as a real-to-binary space converter. We also propose a new method of extracting compressed representation of dynamic hand signatures using discrete wavelet transform (DWT) and discrete fourier transform (DFT). Without the conventional use of dynamic time warping, the proposed method avoids storage of user's hand signature template. This is an important consideration for protecting the privacy of the biometric owner. Our results show that the proposed method could produce stable and distinguishable bit strings with equal error rates (EERs) of[InlineEquation not available: see fulltext.] and[InlineEquation not available: see fulltext.] for random and skilled forgeries for stolen token (worst case) scenario, and[InlineEquation not available: see fulltext.] for both forgeries in the genuine token (optimal) scenario.

Transformation of Schwanniomyces occidentalis with an ADE2 gene cloned from S. occidentalis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Klein, R.D.; Favreau, M.A.

1988-12-01

We have developed an efficient transformation system for the industrial yeast Schwanniomyces occidentalis (formerly Schwanniomyces castellii). The transformation system is based on ade2 mutants of S. occidentalis deficient for phosphoribosylaminoimidazole carboxylase that were generated by mutagenesis. As a selectable marker, we isolated and characterized the S. occidentalis ADE2 gene by complementation in an ade2 strain of Saccharomyces cerevisiae. S. occidentalis was transformed with the recombinant plasmid pADE, consisting of a 4.5-kilobase-pair (kbp) DNA fragment from S. occidentalis containing the ADE2 gene inserted into the S. cerevisiae expression vector pYcDE8 by a modification of the spheroplasting procedure of Beggs. Intact plasmidsmore » were recovered in Escherichia coli from whole-cell lysates of ADE+ transformants, indicating that plasmids were replicating autonomously. High-molecular-mass species of pADE2 were found by Southern hybridization analysis of intact genomic DNA preparations. The shift to higher molecular mass of these plasmids during electrophoresis in the presence ethidium bromide after exposure to shortwave UV suggests that they exist in a supercoiled form in the transformed host. Subclones of the 4.5-kbp insert indicated that ADE2-complementing activity and sequences conferring autonomous replication in S. occidentalis were located within a 2.7-kbp EcoRI-SphI fragment. Plasmids containing this region cloned into the bacterial vector pUC19 complemented ade2 mutants of S. occidentalis with efficiencies identical to those of the original plasmid pADE.« less

Boundary particle method for Laplace transformed time fractional diffusion equations

NASA Astrophysics Data System (ADS)

Fu, Zhuo-Jia; Chen, Wen; Yang, Hai-Tian

2013-02-01

This paper develops a novel boundary meshless approach, Laplace transformed boundary particle method (LTBPM), for numerical modeling of time fractional diffusion equations. It implements Laplace transform technique to obtain the corresponding time-independent inhomogeneous equation in Laplace space and then employs a truly boundary-only meshless boundary particle method (BPM) to solve this Laplace-transformed problem. Unlike the other boundary discretization methods, the BPM does not require any inner nodes, since the recursive composite multiple reciprocity technique (RC-MRM) is used to convert the inhomogeneous problem into the higher-order homogeneous problem. Finally, the Stehfest numerical inverse Laplace transform (NILT) is implemented to retrieve the numerical solutions of time fractional diffusion equations from the corresponding BPM solutions. In comparison with finite difference discretization, the LTBPM introduces Laplace transform and Stehfest NILT algorithm to deal with time fractional derivative term, which evades costly convolution integral calculation in time fractional derivation approximation and avoids the effect of time step on numerical accuracy and stability. Consequently, it can effectively simulate long time-history fractional diffusion systems. Error analysis and numerical experiments demonstrate that the present LTBPM is highly accurate and computationally efficient for 2D and 3D time fractional diffusion equations.

A method to perform a fast fourier transform with primitive image transformations.

PubMed

Sheridan, Phil

2007-05-01

The Fourier transform is one of the most important transformations in image processing. A major component of this influence comes from the ability to implement it efficiently on a digital computer. This paper describes a new methodology to perform a fast Fourier transform (FFT). This methodology emerges from considerations of the natural physical constraints imposed by image capture devices (camera/eye). The novel aspects of the specific FFT method described include: 1) a bit-wise reversal re-grouping operation of the conventional FFT is replaced by the use of lossless image rotation and scaling and 2) the usual arithmetic operations of complex multiplication are replaced with integer addition. The significance of the FFT presented in this paper is introduced by extending a discrete and finite image algebra, named Spiral Honeycomb Image Algebra (SHIA), to a continuous version, named SHIAC.

Multispectral multisensor image fusion using wavelet transforms

USGS Publications Warehouse

Lemeshewsky, George P.

1999-01-01

Fusion techniques can be applied to multispectral and higher spatial resolution panchromatic images to create a composite image that is easier to interpret than the individual images. Wavelet transform-based multisensor, multiresolution fusion (a type of band sharpening) was applied to Landsat thematic mapper (TM) multispectral and coregistered higher resolution SPOT panchromatic images. The objective was to obtain increased spatial resolution, false color composite products to support the interpretation of land cover types wherein the spectral characteristics of the imagery are preserved to provide the spectral clues needed for interpretation. Since the fusion process should not introduce artifacts, a shift invariant implementation of the discrete wavelet transform (SIDWT) was used. These results were compared with those using the shift variant, discrete wavelet transform (DWT). Overall, the process includes a hue, saturation, and value color space transform to minimize color changes, and a reported point-wise maximum selection rule to combine transform coefficients. The performance of fusion based on the SIDWT and DWT was evaluated with a simulated TM 30-m spatial resolution test image and a higher resolution reference. Simulated imagery was made by blurring higher resolution color-infrared photography with the TM sensors' point spread function. The SIDWT based technique produced imagery with fewer artifacts and lower error between fused images and the full resolution reference. Image examples with TM and SPOT 10-m panchromatic illustrate the reduction in artifacts due to the SIDWT based fusion.

U.S. Army Transformation Towards a Brigade-Centric Model: Lessons Learned for the Spanish Army

DTIC Science & Technology

2009-06-12

students at the U.S. Army War College. These essays consider the nature and direction of Transformation, and define its concept. It is far beyond the...Century Transformation of the U.S. Armed Forces”, he [SecDef Rumsfeld] gave a lyrical account of the “transformational battle” of Mazar-e-Sharif, the

Constrained signal reconstruction from wavelet transform coefficients

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brislawn, C.M.

1991-12-31

A new method is introduced for reconstructing a signal from an incomplete sampling of its Discrete Wavelet Transform (DWT). The algorithm yields a minimum-norm estimate satisfying a priori upper and lower bounds on the signal. The method is based on a finite-dimensional representation theory for minimum-norm estimates of bounded signals developed by R.E. Cole. Cole`s work has its origins in earlier techniques of maximum-entropy spectral estimation due to Lang and McClellan, which were adapted by Steinhardt, Goodrich and Roberts for minimum-norm spectral estimation. Cole`s extension of their work provides a representation for minimum-norm estimates of a class of generalized transformsmore » in terms of general correlation data (not just DFT`s of autocorrelation lags, as in spectral estimation). One virtue of this great generality is that it includes the inverse DWT. 20 refs.« less

Real-time frequency-to-time mapping based on spectrally-discrete chromatic dispersion.

PubMed

Dai, Yitang; Li, Jilong; Zhang, Ziping; Yin, Feifei; Li, Wangzhe; Xu, Kun

2017-07-10

Traditional photonics-assisted real-time Fourier transform (RTFT) usually suffers from limited chromatic dispersion, huge volume, or large time delay and attendant loss. In this paper we propose frequency-to-time mapping (FTM) by spectrally-discrete dispersion to increase frequency sensitivity greatly. The novel media has periodic ON/OFF intensity frequency response while quadratic phase distribution along disconnected channels, which de-chirps matched optical input to repeated Fourier-transform-limited output. Real-time FTM is then obtained within each period. Since only discrete phase retardation rather than continuously-changed true time delay is required, huge equivalent dispersion is then available by compact device. Such FTM is theoretically analyzed, and implementation by cascaded optical ring resonators is proposed. After a numerical example, our theory is demonstrated by a proof-of-concept experiment, where a single loop containing 0.5-meters-long fiber is used. FTM under 400-MHz unambiguous bandwidth and 25-MHz resolution is reported. Highly-sensitive and linear mapping is achieved with 6.25 ps/MHz, equivalent to ~4.6 × 10 4 -km standard single mode fiber. Extended instantaneous bandwidth is expected by ring cascading. Our proposal may provide a promising method for real-time, low-latency Fourier transform.

Weight-lattice discretization of Weyl-orbit functions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hrivnák, Jiří, E-mail: jiri.hrivnak@fjfi.cvut.cz, E-mail: walton@uleth.ca; Walton, Mark A., E-mail: jiri.hrivnak@fjfi.cvut.cz, E-mail: walton@uleth.ca

Weyl-orbit functions have been defined for each simple Lie algebra, and permit Fourier-like analysis on the fundamental region of the corresponding affine Weyl group. They have also been discretized, using a refinement of the coweight lattice, so that digitized data on the fundamental region can be Fourier-analyzed. The discretized orbit function has arguments that are redundant if related by the affine Weyl group, while its labels, the Weyl-orbit representatives, invoke the dual affine Weyl group. Here we discretize the orbit functions in a novel way, by using the weight lattice. A cleaner theory results with symmetry between the arguments andmore » labels of the discretized orbit functions. Orthogonality of the new discretized orbit functions is proved, and leads to the construction of unitary, symmetric matrices with Weyl-orbit-valued elements. For one type of orbit function, the matrix coincides with the Kac-Peterson modular S matrix, important for Wess-Zumino-Novikov-Witten conformal field theory.« less

Weight-lattice discretization of Weyl-orbit functions

NASA Astrophysics Data System (ADS)

Hrivnák, Jiří; Walton, Mark A.

2016-08-01

Weyl-orbit functions have been defined for each simple Lie algebra, and permit Fourier-like analysis on the fundamental region of the corresponding affine Weyl group. They have also been discretized, using a refinement of the coweight lattice, so that digitized data on the fundamental region can be Fourier-analyzed. The discretized orbit function has arguments that are redundant if related by the affine Weyl group, while its labels, the Weyl-orbit representatives, invoke the dual affine Weyl group. Here we discretize the orbit functions in a novel way, by using the weight lattice. A cleaner theory results with symmetry between the arguments and labels of the discretized orbit functions. Orthogonality of the new discretized orbit functions is proved, and leads to the construction of unitary, symmetric matrices with Weyl-orbit-valued elements. For one type of orbit function, the matrix coincides with the Kac-Peterson modular S matrix, important for Wess-Zumino-Novikov-Witten conformal field theory.

Boundaries, kinetic properties, and final domain structure of plane discrete uniform Poisson-Voronoi tessellations with von Neumann neighborhoods.

PubMed

Korobov, A

2009-03-01

Discrete random tessellations appear not infrequently in describing nucleation and growth transformations. Generally, several non-Euclidean metrics are possible in this case. Previously [A. Korobov, Phys. Rev. B 76, 085430 (2007)] continual analogs of such tessellations have been studied. Here one of the simplest discrete varieties of the Kolmogorov-Johnson-Mehl-Avrami model, namely, the model with von Neumann neighborhoods, has been examined per se, i.e., without continualization. The tessellation is uniform in the sense that domain boundaries consist of tiles. Similarities and distinctions between discrete and continual models are discussed.

Discrete spacetime, quantum walks, and relativistic wave equations

NASA Astrophysics Data System (ADS)

Mlodinow, Leonard; Brun, Todd A.

2018-04-01

It has been observed that quantum walks on regular lattices can give rise to wave equations for relativistic particles in the continuum limit. In this paper, we define the three-dimensional discrete-time walk as a product of three coined one-dimensional walks. The factor corresponding to each one-dimensional walk involves two projection operators that act on an internal coin space; each projector is associated with either the "forward" or "backward" direction in that physical dimension. We show that the simple requirement that there is no preferred axis or direction along an axis—that is, that the walk be symmetric under parity transformations and steps along different axes of the cubic lattice be uncorrelated—leads, in the case of the simplest solution, to the requirement that the continuum limit of the walk is fully Lorentz-invariant. We show further that, in the case of a massive particle, this symmetry requirement necessitates the use of a four-dimensional internal space (as in the Dirac equation). The "coin flip" operation is generated by the parity transformation on the internal coin space, while the differences of the projection operators associated with each dimension must all anticommute. Finally, we discuss the leading correction to the continuum limit, and the possibility of distinguishing through experiment between the discrete random walk and the continuum-based Dirac equation as a description of fermion dynamics.

Discrete Trials Teaching

ERIC Educational Resources Information Center

Ghezzi, Patrick M.

2007-01-01

The advantages of emphasizing discrete trials "teaching" over discrete trials "training" are presented first, followed by a discussion of discrete trials as a method of teaching that emerged historically--and as a matter of necessity for difficult learners such as those with autism--from discrete trials as a method for laboratory research. The…

Modified symplectic schemes with nearly-analytic discrete operators for acoustic wave simulations

NASA Astrophysics Data System (ADS)

Liu, Shaolin; Yang, Dinghui; Lang, Chao; Wang, Wenshuai; Pan, Zhide

2017-04-01

Using a structure-preserving algorithm significantly increases the computational efficiency of solving wave equations. However, only a few explicit symplectic schemes are available in the literature, and the capabilities of these symplectic schemes have not been sufficiently exploited. Here, we propose a modified strategy to construct explicit symplectic schemes for time advance. The acoustic wave equation is transformed into a Hamiltonian system. The classical symplectic partitioned Runge-Kutta (PRK) method is used for the temporal discretization. Additional spatial differential terms are added to the PRK schemes to form the modified symplectic methods and then two modified time-advancing symplectic methods with all of positive symplectic coefficients are then constructed. The spatial differential operators are approximated by nearly-analytic discrete (NAD) operators, and we call the fully discretized scheme modified symplectic nearly analytic discrete (MSNAD) method. Theoretical analyses show that the MSNAD methods exhibit less numerical dispersion and higher stability limits than conventional methods. Three numerical experiments are conducted to verify the advantages of the MSNAD methods, such as their numerical accuracy, computational cost, stability, and long-term calculation capability.

On the time-weighted quadratic sum of linear discrete systems

NASA Technical Reports Server (NTRS)

Jury, E. I.; Gutman, S.

1975-01-01

A method is proposed for obtaining the time-weighted quadratic sum for linear discrete systems. The formula of the weighted quadratic sum is obtained from matrix z-transform formulation. In addition, it is shown that this quadratic sum can be derived in a recursive form for several useful weighted functions. The discussion presented parallels that of MacFarlane (1963) for weighted quadratic integral for linear continuous systems.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Purvine, Emilie AH; Monson, Kyle E.; Jurrus, Elizabeth R.

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which verticesmore » (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.« less

Jack Mezirow's Conceptualisation of Adult Transformative Learning: A Review

ERIC Educational Resources Information Center

Calleja, Colin

2014-01-01

This paper traces the evolution of Jack Mezirow's transformative learning theory and its conceptualisation. It discusses the three major influences, namely Thomas Khun's philosophical conception of paradigm, Freire's conception of conscientisation and consciousness growth, and Habermas' domains of learning and the discussion of…

Cell shape characterization and classification with discrete Fourier transforms and self-organizing maps.

PubMed

Kriegel, Fabian L; Köhler, Ralf; Bayat-Sarmadi, Jannike; Bayerl, Simon; Hauser, Anja E; Niesner, Raluca; Luch, Andreas; Cseresnyes, Zoltan

2018-03-01

Cells in their natural environment often exhibit complex kinetic behavior and radical adjustments of their shapes. This enables them to accommodate to short- and long-term changes in their surroundings under physiological and pathological conditions. Intravital multi-photon microscopy is a powerful tool to record this complex behavior. Traditionally, cell behavior is characterized by tracking the cells' movements, which yields numerous parameters describing the spatiotemporal characteristics of cells. Cells can be classified according to their tracking behavior using all or a subset of these kinetic parameters. This categorization can be supported by the a priori knowledge of experts. While such an approach provides an excellent starting point for analyzing complex intravital imaging data, faster methods are required for automated and unbiased characterization. In addition to their kinetic behavior, the 3D shape of these cells also provide essential clues about the cells' status and functionality. New approaches that include the study of cell shapes as well may also allow the discovery of correlations amongst the track- and shape-describing parameters. In the current study, we examine the applicability of a set of Fourier components produced by Discrete Fourier Transform (DFT) as a tool for more efficient and less biased classification of complex cell shapes. By carrying out a number of 3D-to-2D projections of surface-rendered cells, the applied method reduces the more complex 3D shape characterization to a series of 2D DFTs. The resulting shape factors are used to train a Self-Organizing Map (SOM), which provides an unbiased estimate for the best clustering of the data, thereby characterizing groups of cells according to their shape. We propose and demonstrate that such shape characterization is a powerful addition to, or a replacement for kinetic analysis. This would make it especially useful in situations where live kinetic imaging is less practical or not

An Analog Circuit Approximation of the Discrete Wavelet Transform for Ultra Low Power Signal Processing in Wearable Sensor Nodes

PubMed Central

Casson, Alexander J.

2015-01-01

Ultra low power signal processing is an essential part of all sensor nodes, and particularly so in emerging wearable sensors for biomedical applications. Analog signal processing has an important role in these low power, low voltage, low frequency applications, and there is a key drive to decrease the power consumption of existing analog domain signal processing and to map more signal processing approaches into the analog domain. This paper presents an analog domain signal processing circuit which approximates the output of the Discrete Wavelet Transform (DWT) for use in ultra low power wearable sensors. Analog filters are used for the DWT filters and it is demonstrated how these generate analog domain DWT-like information that embeds information from Butterworth and Daubechies maximally flat mother wavelet responses. The Analog DWT is realised in hardware via gmC circuits, designed to operate from a 1.3 V coin cell battery, and provide DWT-like signal processing using under 115 nW of power when implemented in a 0.18 μm CMOS process. Practical examples demonstrate the effective use of the new Analog DWT on ECG (electrocardiogram) and EEG (electroencephalogram) signals recorded from humans. PMID:26694414

An Analog Circuit Approximation of the Discrete Wavelet Transform for Ultra Low Power Signal Processing in Wearable Sensor Nodes.

PubMed

Casson, Alexander J

2015-12-17

Ultra low power signal processing is an essential part of all sensor nodes, and particularly so in emerging wearable sensors for biomedical applications. Analog signal processing has an important role in these low power, low voltage, low frequency applications, and there is a key drive to decrease the power consumption of existing analog domain signal processing and to map more signal processing approaches into the analog domain. This paper presents an analog domain signal processing circuit which approximates the output of the Discrete Wavelet Transform (DWT) for use in ultra low power wearable sensors. Analog filters are used for the DWT filters and it is demonstrated how these generate analog domain DWT-like information that embeds information from Butterworth and Daubechies maximally flat mother wavelet responses. The Analog DWT is realised in hardware via g(m)C circuits, designed to operate from a 1.3 V coin cell battery, and provide DWT-like signal processing using under 115 nW of power when implemented in a 0.18 μm CMOS process. Practical examples demonstrate the effective use of the new Analog DWT on ECG (electrocardiogram) and EEG (electroencephalogram) signals recorded from humans.

Discrete Wavelet Transform-Based Whole-Spectral and Subspectral Analysis for Improved Brain Tumor Clustering Using Single Voxel MR Spectroscopy.

PubMed

Yang, Guang; Nawaz, Tahir; Barrick, Thomas R; Howe, Franklyn A; Slabaugh, Greg

2015-12-01

Many approaches have been considered for automatic grading of brain tumors by means of pattern recognition with magnetic resonance spectroscopy (MRS). Providing an improved technique which can assist clinicians in accurately identifying brain tumor grades is our main objective. The proposed technique, which is based on the discrete wavelet transform (DWT) of whole-spectral or subspectral information of key metabolites, combined with unsupervised learning, inspects the separability of the extracted wavelet features from the MRS signal to aid the clustering. In total, we included 134 short echo time single voxel MRS spectra (SV MRS) in our study that cover normal controls, low grade and high grade tumors. The combination of DWT-based whole-spectral or subspectral analysis and unsupervised clustering achieved an overall clustering accuracy of 94.8% and a balanced error rate of 7.8%. To the best of our knowledge, it is the first study using DWT combined with unsupervised learning to cluster brain SV MRS. Instead of dimensionality reduction on SV MRS or feature selection using model fitting, our study provides an alternative method of extracting features to obtain promising clustering results.

Theory of the Lattice Boltzmann Equation: Symmetry properties of Discrete Velocity Sets

NASA Technical Reports Server (NTRS)

Rubinstein, Robert; Luo, Li-Shi

2007-01-01

In the lattice Boltzmann equation, continuous particle velocity space is replaced by a finite dimensional discrete set. The number of linearly independent velocity moments in a lattice Boltzmann model cannot exceed the number of discrete velocities. Thus, finite dimensionality introduces linear dependencies among the moments that do not exist in the exact continuous theory. Given a discrete velocity set, it is important to know to exactly what order moments are free of these dependencies. Elementary group theory is applied to the solution of this problem. It is found that by decomposing the velocity set into subsets that transform among themselves under an appropriate symmetry group, it becomes relatively straightforward to assess the behavior of moments in the theory. The construction of some standard two- and three-dimensional models is reviewed from this viewpoint, and procedures for constructing some new higher dimensional models are suggested.

Principles of Discrete Time Mechanics

NASA Astrophysics Data System (ADS)

Jaroszkiewicz, George

2014-04-01

1. Introduction; 2. The physics of discreteness; 3. The road to calculus; 4. Temporal discretization; 5. Discrete time dynamics architecture; 6. Some models; 7. Classical cellular automata; 8. The action sum; 9. Worked examples; 10. Lee's approach to discrete time mechanics; 11. Elliptic billiards; 12. The construction of system functions; 13. The classical discrete time oscillator; 14. Type 2 temporal discretization; 15. Intermission; 16. Discrete time quantum mechanics; 17. The quantized discrete time oscillator; 18. Path integrals; 19. Quantum encoding; 20. Discrete time classical field equations; 21. The discrete time Schrodinger equation; 22. The discrete time Klein-Gordon equation; 23. The discrete time Dirac equation; 24. Discrete time Maxwell's equations; 25. The discrete time Skyrme model; 26. Discrete time quantum field theory; 27. Interacting discrete time scalar fields; 28. Space, time and gravitation; 29. Causality and observation; 30. Concluding remarks; Appendix A. Coherent states; Appendix B. The time-dependent oscillator; Appendix C. Quaternions; Appendix D. Quantum registers; References; Index.

Police investigations: discretion denied yet undeniably exercised

PubMed Central

Belur, J.; Tilley, N.; Osrin, D.; Daruwalla, N.; Kumar, M.; Tiwari, V.

2014-01-01

Police investigations involve determining whether a crime has been committed, and if so what type of crime, who has committed it and whether there is the evidence to charge the perpetrators. Drawing on fieldwork in Delhi and Mumbai, this paper explores how police investigations unfolded in the specific context of women’s deaths by burning in India. In particular, it focuses on the use of discretion despite its denial by those exercising it. In India, there are distinctive statutes relating to women’s suspicious deaths, reflecting the widespread expectation that the bride’s family will pay a dowry to the groom’s family and the tensions to which this may on occasion give rise in the early years of a marriage. Often, there are conflicting claims influencing how the woman’s death is classified. These in turn affect police investigation. The nature and direction of police discretion in investigating women’s deaths by burning reflect in part the unique nature of the legislation and the particular sensitivities in relation to these types of death. They also highlight processes that are liable to be at work in any crime investigation. It was found that police officers exercised unacknowledged discretion at seven specific points in the investigative process, with potentially significant consequences for the achievement of just outcomes: first response, recording the victim’s ‘dying declaration’, inquest, registering of the ‘First Information Report’, collecting evidence, arrest and framing of the charges. PMID:26376482

Consistent Discretization and Canonical, Classical and Quantum Regge Calculus

NASA Astrophysics Data System (ADS)

Gambini, Rodolfo; Pullin, Jorge

We apply the "consistent discretization" technique to the Regge action for (Euclidean and Lorentzian) general relativity in arbitrary number of dimensions. The result is a well-defined canonical theory that is free of constraints and where the dynamics is implemented as a canonical transformation. In the Lorentzian case, the framework appears to be naturally free of the "spikes" that plague traditional formulations. It also provides a well-defined recipe for determining the integration measure for quantum Regge calculus.

Enhancement of the Wear Particle Monitoring Capability of Oil Debris Sensors Using a Maximal Overlap Discrete Wavelet Transform with Optimal Decomposition Depth

PubMed Central

Li, Chuan; Peng, Juan; Liang, Ming

2014-01-01

Oil debris sensors are effective tools to monitor wear particles in lubricants. For in situ applications, surrounding noise and vibration interferences often distort the oil debris signature of the sensor. Hence extracting oil debris signatures from sensor signals is a challenging task for wear particle monitoring. In this paper we employ the maximal overlap discrete wavelet transform (MODWT) with optimal decomposition depth to enhance the wear particle monitoring capability. The sensor signal is decomposed by the MODWT into different depths for detecting the wear particle existence. To extract the authentic particle signature with minimal distortion, the root mean square deviation of kurtosis value of the segmented signal residue is adopted as a criterion to obtain the optimal decomposition depth for the MODWT. The proposed approach is evaluated using both simulated and experimental wear particles. The results show that the present method can improve the oil debris monitoring capability without structural upgrade requirements. PMID:24686730

Enhancement of the wear particle monitoring capability of oil debris sensors using a maximal overlap discrete wavelet transform with optimal decomposition depth.

PubMed

Li, Chuan; Peng, Juan; Liang, Ming

2014-03-28

Oil debris sensors are effective tools to monitor wear particles in lubricants. For in situ applications, surrounding noise and vibration interferences often distort the oil debris signature of the sensor. Hence extracting oil debris signatures from sensor signals is a challenging task for wear particle monitoring. In this paper we employ the maximal overlap discrete wavelet transform (MODWT) with optimal decomposition depth to enhance the wear particle monitoring capability. The sensor signal is decomposed by the MODWT into different depths for detecting the wear particle existence. To extract the authentic particle signature with minimal distortion, the root mean square deviation of kurtosis value of the segmented signal residue is adopted as a criterion to obtain the optimal decomposition depth for the MODWT. The proposed approach is evaluated using both simulated and experimental wear particles. The results show that the present method can improve the oil debris monitoring capability without structural upgrade requirements.

Wheat mill stream properties for discrete element method modeling

USDA-ARS?s Scientific Manuscript database

A discrete phase approach based on individual wheat kernel characteristics is needed to overcome the limitations of previous statistical models and accurately predict the milling behavior of wheat. As a first step to develop a discrete element method (DEM) model for the wheat milling process, this s...

The Analysis of Eigenstates of a Few Generalized Quantum Baker’s Maps Using Hadamard and Related Transforms

NASA Astrophysics Data System (ADS)

Meenakshisundaram, N.

Application of the Hadamard and related transforms on a few generalized quantum baker’s maps have been studied. Effectiveness of the Hadamard transform and a new transform which combines the Fourier and the Hadamard transforms, for simplifying the eigenstates or resonances of the quantization of a few generalized baker’s map namely tetradic baker and lazy baker’s map when the Hilbert space dimension is power of 2 has been done by comparing the participation ratios in the transformed basis with respect to the position basis. Several special family of states based on their maximal compression in either Hadamard transform or the new transform are identified and they are related to the ubiquitous Thue-Morse and allied sequences. Evidence is provided that these special family of states as well as average over all eigenstates exhibits multifractal nature.

The short time Fourier transform and local signals

NASA Astrophysics Data System (ADS)

Okumura, Shuhei

In this thesis, I examine the theoretical properties of the short time discrete Fourier transform (STFT). The STFT is obtained by applying the Fourier transform by a fixed-sized, moving window to input series. We move the window by one time point at a time, so we have overlapping windows. I present several theoretical properties of the STFT, applied to various types of complex-valued, univariate time series inputs, and their outputs in closed forms. In particular, just like the discrete Fourier transform, the STFT's modulus time series takes large positive values when the input is a periodic signal. One main point is that a white noise time series input results in the STFT output being a complex-valued stationary time series and we can derive the time and time-frequency dependency structure such as the cross-covariance functions. Our primary focus is the detection of local periodic signals. I present a method to detect local signals by computing the probability that the squared modulus STFT time series has consecutive large values exceeding some threshold after one exceeding observation following one observation less than the threshold. We discuss a method to reduce the computation of such probabilities by the Box-Cox transformation and the delta method, and show that it works well in comparison to the Monte Carlo simulation method.

Far-field radiation patterns of aperture antennas by the Winograd Fourier transform algorithm

NASA Technical Reports Server (NTRS)

Heisler, R.

1978-01-01

A more time-efficient algorithm for computing the discrete Fourier transform, the Winograd Fourier transform (WFT), is described. The WFT algorithm is compared with other transform algorithms. Results indicate that the WFT algorithm in antenna analysis appears to be a very successful application. Significant savings in cpu time will improve the computer turn around time and circumvent the need to resort to weekend runs.

A fast complex integer convolution using a hybrid transform

NASA Technical Reports Server (NTRS)

Reed, I. S.; K Truong, T.

1978-01-01

It is shown that the Winograd transform can be combined with a complex integer transform over the Galois field GF(q-squared) to yield a new algorithm for computing the discrete cyclic convolution of complex number points. By this means a fast method for accurately computing the cyclic convolution of a sequence of complex numbers for long convolution lengths can be obtained. This new hybrid algorithm requires fewer multiplications than previous algorithms.

Direct Connection between the RII Chain and the Nonautonomous Discrete Modified KdV Lattice

NASA Astrophysics Data System (ADS)

Maeda, Kazuki; Tsujimoto, Satoshi

2013-11-01

The spectral transformation technique for symmetric RII polynomials is developed. Use of this technique reveals that the nonautonomous discrete modified KdV (nd-mKdV) lattice is directly connected with the RII chain. Hankel determinant solutions to the semi-infinite nd-mKdV lattice are also presented.

Numerical Integration Techniques for Curved-Element Discretizations of Molecule–Solvent Interfaces

PubMed Central

Bardhan, Jaydeep P.; Altman, Michael D.; Willis, David J.; Lippow, Shaun M.; Tidor, Bruce; White, Jacob K.

2012-01-01

Surface formulations of biophysical modeling problems offer attractive theoretical and computational properties. Numerical simulations based on these formulations usually begin with discretization of the surface under consideration; often, the surface is curved, possessing complicated structure and possibly singularities. Numerical simulations commonly are based on approximate, rather than exact, discretizations of these surfaces. To assess the strength of the dependence of simulation accuracy on the fidelity of surface representation, we have developed methods to model several important surface formulations using exact surface discretizations. Following and refining Zauhar’s work (J. Comp.-Aid. Mol. Des. 9:149-159, 1995), we define two classes of curved elements that can exactly discretize the van der Waals, solvent-accessible, and solvent-excluded (molecular) surfaces. We then present numerical integration techniques that can accurately evaluate nonsingular and singular integrals over these curved surfaces. After validating the exactness of the surface discretizations and demonstrating the correctness of the presented integration methods, we present a set of calculations that compare the accuracy of approximate, planar-triangle-based discretizations and exact, curved-element-based simulations of surface-generalized-Born (sGB), surface-continuum van der Waals (scvdW), and boundary-element method (BEM) electrostatics problems. Results demonstrate that continuum electrostatic calculations with BEM using curved elements, piecewise-constant basis functions, and centroid collocation are nearly ten times more accurate than planartriangle BEM for basis sets of comparable size. The sGB and scvdW calculations give exceptional accuracy even for the coarsest obtainable discretized surfaces. The extra accuracy is attributed to the exact representation of the solute–solvent interface; in contrast, commonly used planar-triangle discretizations can only offer improved

On the consistency between nearest-neighbor peridynamic discretizations and discretized classical elasticity models

DOE PAGES

Seleson, Pablo; Du, Qiang; Parks, Michael L.

2016-08-16

The peridynamic theory of solid mechanics is a nonlocal reformulation of the classical continuum mechanics theory. At the continuum level, it has been demonstrated that classical (local) elasticity is a special case of peridynamics. Such a connection between these theories has not been extensively explored at the discrete level. This paper investigates the consistency between nearest-neighbor discretizations of linear elastic peridynamic models and finite difference discretizations of the Navier–Cauchy equation of classical elasticity. While nearest-neighbor discretizations in peridynamics have been numerically observed to present grid-dependent crack paths or spurious microcracks, this paper focuses on a different, analytical aspect of suchmore » discretizations. We demonstrate that, even in the absence of cracks, such discretizations may be problematic unless a proper selection of weights is used. Specifically, we demonstrate that using the standard meshfree approach in peridynamics, nearest-neighbor discretizations do not reduce, in general, to discretizations of corresponding classical models. We study nodal-based quadratures for the discretization of peridynamic models, and we derive quadrature weights that result in consistency between nearest-neighbor discretizations of peridynamic models and discretized classical models. The quadrature weights that lead to such consistency are, however, model-/discretization-dependent. We motivate the choice of those quadrature weights through a quadratic approximation of displacement fields. The stability of nearest-neighbor peridynamic schemes is demonstrated through a Fourier mode analysis. Finally, an approach based on a normalization of peridynamic constitutive constants at the discrete level is explored. This approach results in the desired consistency for one-dimensional models, but does not work in higher dimensions. The results of the work presented in this paper suggest that even though nearest

Cd–cysteine precursor nanowire templated microwave-assisted transformation route to CdS nanotubes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, Xiao-Lin, E-mail: liu_x_l@sina.cn; Zhu, Ying-Jie; Zhang, Qian

2012-12-15

Graphical abstract: Cadmium sulfide polycrystalline nanotubes have been successfully synthesized by microwave-assisted transformation method using Cd–cysteine precursor nanowires as the source material and template in ethylene glycol at 160 °C or ethanol at 60 °C. Display Omitted Highlights: ► Cd–cysteine precursor nanowires were successfully synthesized in alkaline solution. ► CdS nanotubes were prepared by templated microwave-assisted transformation method. ► CdS nanotubes can well duplicate the size and morphology of precursor nanowires. ► This method has the advantages of the simplicity and low cost. -- Abstract: We report the Cd–cysteine precursor nanowire templated microwave-assisted transformation route to CdS nanotubes. In thismore » method, the Cd–cysteine precursor nanowires are synthesized using CdCl{sub 2}·2.5H{sub 2}O, L-cysteine and ethanolamine in water at room temperature. The Cd–cysteine precursor nanowires are used as the source material and template for the subsequent preparation of CdS nanotubes by a microwave-assisted transformation method using ethylene glycol or ethanol as the solvent. This method has the advantages of the simplicity and low cost, and may be extended to the synthesis of nanotubes of other compounds. The products are characterized by X-ray powder diffraction (XRD), scanning electron microscopy (SEM) and transmission electron microscopy (TEM).« less

Frequency Band Analysis of Electrocardiogram (ECG) Signals for Human Emotional State Classification Using Discrete Wavelet Transform (DWT).

PubMed

Murugappan, Murugappan; Murugappan, Subbulakshmi; Zheng, Bong Siao

2013-07-01

[Purpose] Intelligent emotion assessment systems have been highly successful in a variety of applications, such as e-learning, psychology, and psycho-physiology. This study aimed to assess five different human emotions (happiness, disgust, fear, sadness, and neutral) using heart rate variability (HRV) signals derived from an electrocardiogram (ECG). [Subjects] Twenty healthy university students (10 males and 10 females) with a mean age of 23 years participated in this experiment. [Methods] All five emotions were induced by audio-visual stimuli (video clips). ECG signals were acquired using 3 electrodes and were preprocessed using a Butterworth 3rd order filter to remove noise and baseline wander. The Pan-Tompkins algorithm was used to derive the HRV signals from ECG. Discrete wavelet transform (DWT) was used to extract statistical features from the HRV signals using four wavelet functions: Daubechies6 (db6), Daubechies7 (db7), Symmlet8 (sym8), and Coiflet5 (coif5). The k-nearest neighbor (KNN) and linear discriminant analysis (LDA) were used to map the statistical features into corresponding emotions. [Results] KNN provided the maximum average emotion classification rate compared to LDA for five emotions (sadness - 50.28%; happiness - 79.03%; fear - 77.78%; disgust - 88.69%; and neutral - 78.34%). [Conclusion] The results of this study indicate that HRV may be a reliable indicator of changes in the emotional state of subjects and provides an approach to the development of a real-time emotion assessment system with a higher reliability than other systems.

Multidimensional, mapping-based complex wavelet transforms.

PubMed

Fernandes, Felix C A; van Spaendonck, Rutger L C; Burrus, C Sidney

2005-01-01

Although the discrete wavelet transform (DWT) is a powerful tool for signal and image processing, it has three serious disadvantages: shift sensitivity, poor directionality, and lack of phase information. To overcome these disadvantages, we introduce multidimensional, mapping-based, complex wavelet transforms that consist of a mapping onto a complex function space followed by a DWT of the complex mapping. Unlike other popular transforms that also mitigate DWT shortcomings, the decoupled implementation of our transforms has two important advantages. First, the controllable redundancy of the mapping stage offers a balance between degree of shift sensitivity and transform redundancy. This allows us to create a directional, nonredundant, complex wavelet transform with potential benefits for image coding systems. To the best of our knowledge, no other complex wavelet transform is simultaneously directional and nonredundant. The second advantage of our approach is the flexibility to use any DWT in the transform implementation. As an example, we exploit this flexibility to create the complex double-density DWT: a shift-insensitive, directional, complex wavelet transform with a low redundancy of (3M - 1)/(2M - 1) in M dimensions. No other transform achieves all these properties at a lower redundancy, to the best of our knowledge. By exploiting the advantages of our multidimensional, mapping-based complex wavelet transforms in seismic signal-processing applications, we have demonstrated state-of-the-art results.

100 Gb/s optical discrete multi-tone transceivers for intra- and inter-datacenter networks

NASA Astrophysics Data System (ADS)

Okabe, Ryo; Tanaka, Toshiki; Nishihara, Masato; Kai, Yutaka; Takahara, Tomoo; Liu, Bo; Li, Lei; Tao, Zhenning; Rasmussen, Jens C.

2016-03-01

Discrete multi-tone (DMT) technology is an attractive modulation technology for short-reach application due to its high spectral efficiency and simple configuration. In this paper, we first explain the features of DMT technology then discuss the impact of fiber dispersion and chirp on the frequency responses of the DMT signal and the importance in the relationship between chirp and the optical transmission band. Next, we explain our experiments of 100-Gb/s DMT transmission of 10 km in the O-band using directly modulated lasers for low-cost application. In an inter-datacenter network of more than several tens of kilometers, fiber dispersion mainly limits system performance. We also discuss our experiment of 100-Gb/s DMT transmission up to 100 km in the C-band without a dispersion compensator by using vestigial sideband spectrum shaping and nonlinear compensation.

Local discretization method for overdamped Brownian motion on a potential with multiple deep wells.

PubMed

Nguyen, P T T; Challis, K J; Jack, M W

2016-11-01

We present a general method for transforming the continuous diffusion equation describing overdamped Brownian motion on a time-independent potential with multiple deep wells to a discrete master equation. The method is based on an expansion in localized basis states of local metastable potentials that match the full potential in the region of each potential well. Unlike previous basis methods for discretizing Brownian motion on a potential, this approach is valid for periodic potentials with varying multiple deep wells per period and can also be applied to nonperiodic systems. We apply the method to a range of potentials and find that potential wells that are deep compared to five times the thermal energy can be associated with a discrete localized state while shallower wells are better incorporated into the local metastable potentials of neighboring deep potential wells.

Local discretization method for overdamped Brownian motion on a potential with multiple deep wells

NASA Astrophysics Data System (ADS)

Nguyen, P. T. T.; Challis, K. J.; Jack, M. W.

2016-11-01

We present a general method for transforming the continuous diffusion equation describing overdamped Brownian motion on a time-independent potential with multiple deep wells to a discrete master equation. The method is based on an expansion in localized basis states of local metastable potentials that match the full potential in the region of each potential well. Unlike previous basis methods for discretizing Brownian motion on a potential, this approach is valid for periodic potentials with varying multiple deep wells per period and can also be applied to nonperiodic systems. We apply the method to a range of potentials and find that potential wells that are deep compared to five times the thermal energy can be associated with a discrete localized state while shallower wells are better incorporated into the local metastable potentials of neighboring deep potential wells.

Discrete structures in continuum descriptions of defective crystals.

PubMed

Parry, G P

2016-04-28

I discuss various mathematical constructions that combine together to provide a natural setting for discrete and continuum geometric models of defective crystals. In particular, I provide a quite general list of 'plastic strain variables', which quantifies inelastic behaviour, and exhibit rigorous connections between discrete and continuous mathematical structures associated with crystalline materials that have a correspondingly general constitutive specification. © 2016 The Author(s).

Excitation of Continuous and Discrete Modes in Incompressible Boundary Layers

NASA Technical Reports Server (NTRS)

Ashpis, David E.; Reshotko, Eli

1998-01-01

This report documents the full details of the condensed journal article by Ashpis & Reshotko (JFM, 1990) entitled "The Vibrating Ribbon Problem Revisited." A revised formal solution of the vibrating ribbon problem of hydrodynamic stability is presented. The initial formulation of Gaster (JFM, 1965) is modified by application of the Briggs method and a careful treatment of the complex double Fourier transform inversions. Expressions are obtained in a natural way for the discrete spectrum as well as for the four branches of the continuous spectra. These correspond to discrete and branch-cut singularities in the complex wave-number plane. The solutions from the continuous spectra decay both upstream and downstream of the ribbon, with the decay in the upstream direction being much more rapid than that in the downstream direction. Comments and clarification of related prior work are made.

Illustrating chaos: a schematic discretization of the general three-body problem in Newtonian gravity

NASA Astrophysics Data System (ADS)

Leigh, Nathan W. C.; Wegsman, Shalma

2018-05-01

We present a formalism for constructing schematic diagrams to depict chaotic three-body interactions in Newtonian gravity. This is done by decomposing each interaction into a series of discrete transformations in energy- and angular momentum-space. Each time a transformation is applied, the system changes state as the particles re-distribute their energy and angular momenta. These diagrams have the virtue of containing all of the quantitative information needed to fully characterize most bound or unbound interactions through time and space, including the total duration of the interaction, the initial and final stable states in addition to every intervening temporary meta-stable state. As shown via an illustrative example for the bound case, prolonged excursions of one of the particles, which by far dominates the computational cost of the simulations, are reduced to a single discrete transformation in energy- and angular momentum-space, thereby potentially mitigating any computational expense. We further generalize our formalism to sequences of (unbound) three-body interactions, as occur in dense stellar environments during binary hardening. Finally, we provide a method for dynamically evolving entire populations of binaries via three-body scattering interactions, using a purely analytic formalism. In principle, the techniques presented here are adaptable to other three-body problems that conserve energy and angular momentum.

FPGA-based smart sensor for drought stress detection in tomato plants using novel physiological variables and discrete wavelet transform.

PubMed

Duarte-Galvan, Carlos; Romero-Troncoso, Rene de J; Torres-Pacheco, Irineo; Guevara-Gonzalez, Ramon G; Fernandez-Jaramillo, Arturo A; Contreras-Medina, Luis M; Carrillo-Serrano, Roberto V; Millan-Almaraz, Jesus R

2014-10-09

Soil drought represents one of the most dangerous stresses for plants. It impacts the yield and quality of crops, and if it remains undetected for a long time, the entire crop could be lost. However, for some plants a certain amount of drought stress improves specific characteristics. In such cases, a device capable of detecting and quantifying the impact of drought stress in plants is desirable. This article focuses on testing if the monitoring of physiological process through a gas exchange methodology provides enough information to detect drought stress conditions in plants. The experiment consists of using a set of smart sensors based on Field Programmable Gate Arrays (FPGAs) to monitor a group of plants under controlled drought conditions. The main objective was to use different digital signal processing techniques such as the Discrete Wavelet Transform (DWT) to explore the response of plant physiological processes to drought. Also, an index-based methodology was utilized to compensate the spatial variation inside the greenhouse. As a result, differences between treatments were determined to be independent of climate variations inside the greenhouse. Finally, after using the DWT as digital filter, results demonstrated that the proposed system is capable to reject high frequency noise and to detect drought conditions.

The Coordinate Transformation Method of High Resolution dem Data

NASA Astrophysics Data System (ADS)

Yan, Chaode; Guo, Wang; Li, Aimin

2018-04-01

Coordinate transformation methods of DEM data can be divided into two categories. One reconstruct based on original vector elevation data. The other transforms DEM data blocks by transforming parameters. But the former doesn't work in the absence of original vector data, and the later may cause errors at joint places between adjoining blocks of high resolution DEM data. In view of this problem, a method dealing with high resolution DEM data coordinate transformation is proposed. The method transforms DEM data into discrete vector elevation points, and then adjusts positions of points by bi-linear interpolation respectively. Finally, a TIN is generated by transformed points, and the new DEM data in target coordinate system is reconstructed based on TIN. An algorithm which can find blocks and transform automatically is given in this paper. The method is tested in different terrains and proved to be feasible and valid.

Robust preview control for a class of uncertain discrete-time systems with time-varying delay.

PubMed

Li, Li; Liao, Fucheng

2018-02-01

This paper proposes a concept of robust preview tracking control for uncertain discrete-time systems with time-varying delay. Firstly, a model transformation is employed for an uncertain discrete system with time-varying delay. Then, the auxiliary variables related to the system state and input are introduced to derive an augmented error system that includes future information on the reference signal. This leads to the tracking problem being transformed into a regulator problem. Finally, for the augmented error system, a sufficient condition of asymptotic stability is derived and the preview controller design method is proposed based on the scaled small gain theorem and linear matrix inequality (LMI) technique. The method proposed in this paper not only solves the difficulty problem of applying the difference operator to the time-varying matrices but also simplifies the structure of the augmented error system. The numerical simulation example also illustrates the effectiveness of the results presented in the paper. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Discrete mode laser diodes for FTTH/PON applications up to 10 Gbit/s

NASA Astrophysics Data System (ADS)

O'Carroll, John; Phelan, Richard; Kelly, Brian; Byrne, Diarmuid; Latkowski, Sylwester; Anandarajah, Prince M.; Barry, Liam P.

2012-06-01

Discrete Mode Laser Diodes (DMLDs) present an economic approach with a focus on high volume manufacturability of single mode lasers using a single step fabrication process. We report on a DMLD designed for operation in the 1550 nm window with high Side Mode Suppression Ratio (SMSR) over a wide temperature tuning range of -20 °C < T < 95 °C. Direct modulation rates as high as 10 Gbit/s are demonstrated at both 1550 nm and 1310 nm. Transmission experiments were also carried out over single mode fibre at both wavelengths. Using dispersion pre-compensation transmission from 0 to 60 km is demonstrated at 1550 nm with a maximum power penalty measured at 60 km of 3.6 dB.

Transformative Learning: Reader's Guide

ERIC Educational Resources Information Center

Chang, Bo

2017-01-01

Mezirow's (1978) transformative learning was influenced by Kuhn's (1962) paradigm and Freire's (1970) emancipatory learning. In this paper, the author provides readers a clear guide about the main components of transformative learning: Experience, critical reflection, and rational discourse. The author emphasizes that experience in transformative…

Polynomial compensation, inversion, and approximation of discrete time linear systems

NASA Technical Reports Server (NTRS)

Baram, Yoram

1987-01-01

The least-squares transformation of a discrete-time multivariable linear system into a desired one by convolving the first with a polynomial system yields optimal polynomial solutions to the problems of system compensation, inversion, and approximation. The polynomial coefficients are obtained from the solution to a so-called normal linear matrix equation, whose coefficients are shown to be the weighting patterns of certain linear systems. These, in turn, can be used in the recursive solution of the normal equation.

Discrete Variational Approach for Modeling Laser-Plasma Interactions

NASA Astrophysics Data System (ADS)

Reyes, J. Paxon; Shadwick, B. A.

2014-10-01

The traditional approach for fluid models of laser-plasma interactions begins by approximating fields and derivatives on a grid in space and time, leading to difference equations that are manipulated to create a time-advance algorithm. In contrast, by introducing the spatial discretization at the level of the action, the resulting Euler-Lagrange equations have particular differencing approximations that will exactly satisfy discrete versions of the relevant conservation laws. For example, applying a spatial discretization in the Lagrangian density leads to continuous-time, discrete-space equations and exact energy conservation regardless of the spatial grid resolution. We compare the results of two discrete variational methods using the variational principles from Chen and Sudan and Brizard. Since the fluid system conserves energy and momentum, the relative errors in these conserved quantities are well-motivated physically as figures of merit for a particular method. This work was supported by the U. S. Department of Energy under Contract No. DE-SC0008382 and by the National Science Foundation under Contract No. PHY-1104683.

Hierarchical coarse-graining transform.

PubMed

Pancaldi, Vera; King, Peter R; Christensen, Kim

2009-03-01

We present a hierarchical transform that can be applied to Laplace-like differential equations such as Darcy's equation for single-phase flow in a porous medium. A finite-difference discretization scheme is used to set the equation in the form of an eigenvalue problem. Within the formalism suggested, the pressure field is decomposed into an average value and fluctuations of different kinds and at different scales. The application of the transform to the equation allows us to calculate the unknown pressure with a varying level of detail. A procedure is suggested to localize important features in the pressure field based only on the fine-scale permeability, and hence we develop a form of adaptive coarse graining. The formalism and method are described and demonstrated using two synthetic toy problems.

Transform coding for space applications

NASA Technical Reports Server (NTRS)

Glover, Daniel

1993-01-01

Data compression coding requirements for aerospace applications differ somewhat from the compression requirements for entertainment systems. On the one hand, entertainment applications are bit rate driven with the goal of getting the best quality possible with a given bandwidth. Science applications are quality driven with the goal of getting the lowest bit rate for a given level of reconstruction quality. In the past, the required quality level has been nothing less than perfect allowing only the use of lossless compression methods (if that). With the advent of better, faster, cheaper missions, an opportunity has arisen for lossy data compression methods to find a use in science applications as requirements for perfect quality reconstruction runs into cost constraints. This paper presents a review of the data compression problem from the space application perspective. Transform coding techniques are described and some simple, integer transforms are presented. The application of these transforms to space-based data compression problems is discussed. Integer transforms have an advantage over conventional transforms in computational complexity. Space applications are different from broadcast or entertainment in that it is desirable to have a simple encoder (in space) and tolerate a more complicated decoder (on the ground) rather than vice versa. Energy compaction with new transforms are compared with the Walsh-Hadamard (WHT), Discrete Cosine (DCT), and Integer Cosine (ICT) transforms.

Optimal Discrete Spatial Compression for Beamspace Massive MIMO Signals

NASA Astrophysics Data System (ADS)

Jiang, Zhiyuan; Zhou, Sheng; Niu, Zhisheng

2018-05-01

Deploying massive number of antennas at the base station side can boost the cellular system performance dramatically. Meanwhile, it however involves significant additional radio-frequency (RF) front-end complexity, hardware cost and power consumption. To address this issue, the beamspace-multiple-input-multiple-output (beamspace-MIMO) based approach is considered as a promising solution. In this paper, we first show that the traditional beamspace-MIMO suffers from spatial power leakage and imperfect channel statistics estimation. A beam combination module is hence proposed, which consists of a small number (compared with the number of antenna elements) of low-resolution (possibly one-bit) digital (discrete) phase shifters after the beamspace transformation to further compress the beamspace signal dimensionality, such that the number of RF chains can be reduced beyond beamspace transformation and beam selection. The optimum discrete beam combination weights for the uplink are obtained based on the branch-and-bound (BB) approach. The key to the BB-based solution is to solve the embodied sub-problem, whose solution is derived in a closed-form. Based on the solution, a sequential greedy beam combination scheme with linear-complexity (w.r.t. the number of beams in the beamspace) is proposed. Link-level simulation results based on realistic channel models and long-term-evolution (LTE) parameters are presented which show that the proposed schemes can reduce the number of RF chains by up to $25\\%$ with a one-bit digital phase-shifter-network.

An LMI approach to design H(infinity) controllers for discrete-time nonlinear systems based on unified models.

PubMed

Liu, Meiqin; Zhang, Senlin

2008-10-01

A unified neural network model termed standard neural network model (SNNM) is advanced. Based on the robust L(2) gain (i.e. robust H(infinity) performance) analysis of the SNNM with external disturbances, a state-feedback control law is designed for the SNNM to stabilize the closed-loop system and eliminate the effect of external disturbances. The control design constraints are shown to be a set of linear matrix inequalities (LMIs) which can be easily solved by various convex optimization algorithms (e.g. interior-point algorithms) to determine the control law. Most discrete-time recurrent neural network (RNNs) and discrete-time nonlinear systems modelled by neural networks or Takagi and Sugeno (T-S) fuzzy models can be transformed into the SNNMs to be robust H(infinity) performance analyzed or robust H(infinity) controller synthesized in a unified SNNM's framework. Finally, some examples are presented to illustrate the wide application of the SNNMs to the nonlinear systems, and the proposed approach is compared with related methods reported in the literature.

Discrete wavelet transform and energy eigen value for rotor bars fault detection in variable speed field-oriented control of induction motor drive.

PubMed

Ameid, Tarek; Menacer, Arezki; Talhaoui, Hicham; Azzoug, Youness

2018-05-03

This paper presents a methodology for the broken rotor bars fault detection is considered when the rotor speed varies continuously and the induction machine is controlled by Field-Oriented Control (FOC). The rotor fault detection is obtained by analyzing a several mechanical and electrical quantities (i.e., rotor speed, stator phase current and output signal of the speed regulator) by the Discrete Wavelet Transform (DWT) in variable speed drives. The severity of the fault is obtained by stored energy calculation for active power signal. Hence, it can be a useful solution as fault indicator. The FOC is implemented in order to preserve a good performance speed control; to compensate the broken rotor bars effect in the mechanical speed and to ensure the operation continuity and to investigate the fault effect in the variable speed. The effectiveness of the technique is evaluated in simulation and in a real-time implementation by using Matlab/Simulink with the real-time interface (RTI) based on dSpace 1104 board. Copyright © 2018. Published by Elsevier Ltd.

Phase recovery in temporal speckle pattern interferometry using the generalized S-transform.

PubMed

Federico, Alejandro; Kaufmann, Guillermo H

2008-04-15

We propose a novel approach based on the generalized S-transform to retrieve optical phase distributions in temporal speckle pattern interferometry. The performance of the proposed approach is compared with those given by well-known techniques based on the continuous wavelet, the Hilbert transforms, and a smoothed time-frequency distribution by analyzing interferometric data degraded by noise, nonmodulating pixels, and modulation loss. The advantages and limitations of the proposed phase retrieval approach are discussed.

Coronary arteries segmentation based on the 3D discrete wavelet transform and 3D neutrosophic transform.

PubMed

Chen, Shuo-Tsung; Wang, Tzung-Dau; Lee, Wen-Jeng; Huang, Tsai-Wei; Hung, Pei-Kai; Wei, Cheng-Yu; Chen, Chung-Ming; Kung, Woon-Man

2015-01-01

Most applications in the field of medical image processing require precise estimation. To improve the accuracy of segmentation, this study aimed to propose a novel segmentation method for coronary arteries to allow for the automatic and accurate detection of coronary pathologies. The proposed segmentation method included 2 parts. First, 3D region growing was applied to give the initial segmentation of coronary arteries. Next, the location of vessel information, HHH subband coefficients of the 3D DWT, was detected by the proposed vessel-texture discrimination algorithm. Based on the initial segmentation, 3D DWT integrated with the 3D neutrosophic transformation could accurately detect the coronary arteries. Each subbranch of the segmented coronary arteries was segmented correctly by the proposed method. The obtained results are compared with those ground truth values obtained from the commercial software from GE Healthcare and the level-set method proposed by Yang et al., 2007. Results indicate that the proposed method is better in terms of efficiency analyzed. Based on the initial segmentation of coronary arteries obtained from 3D region growing, one-level 3D DWT and 3D neutrosophic transformation can be applied to detect coronary pathologies accurately.

Analyzing neuronal networks using discrete-time dynamics

NASA Astrophysics Data System (ADS)

Ahn, Sungwoo; Smith, Brian H.; Borisyuk, Alla; Terman, David

2010-05-01

We develop mathematical techniques for analyzing detailed Hodgkin-Huxley like models for excitatory-inhibitory neuronal networks. Our strategy for studying a given network is to first reduce it to a discrete-time dynamical system. The discrete model is considerably easier to analyze, both mathematically and computationally, and parameters in the discrete model correspond directly to parameters in the original system of differential equations. While these networks arise in many important applications, a primary focus of this paper is to better understand mechanisms that underlie temporally dynamic responses in early processing of olfactory sensory information. The models presented here exhibit several properties that have been described for olfactory codes in an insect’s Antennal Lobe. These include transient patterns of synchronization and decorrelation of sensory inputs. By reducing the model to a discrete system, we are able to systematically study how properties of the dynamics, including the complex structure of the transients and attractors, depend on factors related to connectivity and the intrinsic and synaptic properties of cells within the network.

Using discrete wavelet transform features to discriminate between noise and phases in seismic waveforms

NASA Astrophysics Data System (ADS)

Forrest, R.; Ray, J.; Hansen, C. W.

2017-12-01

Currently, simple polarization metrics such as the horizontal-to-vertical ratio are used to discriminate between noise and various phases in three-component seismic waveform data collected at regional distances. Accurately establishing the identity and arrival of these waves in adverse signal-to-noise environments is helpful in detecting and locating the seismic events. In this work, we explore the use of multiresolution decompositions to discriminate between noise and event arrivals. A segment of the waveform lying inside a time-window that spans the coda of an arrival is subjected to a discrete wavelet decomposition. Multi-resolution classification features as well as statistical tests are derived from these wavelet decomposition quantities to quantify their discriminating power. Furthermore, we move to streaming data and address the problem of false positives by introducing ensembles of classifiers. We describe in detail results of these methods tuned from data obtained from Coronel Fontana, Argentina (CFAA), as well as Stephens Creek, Australia (STKA). Acknowledgement: Sandia National Laboratories is a multi-mission laboratory managed and operated by National Technology and Engineering Solutions of Sandia, LLC., a wholly owned subsidiary of Honeywell International, Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA-0003525.

Distributed consensus for discrete-time heterogeneous multi-agent systems

NASA Astrophysics Data System (ADS)

Zhao, Huanyu; Fei, Shumin

2018-06-01

This paper studies the consensus problem for a class of discrete-time heterogeneous multi-agent systems. Two kinds of consensus algorithms will be considered. The heterogeneous multi-agent systems considered are converted into equivalent error systems by a model transformation. Then we analyse the consensus problem of the original systems by analysing the stability problem of the error systems. Some sufficient conditions for consensus of heterogeneous multi-agent systems are obtained by applying algebraic graph theory and matrix theory. Simulation examples are presented to show the usefulness of the results.

Novel morphology change of Au-Methotrexate conjugates: From nanochains to discrete nanoparticles.

PubMed

Wang, Wei-Yuan; Zhao, Xiu-Fen; Ju, Xiao-Han; Wang, Yu; Wang, Lin; Li, Shu-Ping; Li, Xiao-Dong

2016-12-30

A novel morphology change of Au-methotrexate (Au-MTX) conjugates that could transform from nanochains to discrete nanoparticles was achieved by a simple, one-pot, and hydrothermal growth method. Herein, MTX was used efficiently as a complex-forming agent, reducing agent, capping agent, and importantly a targeting anticancer drug. The formation mechanism suggested a similarity with the molecular imprinting technology. The Au-MTX complex induced the MTX molecules to selectively adsorb on different crystal facets of gold nanoparticles (AuNPs) and then formed gold nanospheres. Moreover, the abundantly binding MTX molecules promoted directional alignment of these gold nanospheres to further form nanochains. More interestingly, the linear structures gradually changed into discrete nanoparticles by adding different amount of ethylene diamine tetra (methylene phosphonic acid) (EDTMPA) into the initial reaction solution, which likely arose from the strong electrostatic effect of the negatively charged phosphonic acid groups. Compared with the as-prepared nanochains, the resultant discrete nanoparticles showed almost equal drug loading capacity but with higher drug release control, colloidal stability, and in vitro anticancer activity. Copyright © 2016 Elsevier B.V. All rights reserved.

First-principles modeling of electromagnetic scattering by discrete and discretely heterogeneous random media

PubMed Central

Mishchenko, Michael I.; Dlugach, Janna M.; Yurkin, Maxim A.; Bi, Lei; Cairns, Brian; Liu, Li; Panetta, R. Lee; Travis, Larry D.; Yang, Ping; Zakharova, Nadezhda T.

2018-01-01

A discrete random medium is an object in the form of a finite volume of a vacuum or a homogeneous material medium filled with quasi-randomly and quasi-uniformly distributed discrete macroscopic impurities called small particles. Such objects are ubiquitous in natural and artificial environments. They are often characterized by analyzing theoretically the results of laboratory, in situ, or remote-sensing measurements of the scattering of light and other electromagnetic radiation. Electromagnetic scattering and absorption by particles can also affect the energy budget of a discrete random medium and hence various ambient physical and chemical processes. In either case electromagnetic scattering must be modeled in terms of appropriate optical observables, i.e., quadratic or bilinear forms in the field that quantify the reading of a relevant optical instrument or the electromagnetic energy budget. It is generally believed that time-harmonic Maxwell’s equations can accurately describe elastic electromagnetic scattering by macroscopic particulate media that change in time much more slowly than the incident electromagnetic field. However, direct solutions of these equations for discrete random media had been impracticable until quite recently. This has led to a widespread use of various phenomenological approaches in situations when their very applicability can be questioned. Recently, however, a new branch of physical optics has emerged wherein electromagnetic scattering by discrete and discretely heterogeneous random media is modeled directly by using analytical or numerically exact computer solutions of the Maxwell equations. Therefore, the main objective of this Report is to formulate the general theoretical framework of electromagnetic scattering by discrete random media rooted in the Maxwell–Lorentz electromagnetics and discuss its immediate analytical and numerical consequences. Starting from the microscopic Maxwell–Lorentz equations, we trace the development

Higher-order vector discrete rogue-wave states in the coupled Ablowitz-Ladik equations: Exact solutions and stability.

PubMed

Wen, Xiao-Yong; Yan, Zhenya; Malomed, Boris A

2016-12-01

An integrable system of two-component nonlinear Ablowitz-Ladik equations is used to construct complex rogue-wave (RW) solutions in an explicit form. First, the modulational instability of continuous waves is studied in the system. Then, new higher-order discrete two-component RW solutions of the system are found by means of a newly derived discrete version of a generalized Darboux transformation. Finally, the perturbed evolution of these RW states is explored in terms of systematic simulations, which demonstrates that tightly and loosely bound RWs are, respectively, nearly stable and strongly unstable solutions.

Frequency Band Analysis of Electrocardiogram (ECG) Signals for Human Emotional State Classification Using Discrete Wavelet Transform (DWT)

PubMed Central

Murugappan, Murugappan; Murugappan, Subbulakshmi; Zheng, Bong Siao

2013-01-01

[Purpose] Intelligent emotion assessment systems have been highly successful in a variety of applications, such as e-learning, psychology, and psycho-physiology. This study aimed to assess five different human emotions (happiness, disgust, fear, sadness, and neutral) using heart rate variability (HRV) signals derived from an electrocardiogram (ECG). [Subjects] Twenty healthy university students (10 males and 10 females) with a mean age of 23 years participated in this experiment. [Methods] All five emotions were induced by audio-visual stimuli (video clips). ECG signals were acquired using 3 electrodes and were preprocessed using a Butterworth 3rd order filter to remove noise and baseline wander. The Pan-Tompkins algorithm was used to derive the HRV signals from ECG. Discrete wavelet transform (DWT) was used to extract statistical features from the HRV signals using four wavelet functions: Daubechies6 (db6), Daubechies7 (db7), Symmlet8 (sym8), and Coiflet5 (coif5). The k-nearest neighbor (KNN) and linear discriminant analysis (LDA) were used to map the statistical features into corresponding emotions. [Results] KNN provided the maximum average emotion classification rate compared to LDA for five emotions (sadness − 50.28%; happiness − 79.03%; fear − 77.78%; disgust − 88.69%; and neutral − 78.34%). [Conclusion] The results of this study indicate that HRV may be a reliable indicator of changes in the emotional state of subjects and provides an approach to the development of a real-time emotion assessment system with a higher reliability than other systems. PMID:24259846

Discrete transparent boundary conditions for the mixed KDV-BBM equation

NASA Astrophysics Data System (ADS)

Besse, Christophe; Noble, Pascal; Sanchez, David

2017-09-01

In this paper, we consider artificial boundary conditions for the linearized mixed Korteweg-de Vries (KDV) and Benjamin-Bona-Mahoney (BBM) equation which models water waves in the small amplitude, large wavelength regime. Continuous (respectively discrete) artificial boundary conditions involve non local operators in time which in turn requires to compute time convolutions and invert the Laplace transform of an analytic function (respectively the Z-transform of an holomorphic function). In this paper, we propose a new, stable and fairly general strategy to carry out this crucial step in the design of transparent boundary conditions. For large time simulations, we also introduce a methodology based on the asymptotic expansion of coefficients involved in exact direct transparent boundary conditions. We illustrate the accuracy of our methods for Gaussian and wave packets initial data.

Template-free synthesis and structural evolution of discrete hydroxycancrinite zeolite nanorods from high-concentration hydrogels.

PubMed

Chen, Shaojiang; Sorge, Lukas P; Seo, Dong-Kyun

2017-12-07

We report the synthesis and characterization of hydroxycancrinite zeolite nanorods by a simple hydrothermal treatment of aluminosilicate hydrogels at high concentrations of precursors without the use of structure-directing agents. Transmission electron microscopy (TEM) analysis reveals that cancrinite nanorods, with lengths of 200-800 nm and diameters of 30-50 nm, exhibit a hexagonal morphology and are elongated along the crystallographic c direction. The powder X-ray diffraction (PXRD), Fourier transform infrared (FT-IR) and TEM studies revealed sequential events of hydrogel formation, the formation of aggregated sodalite nuclei, the conversion of sodalite to cancrinite and finally the growth of cancrinite nanorods into discrete particles. The aqueous dispersion of the discrete nanorods displays a good stability between pH 6-12 with the zeta potential no greater than -30 mV. The synthesis is unique in that the initial aggregated nanocrystals do not grow into microsized particles (aggregative growth) but into discrete nanorods. Our findings demonstrate an unconventional possibility that discrete zeolite nanocrystals could be produced from a concentrated hydrogel.

Polarization transformation as an algorithm for automatic generalization and quality assessment

NASA Astrophysics Data System (ADS)

Qian, Haizhong; Meng, Liqiu

2007-06-01

Since decades it has been a dream of cartographers to computationally mimic the generalization processes in human brains for the derivation of various small-scale target maps or databases from a large-scale source map or database. This paper addresses in a systematic way the polarization transformation (PT) - a new algorithm that serves both the purpose of automatic generalization of discrete features and the quality assurance. By means of PT, two dimensional point clusters or line networks in the Cartesian system can be transformed into a polar coordinate system, which then can be unfolded as a single spectrum line r = f(α), where r and a stand for the polar radius and the polar angle respectively. After the transformation, the original features will correspond to nodes on the spectrum line delimited between 0° and 360° along the horizontal axis, and between the minimum and maximum polar radius along the vertical axis. Since PT is a lossless transformation, it allows a straighforward analysis and comparison of the original and generalized distributions, thus automatic generalization and quality assurance can be down in this way. Examples illustrate that PT algorithm meets with the requirement of generalization of discrete spatial features and is more scientific.

A novel recursive Fourier transform for nonuniform sampled signals: application to heart rate variability spectrum estimation.

PubMed

Holland, Alexander; Aboy, Mateo

2009-07-01

We present a novel method to iteratively calculate discrete Fourier transforms for discrete time signals with sample time intervals that may be widely nonuniform. The proposed recursive Fourier transform (RFT) does not require interpolation of the samples to uniform time intervals, and each iterative transform update of N frequencies has computational order N. Because of the inherent non-uniformity in the time between successive heart beats, an application particularly well suited for this transform is power spectral density (PSD) estimation for heart rate variability. We compare RFT based spectrum estimation with Lomb-Scargle Transform (LST) based estimation. PSD estimation based on the LST also does not require uniform time samples, but the LST has a computational order greater than Nlog(N). We conducted an assessment study involving the analysis of quasi-stationary signals with various levels of randomly missing heart beats. Our results indicate that the RFT leads to comparable estimation performance to the LST with significantly less computational overhead and complexity for applications requiring iterative spectrum estimations.

The Clemson University, University Research Initiative Program in Discrete Mathematics and Computational Analysis

DTIC Science & Technology

1990-03-01

Assmus, E. F., and J. D. Key, "Affine and projective planes", to appear in Discrete Math (Special Coding Theory Issue). 5. Assumus, E. F. and J. D...S. Locke, ’The subchromatic number of a graph", Discrete Math . 74 (1989)33-49. 24. Hedetniemi, S. T., and T. V. Wimer, "K-terminal recursive families...34Designs and geometries with Cayley", submitted to Journal of Symbolic Computation. 34. Key, J. D., "Regular sets in geometries", Annals of Discrete Math . 37

High voltage isolation transformer

NASA Astrophysics Data System (ADS)

Clatterbuck, C. H.; Ruitberg, A. P.

1985-04-01

A high voltage isolation transformer is provided with primary and secondary coils separated by discrete electrostatic shields from the surfaces of insulating spools on which the coils are wound. The electrostatic shields are formed by coatings of a compound with a low electrical conductivity which completely encase the coils and adhere to the surfaces of the insulating spools adjacent to the coils. Coatings of the compound also line axial bores of the spools, thereby forming electrostatic shields separating the spools from legs of a ferromagnetic core extending through the bores. The transformer is able to isolate a high constant potential applied to one of its coils, without the occurrence of sparking or corona, by coupling the coatings, lining the axial bores to the ferromagnetic core and by coupling one terminal of each coil to the respective coating encasing the coil.

High voltage isolation transformer

NASA Technical Reports Server (NTRS)

Clatterbuck, C. H.; Ruitberg, A. P. (Inventor)

1985-01-01

A high voltage isolation transformer is provided with primary and secondary coils separated by discrete electrostatic shields from the surfaces of insulating spools on which the coils are wound. The electrostatic shields are formed by coatings of a compound with a low electrical conductivity which completely encase the coils and adhere to the surfaces of the insulating spools adjacent to the coils. Coatings of the compound also line axial bores of the spools, thereby forming electrostatic shields separating the spools from legs of a ferromagnetic core extending through the bores. The transformer is able to isolate a high constant potential applied to one of its coils, without the occurrence of sparking or corona, by coupling the coatings, lining the axial bores to the ferromagnetic core and by coupling one terminal of each coil to the respective coating encasing the coil.

Evaluating Pillar Industry’s Transformation Capability: A Case Study of Two Chinese Steel-Based Cities

PubMed Central

Li, Zhidong; Marinova, Dora; Guo, Xiumei; Gao, Yuan

2015-01-01

Many steel-based cities in China were established between the 1950s and 1960s. After more than half a century of development and boom, these cities are starting to decline and industrial transformation is urgently needed. This paper focuses on evaluating the transformation capability of resource-based cities building an evaluation model. Using Text Mining and the Document Explorer technique as a way of extracting text features, the 200 most frequently used words are derived from 100 publications related to steel- and other resource-based cities. The Expert Evaluation Method (EEM) and Analytic Hierarchy Process (AHP) techniques are then applied to select 53 indicators, determine their weights and establish an index system for evaluating the transformation capability of the pillar industry of China’s steel-based cities. Using real data and expert reviews, the improved Fuzzy Relation Matrix (FRM) method is applied to two case studies in China, namely Panzhihua and Daye, and the evaluation model is developed using Fuzzy Comprehensive Evaluation (FCE). The cities’ abilities to carry out industrial transformation are evaluated with concerns expressed for the case of Daye. The findings have policy implications for the potential and required industrial transformation in the two selected cities and other resource-based towns. PMID:26422266

Continuum modeling of the mechanical and thermal behavior of discrete large structures

NASA Technical Reports Server (NTRS)

Nayfeh, A. H.; Hefzy, M. S.

1980-01-01

In the present paper we introduce a rather straightforward construction procedure in order to derive continuum equivalence of discrete truss-like repetitive structures. Once the actual structure is specified, the construction procedure can be outlined by the following three steps: (a) all sets of parallel members are identified, (b) unidirectional 'effective continuum' properties are derived for each of these sets and (c) orthogonal transformations are finally used to determine the contribution of each set to the 'overall effective continuum' properties of the structure. Here the properties includes mechanical (stiffnesses), thermal (coefficients of thermal expansions) and material densities. Once expanded descriptions of the steps (b) and (c) are done, the construction procedure will be applied to a wide variety of discrete structures and the results will be compared with those of other existing methods.

Universal discrete Fourier optics RF photonic integrated circuit architecture.

PubMed

Hall, Trevor J; Hasan, Mehedi

2016-04-04

This paper describes a coherent electro-optic circuit architecture that generates a frequency comb consisting of N spatially separated orders using a generalised Mach-Zenhder interferometer (MZI) with its N × 1 combiner replaced by an optical N × N Discrete Fourier Transform (DFT). Advantage may be taken of the tight optical path-length control, component and circuit symmetries and emerging trimming algorithms offered by photonic integration in any platform that offers linear electro-optic phase modulation such as LiNbO_3, silicon, III-V or hybrid technology. The circuit architecture subsumes all MZI-based RF photonic circuit architectures in the prior art given an appropriate choice of output port(s) and dimension N although the principal application envisaged is phase correlated subcarrier generation for all optical orthogonal frequency division multiplexing. A transfer matrix approach is used to model the operation of the architecture. The predictions of the model are validated by simulations performed using an industry standard software tool. Implementation is found to be practical.

Cellular angiofibroma with atypia or sarcomatous transformation: clinicopathologic analysis of 13 cases.

PubMed

Chen, Eleanor; Fletcher, Christopher D M

2010-05-01

Cellular angiofibroma is a mesenchymal neoplasm that is characterized by a bland spindle cell component, morphologically reminiscent of spindle cell lipoma, and thick-walled vessels. The tumor occurs equally in men and women and usually arises in the inguino-scrotal or vulvovaginal regions. An earlier study of 51 cases from our group showed that the tumor follows a benign course without any tendency for recurrence. In 1 case, an intralesional microscopic nodule of pleomorphic liposarcoma was observed. The biologic significance of atypia or sarcomatous transformation in cellular angiofibroma remains uncertain. In this study, we characterized clinicopathologic features in 13 cases of cellular angiofibroma with morphologic atypia or sarcomatous transformation. Thirteen cases with atypia or sarcomatous transformation among 154 usual cellular angiofibromas identified between 1993 and 2009 were retrieved from consultation files. There were 12 females and 1 male ranging in age from 39 to 71 years (median age, 46 y). Tumor size ranged from 1.2 to 7.5 cm. In 11 cases, the tumors occurred in the vulva. One case each occurred in the paratesticular and hip regions. Most tumors were located in subcutaneous tissue. There were 4 cases of cellular angiofibroma with atypia. Three showed severely atypical cells as scattered foci within the cellular angiofibroma. One case showed a discrete nodule of atypical cells. There were 9 cases of cellular angiofibroma with morphologic features of sarcomatous transformation. In each case, abrupt transition to a discrete sarcomatous component was seen. Of these 9 cases, the sarcomatous component in 2 cases showed features of pleomorphic liposarcoma with multivacuolated lipoblasts readily identified. Three of these 9 cases showed discrete nodule(s) closely resembling atypical lipomatous tumor within usual cellular angiofibroma. In the remaining 4 cases, the sarcomatous component was composed of pleomorphic spindle cells arranged in various

Feature Detection and Curve Fitting Using Fast Walsh Transforms for Shock Tracking: Applications

NASA Technical Reports Server (NTRS)

Gnoffo, Peter A.

2017-01-01

Walsh functions form an orthonormal basis set consisting of square waves. Square waves make the system well suited for detecting and representing functions with discontinuities. Given a uniform distribution of 2p cells on a one-dimensional element, it has been proven that the inner product of the Walsh Root function for group p with every polynomial of degree < or = (p - 1) across the element is identically zero. It has also been proven that the magnitude and location of a discontinuous jump, as represented by a Heaviside function, are explicitly identified by its Fast Walsh Transform (FWT) coefficients. These two proofs enable an algorithm that quickly provides a Weighted Least Squares fit to distributions across the element that include a discontinuity. The detection of a discontinuity enables analytic relations to locally describe its evolution and provide increased accuracy. Time accurate examples are provided for advection, Burgers equation, and Riemann problems (diaphragm burst) in closed tubes and de Laval nozzles. New algorithms to detect up to two C0 and/or C1 discontinuities within a single element are developed for application to the Riemann problem, in which a contact discontinuity and shock wave form after the diaphragm bursts.

A flexible nonlinear diffusion acceleration method for the S N transport equations discretized with discontinuous finite elements

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schunert, Sebastian; Wang, Yaqi; Gleicher, Frederick

This paper presents a flexible nonlinear diffusion acceleration (NDA) method that discretizes both the S N transport equation and the diffusion equation using the discontinuous finite element method (DFEM). The method is flexible in that the diffusion equation can be discretized on a coarser mesh with the only restriction that it is nested within the transport mesh and the FEM shape function orders of the two equations can be different. The consistency of the transport and diffusion solutions at convergence is defined by using a projection operator mapping the transport into the diffusion FEM space. The diffusion weak form ismore » based on the modified incomplete interior penalty (MIP) diffusion DFEM discretization that is extended by volumetric drift, interior face, and boundary closure terms. In contrast to commonly used coarse mesh finite difference (CMFD) methods, the presented NDA method uses a full FEM discretized diffusion equation for acceleration. Suitable projection and prolongation operators arise naturally from the FEM framework. Via Fourier analysis and numerical experiments for a one-group, fixed source problem the following properties of the NDA method are established for structured quadrilateral meshes: (1) the presented method is unconditionally stable and effective in the presence of mild material heterogeneities if the same mesh and identical shape functions either of the bilinear or biquadratic type are used, (2) the NDA method remains unconditionally stable in the presence of strong heterogeneities, (3) the NDA method with bilinear elements extends the range of effectiveness and stability by a factor of two when compared to CMFD if a coarser diffusion mesh is selected. In addition, the method is tested for solving the C5G7 multigroup, eigenvalue problem using coarse and fine mesh acceleration. Finally, while NDA does not offer an advantage over CMFD for fine mesh acceleration, it reduces the iteration count required for convergence by almost

A flexible nonlinear diffusion acceleration method for the S N transport equations discretized with discontinuous finite elements

DOE PAGES

Schunert, Sebastian; Wang, Yaqi; Gleicher, Frederick; ...

2017-02-21

This paper presents a flexible nonlinear diffusion acceleration (NDA) method that discretizes both the S N transport equation and the diffusion equation using the discontinuous finite element method (DFEM). The method is flexible in that the diffusion equation can be discretized on a coarser mesh with the only restriction that it is nested within the transport mesh and the FEM shape function orders of the two equations can be different. The consistency of the transport and diffusion solutions at convergence is defined by using a projection operator mapping the transport into the diffusion FEM space. The diffusion weak form ismore » based on the modified incomplete interior penalty (MIP) diffusion DFEM discretization that is extended by volumetric drift, interior face, and boundary closure terms. In contrast to commonly used coarse mesh finite difference (CMFD) methods, the presented NDA method uses a full FEM discretized diffusion equation for acceleration. Suitable projection and prolongation operators arise naturally from the FEM framework. Via Fourier analysis and numerical experiments for a one-group, fixed source problem the following properties of the NDA method are established for structured quadrilateral meshes: (1) the presented method is unconditionally stable and effective in the presence of mild material heterogeneities if the same mesh and identical shape functions either of the bilinear or biquadratic type are used, (2) the NDA method remains unconditionally stable in the presence of strong heterogeneities, (3) the NDA method with bilinear elements extends the range of effectiveness and stability by a factor of two when compared to CMFD if a coarser diffusion mesh is selected. In addition, the method is tested for solving the C5G7 multigroup, eigenvalue problem using coarse and fine mesh acceleration. Finally, while NDA does not offer an advantage over CMFD for fine mesh acceleration, it reduces the iteration count required for convergence by almost

Infinite Conservation Laws, Continuous Symmetries and Invariant Solutions of Some Discrete Integrable Equations

NASA Astrophysics Data System (ADS)

Zhang, Yu-Feng; Zhang, Xiang-Zhi; Dong, Huan-He

2017-12-01

Two new shift operators are introduced for which a few differential-difference equations are generated by applying the R-matrix method. These equations can be reduced to the standard Toda lattice equation and (1+1)-dimensional and (2+1)-dimensional Toda-type equations which have important applications in hydrodynamics, plasma physics, and so on. Based on these consequences, we deduce the Hamiltonian structures of two discrete systems. Finally, we obtain some new infinite conservation laws of two discrete equations and employ Lie-point transformation group to obtain some continuous symmetries and part of invariant solutions for the (1+1) and (2+1)-dimensional Toda-type equations. Supported by the Fundamental Research Funds for the Central University under Grant No. 2017XKZD11

Discrete stochastic analogs of Erlang epidemic models.

PubMed

Getz, Wayne M; Dougherty, Eric R

2018-12-01

Erlang differential equation models of epidemic processes provide more realistic disease-class transition dynamics from susceptible (S) to exposed (E) to infectious (I) and removed (R) categories than the ubiquitous SEIR model. The latter is itself is at one end of the spectrum of Erlang SE[Formula: see text]I[Formula: see text]R models with [Formula: see text] concatenated E compartments and [Formula: see text] concatenated I compartments. Discrete-time models, however, are computationally much simpler to simulate and fit to epidemic outbreak data than continuous-time differential equations, and are also much more readily extended to include demographic and other types of stochasticity. Here we formulate discrete-time deterministic analogs of the Erlang models, and their stochastic extension, based on a time-to-go distributional principle. Depending on which distributions are used (e.g. discretized Erlang, Gamma, Beta, or Uniform distributions), we demonstrate that our formulation represents both a discretization of Erlang epidemic models and generalizations thereof. We consider the challenges of fitting SE[Formula: see text]I[Formula: see text]R models and our discrete-time analog to data (the recent outbreak of Ebola in Liberia). We demonstrate that the latter performs much better than the former; although confining fits to strict SEIR formulations reduces the numerical challenges, but sacrifices best-fit likelihood scores by at least 7%.

Pedestrian detection based on redundant wavelet transform

NASA Astrophysics Data System (ADS)

Huang, Lin; Ji, Liping; Hu, Ping; Yang, Tiejun

2016-10-01

Intelligent video surveillance is to analysis video or image sequences captured by a fixed or mobile surveillance camera, including moving object detection, segmentation and recognition. By using it, we can be notified immediately in an abnormal situation. Pedestrian detection plays an important role in an intelligent video surveillance system, and it is also a key technology in the field of intelligent vehicle. So pedestrian detection has very vital significance in traffic management optimization, security early warn and abnormal behavior detection. Generally, pedestrian detection can be summarized as: first to estimate moving areas; then to extract features of region of interest; finally to classify using a classifier. Redundant wavelet transform (RWT) overcomes the deficiency of shift variant of discrete wavelet transform, and it has better performance in motion estimation when compared to discrete wavelet transform. Addressing the problem of the detection of multi-pedestrian with different speed, we present an algorithm of pedestrian detection based on motion estimation using RWT, combining histogram of oriented gradients (HOG) and support vector machine (SVM). Firstly, three intensities of movement (IoM) are estimated using RWT and the corresponding areas are segmented. According to the different IoM, a region proposal (RP) is generated. Then, the features of a RP is extracted using HOG. Finally, the features are fed into a SVM trained by pedestrian databases and the final detection results are gained. Experiments show that the proposed algorithm can detect pedestrians accurately and efficiently.

Performance Evaluation of Frequency Transform Based Block Classification of Compound Image Segmentation Techniques

NASA Astrophysics Data System (ADS)

Selwyn, Ebenezer Juliet; Florinabel, D. Jemi

2018-04-01

Compound image segmentation plays a vital role in the compression of computer screen images. Computer screen images are images which are mixed with textual, graphical, or pictorial contents. In this paper, we present a comparison of two transform based block classification of compound images based on metrics like speed of classification, precision and recall rate. Block based classification approaches normally divide the compound images into fixed size blocks of non-overlapping in nature. Then frequency transform like Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) are applied over each block. Mean and standard deviation are computed for each 8 × 8 block and are used as features set to classify the compound images into text/graphics and picture/background block. The classification accuracy of block classification based segmentation techniques are measured by evaluation metrics like precision and recall rate. Compound images of smooth background and complex background images containing text of varying size, colour and orientation are considered for testing. Experimental evidence shows that the DWT based segmentation provides significant improvement in recall rate and precision rate approximately 2.3% than DCT based segmentation with an increase in block classification time for both smooth and complex background images.

Numerical integration techniques for curved-element discretizations of molecule-solvent interfaces.

PubMed

Bardhan, Jaydeep P; Altman, Michael D; Willis, David J; Lippow, Shaun M; Tidor, Bruce; White, Jacob K

2007-07-07

Surface formulations of biophysical modeling problems offer attractive theoretical and computational properties. Numerical simulations based on these formulations usually begin with discretization of the surface under consideration; often, the surface is curved, possessing complicated structure and possibly singularities. Numerical simulations commonly are based on approximate, rather than exact, discretizations of these surfaces. To assess the strength of the dependence of simulation accuracy on the fidelity of surface representation, here methods were developed to model several important surface formulations using exact surface discretizations. Following and refining Zauhar's work [J. Comput.-Aided Mol. Des. 9, 149 (1995)], two classes of curved elements were defined that can exactly discretize the van der Waals, solvent-accessible, and solvent-excluded (molecular) surfaces. Numerical integration techniques are presented that can accurately evaluate nonsingular and singular integrals over these curved surfaces. After validating the exactness of the surface discretizations and demonstrating the correctness of the presented integration methods, a set of calculations are presented that compare the accuracy of approximate, planar-triangle-based discretizations and exact, curved-element-based simulations of surface-generalized-Born (sGB), surface-continuum van der Waals (scvdW), and boundary-element method (BEM) electrostatics problems. Results demonstrate that continuum electrostatic calculations with BEM using curved elements, piecewise-constant basis functions, and centroid collocation are nearly ten times more accurate than planar-triangle BEM for basis sets of comparable size. The sGB and scvdW calculations give exceptional accuracy even for the coarsest obtainable discretized surfaces. The extra accuracy is attributed to the exact representation of the solute-solvent interface; in contrast, commonly used planar-triangle discretizations can only offer improved

Flexible Automatic Discretization for Finite Differences: Eliminating the Human Factor

NASA Astrophysics Data System (ADS)

Pranger, Casper

2017-04-01

In the geophysical numerical modelling community, finite differences are (in part due to their small footprint) a popular spatial discretization method for PDEs in the regular-shaped continuum that is the earth. However, they rapidly become prone to programming mistakes when physics increase in complexity. To eliminate opportunities for human error, we have designed an automatic discretization algorithm using Wolfram Mathematica, in which the user supplies symbolic PDEs, the number of spatial dimensions, and a choice of symbolic boundary conditions, and the script transforms this information into matrix- and right-hand-side rules ready for use in a C++ code that will accept them. The symbolic PDEs are further used to automatically develop and perform manufactured solution benchmarks, ensuring at all stages physical fidelity while providing pragmatic targets for numerical accuracy. We find that this procedure greatly accelerates code development and provides a great deal of flexibility in ones choice of physics.

Intelligent Power Swing Detection Scheme to Prevent False Relay Tripping Using S-Transform

NASA Astrophysics Data System (ADS)

Mohamad, Nor Z.; Abidin, Ahmad F.; Musirin, Ismail

2014-06-01

Distance relay design is equipped with out-of-step tripping scheme to ensure correct distance relay operation during power swing. The out-of-step condition is a consequence result from unstable power swing. It requires proper detection of power swing to initiate a tripping signal followed by separation of unstable part from the entire power system. The distinguishing process of unstable swing from stable swing poses a challenging task. This paper presents an intelligent approach to detect power swing based on S-Transform signal processing tool. The proposed scheme is based on the use of S-Transform feature of active power at the distance relay measurement point. It is demonstrated that the proposed scheme is able to detect and discriminate the unstable swing from stable swing occurring in the system. To ascertain validity of the proposed scheme, simulations were carried out with the IEEE 39 bus system and its performance has been compared with the wavelet transform-based power swing detection scheme.

Dynamics and elastic interactions of the discrete multi-dark soliton solutions for the Kaup-Newell lattice equation

NASA Astrophysics Data System (ADS)

Liu, Nan; Wen, Xiao-Yong

2018-03-01

Under consideration in this paper is the Kaup-Newell (KN) lattice equation which is an integrable discretization of the KN equation. Infinitely, many conservation laws and discrete N-fold Darboux transformation (DT) for this system are constructed and established based on its Lax representation. Via the resulting N-fold DT, the discrete multi-dark soliton solutions in terms of determinants are derived from non-vanishing background. Propagation and elastic interaction structures of such solitons are shown graphically. Overtaking interaction phenomena between/among the two, three and four solitons are discussed. Numerical simulations are used to explore their dynamical behaviors of such multi-dark solitons. Numerical results show that their evolutions are stable against a small noise. Results in this paper might be helpful for understanding the propagation of nonlinear Alfvén waves in plasmas.

Discrete exterior calculus discretization of incompressible Navier-Stokes equations over surface simplicial meshes

NASA Astrophysics Data System (ADS)

Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi

2016-05-01

A conservative discretization of incompressible Navier-Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.

PREFACE: 4th Symposium on Prospects in the Physics of Discrete Symmetries (DISCRETE2014)

NASA Astrophysics Data System (ADS)

Di Domenico, Antonio; Mavromatos, Nick E.; Mitsou, Vasiliki A.; Skliros, Dimitri P.

2015-07-01

The DISCRETE 2014: Fourth Symposium in the Physics of Discrete Symmetries took place at King's College London, Strand Campus, London WC2R 2LS, from Tuesday, December 2 2014 till Saturday, December 6 2014. This is the fourth Edition of the DISCRETE conference series, which is a biannual event, having been held previously in Valencia (Discrete'08), Rome (Discrete2010) and Lisbon (Discrete2012). The topics covered at the DISCRETE series of conferences are: T, C, P, CP symmetries; accidental symmetries (B, L conservation); CPT symmetry, decoherence and entangled states, Lorentz symmetry breaking (phenomenology and current bounds); neutrino mass and mixing; implications for cosmology and astroparticle physics, dark matter searches; experimental prospects at LHC, new facilities. In DISCRETE 2014 we have also introduced two new topics: cosmological aspects of non-commutative space-times as well as PT symmetric Hamiltonians (non-Hermitian but with real eigenvalues), a topic that has wide applications in particle physics and beyond. The conference was opened by the King's College London Vice Principal on Research and Innovation, Mr Chris Mottershead, followed by a welcome address by the Chair of DISCRETE 2014 (Professor Nick E. Mavromatos). After these introductory talks, the scientific programme of the DISCRETE 2014 symposium started. Following the tradition of DISCRETE series of conferences, the talks (138 in total) were divided into plenary-review talks (25), invited research talks (50) and shorter presentations (63) — selected by the conveners of each session in consultation with the organisers — from the submitted abstracts. We have been fortunate to have very high-quality, thought stimulating and interesting talks at all levels, which, together with the discussions among the participants, made the conference quite enjoyable. There were 152 registered participants for the event.

Group theoretical methods and wavelet theory: coorbit theory and applications

NASA Astrophysics Data System (ADS)

Feichtinger, Hans G.

2013-05-01

Before the invention of orthogonal wavelet systems by Yves Meyer1 in 1986 Gabor expansions (viewed as discretized inversion of the Short-Time Fourier Transform2 using the overlap and add OLA) and (what is now perceived as) wavelet expansions have been treated more or less at an equal footing. The famous paper on painless expansions by Daubechies, Grossman and Meyer3 is a good example for this situation. The description of atomic decompositions for functions in modulation spaces4 (including the classical Sobolev spaces) given by the author5 was directly modeled according to the corresponding atomic characterizations by Frazier and Jawerth,6, 7 more or less with the idea of replacing the dyadic partitions of unity of the Fourier transform side by uniform partitions of unity (so-called BUPU's, first named as such in the early work on Wiener-type spaces by the author in 19808). Watching the literature in the subsequent two decades one can observe that the interest in wavelets "took over", because it became possible to construct orthonormal wavelet systems with compact support and of any given degree of smoothness,9 while in contrast the Balian-Low theorem is prohibiting the existence of corresponding Gabor orthonormal bases, even in the multi-dimensional case and for general symplectic lattices.10 It is an interesting historical fact that* his construction of band-limited orthonormal wavelets (the Meyer wavelet, see11) grew out of an attempt to prove the impossibility of the existence of such systems, and the final insight was that it was not impossible to have such systems, and in fact quite a variety of orthonormal wavelet system can be constructed as we know by now. Meanwhile it is established wisdom that wavelet theory and time-frequency analysis are two different ways of decomposing signals in orthogonal resp. non-orthogonal ways. The unifying theory, covering both cases, distilling from these two situations the common group theoretical background lead to the

Experimental phase synchronization detection in non-phase coherent chaotic systems by using the discrete complex wavelet approach

NASA Astrophysics Data System (ADS)

Ferreira, Maria Teodora; Follmann, Rosangela; Domingues, Margarete O.; Macau, Elbert E. N.; Kiss, István Z.

2017-08-01

Phase synchronization may emerge from mutually interacting non-linear oscillators, even under weak coupling, when phase differences are bounded, while amplitudes remain uncorrelated. However, the detection of this phenomenon can be a challenging problem to tackle. In this work, we apply the Discrete Complex Wavelet Approach (DCWA) for phase assignment, considering signals from coupled chaotic systems and experimental data. The DCWA is based on the Dual-Tree Complex Wavelet Transform (DT-CWT), which is a discrete transformation. Due to its multi-scale properties in the context of phase characterization, it is possible to obtain very good results from scalar time series, even with non-phase-coherent chaotic systems without state space reconstruction or pre-processing. The method correctly predicts the phase synchronization for a chemical experiment with three locally coupled, non-phase-coherent chaotic processes. The impact of different time-scales is demonstrated on the synchronization process that outlines the advantages of DCWA for analysis of experimental data.

Local gray level S-curve transformation - A generalized contrast enhancement technique for medical images.

PubMed

Gandhamal, Akash; Talbar, Sanjay; Gajre, Suhas; Hani, Ahmad Fadzil M; Kumar, Dileep

2017-04-01

Most medical images suffer from inadequate contrast and brightness, which leads to blurred or weak edges (low contrast) between adjacent tissues resulting in poor segmentation and errors in classification of tissues. Thus, contrast enhancement to improve visual information is extremely important in the development of computational approaches for obtaining quantitative measurements from medical images. In this research, a contrast enhancement algorithm that applies gray-level S-curve transformation technique locally in medical images obtained from various modalities is investigated. The S-curve transformation is an extended gray level transformation technique that results into a curve similar to a sigmoid function through a pixel to pixel transformation. This curve essentially increases the difference between minimum and maximum gray values and the image gradient, locally thereby, strengthening edges between adjacent tissues. The performance of the proposed technique is determined by measuring several parameters namely, edge content (improvement in image gradient), enhancement measure (degree of contrast enhancement), absolute mean brightness error (luminance distortion caused by the enhancement), and feature similarity index measure (preservation of the original image features). Based on medical image datasets comprising 1937 images from various modalities such as ultrasound, mammograms, fluorescent images, fundus, X-ray radiographs and MR images, it is found that the local gray-level S-curve transformation outperforms existing techniques in terms of improved contrast and brightness, resulting in clear and strong edges between adjacent tissues. The proposed technique can be used as a preprocessing tool for effective segmentation and classification of tissue structures in medical images. Copyright © 2017 Elsevier Ltd. All rights reserved.

Acanthite–argentite transformation in nanocrystalline silver sulfide and the Ag{sub 2}S/Ag nanoheterostructure

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gusev, A. I., E-mail: gusev@ihim.uran.ru; Sadovnikov, S. I.

Nanocrystalline acanthite-structured silver sulfide of the monoclinic structure and a Ag{sub 2}S/Ag nanoheterostructure are produced. The high-temperature X-ray diffraction technique is applied to the in situ study of the (acanthite α-Ag{sub 2}S)–(argentite β-Ag{sub 2}S) phase transformation in nanocrystalline silver sulfide. The crystal structure of argentite is refined, and it is found that the content of vacant sites in the metal sublattice of argentite exceeds 92%. A model of a resistive switch, whose operation is based on the reversible acanthite–argentite transformation in a Ag{sub 2}S/Ag heterostructure, is considered.

Development of a Candida glabrata dominant nutritional transformation marker utilizing the Aspergillus nidulans acetamidase gene (amdS).

PubMed

Fu, Jianmin; Blaylock, Morganne; Wickes, Cameron F; Welte, William; Mehrtash, Adrian; Wiederhold, Nathan; Wickes, Brian L

2016-05-01

The gene encoding Aspergillus nidulans acetamidase (amdS) was placed under control of Candida albicans ACT1 promoter and terminator sequences and then cloned into a plasmid containing C. glabrata ARS10,CEN8 or ARS10+CEN8 sequences. All plasmids transformed C. glabrata wild-type cells to acetamide+, with the ARS-only containing plasmid transforming cells at the highest frequencies (>1.0 × 10(4) transformants μg(-1)). Plasmids were rapidly lost under non-selective conditions with the frequency dependent on chromosomal element, thus recycling the acetamide- phenotype. The amdS plasmid was used to transform a set of clinical isolates resistant to a variety of antifungal drugs. All strains were successfully transformed to the acetamide+ phenotype at high frequency, confirming that this plasmid construct could be used as a simple dominant marker on virtually any strain. Gap repair experiments demonstrated that just as in Saccharomyces cerevisiae, gap repair functions efficiently inC. glabrata, suggesting that C. glabrata has numerous similarities toS. cerevisiae with regard to ease of molecular manipulation. The amdS system is inexpensive and efficient, and combined with existing C. glabrata plasmid elements, confers a high transformation frequency for C. glabrata with a phenotype that can be easily recycled. © FEMS 2016. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

TRANSFORMATION

DOE Office of Scientific and Technical Information (OSTI.GOV)

LACKS,S.A.

2003-10-09

Transformation, which alters the genetic makeup of an individual, is a concept that intrigues the human imagination. In Streptococcus pneumoniae such transformation was first demonstrated. Perhaps our fascination with genetics derived from our ancestors observing their own progeny, with its retention and assortment of parental traits, but such interest must have been accelerated after the dawn of agriculture. It was in pea plants that Gregor Mendel in the late 1800s examined inherited traits and found them to be determined by physical elements, or genes, passed from parents to progeny. In our day, the material basis of these genetic determinants wasmore » revealed to be DNA by the lowly bacteria, in particular, the pneumococcus. For this species, transformation by free DNA is a sexual process that enables cells to sport new combinations of genes and traits. Genetic transformation of the type found in S. pneumoniae occurs naturally in many species of bacteria (70), but, initially only a few other transformable species were found, namely, Haemophilus influenzae, Neisseria meningitides, Neisseria gonorrheae, and Bacillus subtilis (96). Natural transformation, which requires a set of genes evolved for the purpose, contrasts with artificial transformation, which is accomplished by shocking cells either electrically, as in electroporation, or by ionic and temperature shifts. Although such artificial treatments can introduce very small amounts of DNA into virtually any type of cell, the amounts introduced by natural transformation are a million-fold greater, and S. pneumoniae can take up as much as 10% of its cellular DNA content (40).« less

On the Discrete Spectrum of the Nonstationary Schrödinger Equation and Multipole Lumps of the Kadomtsev-Petviashvili I Equation

NASA Astrophysics Data System (ADS)

Villarroel, Javier; Ablowitz, Mark J.

The discrete spectrum of the nonstationary Schrödinger equation and localized solutions of the Kadomtsev-Petviashvili-I (KPI) equation are studied via the inverse scattering transform. It is shown that there exist infinitely many real and rationally decaying potentials which correspond to a discrete spectrum whose related eigenfunctions have multiple poles in the spectral parameter. An index or winding number is asssociated with each of these solutions. The resulting localized solutions of KPI behave as collection of individual humps with nonuniform dynamics.

A fast D.F.T. algorithm using complex integer transforms

NASA Technical Reports Server (NTRS)

Reed, I. S.; Truong, T. K.

1978-01-01

Winograd (1976) has developed a new class of algorithms which depend heavily on the computation of a cyclic convolution for computing the conventional DFT (discrete Fourier transform); this new algorithm, for a few hundred transform points, requires substantially fewer multiplications than the conventional FFT algorithm. Reed and Truong have defined a special class of finite Fourier-like transforms over GF(q squared), where q = 2 to the p power minus 1 is a Mersenne prime for p = 2, 3, 5, 7, 13, 17, 19, 31, 61. In the present paper it is shown that Winograd's algorithm can be combined with the aforementioned Fourier-like transform to yield a new algorithm for computing the DFT. A fast method for accurately computing the DFT of a sequence of complex numbers of very long transform-lengths is thus obtained.

Analysis of temperature rise for piezoelectric transformer using finite-element method.

PubMed

Joo, Hyun-Woo; Lee, Chang-Hwan; Rho, Jong-Seok; Jung, Hyun-Kyo

2006-08-01

Analysis of heat problem and temperature field of a piezoelectric transformer, operated at steady-state conditions, is described. The resonance frequency of the transformer is calculated from impedance and electrical gain analysis using a finite-element method. Mechanical displacement and electric potential of the transformer at the calculated resonance frequency are used to calculate the loss distribution of the transformer. Temperature distribution using discretized heat transfer equation is calculated from the obtained losses of the transformer. Properties of the piezoelectric material, dependent on the temperature field, are measured to recalculate the losses, temperature distribution, and new resonance characteristics of the transformer. Iterative method is adopted to recalculate the losses and resonance frequency due to the changes of the material constants from temperature increase. Computed temperature distributions and new resonance characteristics of the transformer at steady-state temperature are verified by comparison with experimental results.

Discrete modelling of drapery systems

NASA Astrophysics Data System (ADS)

Thoeni, Klaus; Giacomini, Anna

2016-04-01

.L., editors. Rockfall: Characterization and Control. Washington, DC: Transportation Research Board, 554-576. Giacomini, A., Thoeni, K., Lambert, C., Booth, S., Sloan, S.W. (2012) Experimental study on rockfall drapery systems for open pit highwalls. International Journal of Rock Mechanics and Mining Sciences 56, 171-181. Šmilauer, V., Catalano, E., Chareyre, B., Dorofenko, S., Duriez, J., Gladky, A., Kozicki, J., Modenese, C., Scholtès, L., Sibille, L., Stránskỳ, J., Thoeni, K. (2010) Yade Documentation. The Yade Project, 1st ed., http://yade-dem.org/doc/. Thoeni, K., Giacomini, A., Lambert, C., Sloan, S.W., Carter, J.P. (2014) A 3D discrete element modelling approach for rockfall analysis with drapery systems. International Journal of Rock Mechanics and Mining Sciences 68, 107-119. Thoeni, K., Lambert, C., Giacomini, A., Sloan, S.W. (2013) Discrete modelling of hexagonal wire meshes with a stochastically distorted contact model. Computers and Geotechnics, 49, 158-69.

Discrete Time Rescaling Theorem: Determining Goodness of Fit for Discrete Time Statistical Models of Neural Spiking

PubMed Central

Haslinger, Robert; Pipa, Gordon; Brown, Emery

2010-01-01

One approach for understanding the encoding of information by spike trains is to fit statistical models and then test their goodness of fit. The time rescaling theorem provides a goodness of fit test consistent with the point process nature of spike trains. The interspike intervals (ISIs) are rescaled (as a function of the model’s spike probability) to be independent and exponentially distributed if the model is accurate. A Kolmogorov Smirnov (KS) test between the rescaled ISIs and the exponential distribution is then used to check goodness of fit. This rescaling relies upon assumptions of continuously defined time and instantaneous events. However spikes have finite width and statistical models of spike trains almost always discretize time into bins. Here we demonstrate that finite temporal resolution of discrete time models prevents their rescaled ISIs from being exponentially distributed. Poor goodness of fit may be erroneously indicated even if the model is exactly correct. We present two adaptations of the time rescaling theorem to discrete time models. In the first we propose that instead of assuming the rescaled times to be exponential, the reference distribution be estimated through direct simulation by the fitted model. In the second, we prove a discrete time version of the time rescaling theorem which analytically corrects for the effects of finite resolution. This allows us to define a rescaled time which is exponentially distributed, even at arbitrary temporal discretizations. We demonstrate the efficacy of both techniques by fitting Generalized Linear Models (GLMs) to both simulated spike trains and spike trains recorded experimentally in monkey V1 cortex. Both techniques give nearly identical results, reducing the false positive rate of the KS test and greatly increasing the reliability of model evaluation based upon the time rescaling theorem. PMID:20608868

A Novel Image Encryption Based on Algebraic S-box and Arnold Transform

NASA Astrophysics Data System (ADS)

Farwa, Shabieh; Muhammad, Nazeer; Shah, Tariq; Ahmad, Sohail

2017-09-01

Recent study shows that substitution box (S-box) only cannot be reliably used in image encryption techniques. We, in this paper, propose a novel and secure image encryption scheme that utilizes the combined effect of an algebraic substitution box along with the scrambling effect of the Arnold transform. The underlying algorithm involves the application of S-box, which is the most imperative source to create confusion and diffusion in the data. The speciality of the proposed algorithm lies, firstly, in the high sensitivity of our S-box to the choice of the initial conditions which makes this S-box stronger than the chaos-based S-boxes as it saves computational labour by deploying a comparatively simple and direct approach based on the algebraic structure of the multiplicative cyclic group of the Galois field. Secondly the proposed method becomes more secure by considering a combination of S-box with certain number of iterations of the Arnold transform. The strength of the S-box is examined in terms of various performance indices such as nonlinearity, strict avalanche criterion, bit independence criterion, linear and differential approximation probabilities etc. We prove through the most significant techniques used for the statistical analyses of the encrypted image that our image encryption algorithm satisfies all the necessary criteria to be usefully and reliably implemented in image encryption applications.

A real-time inverse quantised transform for multi-standard with dynamic resolution support

NASA Astrophysics Data System (ADS)

Sun, Chi-Chia; Lin, Chun-Ying; Zhang, Ce

2016-06-01

In this paper, a real-time configurable intelligent property (IP) core is presented for image/video decoding process in compatibility with the standard MPEG-4 Visual and the standard H.264/AVC. The inverse quantised discrete cosine and integer transform can be used to perform inverse quantised discrete cosine transform and inverse quantised inverse integer transforms which only required shift and add operations. Meanwhile, COordinate Rotation DIgital Computer iterations and compensation steps are adjustable in order to compensate for the video compression quality regarding various data throughput. The implementations are embedded in publicly available software XVID Codes 1.2.2 for the standard MPEG-4 Visual and the H.264/AVC reference software JM 16.1, where the experimental results show that the balance between the computational complexity and video compression quality is retained. At the end, FPGA synthesised results show that the proposed IP core can bring advantages to low hardware costs and also provide real-time performance for Full HD and 4K-2K video decoding.

Space-Time Discrete KPZ Equation

NASA Astrophysics Data System (ADS)

Cannizzaro, G.; Matetski, K.

2018-03-01

We study a general family of space-time discretizations of the KPZ equation and show that they converge to its solution. The approach we follow makes use of basic elements of the theory of regularity structures (Hairer in Invent Math 198(2):269-504, 2014) as well as its discrete counterpart (Hairer and Matetski in Discretizations of rough stochastic PDEs, 2015. arXiv:1511.06937). Since the discretization is in both space and time and we allow non-standard discretization for the product, the methods mentioned above have to be suitably modified in order to accommodate the structure of the models under study.

Applications of fractional lower order S transform time frequency filtering algorithm to machine fault diagnosis

PubMed Central

Wang, Haibin; Zha, Daifeng; Li, Peng; Xie, Huicheng; Mao, Lili

2017-01-01

Stockwell transform(ST) time-frequency representation(ST-TFR) is a time frequency analysis method which combines short time Fourier transform with wavelet transform, and ST time frequency filtering(ST-TFF) method which takes advantage of time-frequency localized spectra can separate the signals from Gaussian noise. The ST-TFR and ST-TFF methods are used to analyze the fault signals, which is reasonable and effective in general Gaussian noise cases. However, it is proved that the mechanical bearing fault signal belongs to Alpha(α) stable distribution process(1 < α < 2) in this paper, even the noise also is α stable distribution in some special cases. The performance of ST-TFR method will degrade under α stable distribution noise environment, following the ST-TFF method fail. Hence, a new fractional lower order ST time frequency representation(FLOST-TFR) method employing fractional lower order moment and ST and inverse FLOST(IFLOST) are proposed in this paper. A new FLOST time frequency filtering(FLOST-TFF) algorithm based on FLOST-TFR method and IFLOST is also proposed, whose simplified method is presented in this paper. The discrete implementation of FLOST-TFF algorithm is deduced, and relevant steps are summarized. Simulation results demonstrate that FLOST-TFR algorithm is obviously better than the existing ST-TFR algorithm under α stable distribution noise, which can work better under Gaussian noise environment, and is robust. The FLOST-TFF method can effectively filter out α stable distribution noise, and restore the original signal. The performance of FLOST-TFF algorithm is better than the ST-TFF method, employing which mixed MSEs are smaller when α and generalized signal noise ratio(GSNR) change. Finally, the FLOST-TFR and FLOST-TFF methods are applied to analyze the outer race fault signal and extract their fault features under α stable distribution noise, where excellent performances can be shown. PMID:28406916

Irish Educational Policy in the 1960s: A Decade of Transformation

ERIC Educational Resources Information Center

Fleming, Brian; Harford, Judith

2014-01-01

A decade of transformation that emerged following a period of inertia and insularity in Irish education, the 1960s is widely regarded by scholars as representing a paradigm shift in education policy. Marked by a more interventionist, strategic policy approach, this period resulted in significant democratisation of education, particularly at…

Discrete simulations of spatio-temporal dynamics of small water bodies under varied stream flow discharges

NASA Astrophysics Data System (ADS)

Daya Sagar, B. S.

2005-01-01

Spatio-temporal patterns of small water bodies (SWBs) under the influence of temporally varied stream flow discharge are simulated in discrete space by employing geomorphologically realistic expansion and contraction transformations. Cascades of expansion-contraction are systematically performed by synchronizing them with stream flow discharge simulated via the logistic map. Templates with definite characteristic information are defined from stream flow discharge pattern as the basis to model the spatio-temporal organization of randomly situated surface water bodies of various sizes and shapes. These spatio-temporal patterns under varied parameters (λs) controlling stream flow discharge patterns are characterized by estimating their fractal dimensions. At various λs, nonlinear control parameters, we show the union of boundaries of water bodies that traverse the water body and non-water body spaces as geomorphic attractors. The computed fractal dimensions of these attractors are 1.58, 1.53, 1.78, 1.76, 1.84, and 1.90, respectively, at λs of 1, 2, 3, 3.46, 3.57, and 3.99. These values are in line with general visual observations.

Transforming children’s palliative care—from ideas to action: highlights from the first ICPCN conference on children’s palliative care

PubMed Central

Downing, J; Marston, J; Muckaden, MA; Boucher, S; Cardoz, M; Nkosi, B; Steel, B; Talawadekar, P; Tilve, P

2014-01-01

The International Children’s Palliative Care Network (ICPCN) held its first international conference on children’s palliative care, in conjunction with Tata Memorial Centre, in Mumbai, India, from 10–12 February 2014. The theme of the conference, Transforming children’s palliative care—from ideas to action, reflected the vision of the ICPCN to live in a world where every child who needs it, can access palliative care, regardless of where they live. Key to this is action, to develop service provision and advocate for children’s palliative care. Three pre-conference workshops were held on 9 February, aimed at doctors, nurses, social workers, and volunteers, and focused around the principles of children’s palliative care, and in particular pain and symptom management. The conference brought together 235 participants representing 38 countries. Key themes identified throughout the conference included: the need for advocacy and leadership; for education and research, with great strides having been taken in the development of an evidence base for children’s palliative care, along with the provision of education; the importance of communication and attention to spirituality in children, and issues around clinical care, in particular for neonates. Delegates were continually challenged to transform children’s palliative care in their parts of the world and the conference culminated in the signing of the ICPCN Mumbai Declaration. The Declaration calls upon governments around the world to improve access to quality children’s palliative care services and made a call on the Belgian government not to pass a bill allowing children to be euthanised in that country. The conference highlighted many of the ongoing developments in children’s palliative care around the world, and as she closed the conference, Joan Marston (ICPCN CEO) challenged participants to take positive action and be the champions that the children need, thus transforming children’s

Molecular transformation, gene cloning, and gene expression systems for filamentous fungi

USGS Publications Warehouse

Gold, Scott E.; Duick, John W.; Redman, Regina S.; Rodriguez, Rusty J.

2001-01-01

This chapter discusses the molecular transformation, gene cloning, and gene expression systems for filamentous fungi. Molecular transformation involves the movement of discrete amounts of DNA into cells, the expression of genes on the transported DNA, and the sustainable replication of the transforming DNA. The ability to transform fungi is dependent on the stable replication and expression of genes located on the transforming DNA. Three phenomena observed in bacteria, that is, competence, plasmids, and restriction enzymes to facilitate cloning, were responsible for the development of molecular transformation in fungi. Initial transformation success with filamentous fungi, involving the complementation of auxotrophic mutants by exposure to sheared genomic DNA or RNA from wt isolates, occurred with low transformation efficiencies. In addition, it was difficult to retrieve complementing DNA fragments and isolate genes of interest. This prompted the development of transformation vectors and methods to increase efficiencies. The physiological studies performed with fungi indicated that the cell wall could be removed to generate protoplasts. It was evident that protoplasts could be transformed with significantly greater efficiencies than walled cells.

Image Fusion Algorithms Using Human Visual System in Transform Domain

NASA Astrophysics Data System (ADS)

Vadhi, Radhika; Swamy Kilari, Veera; Samayamantula, Srinivas Kumar

2017-08-01

The endeavor of digital image fusion is to combine the important visual parts from various sources to advance the visibility eminence of the image. The fused image has a more visual quality than any source images. In this paper, the Human Visual System (HVS) weights are used in the transform domain to select appropriate information from various source images and then to attain a fused image. In this process, mainly two steps are involved. First, apply the DWT to the registered source images. Later, identify qualitative sub-bands using HVS weights. Hence, qualitative sub-bands are selected from different sources to form high quality HVS based fused image. The quality of the HVS based fused image is evaluated with general fusion metrics. The results show the superiority among the state-of-the art resolution Transforms (MRT) such as Discrete Wavelet Transform (DWT), Stationary Wavelet Transform (SWT), Contourlet Transform (CT), and Non Sub Sampled Contourlet Transform (NSCT) using maximum selection fusion rule.

ECG Signal Analysis and Arrhythmia Detection using Wavelet Transform

NASA Astrophysics Data System (ADS)

Kaur, Inderbir; Rajni, Rajni; Marwaha, Anupma

2016-12-01

Electrocardiogram (ECG) is used to record the electrical activity of the heart. The ECG signal being non-stationary in nature, makes the analysis and interpretation of the signal very difficult. Hence accurate analysis of ECG signal with a powerful tool like discrete wavelet transform (DWT) becomes imperative. In this paper, ECG signal is denoised to remove the artifacts and analyzed using Wavelet Transform to detect the QRS complex and arrhythmia. This work is implemented in MATLAB software for MIT/BIH Arrhythmia database and yields the sensitivity of 99.85 %, positive predictivity of 99.92 % and detection error rate of 0.221 % with wavelet transform. It is also inferred that DWT outperforms principle component analysis technique in detection of ECG signal.

Automated transformation-invariant shape recognition through wavelet multiresolution

NASA Astrophysics Data System (ADS)

Brault, Patrice; Mounier, Hugues

2001-12-01

We present here new results in Wavelet Multi-Resolution Analysis (W-MRA) applied to shape recognition in automatic vehicle driving applications. Different types of shapes have to be recognized in this framework. They pertain to most of the objects entering the sensors field of a car. These objects can be road signs, lane separation lines, moving or static obstacles, other automotive vehicles, or visual beacons. The recognition process must be invariant to global, affine or not, transformations which are : rotation, translation and scaling. It also has to be invariant to more local, elastic, deformations like the perspective (in particular with wide angle camera lenses), and also like deformations due to environmental conditions (weather : rain, mist, light reverberation) or optical and electrical signal noises. To demonstrate our method, an initial shape, with a known contour, is compared to the same contour altered by rotation, translation, scaling and perspective. The curvature computed for each contour point is used as a main criterion in the shape matching process. The original part of this work is to use wavelet descriptors, generated with a fast orthonormal W-MRA, rather than Fourier descriptors, in order to provide a multi-resolution description of the contour to be analyzed. In such way, the intrinsic spatial localization property of wavelet descriptors can be used and the recognition process can be speeded up. The most important part of this work is to demonstrate the potential performance of Wavelet-MRA in this application of shape recognition.

Modeling Anti-Air Warfare With Discrete Event Simulation and Analyzing Naval Convoy Operations

DTIC Science & Technology

2016-06-01

WARFARE WITH DISCRETE EVENT SIMULATION AND ANALYZING NAVAL CONVOY OPERATIONS by Ali E. Opcin June 2016 Thesis Advisor: Arnold H. Buss Co...REPORT DATE June 2016 3. REPORT TYPE AND DATES COVERED Master’s thesis 4. TITLE AND SUBTITLE MODELING ANTI-AIR WARFARE WITH DISCRETE EVENT...In this study, a discrete event simulation (DES) was built by modeling ships, and their sensors and weapons, to simulate convoy operations under

Integral group actions on symmetric spaces and discrete duality symmetries of supergravity theories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carbone, Lisa; Murray, Scott H.; Sati, Hisham

For G = G(ℝ), a split, simply connected, semisimple Lie group of rank n and K the maximal compact subgroup of G, we give a method for computing Iwasawa coordinates of K∖G using the Chevalley generators and the Steinberg presentation. When K∖G is a scalar coset for a supergravity theory in dimensions ≥3, we determine the action of the integral form G(ℤ) on K∖G. We give explicit results for the action of the discrete U-duality groups SL{sub 2}(ℤ) and E{sub 7}(ℤ) on the scalar cosets SO(2)∖SL{sub 2}(ℝ) and [SU(8)/( ± Id)]∖E{sub 7(+7)}(ℝ) for type IIB supergravity in ten dimensions andmore » 11-dimensional supergravity reduced to D = 4 dimensions, respectively. For the former, we use this to determine the discrete U-duality transformations on the scalar sector in the Borel gauge and we describe the discrete symmetries of the dyonic charge lattice. We determine the spectrum-generating symmetry group for fundamental BPS solitons of type IIB supergravity in D = 10 dimensions at the classical level and we propose an analog of this symmetry at the quantum level. We indicate how our methods can be used to study the orbits of discrete U-duality groups in general.« less

Optimal block cosine transform image coding for noisy channels

NASA Technical Reports Server (NTRS)

Vaishampayan, V.; Farvardin, N.

1986-01-01

The two dimensional block transform coding scheme based on the discrete cosine transform was studied extensively for image coding applications. While this scheme has proven to be efficient in the absence of channel errors, its performance degrades rapidly over noisy channels. A method is presented for the joint source channel coding optimization of a scheme based on the 2-D block cosine transform when the output of the encoder is to be transmitted via a memoryless design of the quantizers used for encoding the transform coefficients. This algorithm produces a set of locally optimum quantizers and the corresponding binary code assignment for the assumed transform coefficient statistics. To determine the optimum bit assignment among the transform coefficients, an algorithm was used based on the steepest descent method, which under certain convexity conditions on the performance of the channel optimized quantizers, yields the optimal bit allocation. Comprehensive simulation results for the performance of this locally optimum system over noisy channels were obtained and appropriate comparisons against a reference system designed for no channel error were rendered.

Rhenium doping induced structural transformation in mono-layered MoS2 with improved catalytic activity for hydrogen evolution reaction

NASA Astrophysics Data System (ADS)

Shi, Wenwu; Wang, Zhiguo; Qing Fu, Yong

2017-10-01

This paper reports a new design methodology to improve catalytic activities of catalysts based on 2D transition metal dichalcogenides through elemental doping which induces structural transformations. Effects of rhenium (Re) doping on structural stability/phase transformation and catalytic activity of mono-layered trigonal prismatic (2H) MoS2 were investigated using density functional theory as one example. Results show that 2H-Mo1-x Re x S2 transforms into 1T‧-Mo1-x Re x S2MoS2 as the value of x is larger than 0.4, and the transfer of the electron from Re to Mo is identified as the main reason for this structural transformation. The 1T‧-Mo1-x Re x S2 shows a good catalytic activity for the hydrogen evolution reaction when 0.75  ⩽  x  ⩽  0.94.

Efficient genetic algorithms using discretization scheduling.

PubMed

McLay, Laura A; Goldberg, David E

2005-01-01

In many applications of genetic algorithms, there is a tradeoff between speed and accuracy in fitness evaluations when evaluations use numerical methods with varying discretization. In these types of applications, the cost and accuracy vary from discretization errors when implicit or explicit quadrature is used to estimate the function evaluations. This paper examines discretization scheduling, or how to vary the discretization within the genetic algorithm in order to use the least amount of computation time for a solution of a desired quality. The effectiveness of discretization scheduling can be determined by comparing its computation time to the computation time of a GA using a constant discretization. There are three ingredients for the discretization scheduling: population sizing, estimated time for each function evaluation and predicted convergence time analysis. Idealized one- and two-dimensional experiments and an inverse groundwater application illustrate the computational savings to be achieved from using discretization scheduling.

Experimental study of discrete diffraction behavior in a coherent atomic system

NASA Astrophysics Data System (ADS)

Yuan, Jinpeng; Li, Yihong; Li, Shaohua; Li, Changyong; Wang, Lirong; Xiao, Liantuan; Jia, Suotang

2017-12-01

Discrete diffraction behavior was experimentally studied in a coherent rubidium 5S 1/2  -  5P 3/2  -  5D 5/2 cascade system. An optical lattice was established by the interference of two coupling lasers corresponding to 5P 3/2  -  5D 5/2 transition with a small angle. The distinct discrete diffraction patterns were observed in vapor when the probe laser corresponding to the 5S 1/2  -  5P 3/2 transition propagated through the optical lattice. The optimized pertinent experimental parameters such as vapor temperature, two-photon detuning, coupling laser intensity and probe laser intensity are obtained. The experimental results are well analyzed utilizing the density-matrix theory. This system provides a new approach to investigate non-Hermitian physics and discrete solitons.

Adaptive NN tracking control of uncertain nonlinear discrete-time systems with nonaffine dead-zone input.

PubMed

Liu, Yan-Jun; Tong, Shaocheng

2015-03-01

In the paper, an adaptive tracking control design is studied for a class of nonlinear discrete-time systems with dead-zone input. The considered systems are of the nonaffine pure-feedback form and the dead-zone input appears nonlinearly in the systems. The contributions of the paper are that: 1) it is for the first time to investigate the control problem for this class of discrete-time systems with dead-zone; 2) there are major difficulties for stabilizing such systems and in order to overcome the difficulties, the systems are transformed into an n-step-ahead predictor but nonaffine function is still existent; and 3) an adaptive compensative term is constructed to compensate for the parameters of the dead-zone. The neural networks are used to approximate the unknown functions in the transformed systems. Based on the Lyapunov theory, it is proven that all the signals in the closed-loop system are semi-globally uniformly ultimately bounded and the tracking error converges to a small neighborhood of zero. Two simulation examples are provided to verify the effectiveness of the control approach in the paper.

Safety Discrete Event Models for Holonic Cyclic Manufacturing Systems

NASA Astrophysics Data System (ADS)

Ciufudean, Calin; Filote, Constantin

In this paper the expression “holonic cyclic manufacturing systems” refers to complex assembly/disassembly systems or fork/join systems, kanban systems, and in general, to any discrete event system that transforms raw material and/or components into products. Such a system is said to be cyclic if it provides the same sequence of products indefinitely. This paper considers the scheduling of holonic cyclic manufacturing systems and describes a new approach using Petri nets formalism. We propose an approach to frame the optimum schedule of holonic cyclic manufacturing systems in order to maximize the throughput while minimize the work in process. We also propose an algorithm to verify the optimum schedule.

Structural transformations of sVI tert-butylamine hydrates to sII binary hydrates with methane.

PubMed

Prasad, Pinnelli S R; Sugahara, Takeshi; Sloan, E Dendy; Sum, Amadeu K; Koh, Carolyn A

2009-10-22

Binary clathrate hydrates with methane (CH(4), 4.36 A) and tert-butylamine (t-BuNH(2), 6.72 A) as guest molecules were synthesized at different molar concentrations of t-BuNH(2) (1.00-9.31 mol %) with methane at 7.0 MPa and 250 K, and were characterized by powder X-ray diffraction (PXRD) and Raman microscopy. A structural transformation from sVI to sII of t-BuNH(2) hydrate was clearly observed on pressurizing with methane. The PXRD showed sII signatures and the remnant sVI signatures were insignificant, implying the metastable nature of sVI binary hydrates. Raman spectroscopic data on these binary hydrates suggest that the methane molecules occupy the small cages and vacant large cages. The methane storage capacity in this system was nearly doubled to approximately 6.86 wt % for 5.56 mol % > t-BuNH(2) > 1.0 mol %.

Discrete Sparse Coding.

PubMed

Exarchakis, Georgios; Lücke, Jörg

2017-11-01

Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions. We consider the general case in which the latents (while being sparse) can take on any value of a finite set of possible values and in which we learn the prior probability of any value from data. This approach can be applied to any data generated by discrete causes, and it can be applied as an approximation of continuous causes. As the prior probabilities are learned, the approach then allows for estimating the prior shape without assuming specific functional forms. To efficiently train the parameters of our probabilistic generative model, we apply a truncated expectation-maximization approach (expectation truncation) that we modify to work with a general discrete prior. We evaluate the performance of the algorithm by applying it to a variety of tasks: (1) we use artificial data to verify that the algorithm can recover the generating parameters from a random initialization, (2) use image patches of natural images and discuss the role of the prior for the extraction of image components, (3) use extracellular recordings of neurons to present a novel method of analysis for spiking neurons that includes an intuitive discretization strategy, and (4) apply the algorithm on the task of encoding audio waveforms of human speech. The diverse set of numerical experiments presented in this letter suggests that discrete sparse coding algorithms can scale efficiently to work with realistic data sets and provide novel statistical quantities to describe the structure of the data.

Joint modeling of longitudinal data and discrete-time survival outcome.

PubMed

Qiu, Feiyou; Stein, Catherine M; Elston, Robert C

2016-08-01

A predictive joint shared parameter model is proposed for discrete time-to-event and longitudinal data. A discrete survival model with frailty and a generalized linear mixed model for the longitudinal data are joined to predict the probability of events. This joint model focuses on predicting discrete time-to-event outcome, taking advantage of repeated measurements. We show that the probability of an event in a time window can be more precisely predicted by incorporating the longitudinal measurements. The model was investigated by comparison with a two-step model and a discrete-time survival model. Results from both a study on the occurrence of tuberculosis and simulated data show that the joint model is superior to the other models in discrimination ability, especially as the latent variables related to both survival times and the longitudinal measurements depart from 0. © The Author(s) 2013.

A study of stationarity in time series by using wavelet transform

NASA Astrophysics Data System (ADS)

Dghais, Amel Abdoullah Ahmed; Ismail, Mohd Tahir

2014-07-01

In this work the core objective is to apply discrete wavelet transform (DWT) functions namely Haar, Daubechies, Symmlet, Coiflet and discrete approximation of the meyer wavelets in non-stationary financial time series data from US stock market (DJIA30). The data consists of 2048 daily data of closing index starting from December 17, 2004 until October 23, 2012. From the unit root test the results show that the data is non stationary in the level. In order to study the stationarity of a time series, the autocorrelation function (ACF) is used. Results indicate that, Haar function is the lowest function to obtain noisy series as compared to Daubechies, Symmlet, Coiflet and discrete approximation of the meyer wavelets. In addition, the original data after decomposition by DWT is less noisy series than decomposition by DWT for return time series.

Q estimation of seismic data using the generalized S-transform

NASA Astrophysics Data System (ADS)

Hao, Yaju; Wen, Xiaotao; Zhang, Bo; He, Zhenhua; Zhang, Rui; Zhang, Jinming

2016-12-01

Quality factor, Q, is a parameter that characterizes the energy dissipation during seismic wave propagation. The reservoir pore is one of the main factors that affect the value of Q. Especially, when pore space is filled with oil or gas, the rock usually exhibits a relative low Q value. Such a low Q value has been used as a direct hydrocarbon indicator by many researchers. The conventional Q estimation method based on spectral ratio suffers from the problem of waveform tuning; hence, many researchers have introduced time-frequency analysis techniques to tackle this problem. Unfortunately, the window functions adopted in time-frequency analysis algorithms such as continuous wavelet transform (CWT) and S-transform (ST) contaminate the amplitude spectra because the seismic signal is multiplied by the window functions during time-frequency decomposition. The basic assumption of the spectral ratio method is that there is a linear relationship between natural logarithmic spectral ratio and frequency. However, this assumption does not hold if we take the influence of window functions into consideration. In this paper, we first employ a recently developed two-parameter generalized S-transform (GST) to obtain the time-frequency spectra of seismic traces. We then deduce the non-linear relationship between natural logarithmic spectral ratio and frequency. Finally, we obtain a linear relationship between natural logarithmic spectral ratio and a newly defined parameter γ by ignoring the negligible second order term. The gradient of this linear relationship is 1/Q. Here, the parameter γ is a function of frequency and source wavelet. Numerical examples for VSP and post-stack reflection data confirm that our algorithm is capable of yielding accurate results. The Q-value results estimated from field data acquired in western China show reasonable comparison with oil-producing well location.

Discrete breathers for a discrete nonlinear Schrödinger ring coupled to a central site.

PubMed

Jason, Peter; Johansson, Magnus

2016-01-01

We examine the existence and properties of certain discrete breathers for a discrete nonlinear Schrödinger model where all but one site are placed in a ring and coupled to the additional central site. The discrete breathers we focus on are stationary solutions mainly localized on one or a few of the ring sites and possibly also the central site. By numerical methods, we trace out and study the continuous families the discrete breathers belong to. Our main result is the discovery of a split bifurcation at a critical value of the coupling between neighboring ring sites. Below this critical value, families form closed loops in a certain parameter space, implying that discrete breathers with and without central-site occupation belong to the same family. Above the split bifurcation the families split up into several separate ones, which bifurcate with solutions with constant ring amplitudes. For symmetry reasons, the families have different properties below the split bifurcation for even and odd numbers of sites. It is also determined under which conditions the discrete breathers are linearly stable. The dynamics of some simpler initial conditions that approximate the discrete breathers are also studied and the parameter regimes where the dynamics remain localized close to the initially excited ring site are related to the linear stability of the exact discrete breathers.

Vehicle Classification Using the Discrete Fourier Transform with Traffic Inductive Sensors.

PubMed

Lamas-Seco, José J; Castro, Paula M; Dapena, Adriana; Vazquez-Araujo, Francisco J

2015-10-26

Inductive Loop Detectors (ILDs) are the most commonly used sensors in traffic management systems. This paper shows that some spectral features extracted from the Fourier Transform (FT) of inductive signatures do not depend on the vehicle speed. Such a property is used to propose a novel method for vehicle classification based on only one signature acquired from a sensor single-loop, in contrast to standard methods using two sensor loops. Our proposal will be evaluated by means of real inductive signatures captured with our hardware prototype.

Discrete wavelet transform-based investigation into the variability of standardized precipitation index in Northwest China during 1960-2014

NASA Astrophysics Data System (ADS)

Yang, Peng; Xia, Jun; Zhan, Chesheng; Zhang, Yongyong; Hu, Sheng

2018-04-01

In this study, the temporal variations of the standard precipitation index (SPI) were analyzed at different scales in Northwest China (NWC). Discrete wavelet transform (DWT) was used in conjunction with the Mann-Kendall (MK) test in this study. This study also investigated the relationships between original precipitation and different periodic components of SPI series with datasets spanning 55 years (1960-2014). The results showed that with the exception of the annual and summer SPI in the Inner Mongolia Inland Rivers Basin (IMIRB), spring SPI in the Qinghai Lake Rivers Basin (QLRB), and spring SPI in the Central Asia Rivers Basin (CARB), it had an increasing trend in other regions for other time series. In the spring, summer, and autumn series, though the MK trends test in most areas was at the insignificant level, they showed an increasing trend in precipitation. Meanwhile, the SPI series in most subbasins of NWC displayed a turning point in 1980-1990, with the significant increasing levels after 2000. Additionally, there was a significant difference between the trend of the original SPI series and the largest approximations. The annual and seasonal SPI series were composed of the short periodicities, which were less than a decade. The MK value would increase by adding the multiple D components (and approximations), and the MK value of the combined series was in harmony with that of the original series. Additionally, the major trend of the annual SPI in NWC was based on the four kinds of climate indices (e.g., Atlantic Oscillation [AO], North Atlantic Oscillation [NAO], Pacific Decadal Oscillation [PDO], and El Nino-Southern Oscillation index [ENSO/NINO]), especially the ENSO.

Tunable arbitrary unitary transformer based on multiple sections of multicore fibers with phase control.

PubMed

Zhou, Junhe; Wu, Jianjie; Hu, Qinsong

2018-02-05

In this paper, we propose a novel tunable unitary transformer, which can achieve arbitrary discrete unitary transforms. The unitary transformer is composed of multiple sections of multi-core fibers with closely aligned coupled cores. Phase shifters are inserted before and after the sections to control the phases of the waves in the cores. A simple algorithm is proposed to find the optimal phase setup for the phase shifters to realize the desired unitary transforms. The proposed device is fiber based and is particularly suitable for the mode division multiplexing systems. A tunable mode MUX/DEMUX for a three-mode fiber is designed based on the proposed structure.

Dimming-discrete-multi-tone (DMT) for simultaneous color control and high speed visible light communication.

PubMed

Sung, Jiun-Yu; Chow, Chi-Wai; Yeh, Chien-Hung

2014-04-07

Visible light communication (VLC) using LEDs has attracted significant attention recently for the future secure, license-free and electromagnetic-interference (EMI)-free optical wireless communication. Dimming technique in LED lamp is advantageous for energy efficiency. Color control can be performed in the red-green-blue (RGB) LEDs by using dimming technique. It is highly desirable to employ dimming technique to provide simultaneous color and dimming control and high speed VLC. Here, we proposed and demonstrated a LED dimming control using dimming-discrete-multi-tone (DMT) modulation. High speed DMT-based VLC with simultaneous color and dimming control is demonstrated for the first time to the best of our knowledge. Demonstration and analyses for several modulation conditions and transmission distances are performed, for instance, demonstrating the data rate of 103.5 Mb/s (using RGB LED) with fast Fourier transform (FFT) size of 512.

Toward Optimal Manifold Hashing via Discrete Locally Linear Embedding.

PubMed

Rongrong Ji; Hong Liu; Liujuan Cao; Di Liu; Yongjian Wu; Feiyue Huang

2017-11-01

Binary code learning, also known as hashing, has received increasing attention in large-scale visual search. By transforming high-dimensional features to binary codes, the original Euclidean distance is approximated via Hamming distance. More recently, it is advocated that it is the manifold distance, rather than the Euclidean distance, that should be preserved in the Hamming space. However, it retains as an open problem to directly preserve the manifold structure by hashing. In particular, it first needs to build the local linear embedding in the original feature space, and then quantize such embedding to binary codes. Such a two-step coding is problematic and less optimized. Besides, the off-line learning is extremely time and memory consuming, which needs to calculate the similarity matrix of the original data. In this paper, we propose a novel hashing algorithm, termed discrete locality linear embedding hashing (DLLH), which well addresses the above challenges. The DLLH directly reconstructs the manifold structure in the Hamming space, which learns optimal hash codes to maintain the local linear relationship of data points. To learn discrete locally linear embeddingcodes, we further propose a discrete optimization algorithm with an iterative parameters updating scheme. Moreover, an anchor-based acceleration scheme, termed Anchor-DLLH, is further introduced, which approximates the large similarity matrix by the product of two low-rank matrices. Experimental results on three widely used benchmark data sets, i.e., CIFAR10, NUS-WIDE, and YouTube Face, have shown superior performance of the proposed DLLH over the state-of-the-art approaches.

An innovative approach for characteristic analysis and state-of-health diagnosis for a Li-ion cell based on the discrete wavelet transform

NASA Astrophysics Data System (ADS)

Kim, Jonghoon; Cho, B. H.

2014-08-01

This paper introduces an innovative approach to analyze electrochemical characteristics and state-of-health (SOH) diagnosis of a Li-ion cell based on the discrete wavelet transform (DWT). In this approach, the DWT has been applied as a powerful tool in the analysis of the discharging/charging voltage signal (DCVS) with non-stationary and transient phenomena for a Li-ion cell. Specifically, DWT-based multi-resolution analysis (MRA) is used for extracting information on the electrochemical characteristics in both time and frequency domain simultaneously. Through using the MRA with implementation of the wavelet decomposition, the information on the electrochemical characteristics of a Li-ion cell can be extracted from the DCVS over a wide frequency range. Wavelet decomposition based on the selection of the order 3 Daubechies wavelet (dB3) and scale 5 as the best wavelet function and the optimal decomposition scale is implemented. In particular, this present approach develops these investigations one step further by showing low and high frequency components (approximation component An and detail component Dn, respectively) extracted from variable Li-ion cells with different electrochemical characteristics caused by aging effect. Experimental results show the clearness of the DWT-based approach for the reliable diagnosis of the SOH for a Li-ion cell.

A Student's Construction of Transformations of Functions in a Multiple Representational Environment.

ERIC Educational Resources Information Center

Borba, Marcelo C.; Confrey, Jere

1996-01-01

Reports on a case study of a 16-year-old student working on transformations of functions in a computer-based, multirepresentational environment. Presents an analysis of the work during the transition from the use of visualization and analysis of discrete points to the use of algebraic symbolism. (AIM)

Pricing timer options and variance derivatives with closed-form partial transform under the 3/2 model

PubMed Central

Zheng, Wendong; Zeng, Pingping

2016-01-01

ABSTRACT Most of the empirical studies on stochastic volatility dynamics favour the 3/2 specification over the square-root (CIR) process in the Heston model. In the context of option pricing, the 3/2 stochastic volatility model (SVM) is reported to be able to capture the volatility skew evolution better than the Heston model. In this article, we make a thorough investigation on the analytic tractability of the 3/2 SVM by proposing a closed-form formula for the partial transform of the triple joint transition density which stand for the log asset price, the quadratic variation (continuous realized variance) and the instantaneous variance, respectively. Two distinct formulations are provided for deriving the main result. The closed-form partial transform enables us to deduce a variety of marginal partial transforms and characteristic functions and plays a crucial role in pricing discretely sampled variance derivatives and exotic options that depend on both the asset price and quadratic variation. Various applications and numerical examples on pricing moment swaps and timer options with discrete monitoring feature are given to demonstrate the versatility of the partial transform under the 3/2 model. PMID:28706460

Adaptive Discrete Hypergraph Matching.

PubMed

Yan, Junchi; Li, Changsheng; Li, Yin; Cao, Guitao

2018-02-01

This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.

Einstein’s sigh: hidden symmetry in Einstein’s derivation of the Lorentz transformation

NASA Astrophysics Data System (ADS)

Chao, Sheng D.

2017-03-01

‘Das hätte ich einfacher sagen können (I could have said that more simply).’ was Einstein’s sigh when he had a chance to remark on his own derivation of the Lorentz transformation (LT) in the 1905 seminal paper. In fact, in a popular science exposition of the theory of relativity Einstein did provide such a simple derivation of the LT. It is a curious historical fact that the latter derivation was presented in 1916, while Einstein’s remark was made in 1943. Was the 1916 derivation simple enough to relieve his sigh? Had he expected an even simpler derivation beyond his thoughts? In this paper, Einstein’s simple derivation of the LT is revisited and analysed. We show that the LT can be obtained from a symmetry principle hidden in Einstein’s logical reasoning. First, the relativity principle can be restated as a mirror principle based on the space-time exchange-inversion operation. Second, the assumed constancy of the speed of light (Einstein’s second postulate) can be derived by using the velocity reciprocity property, which is a deductive result of the space-time homogeneity and the space isotropy. Therefore, Einstein could have presented his derivation of the LT more simply, thus turning Einstein’s sigh of regret into a sigh of relief.

Transformation of socio-cultural aspect of gated housing’s residence in Medan City, Indonesia.

NASA Astrophysics Data System (ADS)

Nirfalini Aulia, Dwira

2018-03-01

Gated Community Housing develops rapidly in Medan City and other big cities in Indonesia. These housing types initially reserved for middle to high-income residents. Transformation can describe as changes from one condition to another condition that can happen continuously in time. Change is affected by internal and external factors. Internal factors include culture, perspective, and social system while external factors include science progress and other cultural influence. This research is a descriptive study which tries to describe the phenomenon that is currently ongoing. Gated housing chosen are Perumahan Taman Setia Budi Indah, Perumahan Bumi Asri dan Perumahan Graha Helvetia. Characteristics of gated housing’s residents transform by the regional or national socioeconomic transformation. The structure and function of human social life are not uniform; meaning in every social life setting each of the structure and function are different. The characteristic of a community will transform in continuity.

A New Approach to the Numerical Evaluation of the Inverse Radon Transform with Discrete, Noisy Data.

DTIC Science & Technology

1980-07-01

spline form. The resulting analytic expression for the inner integral in the inverse transform is then readily evaluated, and the outer (periodic...integral is replaced by a sum. The work involved to obtain the inverse transform appears to be within the capability of existing computing equipment for

Transformations of asymptotically AdS hyperbolic initial data and associated geometric inequalities

NASA Astrophysics Data System (ADS)

Cha, Ye Sle; Khuri, Marcus

2018-01-01

We construct transformations which take asymptotically AdS hyperbolic initial data into asymptotically flat initial data, and which preserve relevant physical quantities. This is used to derive geometric inequalities in the asymptotically AdS hyperbolic setting from counterparts in the asymptotically flat realm, whenever a geometrically motivated system of elliptic equations admits a solution. The inequalities treated here relate mass, angular momentum, charge, and horizon area. Furthermore, new mass-angular momentum inequalities in this setting are conjectured and discussed.

Scaled nonuniform Fourier transform for image reconstruction in swept source optical coherence tomography

NASA Astrophysics Data System (ADS)

Mezgebo, Biniyam; Nagib, Karim; Fernando, Namal; Kordi, Behzad; Sherif, Sherif

2018-02-01

Swept Source optical coherence tomography (SS-OCT) is an important imaging modality for both medical and industrial diagnostic applications. A cross-sectional SS-OCT image is obtained by applying an inverse discrete Fourier transform (DFT) to axial interferograms measured in the frequency domain (k-space). This inverse DFT is typically implemented as a fast Fourier transform (FFT) that requires the data samples to be equidistant in k-space. As the frequency of light produced by a typical wavelength-swept laser is nonlinear in time, the recorded interferogram samples will not be uniformly spaced in k-space. Many image reconstruction methods have been proposed to overcome this problem. Most such methods rely on oversampling the measured interferogram then use either hardware, e.g., Mach-Zhender interferometer as a frequency clock module, or software, e.g., interpolation in k-space, to obtain equally spaced samples that are suitable for the FFT. To overcome the problem of nonuniform sampling in k-space without any need for interferogram oversampling, an earlier method demonstrated the use of the nonuniform discrete Fourier transform (NDFT) for image reconstruction in SS-OCT. In this paper, we present a more accurate method for SS-OCT image reconstruction from nonuniform samples in k-space using a scaled nonuniform Fourier transform. The result is demonstrated using SS-OCT images of Axolotl salamander eggs.

Reconcile Planck-scale discreteness and the Lorentz-Fitzgerald contraction

NASA Astrophysics Data System (ADS)

Rovelli, Carlo; Speziale, Simone

2003-03-01

A Planck-scale minimal observable length appears in many approaches to quantum gravity. It is sometimes argued that this minimal length might conflict with Lorentz invariance, because a boosted observer can see the minimal length further Lorentz contracted. We show that this is not the case within loop quantum gravity. In loop quantum gravity the minimal length (more precisely, minimal area) does not appear as a fixed property of geometry, but rather as the minimal (nonzero) eigenvalue of a quantum observable. The boosted observer can see the same observable spectrum, with the same minimal area. What changes continuously in the boost transformation is not the value of the minimal length: it is the probability distribution of seeing one or the other of the discrete eigenvalues of the area. We discuss several difficulties associated with boosts and area measurement in quantum gravity. We compute the transformation of the area operator under a local boost, propose an explicit expression for the generator of local boosts, and give the conditions under which its action is unitary.

Discrete post-processing of total cloud cover ensemble forecasts

NASA Astrophysics Data System (ADS)

Hemri, Stephan; Haiden, Thomas; Pappenberger, Florian

2017-04-01

This contribution presents an approach to post-process ensemble forecasts for the discrete and bounded weather variable of total cloud cover. Two methods for discrete statistical post-processing of ensemble predictions are tested. The first approach is based on multinomial logistic regression, the second involves a proportional odds logistic regression model. Applying them to total cloud cover raw ensemble forecasts from the European Centre for Medium-Range Weather Forecasts improves forecast skill significantly. Based on station-wise post-processing of raw ensemble total cloud cover forecasts for a global set of 3330 stations over the period from 2007 to early 2014, the more parsimonious proportional odds logistic regression model proved to slightly outperform the multinomial logistic regression model. Reference Hemri, S., Haiden, T., & Pappenberger, F. (2016). Discrete post-processing of total cloud cover ensemble forecasts. Monthly Weather Review 144, 2565-2577.

Computation of Discrete Slanted Hole Film Cooling Flow Using the Navier-Stokes Equations.

DTIC Science & Technology

1982-07-01

7 -121 796 COMPUTATION OF DISCRETE SLANTED HOLE FILM COOLING FLOW i/ i USING THE NAVIER- ..(U) CIENTIFIC RESEARCH ASSOCIATES INC GLASTONBURY CT H...V U U6-IMSA P/ & .OS,-TR. 82-1004 Report R82-910002-4 / COMPUTATION OF DISCRETE SLAMED HOLE FILM COOLING FLOW ( USING THE XAVIER-STOKES EQUATIONS H...CL SIT %GE (f.en Dae Entere)04 REPORT DOCUMENTATION PAGE BEFORE COMPLETING FORM REPORT NUMBER 2. GOVT ACCESSION NO] S. RECIPIENT’S CATALOG NUMBERAO

Discrete Jordan curve theorem

NASA Astrophysics Data System (ADS)

Chen, Li

1999-09-01

According to a general definition of discrete curves, surfaces, and manifolds (Li Chen, 'Generalized discrete object tracking algorithms and implementations, ' In Melter, Wu, and Latecki ed, Vision Geometry VI, SPIE Vol. 3168, pp 184 - 195, 1997.). This paper focuses on the Jordan curve theorem in 2D discrete spaces. The Jordan curve theorem says that a (simply) closed curve separates a simply connected surface into two components. Based on the definition of discrete surfaces, we give three reasonable definitions of simply connected spaces. Theoretically, these three definition shall be equivalent. We have proved the Jordan curve theorem under the third definition of simply connected spaces. The Jordan theorem shows the relationship among an object, its boundary, and its outside area. In continuous space, the boundary of an mD manifold is an (m - 1)D manifold. The similar result does apply to regular discrete manifolds. The concept of a new regular nD-cell is developed based on the regular surface point in 2D, and well-composed objects in 2D and 3D given by Latecki (L. Latecki, '3D well-composed pictures,' In Melter, Wu, and Latecki ed, Vision Geometry IV, SPIE Vol 2573, pp 196 - 203, 1995.).

Human Motion Capture Data Tailored Transform Coding.

PubMed

Junhui Hou; Lap-Pui Chau; Magnenat-Thalmann, Nadia; Ying He

2015-07-01

Human motion capture (mocap) is a widely used technique for digitalizing human movements. With growing usage, compressing mocap data has received increasing attention, since compact data size enables efficient storage and transmission. Our analysis shows that mocap data have some unique characteristics that distinguish themselves from images and videos. Therefore, directly borrowing image or video compression techniques, such as discrete cosine transform, does not work well. In this paper, we propose a novel mocap-tailored transform coding algorithm that takes advantage of these features. Our algorithm segments the input mocap sequences into clips, which are represented in 2D matrices. Then it computes a set of data-dependent orthogonal bases to transform the matrices to frequency domain, in which the transform coefficients have significantly less dependency. Finally, the compression is obtained by entropy coding of the quantized coefficients and the bases. Our method has low computational cost and can be easily extended to compress mocap databases. It also requires neither training nor complicated parameter setting. Experimental results demonstrate that the proposed scheme significantly outperforms state-of-the-art algorithms in terms of compression performance and speed.

Observability of discretized partial differential equations

NASA Technical Reports Server (NTRS)

Cohn, Stephen E.; Dee, Dick P.

1988-01-01

It is shown that complete observability of the discrete model used to assimilate data from a linear partial differential equation (PDE) system is necessary and sufficient for asymptotic stability of the data assimilation process. The observability theory for discrete systems is reviewed and applied to obtain simple observability tests for discretized constant-coefficient PDEs. Examples are used to show how numerical dispersion can result in discrete dynamics with multiple eigenvalues, thereby detracting from observability.

Discrete Mathematics Re "Tooled."

ERIC Educational Resources Information Center

Grassl, Richard M.; Mingus, Tabitha T. Y.

1999-01-01

Indicates the importance of teaching discrete mathematics. Describes how the use of technology can enhance the teaching and learning of discrete mathematics. Explorations using Excel, Derive, and the TI-92 proved how preservice and inservice teachers experienced a new dimension in problem solving and discovery. (ASK)

Compact pulse transformer for 85 kV, 3.5 μs electron gun anode of compact X-ray cargo scanner

DOE Office of Scientific and Technical Information (OSTI.GOV)

Patel, R.; Sharma, D.K.; Dixit, K.

Design of compact and reliable 85kV HV pulse transformer for electron gun anode pulsing is a major concern, when size and space are constraints. This paper describes design procedures and optimization of various parameters like HV insulation, step up ratio, rise time and flat top of Pulse transformer, operating with input from a 10 stage PFN of 50 ohm impedance and charged at 14kV. The transformer should deliver rated output voltage of negative polarity 85kV, 3 to 4μs pulse width, less than 2μs rise time and flat top within 10% across an electron gun load, equivalent to a parallel combinationmore » of 10kΩ and 200pF load at a PRF of 250 Hz. Since the Cargo Scanner has to operate on movable carrier, this transformer is designed to operate even in the inclined positions. This transformer has given voltage step up, rise time and flat top of 13.75, 1.5 μs and 4.5% respectively for a 10kΩ and 200pF load at 250Hz PRF and also demonstrated operation in 90{sup °} tilted transformer positions. An effort has been put to achieve maintenance free Pulse transformer by providing effective sealing in the transformer tank to stop breathing action. Also, special flexing walls of transformer tank accommodate for small changes in volume of oil due to temperature variations. (author)« less

Generalized Legendre transformations and symmetries of the WDVV equations

NASA Astrophysics Data System (ADS)

Strachan, Ian A. B.; Stedman, Richard

2017-03-01

The Witten-Dijkgraaf-Verlinde-Verlinde (or WDVV) equations, as one would expect from an integrable system, has many symmetries, both continuous and discrete. One class—the so-called Legendre transformations—were introduced by Dubrovin. They are a discrete set of symmetries between the stronger concept of a Frobenius manifold, and are generated by certain flat vector fields. In this paper this construction is generalized to the case where the vector field (called here the Legendre field) is non-flat but satisfies a certain set of defining equations. One application of this more general theory is to generate the induced symmetry between almost-dual Frobenius manifolds whose underlying Frobenius manifolds are related by a Legendre transformation. This also provides a map between rational and trigonometric solutions of the WDVV equations.

Arsenite induces cell transformation by reactive oxygen species, AKT, ERK1/2, and p70S6K1

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carpenter, Richard L.; Jiang, Yue; Jing, Yi

2011-10-28

Highlights: Black-Right-Pointing-Pointer Chronic exposure to arsenite induces cell proliferation and transformation. Black-Right-Pointing-Pointer Arsenite-induced transformation increases ROS production and downstream signalings. Black-Right-Pointing-Pointer Inhibition of ROS levels via catalase reduces arsenite-induced cell transformation. Black-Right-Pointing-Pointer Interruption of AKT, ERK, or p70S6K1 inhibits arsenite-induced cell transformation. -- Abstract: Arsenic is naturally occurring element that exists in both organic and inorganic formulations. The inorganic form arsenite has a positive association with development of multiple cancer types. There are significant populations throughout the world with high exposure to arsenite via drinking water. Thus, human exposure to arsenic has become a significant public health problem. Recent evidencemore » suggests that reactive oxygen species (ROS) mediate multiple changes to cell behavior after acute arsenic exposure, including activation of proliferative signaling and angiogenesis. However, the role of ROS in mediating cell transformation by chronic arsenic exposure is unknown. We found that cells chronically exposed to sodium arsenite increased proliferation and gained anchorage-independent growth. This cell transformation phenotype required constitutive activation of AKT, ERK1/2, mTOR, and p70S6K1. We also observed these cells constitutively produce ROS, which was required for the constitutive activation of AKT, ERK1/2, mTOR, and p70S6K1. Suppression of ROS levels by forced expression of catalase also reduced cell proliferation and anchorage-independent growth. These results indicate cell transformation induced by chronic arsenic exposure is mediated by increased cellular levels of ROS, which mediates activation of AKT, ERK1/2, and p70S6K1.« less

Real topological entropy versus metric entropy for birational measure-preserving transformations

NASA Astrophysics Data System (ADS)

Abarenkova, N.; Anglès d'Auriac, J.-Ch.; Boukraa, S.; Maillard, J.-M.

2000-10-01

We consider a family of birational measure-preserving transformations of two complex variables, depending on one parameter for which simple rational expressions for the dynamical zeta function have been conjectured, together with an equality between the topological entropy and the logarithm of the Arnold complexity (divided by the number of iterations). Similar results have been obtained for the adaptation of these two concepts to dynamical systems of real variables, yielding to introduce a “real topological entropy” and a “real Arnold complexity”. We try to compare, here, the Kolmogorov-Sinai metric entropy and this real Arnold complexity, or real topological entropy, on this particular example of a one-parameter dependent birational transformation of two variables. More precisely, we analyze, using an infinite precision calculation, the Lyapunov characteristic exponents for various values of the parameter of the birational transformation, in order to compare these results with the ones for the real Arnold complexity. We find a quite surprising result: for this very birational example, and, in fact, for a large set of birational measure-preserving mappings generated by involutions, the Lyapunov characteristic exponents seem to be equal to zero or, at least, extremely small, for all the orbits we have considered, and for all values of the parameter. Birational measure-preserving transformations, generated by involutions, could thus allow to better understand the difference between the topological description and the probabilistic description of discrete dynamical systems. Many birational measure-preserving transformations, generated by involutions, seem to provide examples of discrete dynamical systems which can be topologically chaotic while they are metrically almost quasi-periodic. Heuristically, this can be understood as a consequence of the fact that their orbits seem to form some kind of “transcendental foliation” of the two-dimensional space of

Fast heap transform-based QR-decomposition of real and complex matrices: algorithms and codes

NASA Astrophysics Data System (ADS)

Grigoryan, Artyom M.

2015-03-01

In this paper, we describe a new look on the application of Givens rotations to the QR-decomposition problem, which is similar to the method of Householder transformations. We apply the concept of the discrete heap transform, or signal-induced unitary transforms which had been introduced by Grigoryan (2006) and used in signal and image processing. Both cases of real and complex nonsingular matrices are considered and examples of performing QR-decomposition of square matrices are given. The proposed method of QR-decomposition for the complex matrix is novel and differs from the known method of complex Givens rotation and is based on analytical equations for the heap transforms. Many examples illustrated the proposed heap transform method of QR-decomposition are given, algorithms are described in detail, and MATLAB-based codes are included.

Ecological monitoring in a discrete-time prey-predator model.

PubMed

Gámez, M; López, I; Rodríguez, C; Varga, Z; Garay, J

2017-09-21

The paper is aimed at the methodological development of ecological monitoring in discrete-time dynamic models. In earlier papers, in the framework of continuous-time models, we have shown how a systems-theoretical methodology can be applied to the monitoring of the state process of a system of interacting populations, also estimating certain abiotic environmental changes such as pollution, climatic or seasonal changes. In practice, however, there may be good reasons to use discrete-time models. (For instance, there may be discrete cycles in the development of the populations, or observations can be made only at discrete time steps.) Therefore the present paper is devoted to the development of the monitoring methodology in the framework of discrete-time models of population ecology. By monitoring we mean that, observing only certain component(s) of the system, we reconstruct the whole state process. This may be necessary, e.g., when in a complex ecosystem the observation of the densities of certain species is impossible, or too expensive. For the first presentation of the offered methodology, we have chosen a discrete-time version of the classical Lotka-Volterra prey-predator model. This is a minimal but not trivial system where the methodology can still be presented. We also show how this methodology can be applied to estimate the effect of an abiotic environmental change, using a component of the population system as an environmental indicator. Although this approach is illustrated in a simplest possible case, it can be easily extended to larger ecosystems with several interacting populations and different types of abiotic environmental effects. Copyright © 2017 Elsevier Ltd. All rights reserved.

Adaptive synchrosqueezing based on a quilted short-time Fourier transform

NASA Astrophysics Data System (ADS)

Berrian, Alexander; Saito, Naoki

2017-08-01

In recent years, the synchrosqueezing transform (SST) has gained popularity as a method for the analysis of signals that can be broken down into multiple components determined by instantaneous amplitudes and phases. One such version of SST, based on the short-time Fourier transform (STFT), enables the sharpening of instantaneous frequency (IF) information derived from the STFT, as well as the separation of amplitude-phase components corresponding to distinct IF curves. However, this SST is limited by the time-frequency resolution of the underlying window function, and may not resolve signals exhibiting diverse time-frequency behaviors with sufficient accuracy. In this work, we develop a framework for an SST based on a "quilted" short-time Fourier transform (SST-QSTFT), which allows adaptation to signal behavior in separate time-frequency regions through the use of multiple windows. This motivates us to introduce a discrete reassignment frequency formula based on a finite difference of the phase spectrum, ensuring computational accuracy for a wider variety of windows. We develop a theoretical framework for the SST-QSTFT in both the continuous and the discrete settings, and describe an algorithm for the automatic selection of optimal windows depending on the region of interest. Using synthetic data, we demonstrate the superior numerical performance of SST-QSTFT relative to other SST methods in a noisy context. Finally, we apply SST-QSTFT to audio recordings of animal calls to demonstrate the potential of our method for the analysis of real bioacoustic signals.

Functional transformations of odor inputs in the mouse olfactory bulb.

PubMed

Adam, Yoav; Livneh, Yoav; Miyamichi, Kazunari; Groysman, Maya; Luo, Liqun; Mizrahi, Adi

2014-01-01

Sensory inputs from the nasal epithelium to the olfactory bulb (OB) are organized as a discrete map in the glomerular layer (GL). This map is then modulated by distinct types of local neurons and transmitted to higher brain areas via mitral and tufted cells. Little is known about the functional organization of the circuits downstream of glomeruli. We used in vivo two-photon calcium imaging for large scale functional mapping of distinct neuronal populations in the mouse OB, at single cell resolution. Specifically, we imaged odor responses of mitral cells (MCs), tufted cells (TCs) and glomerular interneurons (GL-INs). Mitral cells population activity was heterogeneous and only mildly correlated with the olfactory receptor neuron (ORN) inputs, supporting the view that discrete input maps undergo significant transformations at the output level of the OB. In contrast, population activity profiles of TCs were dense, and highly correlated with the odor inputs in both space and time. Glomerular interneurons were also highly correlated with the ORN inputs, but showed higher activation thresholds suggesting that these neurons are driven by strongly activated glomeruli. Temporally, upon persistent odor exposure, TCs quickly adapted. In contrast, both MCs and GL-INs showed diverse temporal response patterns, suggesting that GL-INs could contribute to the transformations MCs undergo at slow time scales. Our data suggest that sensory odor maps are transformed by TCs and MCs in different ways forming two distinct and parallel information streams.

Integrable structure in discrete shell membrane theory.

PubMed

Schief, W K

2014-05-08

We present natural discrete analogues of two integrable classes of shell membranes. By construction, these discrete shell membranes are in equilibrium with respect to suitably chosen internal stresses and external forces. The integrability of the underlying equilibrium equations is proved by relating the geometry of the discrete shell membranes to discrete O surface theory. We establish connections with generalized barycentric coordinates and nine-point centres and identify a discrete version of the classical Gauss equation of surface theory.

Single step transformation of sulphur to Li2S2/Li2S in Li-S batteries

PubMed Central

Helen, M.; Reddy, M. Anji; Diemant, Thomas; Golla-Schindler, Ute; Behm, R. Jürgen; Kaiser, Ute; Fichtner, Maximilian

2015-01-01

Lithium-sulphur batteries have generated tremendous research interest due to their high theoretical energy density and potential cost-effectiveness. The commercial realization of Li-S batteries is still hampered by reduced cycle life associated with the formation of electrolyte soluble higher-order polysulphide (Li2Sx, x = 4–8) intermediates, leading to capacity fading, self-discharge, and a multistep voltage profile. Herein, we have realized a practical approach towards a direct transformation of sulphur to Li2S2/Li2S in lithium-sulphur batteries by alteration of the reaction pathway. A coconut shell derived ultramicroporous carbon-sulphur composite cathode has been used as reaction directing template for the sulphur. The lithiation/delithiation and capacity fading mechanism of microporous carbon confined sulphur composite was revealed by analyzing the subsurface using X-ray photoelectron spectroscopy. No higher-order polysulphides were detected in the electrolyte, on the surface, and in the subsurface of the cathode composite. The altered reaction pathway is reflected by a single-step profile in the discharge/charge of a lithium-sulphur cell. PMID:26173723

Discrete-time Quantum Walks via Interchange Framework and Memory in Quantum Evolution

NASA Astrophysics Data System (ADS)

Dimcovic, Zlatko

effects of history on the quantum evolution and the subtle emergence of classical features as "memory" is explicitly kept for additional steps. We construct and solve a walk with an additional correlation step, finding interesting new features. On the other hand, the fact that the evolution is driven entirely by a local operator, not involving additional spaces, enables us to choose the Fourier transform as an operator completely controlling the evolution. This in turn allows us to combine the quantum walk approach with Fourier transform based techniques, something decidedly not possible in classical computational physics. We are developing a formalism for building networks manageable by walks constructed with this framework, based on the surprising efficiency of our framework in discovering internals of a simple network that we so far solved. Finally, in line with our expectation that the field of quantum walks can take cues from the rich history of development of the classical stochastic techniques, we establish starting points for the work on non-Abelian quantum walks, with a particular quantum-walk analog of the classical "card shuffling," the walk on the permutation group. In summary, this thesis presents a new framework for construction of discrete time quantum walks, employing and exploring memoried nature of unitary evolution. It is applied to fully solving the problems of: A walk on the binary tree and exploration of the quantum-to-classical transition with increased correlation length (history). It is then used for simple network discovery, and to lay the groundwork for analysis of complex networks, based on combined power of efficient exploration of the Hilbert space (as a walk mixing components) and Fourier transformation (since we can choose this for the evolution operator). We hope to establish this as a general technique as its power would be unmatched by any approaches available in the classical computing. We also looked at the promising and challenging

Spatial change transformation of educational areas in Bandung

NASA Astrophysics Data System (ADS)

Yudi Permana, Asep; Wijaya, Karto

2017-12-01

Transformation is a total transfer process from a particular shape into a new figure which can be interpreted as the final stage of a changing process. Transformation, as a gradually progressive process, utilizes space and time factors becoming the aspect that greatly influences the change until reaching the ultimate stage. The changes are completed by responding to the influence of external and internal elements which will lead to a change from an early familiar form. The purpose of this research is to build theory based on phenomenon which occurs in the field as a result of space transformation process in Bandung so that it can be seen the setting adjustment of either physical or non-physical in the area becoming the city identity. The research method is qualitative research method with descriptive survey method approach. The focus of research is aimed at discrete phenomena in the field as an effort to disclose the background essence of the resulted theory formation. The study does not use a theoretical framework, yet there is a consistency in observing a discrete phenomenon of the grand tour results. The phenomenon is raised through the snowball sampling process. The process of collecting data, analyzing, and building theories is conducted jointly and iteratively within one research time range. The study results in the formation of space knowledge based on knitting and the value system of the users’ activities and the space settings. All users’ behaviors in using space are related to social, cultural, economic and creative activities in utilizing the existing space conditions. The results of this study provide an enrichment of architectural theory, planning theory and urban design theory having already existed.

Dynamic generation of light states with discrete symmetries

NASA Astrophysics Data System (ADS)

Cordero, S.; Nahmad-Achar, E.; Castaños, O.; López-Peña, R.

2018-01-01

A dynamic procedure is established within the generalized Tavis-Cummings model to generate light states with discrete point symmetries, given by the cyclic group Cn. We consider arbitrary dipolar coupling strengths of the atoms with a one-mode electromagnetic field in a cavity. The method uses mainly the matter-field entanglement properties of the system, which can be extended to any number of three-level atoms. An initial state constituted by the superposition of two states with definite total excitation numbers, |ψ〉 M1,and |ψ〉 M 2, is considered. It can be generated by the proper selection of the time of flight of an atom passing through the cavity. We demonstrate that the resulting Husimi function of the light is invariant under cyclic point transformations of order n =| M1-M2| .

Discrete Data Qualification System and Method Comprising Noise Series Fault Detection

NASA Technical Reports Server (NTRS)

Fulton, Christopher; Wong, Edmond; Melcher, Kevin; Bickford, Randall

2013-01-01

A Sensor Data Qualification (SDQ) function has been developed that allows the onboard flight computers on NASA s launch vehicles to determine the validity of sensor data to ensure that critical safety and operational decisions are not based on faulty sensor data. This SDQ function includes a novel noise series fault detection algorithm for qualification of the output data from LO2 and LH2 low-level liquid sensors. These sensors are positioned in a launch vehicle s propellant tanks in order to detect propellant depletion during a rocket engine s boost operating phase. This detection capability can prevent the catastrophic situation where the engine operates without propellant. The output from each LO2 and LH2 low-level liquid sensor is a discrete valued signal that is expected to be in either of two states, depending on whether the sensor is immersed (wet) or exposed (dry). Conventional methods for sensor data qualification, such as threshold limit checking, are not effective for this type of signal due to its discrete binary-state nature. To address this data qualification challenge, a noise computation and evaluation method, also known as a noise fault detector, was developed to detect unreasonable statistical characteristics in the discrete data stream. The method operates on a time series of discrete data observations over a moving window of data points and performs a continuous examination of the resulting observation stream to identify the presence of anomalous characteristics. If the method determines the existence of anomalous results, the data from the sensor is disqualified for use by other monitoring or control functions.

Integrable structure in discrete shell membrane theory

PubMed Central

Schief, W. K.

2014-01-01

We present natural discrete analogues of two integrable classes of shell membranes. By construction, these discrete shell membranes are in equilibrium with respect to suitably chosen internal stresses and external forces. The integrability of the underlying equilibrium equations is proved by relating the geometry of the discrete shell membranes to discrete O surface theory. We establish connections with generalized barycentric coordinates and nine-point centres and identify a discrete version of the classical Gauss equation of surface theory. PMID:24808755

Integrable discrete PT symmetric model.

PubMed

Ablowitz, Mark J; Musslimani, Ziad H

2014-09-01

An exactly solvable discrete PT invariant nonlinear Schrödinger-like model is introduced. It is an integrable Hamiltonian system that exhibits a nontrivial nonlinear PT symmetry. A discrete one-soliton solution is constructed using a left-right Riemann-Hilbert formulation. It is shown that this pure soliton exhibits unique features such as power oscillations and singularity formation. The proposed model can be viewed as a discretization of a recently obtained integrable nonlocal nonlinear Schrödinger equation.

Design of an optimal preview controller for linear discrete-time descriptor systems with state delay

NASA Astrophysics Data System (ADS)

Cao, Mengjuan; Liao, Fucheng

2015-04-01

In this paper, the linear discrete-time descriptor system with state delay is studied, and a design method for an optimal preview controller is proposed. First, by using the discrete lifting technique, the original system is transformed into a general descriptor system without state delay in form. Then, taking advantage of the first-order forward difference operator, we construct a descriptor augmented error system, including the state vectors of the lifted system, error vectors, and desired target signals. Rigorous mathematical proofs are given for the regularity, stabilisability, causal controllability, and causal observability of the descriptor augmented error system. Based on these, the optimal preview controller with preview feedforward compensation for the original system is obtained by using the standard optimal regulator theory of the descriptor system. The effectiveness of the proposed method is shown by numerical simulation.

Distributed Relaxation for Conservative Discretizations

NASA Technical Reports Server (NTRS)

Diskin, Boris; Thomas, James L.

2001-01-01

A multigrid method is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work that is a small (less than 10) multiple of the operation count in one target-grid residual evaluation. The way to achieve this efficiency is the distributed relaxation approach. TME solvers employing distributed relaxation have already been demonstrated for nonconservative formulations of high-Reynolds-number viscous incompressible and subsonic compressible flow regimes. The purpose of this paper is to provide foundations for applications of distributed relaxation to conservative discretizations. A direct correspondence between the primitive variable interpolations for calculating fluxes in conservative finite-volume discretizations and stencils of the discretized derivatives in the nonconservative formulation has been established. Based on this correspondence, one can arrive at a conservative discretization which is very efficiently solved with a nonconservative relaxation scheme and this is demonstrated for conservative discretization of the quasi one-dimensional Euler equations. Formulations for both staggered and collocated grid arrangements are considered and extensions of the general procedure to multiple dimensions are discussed.

Genetic Transformation of Streptococcus mutans

PubMed Central

Perry, Dennis; Kuramitsu, Howard K.

1981-01-01

Three strains of Streptococcus mutans belonging to serotypes a, c, and f were transformed to streptomycin resistance by deoxyribonucleic acids derived from homologous and heterologous streptomycin-resistant strains of S. mutans and Streptococcus sanguis strain Challis. Homologous transformation of S. mutans was less efficient than heterologous transformation by deoxyribonucleic acids from other strains of S. mutans. PMID:7251168

DiscML: an R package for estimating evolutionary rates of discrete characters using maximum likelihood.

PubMed

Kim, Tane; Hao, Weilong

2014-09-27

The study of discrete characters is crucial for the understanding of evolutionary processes. Even though great advances have been made in the analysis of nucleotide sequences, computer programs for non-DNA discrete characters are often dedicated to specific analyses and lack flexibility. Discrete characters often have different transition rate matrices, variable rates among sites and sometimes contain unobservable states. To obtain the ability to accurately estimate a variety of discrete characters, programs with sophisticated methodologies and flexible settings are desired. DiscML performs maximum likelihood estimation for evolutionary rates of discrete characters on a provided phylogeny with the options that correct for unobservable data, rate variations, and unknown prior root probabilities from the empirical data. It gives users options to customize the instantaneous transition rate matrices, or to choose pre-determined matrices from models such as birth-and-death (BD), birth-death-and-innovation (BDI), equal rates (ER), symmetric (SYM), general time-reversible (GTR) and all rates different (ARD). Moreover, we show application examples of DiscML on gene family data and on intron presence/absence data. DiscML was developed as a unified R program for estimating evolutionary rates of discrete characters with no restriction on the number of character states, and with flexibility to use different transition models. DiscML is ideal for the analyses of binary (1s/0s) patterns, multi-gene families, and multistate discrete morphological characteristics.

PREFACE: DISCRETE 2012 - Third Symposium on Prospects in the Physics of Discrete Symmetries

NASA Astrophysics Data System (ADS)

Branco, G. C.; Emmanuel-Costa, D.; González Felipe, R.; Joaquim, F. R.; Lavoura, L.; Palomares-Ruiz, S.; Rebelo, M. N.; Romão, J. C.; Silva, J. P.

2013-07-01

The Third Symposium on Prospects in the Physics of Discrete Symmetries (DISCRETE 2012) was held at Instituto Superior Técnico, Portugal, from 3-7 December 2012 and was organised by Centro de Física Teórica de Partículas (CFTP) of Instituto Superior Técnico, Universidade Técnica de Lisboa. This is the sequel to the Symposia that was successfully organised in Valéncia in 2008 and in Rome in 2010. The topics covered included: T, C, P, CP symmetries CPT symmetry, decoherence, Lorentz symmetry breaking Discrete symmetries and models of flavour mixing Baryogenesis, leptogenesis Neutrino physics Electroweak symmetry breaking and physics beyond the Standard Model Accidental symmetries (B, L conservation) Experimental prospects at LHC Dark matter searches Super flavour factories, and other new experimental facilities The Symposium was organised in plenary sessions with a total of 24 invited talks, and parallel sessions with a total of 70 talks, including both invited and selected contributions from the submitted abstracts. The speakers of the plenary sessions were: Ignatios Antoniadis, Abdelhak Djouadi, Rabindra Mohapatra, André Rubbia, Alexei Yu Smirnov, José Bernabéu, Marco Cirelli, Apostolos Pilaftsis, Antonio Di Domenico, Robertus Potting, João Varela, Frank Rathmann, Michele Gallinaro, Dumitru Ghilencea, Neville Harnew, John Walsh, Patrícia Conde Muíño, Juan Aguilar-Saavedra, Nick Mavromatos, Ulrich Nierste, Ferruccio Feruglio, Vasiliki Mitsou, Masanori Yamauchi, and Marcello Giorgi. The Symposium was attended by about 140 participants. Among the social events, there was a social dinner in the historical Associação Comercial de Lisboa, which included a musical performance of 'Fado', the traditional music from Lisbon. The next symposium of the series will be organised by King's College, London University, UK, from 1-5 December 2014. Guest Editors G C Branco, D Emmanuel-Costa, R González Felipe, F R Joaquim, L Lavoura, S Palomares-Ruiz, M N Rebelo, J C

Network Requirements in Support of Army’s LandWarNet Transformation

DTIC Science & Technology

2011-02-15

To overcome the challenges of future requirements for information dominance , the Army must develop a strategy that ensures its organizations have access to global networks and required services throughout any area of operation. This research project analyzes the Army’s transformation of the LandWarNet in support of an expeditionary Army engaged in persistent conflict. The paper identifies how well

On the Inclusion of Difference Equation Problems and Z Transform Methods in Sophomore Differential Equation Classes

ERIC Educational Resources Information Center

Savoye, Philippe

2009-01-01

In recent years, I started covering difference equations and z transform methods in my introductory differential equations course. This allowed my students to extend the "classical" methods for (ordinary differential equation) ODE's to discrete time problems arising in many applications.

Real-time atomistic observation of structural phase transformations in individual hafnia nanorods

DOE PAGES

Hudak, Bethany M.; Depner, Sean W.; Waetzig, Gregory R.; ...

2017-05-12

High-temperature phases of hafnium dioxide have exceptionally high dielectric constants and large bandgaps, but quenching them to room temperature remains a challenge. Scaling the bulk form to nanocrystals, while successful in stabilizing the tetragonal phase of isomorphous ZrO 2, has produced nanorods with a twinned version of the room temperature monoclinic phase in HfO 2. Here we use in situ heating in a scanning transmission electron microscope to observe the transformation of an HfO 2 nanorod from monoclinic to tetragonal, with a transformation temperature suppressed by over 1000°C from bulk. When the nanorod is annealed, we observe with atomic-scale resolutionmore » the transformation from twinned-monoclinic to tetragonal, starting at a twin boundary and propagating via coherent transformation dislocation; the nanorod is reduced to hafnium on cooling. Unlike the bulk displacive transition, nanoscale size-confinement enables us to manipulate the transformation mechanism, and we observe discrete nucleation events and sigmoidal nucleation and growth kinetics.« less

Quantum Optical Realization of Arbitrary Linear Transformations Allowing for Loss and Gain

NASA Astrophysics Data System (ADS)

Tischler, N.; Rockstuhl, C.; Słowik, K.

2018-04-01

Unitary transformations are routinely modeled and implemented in the field of quantum optics. In contrast, nonunitary transformations, which can involve loss and gain, require a different approach. In this work, we present a universal method to deal with nonunitary networks. An input to the method is an arbitrary linear transformation matrix of optical modes that does not need to adhere to bosonic commutation relations. The method constructs a transformation that includes the network of interest and accounts for full quantum optical effects related to loss and gain. Furthermore, through a decomposition in terms of simple building blocks, it provides a step-by-step implementation recipe, in a manner similar to the decomposition by Reck et al. [Experimental Realization of Any Discrete Unitary Operator, Phys. Rev. Lett. 73, 58 (1994), 10.1103/PhysRevLett.73.58] but applicable to nonunitary transformations. Applications of the method include the implementation of positive-operator-valued measures and the design of probabilistic optical quantum information protocols.

Modeling of brittle-viscous flow using discrete particles

NASA Astrophysics Data System (ADS)

Thordén Haug, Øystein; Barabasch, Jessica; Virgo, Simon; Souche, Alban; Galland, Olivier; Mair, Karen; Abe, Steffen; Urai, Janos L.

2017-04-01

range of viscosities. For identical pressure and strain rate, an order of magnitude range in viscosity can be investigated. The extensive material testing indicates that DEM particles interacting by a combination of elastic repulsion and dashpots can be used to model viscous flows. This allows us to exploit the fracturing capabilities of the discrete element methods and study systems that involve both viscous flow and brittle fracturing. However, the small viscosity range achievable using this approach does constraint the applicability for systems where larger viscosity ranges are required, such as folding of viscous layers of contrasting viscosities. References: Abe, S., Place, D., & Mora, P. (2004). A parallel implementation of the lattice solid model for the simulation of rock mechanics and earthquake dynamics. PAGEOPH, 161(11-12), 2265-2277. http://doi.org/10.1007/s00024-004-2562-x Abe, S., and J. L. Urai (2012), Discrete element modeling of boudinage: Insights on rock rheology, matrix flow, and evolution of geometry, JGR., 117, B01407, doi:10.1029/2011JB00855

Discrete dynamical laser equation for the critical onset of bistability, entanglement and disappearance

NASA Astrophysics Data System (ADS)

Abdul, M.; Farooq, U.; Akbar, Jehan; Saif, F.

2018-06-01

We transform the semi-classical laser equation for single mode homogeneously broadened lasers to a one-dimensional nonlinear map by using the discrete dynamical approach. The obtained mapping, referred to as laser logistic mapping (LLM), characteristically exhibits convergent, cyclic and chaotic behavior depending on the control parameter. Thus, the so obtained LLM explains stable, bistable, multi-stable, and chaotic solutions for output field intensity. The onset of bistability takes place at a critical value of the effective gain coefficient. The obtained analytical results are confirmed through numerical calculations.

A Transform-Based Feature Extraction Approach for Motor Imagery Tasks Classification

PubMed Central

Khorshidtalab, Aida; Mesbah, Mostefa; Salami, Momoh J. E.

2015-01-01

In this paper, we present a new motor imagery classification method in the context of electroencephalography (EEG)-based brain–computer interface (BCI). This method uses a signal-dependent orthogonal transform, referred to as linear prediction singular value decomposition (LP-SVD), for feature extraction. The transform defines the mapping as the left singular vectors of the LP coefficient filter impulse response matrix. Using a logistic tree-based model classifier; the extracted features are classified into one of four motor imagery movements. The proposed approach was first benchmarked against two related state-of-the-art feature extraction approaches, namely, discrete cosine transform (DCT) and adaptive autoregressive (AAR)-based methods. By achieving an accuracy of 67.35%, the LP-SVD approach outperformed the other approaches by large margins (25% compared with DCT and 6 % compared with AAR-based methods). To further improve the discriminatory capability of the extracted features and reduce the computational complexity, we enlarged the extracted feature subset by incorporating two extra features, namely, Q- and the Hotelling’s \\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{upgreek} \\usepackage{mathrsfs} \\setlength{\\oddsidemargin}{-69pt} \\begin{document} }{}$T^{2}$ \\end{document} statistics of the transformed EEG and introduced a new EEG channel selection method. The performance of the EEG classification based on the expanded feature set and channel selection method was compared with that of a number of the state-of-the-art classification methods previously reported with the BCI IIIa competition data set. Our method came second with an average accuracy of 81.38%. PMID:27170898

Print Advertisements for Alzheimer’s Disease Drugs: Informational and Transformational Features

PubMed Central

Gooblar, Jonathan; Carpenter, Brian D.

2014-01-01

Purpose We examined print advertisements for Alzheimer’s disease drugs published in journals and magazines between January 2008 and February 2012, using an informational versus transformational theoretical framework to identify objective and persuasive features. Methods In 29 unique advertisements, we used qualitative methods to code and interpret identifying information, charts, benefit and side effect language, and persuasive appeals embedded in graphics and narratives. Results Most elements contained a mixture of informational and transformational features. Charts were used infrequently, but when they did appear the accompanying text often exaggerated the data. Benefit statements covered an array of symptoms, drug properties, and caregiver issues. Side effect statements often used positive persuasive appeals. Graphics and narrative features emphasized positive emotions and outcomes. Implications We found subtle and sophisticated attempts both to educate and to persuade readers. It is important for consumers and prescribing physicians to read print advertisements critically so that they can make informed treatment choices. PMID:23687184

Perfect discretization of reparametrization invariant path integrals

NASA Astrophysics Data System (ADS)

Bahr, Benjamin; Dittrich, Bianca; Steinhaus, Sebastian

2011-05-01

To obtain a well-defined path integral one often employs discretizations. In the case of gravity and reparametrization-invariant systems, the latter of which we consider here as a toy example, discretizations generically break diffeomorphism and reparametrization symmetry, respectively. This has severe implications, as these symmetries determine the dynamics of the corresponding system. Indeed we will show that a discretized path integral with reparametrization-invariance is necessarily also discretization independent and therefore uniquely determined by the corresponding continuum quantum mechanical propagator. We use this insight to develop an iterative method for constructing such a discretized path integral, akin to a Wilsonian RG flow. This allows us to address the problem of discretization ambiguities and of an anomaly-free path integral measure for such systems. The latter is needed to obtain a path integral, that can act as a projector onto the physical states, satisfying the quantum constraints. We will comment on implications for discrete quantum gravity models, such as spin foams.

Physical reasons of emission transformation in infrared CdSeTe/ZnS quantum dots at bioconjugation

NASA Astrophysics Data System (ADS)

Torchynska, T. V.

2015-04-01

The core/shell CdSeTe/ZnS quantum dots (QDs) with emission at 780-800 nm (1.55-1.60 eV) have been studied by means of photoluminescence (PL) and Raman scattering methods in the nonconjugated state and after conjugation to different antibodies (Ab): (i) mouse monoclonal [8C9] human papilloma virus Ab, anti-HPV 16-E7 Ab, (ii) mouse monoclonal [C1P5] human papilloma virus HPV16 E6+HPV18 E6 Ab, and (iii) pseudo rabies virus (PRV) Ab. The transformations of PL and Raman scattering spectra of QDs, stimulated by conjugated antibodies, have been revealed and discussed. The energy band diagram of core/shell CdSeTe/ZnS QDs has been designed that helps to analyze the PL spectra and their transformations at the bioconjugation. It is shown that the core in CdSeTe/ZnS QDs is complex and including the type II quantum well. The last fact permits to explain the nature of infrared (IR) optical transitions (1.55-1.60 eV) and the high energy PL band (1.88-1.94 eV) in the nonconjugated and bioconjugated QDs. A set of physical reasons has been analyzed with the aim to explain the transformation of PL spectra in bioconjugated QDs. Finally it is shown that two factors are responsible for the PL spectrum transformation at bioconjugation to charged antibodies: (i) the change of energy band profile in QDs and (ii) the shift of QD energy levels in the strong quantum confinement case. The effect of PL spectrum transformation is useful for the study of QD bioconjugation to specific antibodies and can be a powerful technique for early medical diagnostics.

Directional dual-tree rational-dilation complex wavelet transform.

PubMed

Serbes, Gorkem; Gulcur, Halil Ozcan; Aydin, Nizamettin

2014-01-01

Dyadic discrete wavelet transform (DWT) has been used successfully in processing signals having non-oscillatory transient behaviour. However, due to the low Q-factor property of their wavelet atoms, the dyadic DWT is less effective in processing oscillatory signals such as embolic signals (ESs). ESs are extracted from quadrature Doppler signals, which are the output of Doppler ultrasound systems. In order to process ESs, firstly, a pre-processing operation known as phase filtering for obtaining directional signals from quadrature Doppler signals must be employed. Only then, wavelet based methods can be applied to these directional signals for further analysis. In this study, a directional dual-tree rational-dilation complex wavelet transform, which can be applied directly to quadrature signals and has the ability of extracting directional information during analysis, is introduced.

Optofluidic waveguide as a transformation optics device for lightwave bending and manipulation.

PubMed

Yang, Y; Liu, A Q; Chin, L K; Zhang, X M; Tsai, D P; Lin, C L; Lu, C; Wang, G P; Zheludev, N I

2012-01-31

Transformation optics represents a new paradigm for designing light-manipulating devices, such as cloaks and field concentrators, through the engineering of electromagnetic space using materials with spatially variable parameters. Here we analyse liquid flowing in an optofluidic waveguide as a new type of controllable transformation optics medium. We show that a laminar liquid flow in an optofluidic channel exhibits spatially variable dielectric properties that support novel wave-focussing and interference phenomena, which are distinctively different from the discrete diffraction observed in solid waveguide arrays. Our work provides new insight into the unique optical properties of optofluidic waveguides and their potential applications.

Spherical cloaking using nonlinear transformations for improved segmentation into concentric isotropic coatings.

PubMed

Qiu, Cheng-Wei; Hu, Li; Zhang, Baile; Wu, Bae-Ian; Johnson, Steven G; Joannopoulos, John D

2009-08-03

Two novel classes of spherical invisibility cloaks based on nonlinear transformation have been studied. The cloaking characteristics are presented by segmenting the nonlinear transformation based spherical cloak into concentric isotropic homogeneous coatings. Detailed investigations of the optimal discretization (e.g., thickness control of each layer, nonlinear factor, etc.) are presented for both linear and nonlinear spherical cloaks and their effects on invisibility performance are also discussed. The cloaking properties and our choice of optimal segmentation are verified by the numerical simulation of not only near-field electric-field distribution but also the far-field radar cross section (RCS).

Ionothermal synthesis and structural transformation targeted by ion exchange in metal-1,3,5-benzenetricarboxylate compounds

DOE Office of Scientific and Technical Information (OSTI.GOV)

Xu, Qing-Qing; State Key Laboratory of Structural Chemistry, Fujian Institute of Research on the Structure of Matter, Chinese Academy of Sciences, Fuzhou, Fujian 350002; Liu, Bing

Ionothermal reactions of 1,3,5-benzenetricarboxylate acid (H{sub 3}BTC) and Ni(NO{sub 3}){sub 2}, Co(NO{sub 3}){sub 2} and Cu(NO{sub 3}){sub 2} gave two discrete 32-membered ring-like allomers, [M{sub 2}(HBTC){sub 2}(NH{sub 2}CONH{sub 2}){sub 2}(H{sub 2}O){sub 4}]·3H{sub 2}O (M=Ni(1), Co(2)) and one layered [Cu{sub 2}(BTC)Cl(H{sub 2}O){sub 4}] (3). The weak interactions in 1 can be deconstructed to some degree in ion exchange by exploring the factors of divalent and trivalent metal species, metal concentration and soaking time, which are demonstrated by PXRD and N{sub 2} absorption. Cu{sup 2+} has the highest N{sub 2} adsorbance when soaking with 1, and 1 can keep structure stable whenmore » Cu{sup 2+} below 0.16 mol L{sup −1} and the soaking time within 24d. As Cu{sup 2+} beyond 0.16 mol L{sup −1} and the soaking time beyond 24d, the structure of compound 1 starts to transform with the crystal morphology from clear pale green to opaque blue. Ionothermal reactions of compound 1 with different Cu{sup 2+} amounts obtained Ni{sup 2+}-Cu{sup 2+} hetero complexes, whose PXRD patterns are similar to that of 3 and EDS indicates Cu{sup 2+}% increases with Cu{sup 2+} additions and close to 100% as Cu{sup 2+} being 1.6 mmol. It suggests that 3 is a controlled product and Cu{sup 2+} can transform discrete compound 1 into 2D compound 3. - Graphical abstract: Three compounds were synthesized through ionothermal reactions. The weak interactions in compound 1 can be deconstructed by ion exchange and discrete compound 1 can be transformed into layered compound 3. - Highlights: • Two discrete ring-like and one layered compounds were ionothermally synthesized. • Metal species, metal concentration and soaking time deconstruct the H-bondings in 1. • 1 can be transformed to 3 through ionothermal reaction, otherwise forbidden.« less

Compatible Spatial Discretizations for Partial Differential Equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Arnold, Douglas, N, ed.

From May 11--15, 2004, the Institute for Mathematics and its Applications held a hot topics workshop on Compatible Spatial Discretizations for Partial Differential Equations. The numerical solution of partial differential equations (PDE) is a fundamental task in science and engineering. The goal of the workshop was to bring together a spectrum of scientists at the forefront of the research in the numerical solution of PDEs to discuss compatible spatial discretizations. We define compatible spatial discretizations as those that inherit or mimic fundamental properties of the PDE such as topology, conservation, symmetries, and positivity structures and maximum principles. A wide varietymore » of discretization methods applied across a wide range of scientific and engineering applications have been designed to or found to inherit or mimic intrinsic spatial structure and reproduce fundamental properties of the solution of the continuous PDE model at the finite dimensional level. A profusion of such methods and concepts relevant to understanding them have been developed and explored: mixed finite element methods, mimetic finite differences, support operator methods, control volume methods, discrete differential forms, Whitney forms, conservative differencing, discrete Hodge operators, discrete Helmholtz decomposition, finite integration techniques, staggered grid and dual grid methods, etc. This workshop seeks to foster communication among the diverse groups of researchers designing, applying, and studying such methods as well as researchers involved in practical solution of large scale problems that may benefit from advancements in such discretizations; to help elucidate the relations between the different methods and concepts; and to generally advance our understanding in the area of compatible spatial discretization methods for PDE. Particular points of emphasis included: + Identification of intrinsic properties of PDE models that are critical for the fidelity of

A novel method to fabricate discrete porous carbon hemispheres and their electrochemical properties as supercapacitors.

PubMed

Chen, Jiafu; Lang, Zhanlin; Xu, Qun; Zhang, Jianan; Fu, Jianwei; Chen, Zhimin

2013-11-07

A simple and efficient method to produce discrete, hierarchical porous carbon hemispheres (CHs) with high uniformity has been successfully developed by constructing nanoreactors and using low crosslinked poly(styrene-co-divinylbenzene) (P(St-co-DVB)) capsules as precursors. The samples are characterized by scanning and transmission electron microscopy, Fourier transform infrared and Raman spectroscopy, X-ray diffraction, and N2 adsorption and desorption. Considering their application, the cyclic voltammetry and electrochemical impedance spectroscopy characterization are tested. The experimental results show that the achievement of discrete and perfect carbon hemispheres is dependent on the proper amount of DVB in the P(St-co-DVB) capsules, which can contribute to the ideal thickness or mechanical strength of the shells. When the amount of DVB is 35 wt% in the precursors, a high Brunauer-Emmett-Teller surface area of 676 m(2) g(-1) can be obtained for the carbon hemispheres, and the extremely large pore volume of 2.63 cm(3) g(-1) can also be achieved at the same time. The electrochemical test shows the carbon hemispheres have a higher specific capacitance of ca. 83 F g(-1) at 10 mV s(-1), compared to other carbon materials. So this method supplies a platform to extend the fabrication field of carbon materials and supplies more chances for the application of carbon materials including carbon hemispheres that are important components and substrates for supercapacitors.

Segmentation of discrete vector fields.

PubMed

Li, Hongyu; Chen, Wenbin; Shen, I-Fan

2006-01-01

In this paper, we propose an approach for 2D discrete vector field segmentation based on the Green function and normalized cut. The method is inspired by discrete Hodge Decomposition such that a discrete vector field can be broken down into three simpler components, namely, curl-free, divergence-free, and harmonic components. We show that the Green Function Method (GFM) can be used to approximate the curl-free and the divergence-free components to achieve our goal of the vector field segmentation. The final segmentation curves that represent the boundaries of the influence region of singularities are obtained from the optimal vector field segmentations. These curves are composed of piecewise smooth contours or streamlines. Our method is applicable to both linear and nonlinear discrete vector fields. Experiments show that the segmentations obtained using our approach essentially agree with human perceptual judgement.

Defense Business Transformation

DTIC Science & Technology

2009-12-01

Defense Business Transformation by Jacques S. Gansler and William Lucyshyn The Center for Technology and National...REPORT TYPE 3. DATES COVERED 00-00-2009 to 00-00-2009 4. TITLE AND SUBTITLE Defense Business Transformation 5a. CONTRACT NUMBER 5b. GRANT NUMBER...vii Part One: DoD Business Transformation

Perfect discretization of path integrals

NASA Astrophysics Data System (ADS)

Steinhaus, Sebastian

2012-05-01

In order to obtain a well-defined path integral one often employs discretizations. In the case of General Relativity these generically break diffeomorphism symmetry, which has severe consequences since these symmetries determine the dynamics of the corresponding system. In this article we consider the path integral of reparametrization invariant systems as a toy example and present an improvement procedure for the discretized propagator. Fixed points and convergence of the procedure are discussed. Furthermore we show that a reparametrization invariant path integral implies discretization independence and acts as a projector onto physical states.

Study on sampling of continuous linear system based on generalized Fourier transform

NASA Astrophysics Data System (ADS)

Li, Huiguang

2003-09-01

In the research of signal and system, the signal's spectrum and the system's frequency characteristic can be discussed through Fourier Transform (FT) and Laplace Transform (LT). However, some singular signals such as impulse function and signum signal don't satisfy Riemann integration and Lebesgue integration. They are called generalized functions in Maths. This paper will introduce a new definition -- Generalized Fourier Transform (GFT) and will discuss generalized function, Fourier Transform and Laplace Transform under a unified frame. When the continuous linear system is sampled, this paper will propose a new method to judge whether the spectrum will overlap after generalized Fourier transform (GFT). Causal and non-causal systems are studied, and sampling method to maintain system's dynamic performance is presented. The results can be used on ordinary sampling and non-Nyquist sampling. The results also have practical meaning on research of "discretization of continuous linear system" and "non-Nyquist sampling of signal and system." Particularly, condition for ensuring controllability and observability of MIMO continuous systems in references 13 and 14 is just an applicable example of this paper.

Doubled lattice Chern-Simons-Yang-Mills theories with discrete gauge group

NASA Astrophysics Data System (ADS)

Caspar, S.; Mesterházy, D.; Olesen, T. Z.; Vlasii, N. D.; Wiese, U.-J.

2016-11-01

We construct doubled lattice Chern-Simons-Yang-Mills theories with discrete gauge group G in the Hamiltonian formulation. Here, these theories are considered on a square spatial lattice and the fundamental degrees of freedom are defined on pairs of links from the direct lattice and its dual, respectively. This provides a natural lattice construction for topologically-massive gauge theories, which are invariant under parity and time-reversal symmetry. After defining the building blocks of the doubled theories, paying special attention to the realization of gauge transformations on quantum states, we examine the dynamics in the group space of a single cross, which is spanned by a single link and its dual. The dynamics is governed by the single-cross electric Hamiltonian and admits a simple quantum mechanical analogy to the problem of a charged particle moving on a discrete space affected by an abstract electromagnetic potential. Such a particle might accumulate a phase shift equivalent to an Aharonov-Bohm phase, which is manifested in the doubled theory in terms of a nontrivial ground-state degeneracy on a single cross. We discuss several examples of these doubled theories with different gauge groups including the cyclic group Z(k) ⊂ U(1) , the symmetric group S3 ⊂ O(2) , the binary dihedral (or quaternion) group D¯2 ⊂ SU(2) , and the finite group Δ(27) ⊂ SU(3) . In each case the spectrum of the single-cross electric Hamiltonian is determined exactly. We examine the nature of the low-lying excited states in the full Hilbert space, and emphasize the role of the center symmetry for the confinement of charges. Whether the investigated doubled models admit a non-Abelian topological state which allows for fault-tolerant quantum computation will be addressed in a future publication.

Design and Analysis of Discrete Lateral Autopilots for Coordinated Bank- to-Turn Missiles

DTIC Science & Technology

1985-12-01

ANALYSIS OF DISCRETE LATERAL AUTOPILOTS FOR COORDINATED BANK-TO-TURN MISSILES * by Christos 1. Karadimas C)__ December 1935 LAJ *Thesis Advisor: Daniel .J...Include Security Clastfication) DESIGN AND ANALYSIS OF DISCRETE LATERAL AUTOPILOTS FOR .- COORDINATED BANK-TO-TURN MISSILES A - H . R o KARADIMAS ...Coordinated Bank-to-Turn Missiles - by Christos I. Karadimas Lieutenant, Hellenic Navy B.S., Hellenic Naval Academy, 1976 Submitted in partial

Phase synchronization based on a Dual-Tree Complex Wavelet Transform

NASA Astrophysics Data System (ADS)

Ferreira, Maria Teodora; Domingues, Margarete Oliveira; Macau, Elbert E. N.

2016-11-01

In this work, we show the applicability of our Discrete Complex Wavelet Approach (DCWA) to verify the phenomenon of phase synchronization transition in two coupled chaotic Lorenz systems. DCWA is based on the phase assignment from complex wavelet coefficients obtained by using a Dual-Tree Complex Wavelet Transform (DT-CWT). We analyzed two coupled chaotic Lorenz systems, aiming to detect the transition from non-phase synchronization to phase synchronization. In addition, we check how good is the method in detecting periods of 2π phase-slips. In all experiments, DCWA is compared with classical phase detection methods such as the ones based on arctangent and Hilbert transform showing a much better performance.

Women’s Preferences for Treatment of Perinatal Depression and Anxiety: A Discrete Choice Experiment

PubMed Central

Ride, Jemimah; Lancsar, Emily

2016-01-01

Perinatal depression and anxiety (PNDA) are an international healthcare priority, associated with significant short- and long-term problems for women, their children and families. Effective treatment is available but uptake is suboptimal: some women go untreated whilst others choose treatments without strong evidence of efficacy. Better understanding of women’s preferences for treatment is needed to facilitate uptake of effective treatment. To address this issue, a discrete choice experiment (DCE) was administered to 217 pregnant or postnatal women in Australia, who were recruited through an online research company and had similar sociodemographic characteristics to Australian data for perinatal women. The DCE investigated preferences regarding cost, treatment type, availability of childcare, modality and efficacy. Data were analysed using logit-based models accounting for preference and scale heterogeneity. Predicted probability analysis was used to explore relative attribute importance and policy change scenarios, including how these differed by women’s sociodemographic characteristics. Cost and treatment type had the greatest impact on choice, such that a policy of subsidising effective treatments was predicted to double their uptake compared with the base case. There were differences in predicted uptake associated with certain sociodemographic characteristics: for example, women with higher educational attainment were more likely to choose effective treatment. The findings suggest policy directions for decision makers whose goal is to reduce the burden of PNDA on women, their children and families. PMID:27258096

The extended Fourier transform for 2D spectral estimation.

PubMed

Armstrong, G S; Mandelshtam, V A

2001-11-01

We present a linear algebraic method, named the eXtended Fourier Transform (XFT), for spectral estimation from truncated time signals. The method is a hybrid of the discrete Fourier transform (DFT) and the regularized resolvent transform (RRT) (J. Chen et al., J. Magn. Reson. 147, 129-137 (2000)). Namely, it estimates the remainder of a finite DFT by RRT. The RRT estimation corresponds to solution of an ill-conditioned problem, which requires regularization. The regularization depends on a parameter, q, that essentially controls the resolution. By varying q from 0 to infinity one can "tune" the spectrum between a high-resolution spectral estimate and the finite DFT. The optimal value of q is chosen according to how well the data fits the form of a sum of complex sinusoids and, in particular, the signal-to-noise ratio. Both 1D and 2D XFT are presented with applications to experimental NMR signals. Copyright 2001 Academic Press.

Delay-dependent dynamical analysis of complex-valued memristive neural networks: Continuous-time and discrete-time cases.

PubMed

Wang, Jinling; Jiang, Haijun; Ma, Tianlong; Hu, Cheng

2018-05-01

This paper considers the delay-dependent stability of memristive complex-valued neural networks (MCVNNs). A novel linear mapping function is presented to transform the complex-valued system into the real-valued system. Under such mapping function, both continuous-time and discrete-time MCVNNs are analyzed in this paper. Firstly, when activation functions are continuous but not Lipschitz continuous, an extended matrix inequality is proved to ensure the stability of continuous-time MCVNNs. Furthermore, if activation functions are discontinuous, a discontinuous adaptive controller is designed to acquire its stability by applying Lyapunov-Krasovskii functionals. Secondly, compared with techniques in continuous-time MCVNNs, the Halanay-type inequality and comparison principle are firstly used to exploit the dynamical behaviors of discrete-time MCVNNs. Finally, the effectiveness of theoretical results is illustrated through numerical examples. Copyright © 2018 Elsevier Ltd. All rights reserved.

Wavelet denoising during optical coherence tomography of the prostate nerves using the complex wavelet transform.

PubMed

Chitchian, Shahab; Fiddy, Michael; Fried, Nathaniel M

2008-01-01

Preservation of the cavernous nerves during prostate cancer surgery is critical in preserving sexual function after surgery. Optical coherence tomography (OCT) of the prostate nerves has recently been studied for potential use in nerve-sparing prostate surgery. In this study, the discrete wavelet transform and complex dual-tree wavelet transform are implemented for wavelet shrinkage denoising in OCT images of the rat prostate. Applying the complex dual-tree wavelet transform provides improved results for speckle noise reduction in the OCT prostate image. Image quality metrics of the cavernous nerves and signal-to-noise ratio (SNR) were improved significantly using this complex wavelet denoising technique.

Dynamic Bayesian wavelet transform: New methodology for extraction of repetitive transients