Medical images storage using discrete cosine transform
Arhouma, Ali M.; Ajaal, Tawfik; Marghani, Khaled
2010-01-01
The advances in technology during the last decades have made the use of digital images as one of the common things in everyday life. While the application of digital images in communicating information is very important, the cost of storing and transmitting images is much larger compared to storage and transmission of text. The main problem with all of the images was the fact that they take large size of memory space, large transmission bandwidth and long transmission time. Image data compression is needed to reduce the storage space,transmission bandwidth and transmission time. Medical image compression plays a key role as hospitals move towards filmless imaging and go completely digital. Image compression allows Picture Archiving and Communication Systems (PACS) to reduce the file size on their storage requirements while maintaining relevant diagnostic information. The reduced image file size yield reduced transmission times. Even as the capacity of storage media continues to increase, it is expected that the volume of uncompressed data produced by hospitals will exceed capacity of storage and drive up costs. This paper proposes a Discrete Cosine Transform (DCT) algorithm which can help to solve the image storage and transmission time problem in hospitals. Discrete cosine transform (DCT) has become the most popular technique for image compression over the past several years. One of the major reasons for its popularity is its selection as the standard for JPEG. DCTs are most commonly used for non-analytical applications such as image processing and digital signal-processing (DSP) applications such as video conferencing, fax systems, video disks, and high-definition television HDTV. They also can be used on a matrix of practically any dimension. The proposed (DCT) algorithm improves the performance of medical image compression while satisfying both the medical image quality, and the high compression ratio. Application of DCT coding algorithm to actual still images
Full-frame compression of discrete wavelet and cosine transforms
Lo, Shih-Chung B.; Li, Huai; Krasner, Brian; Freedman, Matthew T.; Mun, Seong K.
1995-04-01
At the foreground of computerized radiology and the filmless hospital are the possibilities for easy image retrieval, efficient storage, and rapid image communication. This paper represents the authors' continuous efforts in compression research on full-frame discrete wavelet (FFDWT) and full-frame discrete cosine transforms (FFDCT) for medical image compression. Prior to the coding, it is important to evaluate the global entropy in the decomposed space. It is because of the minimum entropy, that a maximum compression efficiency can be achieved. In this study, each image was split into the top three most significant bit (MSB) and the remaining remapped least significant bit (RLSB) images. The 3MSB image was compressed by an error-free contour coding and received an average of 0.1 bit/pixel. The RLSB image was either transformed to a multi-channel wavelet or the cosine transform domain for entropy evaluation. Ten x-ray chest radiographs and ten mammograms were randomly selected from our clinical database and were used for the study. Our results indicated that the coding scheme in the FFDCT domain performed better than in FFDWT domain for high-resolution digital chest radiographs and mammograms. From this study, we found that decomposition efficiency in the DCT domain for relatively smooth images is higher than that in the DWT. However, both schemes worked just as well for low resolution digital images. We also found that the image characteristics of the `Lena' image commonly used in the compression literature are very different from those of radiological images. The compression outcome of the radiological images can not be extrapolated from the compression result based on the `Lena.'
Adaptive discrete cosine transform coding algorithm for digital mammography
Baskurt, Atilla M.; Magnin, Isabelle E.; Goutte, Robert
1992-09-01
The need for storage, transmission, and archiving of medical images has led researchers to develop adaptive and efficient data compression techniques. Among medical images, x-ray radiographs of the breast are especially difficult to process because of their particularly low contrast and very fine structures. A block adaptive coding algorithm based on the discrete cosine transform to compress digitized mammograms is described. A homogeneous repartition of the degradation in the decoded images is obtained using a spatially adaptive threshold. This threshold depends on the coding error associated with each block of the image. The proposed method is tested on a limited number of pathological mammograms including opacities and microcalcifications. A comparative visual analysis is performed between the original and the decoded images. Finally, it is shown that data compression with rather high compression rates (11 to 26) is possible in the mammography field.
Fast ghost imaging and ghost encryption based on the discrete cosine transform
Tanha, Mehrdad; Ahmadi-Kandjani, Sohrab; Kheradmand, Reza
2013-01-01
We introduce the discrete cosine transform as an advanced compression tool for images in computational ghost imaging. A novel approach to fast imaging and encryption, the discrete cosine transform, promotes the security level of ghost images and reduces the image retrieval time. To discuss the advantages of this technique we compare experimental outcomes with simulated ones. (paper)
A 16X16 Discrete Cosine Transform Chip
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
Wiener discrete cosine transform-based image filtering
Pogrebnyak, Oleksiy; Lukin, Vladimir V.
2012-10-01
A classical problem of additive white (spatially uncorrelated) Gaussian noise suppression in grayscale images is considered. The main attention is paid to discrete cosine transform (DCT)-based denoising, in particular, to image processing in blocks of a limited size. The efficiency of DCT-based image filtering with hard thresholding is studied for different sizes of overlapped blocks. A multiscale approach that aggregates the outputs of DCT filters having different overlapped block sizes is proposed. Later, a two-stage denoising procedure that presumes the use of the multiscale DCT-based filtering with hard thresholding at the first stage and a multiscale Wiener DCT-based filtering at the second stage is proposed and tested. The efficiency of the proposed multiscale DCT-based filtering is compared to the state-of-the-art block-matching and three-dimensional filter. Next, the potentially reachable multiscale filtering efficiency in terms of output mean square error (MSE) is studied. The obtained results are of the same order as those obtained by Chatterjee's approach based on nonlocal patch processing. It is shown that the ideal Wiener DCT-based filter potential is usually higher when noise variance is high.
Regular Discrete Cosine Transform and its Application to Digital Images Representation
Yuri A. Gadzhiev
2011-11-01
Full Text Available Discrete cosine transform dct-i, unlike dct-ii, does not concentrate the energy of a transformed vector sufficiently well, so it is not used practically for the purposes of digital image compression. By performing regular normalization of the basic cosine transform matrix, we obtain a discrete cosine transform which has the same cosine basis as dct-i, coincides as dct-i with its own inverse transform, but unlike dct-i, it does not reduce the proper ability of cosine transform to the energy concentration. In this paper we consider briefly the properties of this transform, its possible integer implementation for the case of 8x8-matrix, its applications to the image itself and to the preliminary rgb colour space transformations, further more we investigate some models of quantization, perform an experiment for the estimation of the level of digital images compression and the quality achieved by use of this transform. This experiment shows that the transform can be sufficiently effective for practical use, but the question of its comparative effectiveness with respect to dct-ii remains open.
Jinyu Lu
2014-01-01
Full Text Available A novel iris biometric watermarking scheme is proposed focusing on iris recognition instead of the traditional watermark for increasing the security of the digital products. The preprocess of iris image is to be done firstly, which generates the iris biometric template from person's eye images. And then the templates are to be on discrete cosine transform; the value of the discrete cosine is encoded to BCH error control coding. The host image is divided into four areas equally correspondingly. The BCH codes are embedded in the singular values of each host image's coefficients which are obtained through discrete cosine transform (DCT. Numerical results reveal that proposed method can extract the watermark effectively and illustrate its security and robustness.
Discrete cosine and sine transforms general properties, fast algorithms and integer approximations
Britanak, Vladimir; Rao, K R; Rao, K R
2006-01-01
The Discrete Cosine Transform (DCT) is used in many applications by the scientific, engineering and research communities and in data compression in particular. Fast algorithms and applications of the DCT Type II (DCT-II) have become the heart of many established international image/video coding standards. Since then other forms of the DCT and Discrete Sine Transform (DST) have been investigated in detail. This new edition presents the complete set of DCT and DST discrete trigonometric transforms, including their definitions, general mathematical properties, and relations to the optimal Karhune
Analytic discrete cosine harmonic wavelet transform based OFDM ...
ADCHWT_OFDM) has been proposed in this paper. Analytic DCHWT has been realized by applying DCHWT to the original signal and to its Hilbert transform. ADCHWT has been found to be computationally efficient and very effective in improving ...
A new Watermarking System based on Discrete Cosine Transform (DCT) in color biometric images.
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.
Alternatives to the discrete cosine transform for irreversible tomographic image compression
Villasenor, J.D.
1993-01-01
Full-frame irreversible compression of medical images is currently being performed using the discrete cosine transform (DCT). Although the DCT is the optimum fast transform for video compression applications, the authors show here that it is out-performed by the discrete Fourier transform (DFT) and discrete Hartley transform (DHT) for images obtained using positron emission tomography (PET) and magnetic resonance imaging (MRI), and possibly for certain types of digitized radiographs. The difference occurs because PET and MRI images are characterized by a roughly circular region D of non-zero intensity bounded by a region R in which the Image intensity is essentially zero. Clipping R to its minimum extent can reduce the number of low-intensity pixels but the practical requirement that images be stored on a rectangular grid means that a significant region of zero intensity must remain an integral part of the image to be compressed. With this constraint imposed, the DCT loses its advantage over the DFT because neither transform introduces significant artificial discontinuities. The DFT and DHT have the further important advantage of requiring less computation time than the DCT
Use of the Discrete Cosine Transform for the restoration of an image sequence
Acheroy, M.P.J.
1985-01-01
The Discrete Cosine Transform (DCT) is recognized as an important tool for image compression techniques. Its use in image restoration is, however, not well known. It is the aim of this paper to provide a restoration method for a sequence of images using the DCT as well for the deblurring as for the noise reduction. It is shown that the DCT can play an interesting role in the deconvolution problem for linear imaging systems with finite, invariant and symmetric impulse response. It is further shown that the noise reduction can be performed onto an image sequence using a time adaptive Kalman filter in the domain of the Karhunen-Loeve transform which is approximated by the DCT
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.
Warped Discrete Cosine Transform-Based Low Bit-Rate Block Coding Using Image Downsampling
Ertürk Sarp
2007-01-01
Full Text Available This paper presents warped discrete cosine transform (WDCT-based low bit-rate block coding using image downsampling. While WDCT aims to improve the performance of conventional DCT by frequency warping, the WDCT has only been applicable to high bit-rate coding applications because of the overhead required to define the parameters of the warping filter. Recently, low bit-rate block coding based on image downsampling prior to block coding followed by upsampling after the decoding process is proposed to improve the compression performance for low bit-rate block coders. This paper demonstrates that a superior performance can be achieved if WDCT is used in conjunction with image downsampling-based block coding for low bit-rate applications.
A Complete Video Coding Chain Based on Multi-Dimensional Discrete Cosine Transform
T. Fryza
2010-09-01
Full Text Available The paper deals with a video compression method based on the multi-dimensional discrete cosine transform. In the text, the encoder and decoder architectures including the deﬁnitions of all mathematical operations like the forward and inverse 3-D DCT, quantization and thresholding are presented. According to the particular number of currently processed pictures, the new quantization tables and entropy code dictionaries are proposed in the paper. The practical properties of the 3-D DCT coding chain compared with the modern video compression methods (such as H.264 and WebM and the computing complexity are presented as well. It will be proved the best compress properties could be achieved by complex H.264 codec. On the other hand the computing complexity - especially on the encoding side - is lower for the 3-D DCT method.
High-capacity method for hiding data in the discrete cosine transform domain
Qazanfari, Kazem; Safabakhsh, Reza
2013-10-01
Steganography is the art and science of hiding data in different media such as texts, audios, images, and videos. Data hiding techniques are generally divided into two groups: spatial and frequency domain techniques. Spatial domain methods generally have low security and, as a result, are less attractive to researchers. Discrete cosine transform (DCT) is the most common transform domain used in steganography and JPEG compression. Since a large number of the DCT coefficients of JPEG images are zero, the capacity of DCT domain-based steganography methods is not very high. We present a high-capacity method for hiding messages in the DCT domain. We describe the method in two classes where the receiver has and where the receiver does not have the cover image. In each class, we consider three cases for each coefficient. By considering n coefficients, there are 3n different situations. The method embeds ⌊log2 3n⌋ bits in these n coefficients. We show that the maximum reachable capacity by our method is 58% higher than the other general steganography methods. Experimental results show that the histogram-based steganalysis methods cannot detect the stego images produced by the proposed method while the capacity is increased significantly.
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.
Spread spectrum image data hiding in the encrypted discrete cosine transform coefficients
Zhang, Xiaoqiang; Wang, Z. Jane
2013-10-01
Digital watermarking and data hiding are important tools for digital rights protection of media data. Spread spectrum (SS)-based watermarking and data-hiding approaches are popular due to their outstanding robustness, but their security might not be sufficient. To improve the security of SS, a SS-based image data-hiding approach is proposed by encrypting the discrete cosine transform coefficients of the host image with the piecewise linear chaotic map, before the operation of watermark embedding. To evaluate the performance of the proposed approach, simulations and analyses of its robustness and security are carried out. The average bit-error-rate values on 100 real images from the Berkeley segmentation dataset under the JPEG compression, additive Gaussian noise, salt and pepper noise, and cropping attacks are reported. Experimental results show that the proposed approach can maintain the high robustness of traditional SS schemes and, meanwhile, also improve the security. The proposed approach can extend the key space of traditional SS schemes from 10 to 10 and thus can resist brute-force attack and unauthorized detection watermark attack.
Design of fractional order differentiator using type-III and type-IV discrete cosine transform
Manjeet Kumar
2017-02-01
Full Text Available In this paper, an interpolation method based on discrete cosine transform (DCT is employed for digital finite impulse response-fractional order differentiator (FIR-FOD design. Here, a fractional order digital differentiator is modeled as finite impulse response (FIR system to get an optimized frequency response that approximates the ideal response of a fractional order differentiator. Next, DCT-III and DCT-IV are utilized to determine the filter coefficients of FIR filter that compute the Fractional derivative of a given signal. To improve the frequency response of the proposed FIR-FOD, the filter coefficients are further modified using windows. Several design examples are presented to demonstrate the superiority of the proposed method. The simulation results have also been compared with the existing FIR-FOD design methods such as DFT interpolation, radial basis function (RBF interpolation, DCT-II interpolation and DST interpolation methods. The result reveals that the proposed FIR-FOD design technique using DCT-III and DCT-IV outperforms DFT interpolation, RBF interpolation, DCT-II interpolation and DST interpolation methods in terms of magnitude error.
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.
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.
Raisah Hayati
2014-03-01
Full Text Available Detection of low signal and determination target locations is the basis and important in the system radar. Performance of radar can enhanced with enhancement signal-to-noise ratio in the receiver. In this research, will show a algorithm in radar signal processing, that is for extract the signal target in the place of noise. Discrete Cosine Transform (DCT and Discrete Wavelet Transform (DWT is the success full mathematic function in the signal processing in the last twenty years. In this research will simulate signal with DCT and DWT, analysis his performance in radar signal processing. DWT signal processing will analysis and compare with mother wavelet Haar, Daubechies-12, Coiflet-5 and Symlet-8. DCT signal processing will analysis and compare with same of window function with use in signal restrictions. Window function have influence signal resolution in domain frequency. Window function that use in this research Rectangular, Hamming, Hanning and Dolph-Chebyshev. The result of simulation and analysis Is: mother wavelet with DWT, wavelet Daubechies-12 and Symlet-8 give the best performance and mother wavelet Haar give bad performance. Wavelet Daubechies-12 give the biggest signal to noise ratio that is 32,0603 dB. Mother wavelet Symlet-8 give 32,6589 dB. Mother wavelet Haar give 14,6692 dB. Testing window function DCT, window Dolph-Chebyshev give the best performance, with give the best separation of signal. Analysis of signal reflection that accept of radar give the result that DWT is better performance than DCT in breaking of noise.
Zulfan
2016-07-01
Full Text Available This article discusses a new method for the detection of forgery images generated by copy-move technique. Copy-move technique is one of image forgery techniques which taking a particular object from its original image and add it on that image for the purpose of increasing the number of or changing the same object in the original image. This study aims to detect the forged image generated by the copy-move techniques and copy-move forged image that has been modified by the rotation operation and histogram equalization. Detection feature used is Ordinal Measure of Discrete Cosine Transform coefficient (OM-DCT. Detection starts with division of the image into a block size of BXB (B = 16x16, 32x32 and 64x64 and two-dimensional DCT was performed to each of blocks. The feature distance from the original to the fake image, was calculated by the Euclidian distance and each feature has a distance of less than or equal to the threshold value (T according to the observations will be marked as a forged part. The results show that there are blocks detected on the copy-move image, whether on the unmodified copy-move forge image or those which modified by the rotation operation and histogram equalization. The number of blocks that are found in the copy-move object varies according to the size of the detection block used.
Shih, Cheng-Ting; Lin, Hsin-Hon; Chuang, Keh-Shih; Wu, Jay; Chang, Shu-Jun
2014-01-01
Purpose: Several positron emission tomography (PET) scanners with special detector block arrangements have been developed in recent years to improve the resolution of PET images. However, the discontinuous detector blocks cause gaps in the sinogram. This study proposes an adaptive discrete cosine transform-based (aDCT) filter for gap-inpainting. Methods: The gap-corrupted sinogram was morphologically closed and subsequently converted to the DCT domain. A certain number of the largest coefficients in the DCT spectrum were identified to determine the low-frequency preservation region. The weighting factors for the remaining coefficients were determined by an exponential weighting function. The aDCT filter was constructed and applied to two digital phantoms and a simulated phantom introduced with various levels of noise. Results: For the Shepp-Logan head phantom, the aDCT filter filled the gaps effectively. For the Jaszczak phantom, no secondary artifacts were induced after aDCT filtering. The percent mean square error and mean structure similarity of the aDCT filter were superior to those of the DCT2 filter at all noise levels. For the simulated striatal dopamine innervation study, the aDCT filter recovered the shape of the striatum and restored the striatum to reference activity ratios to the ideal value. Conclusions: The proposed aDCT filter can recover the missing gap data in the sinogram and improve the image quality and quantitative accuracy of PET images
Shih, Cheng-Ting; Lin, Hsin-Hon; Chuang, Keh-Shih [Department of Biomedical Engineering and Environmental Sciences, National Tsing Hua University, Hsinchu 30013, Taiwan (China); Wu, Jay, E-mail: jwu@mail.cmu.edu.tw [Department of Biomedical Imaging and Radiological Science, China Medical University, Taichung 40402, Taiwan (China); Chang, Shu-Jun [Health Physics Division, Institute of Nuclear Energy Research, Atomic Energy Council, Taoyuan 32546, Taiwan (China)
2014-08-15
Purpose: Several positron emission tomography (PET) scanners with special detector block arrangements have been developed in recent years to improve the resolution of PET images. However, the discontinuous detector blocks cause gaps in the sinogram. This study proposes an adaptive discrete cosine transform-based (aDCT) filter for gap-inpainting. Methods: The gap-corrupted sinogram was morphologically closed and subsequently converted to the DCT domain. A certain number of the largest coefficients in the DCT spectrum were identified to determine the low-frequency preservation region. The weighting factors for the remaining coefficients were determined by an exponential weighting function. The aDCT filter was constructed and applied to two digital phantoms and a simulated phantom introduced with various levels of noise. Results: For the Shepp-Logan head phantom, the aDCT filter filled the gaps effectively. For the Jaszczak phantom, no secondary artifacts were induced after aDCT filtering. The percent mean square error and mean structure similarity of the aDCT filter were superior to those of the DCT2 filter at all noise levels. For the simulated striatal dopamine innervation study, the aDCT filter recovered the shape of the striatum and restored the striatum to reference activity ratios to the ideal value. Conclusions: The proposed aDCT filter can recover the missing gap data in the sinogram and improve the image quality and quantitative accuracy of PET images.
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.
Akkoç, Betül; Arslan, Ahmet; Kök, Hatice
2017-05-01
One of the first stages in the identification of an individual is gender determination. Through gender determination, the search spectrum can be reduced. In disasters such as accidents or fires, which can render identification somewhat difficult, durable teeth are an important source for identification. This study proposes a smart system that can automatically determine gender using 3D digital maxillary tooth plaster models. The study group was composed of 40 Turkish individuals (20 female, 20 male) between the ages of 21 and 24. Using the iterative closest point (ICP) algorithm, tooth models were aligned, and after the segmentation process, models were transformed into depth images. The local discrete cosine transform (DCT) was used in the process of feature extraction, and the random forest (RF) algorithm was used for the process of classification. Classification was performed using 30 different seeds for random generator values and 10-fold cross-validation. A value of 85.166% was obtained for average classification accuracy (CA) and a value of 91.75% for the area under the ROC curve (AUC). A multi-disciplinary study is performed here that includes computer sciences, medicine and dentistry. A smart system is proposed for the determination of gender from 3D digital models of maxillary tooth plaster models. This study has the capacity to extend the field of gender determination from teeth. Copyright © 2017 Elsevier B.V. All rights reserved.
Firth, Jean M
1992-01-01
The analysis of signals and systems using transform methods is a very important aspect of the examination of processes and problems in an increasingly wide range of applications. Whereas the initial impetus in the development of methods appropriate for handling discrete sets of data occurred mainly in an electrical engineering context (for example in the design of digital filters), the same techniques are in use in such disciplines as cardiology, optics, speech analysis and management, as well as in other branches of science and engineering. This text is aimed at a readership whose mathematical background includes some acquaintance with complex numbers, linear differen tial equations, matrix algebra, and series. Specifically, a familiarity with Fourier series (in trigonometric and exponential forms) is assumed, and an exposure to the concept of a continuous integral transform is desirable. Such a background can be expected, for example, on completion of the first year of a science or engineering degree cour...
Inversion algorithms for the spherical Radon and cosine transform
Louis, A K; Riplinger, M; Spiess, M; Spodarev, E
2011-01-01
We consider two integral transforms which are frequently used in integral geometry and related fields, namely the spherical Radon and cosine transform. Fast algorithms are developed which invert the respective transforms in a numerically stable way. So far, only theoretical inversion formulae or algorithms for atomic measures have been derived, which are not so important for applications. We focus on two- and three-dimensional cases, where we also show that our method leads to a regularization. Numerical results are presented and show the validity of the resulting algorithms. First, we use synthetic data for the inversion of the Radon transform. Then we apply the algorithm for the inversion of the cosine transform to reconstruct the directional distribution of line processes from finitely many intersections of their lines with test lines (2D) or planes (3D), respectively. Finally we apply our method to analyse a series of microscopic two- and three-dimensional images of a fibre system
Infrared images target detection based on background modeling in the discrete cosine domain
Ye, Han; Pei, Jihong
2018-02-01
Background modeling is the critical technology to detect the moving target for video surveillance. Most background modeling techniques are aimed at land monitoring and operated in the spatial domain. A background establishment becomes difficult when the scene is a complex fluctuating sea surface. In this paper, the background stability and separability between target are analyzed deeply in the discrete cosine transform (DCT) domain, on this basis, we propose a background modeling method. The proposed method models each frequency point as a single Gaussian model to represent background, and the target is extracted by suppressing the background coefficients. Experimental results show that our approach can establish an accurate background model for seawater, and the detection results outperform other background modeling methods in the spatial domain.
Discrete Gabor transform and discrete Zak transform
Bastiaans, M.J.; Namazi, N.M.; Matthews, K.
1996-01-01
Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal or synthesis window is introduced, along with the inverse operation, i.e. the Gabor transform, which uses an analysis window that is related to the synthesis window and with the help of
Zhao, Yun-wei; Zhu, Zi-qiang; Lu, Guang-yin; Han, Bo
2018-03-01
The sine and cosine transforms implemented with digital filters have been used in the Transient electromagnetic methods for a few decades. Kong (2007) proposed a method of obtaining filter coefficients, which are computed in the sample domain by Hankel transform pair. However, the curve shape of Hankel transform pair changes with a parameter, which usually is set to be 1 or 3 in the process of obtaining the digital filter coefficients of sine and cosine transforms. First, this study investigates the influence of the parameter on the digital filter algorithm of sine and cosine transforms based on the digital filter algorithm of Hankel transform and the relationship between the sine, cosine function and the ±1/2 order Bessel function of the first kind. The results show that the selection of the parameter highly influences the precision of digital filter algorithm. Second, upon the optimal selection of the parameter, it is found that an optimal sampling interval s also exists to achieve the best precision of digital filter algorithm. Finally, this study proposes four groups of sine and cosine transform digital filter coefficients with different length, which may help to develop the digital filter algorithm of sine and cosine transforms, and promote its application.
Segmentation Technique for Image Indexing and Retrieval on Discrete Cosines Domain
Suhendro Yusuf Irianto
2013-03-01
Full Text Available This paper uses region growing segmentation technique to segment the Discrete Cosines (DC image. The problem of content Based image retrieval (CBIR is the luck of accuracy in matching between image query and image in the database as it matches object and background in the same time. This the reason previous CBIR techniques inaccurate and time consuming. The CBIR based on the segmented region proposed in this work separates object from background as CBIR need only match the object not the background. By using region growing technique on DC image, it reduces the number of image regions. The proposed of recursive region growing is not new technique but its application on DC images to build indexing keys is quite new and not yet presented by many authors. The experimental results show that the proposed methods on segmented images present good precision which are higher than 0.60 on all classes . It can be concluded that region growing segmented based CBIR more efficient compare to DC images in term of their precision 0.59 and 0.75, respectively. Moreover, DC based CBIR can save time and simplify algorithm compare to DCT images.
Analytic discrete cosine harmonic wavelet transform based OFDM ...
in improving Bit Error Rate (BER) and Peak to Average Power Ratio (PAPR) per- ... as an alternative to Fourier basis has been suggested for multicarrier transmission ..... Ramjee Prasad 2004 OFDM for Wireless Communications Systems.
Solution of the Doppler broadening function based on the fourier cosine transform
Goncalves, Alessandro da C [COPPE/UFRJ - Programa de Engenharia Nuclear, Universidade Federal do Rio de Janeiro, P.O. Box 68509, 21941-914 Rio de Janeiro, RJ (Brazil)], E-mail: agoncalves@con.ufrj.br; Martinez, Aquilino S.; Silva, Fernando C. da [COPPE/UFRJ - Programa de Engenharia Nuclear, Universidade Federal do Rio de Janeiro, P.O. Box 68509, 21941-914 Rio de Janeiro, RJ (Brazil)
2008-10-15
This paper provides a new integral representation for the Doppler broadening function {psi}({xi}, x), which is interpreted as being a Fourier cosine transform. This integral form allows the obtaining of an analytical solution in a simple and accurate functional manner as regards the elementary functions. The solution obtained through the new integral representation can be widely used in several applications such as the calculation of self-shielding factors and measurement corrections for the microscopic cross section through the activation technique.
Solution of the Doppler broadening function based on the fourier cosine transform
Goncalves, Alessandro da C; Martinez, Aquilino S.; Silva, Fernando C. da
2008-01-01
This paper provides a new integral representation for the Doppler broadening function ψ(ξ, x), which is interpreted as being a Fourier cosine transform. This integral form allows the obtaining of an analytical solution in a simple and accurate functional manner as regards the elementary functions. The solution obtained through the new integral representation can be widely used in several applications such as the calculation of self-shielding factors and measurement corrections for the microscopic cross section through the activation technique
Baecklund transformations for discrete Painleve equations: Discrete PII-PV
Sakka, A.; Mugan, U.
2006-01-01
Transformation properties of discrete Painleve equations are investigated by using an algorithmic method. This method yields explicit transformations which relates the solutions of discrete Painleve equations, discrete P II -P V , with different values of parameters. The particular solutions which are expressible in terms of the discrete analogue of the classical special functions of discrete Painleve equations can also be obtained from these transformations
3-D Discrete Analytical Ridgelet Transform
Helbert , David; Carré , Philippe; Andrès , Éric
2006-01-01
International audience; In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines:...
On the discrete Gabor transform and the discrete Zak transform
Bastiaans, M.J.; Geilen, M.C.W.
1996-01-01
Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal (or synthesis window) and the inverse operation -- the Gabor transform -- with which Gabor's expansion coefficients can be determined, are introduced. It is shown how, in the case of a
The discrete Fourier transform theory, algorithms and applications
Sundaraajan, D
2001-01-01
This authoritative book provides comprehensive coverage of practical Fourier analysis. It develops the concepts right from the basics and gradually guides the reader to the advanced topics. It presents the latest and practically efficient DFT algorithms, as well as the computation of discrete cosine and Walsh-Hadamard transforms. The large number of visual aids such as figures, flow graphs and flow charts makes the mathematical topic easy to understand. In addition, the numerous examples and the set of C-language programs (a supplement to the book) help greatly in understanding the theory and
A new expression for doppler broadening function based on Fourier Cosine Transform
Goncalves, Alessandro da C.; Martinez, Aquilino S.; Silva, Fernando C. da [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear]. E-mails: agoncalves@con.ufrj.br; aquilino@lmp.ufrj.br; fernando@con.ufrj.br
2007-07-01
The main objective of this paper consists of the derivation of an analytical solution for the Doppler broadening function {psi} ({xi}, x). The analytical solution is derived from a new integral expression for the {psi} ({xi}, x) function, which can be interpreted as a Fourier cosine transform. The expression obtained for {psi} ({xi}, x) in terms of elementary functions, proved quite simple and accurate, leading to a similar solution obtained through the differential equation for the {psi} ({xi}, x) function, using the methods of Frobenius and of parameter variation. The Doppler broadening function is widely used in applications related to the treatment of nuclear resonances, calculations of multigroup parameters and resonance self-shielding factors, and to correct microscopic cross section measurements through the activation technique. (author)
A new expression for doppler broadening function based on Fourier Cosine Transform
Goncalves, Alessandro da C.; Martinez, Aquilino S.; Silva, Fernando C. da
2007-01-01
The main objective of this paper consists of the derivation of an analytical solution for the Doppler broadening function Ψ (ξ, x). The analytical solution is derived from a new integral expression for the Ψ (ξ, x) function, which can be interpreted as a Fourier cosine transform. The expression obtained for Ψ (ξ, x) in terms of elementary functions, proved quite simple and accurate, leading to a similar solution obtained through the differential equation for the Ψ (ξ, x) function, using the methods of Frobenius and of parameter variation. The Doppler broadening function is widely used in applications related to the treatment of nuclear resonances, calculations of multigroup parameters and resonance self-shielding factors, and to correct microscopic cross section measurements through the activation technique. (author)
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.
3-D discrete analytical ridgelet transform.
Helbert, David; Carré, Philippe; Andres, Eric
2006-12-01
In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines: 3-D discrete radial lines going through the origin defined from their orthogonal projections and 3-D planes covered with 2-D discrete line segments. These discrete analytical lines have a parameter called arithmetical thickness, allowing us to define a 3-D DART adapted to a specific application. Indeed, the 3-D DART representation is not orthogonal, It is associated with a flexible redundancy factor. The 3-D DART has a very simple forward/inverse algorithm that provides an exact reconstruction without any iterative method. In order to illustrate the potentiality of this new discrete transform, we apply the 3-D DART and its extension to the Local-DART (with smooth windowing) to the denoising of 3-D image and color video. These experimental results show that the simple thresholding of the 3-D DART coefficients is efficient.
Digital Watermarks Using Discrete Wavelet Transformation and Spectrum Spreading
Ryousuke Takai
2003-12-01
Full Text Available In recent tears, digital media makes rapid progress through the development of digital technology. Digital media normally assures fairly high quality, nevertheless can be easily reproduced in a perfect form. This perfect reproducibility takes and advantage from a certain point of view, while it produces an essential disadvantage, since digital media is frequently copied illegally. Thus the problem of the copyright protection becomes a very important issue. A solution of this problem is to embed digital watermarks that is not perceived clearly by usual people, but represents the proper right of original product. In our method, the images data in the frequency domain are transformed by the Discrete Wavelet Transform and analyzed by the multi resolution approximation, [1]. Further, the spectrum spreading is executed by using PN-sequences. Choi and Aizawa [7] embed watermarks by using block correlation of DCT coefficients. Thus, we apply Discrete Cosine Transformation, abbreviated to DCT, instead of the Fourier transformation in order to embed watermarks.If the value of this variance is high then we decide that the block has bigger magnitude for visual fluctuations. Henceforth, we may embed stronger watermarks, which gives resistance for images processing, such as attacks and/or compressions.
Geometric Representations for Discrete Fourier Transforms
Cambell, C. W.
1986-01-01
Simple geometric representations show symmetry and periodicity of discrete Fourier transforms (DFT's). Help in visualizing requirements for storing and manipulating transform value in computations. Representations useful in any number of dimensions, but particularly in one-, two-, and three-dimensional cases often encountered in practice.
Approximating the Analytic Fourier Transform with the Discrete Fourier Transform
Axelrod, Jeremy
2015-01-01
The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more rapidly than via a direct matrix multiplication. Advantages and limitations of using this method to approximate the Fourier transform are discussed, and prototypical MATLAB codes implementing the method are presented.
Designing garbage-free reversible implementations of the integer cosine transform
De Vos, Alexis; Burignat, Stephane; Gluck, Robert
2014-01-01
reversible circuit is able to perform both the forward transform and the inverse transform. The detailed structure of such a reversible design strongly depends on the odd prime factors of the determinant of the transform: whether those are of the form 2k ± 1 or of the form 2k ± 2l ± 1 or neither...
Discrete Fourier transform in nanostructures using scattering
Leuenberger, Michael N.; Flatte, Michael E.; Loss, Daniel; Awschalom, D.D.
2004-01-01
In this article, we show that the discrete Fourier transform (DFT) can be performed by scattering a coherent particle or laser beam off an electrically controllable two-dimensional (2D) potential that has the shape of rings or peaks. After encoding the initial vector into the two-dimensional potential by means of electric gates, the Fourier-transformed vector can be read out by detectors surrounding the potential. The wavelength of the laser beam determines the necessary accuracy of the 2D potential, which makes our method very fault-tolerant. Since the time to perform the DFT is much smaller than the clock cycle of today's computers, our proposed device performs DFTs at the frequency of the computer clock speed
Surface Design Based on Discrete Conformal Transformations
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 Baecklund transformation between two integrable discrete hungry systems
Fukuda, Akiko, E-mail: j1409704@ed.kagu.tus.ac.j [Department of Mathematical Information Science, Graduate School of Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Yamamoto, Yusaku [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe 657-8501 (Japan); Iwasaki, Masashi [Department of Informatics and Environmental Science, Kyoto Prefectural University, 1-5, Nakaragi-cho, Shimogamo, Sakyo-ku, Kyoto 606-8522 (Japan); Ishiwata, Emiko [Department of Mathematical Information Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Nakamura, Yoshimasa [Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)
2011-01-17
The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.
A Baecklund transformation between two integrable discrete hungry systems
Fukuda, Akiko; Yamamoto, Yusaku; Iwasaki, Masashi; Ishiwata, Emiko; Nakamura, Yoshimasa
2011-01-01
The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.
Discrete Haar transform and protein structure.
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.
Discrete canonical transforms that are Hadamard matrices
Healy, John J; Wolf, Kurt Bernardo
2011-01-01
The group Sp(2,R) of symplectic linear canonical transformations has an integral kernel which has quadratic and linear phases, and which is realized by the geometric paraxial optical model. The discrete counterpart of this model is a finite Hamiltonian system that acts on N-point signals through N x N matrices whose elements also have a constant absolute value, although they do not form a representation of that group. Those matrices that are also unitary are Hadamard matrices. We investigate the manifolds of these N x N matrices under the Sp(2,R) equivalence imposed by the model, and find them to be on two-sided cosets. By means of an algorithm we determine representatives that lead to collections of mutually unbiased bases.
Implementation of quantum and classical discrete fractional Fourier transforms
Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N.; Szameit, Alexander
2016-01-01
Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools. PMID:27006089
Implementation of quantum and classical discrete fractional Fourier transforms.
Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N; Szameit, Alexander
2016-03-23
Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools.
Lax Pairs for Discrete Integrable Equations via Darboux Transformations
Cao Ce-Wen; Zhang Guang-Yao
2012-01-01
A method is developed to construct discrete Lax pairs using Darboux transformations. More kinds of Lax pairs are found for some newly appeared discrete integrable equations, including the H1, the special H3 and the Q1 models in the Adler—Bobenko—Suris list and the closely related discrete and semi-discrete pKdV, pMKdV, SG and Liouville equations. (general)
Feng Baofeng; Maruno, Ken-ichi; Inoguchi, Jun-ichi; Kajiwara, Kenji; Ohta, Yasuhiro
2011-01-01
We consider integrable discretizations of some soliton equations associated with the motions of plane curves: the Wadati-Konno-Ichikawa elastic beam equation, the complex Dym equation and the short pulse equation. They are related to the modified KdV or the sine-Gordon equations by the hodograph transformations. Based on the observation that the hodograph transformations are regarded as the Euler-Lagrange transformations of the curve motions, we construct the discrete analogues of the hodograph transformations, which yield integrable discretizations of those soliton equations. (paper)
Shi, Ying; Zhang, Da-jun; Nimmo, Jonathan J C
2014-01-01
The Hirota–Miwa equation can be written in ‘nonlinear’ form in two ways: the discrete KP equation and, by using a compatible continuous variable, the discrete potential KP equation. For both systems, we consider the Darboux and binary Darboux transformations, expressed in terms of the continuous variable, and obtain exact solutions in Wronskian and Grammian form. We discuss reductions of both systems to the discrete KdV and discrete potential KdV equation, respectively, and exploit this connection to find the Darboux and binary Darboux transformations and exact solutions of these equations. (paper)
A discrete dislocation–transformation model for austenitic single crystals
Shi, J; Turteltaub, S; Remmers, J J C; Van der Giessen, E
2008-01-01
A discrete model for analyzing the interaction between plastic flow and martensitic phase transformations is developed. The model is intended for simulating the microstructure evolution in a single crystal of austenite that transforms non-homogeneously into martensite. The plastic flow in the untransformed austenite is simulated using a plane-strain discrete dislocation model. The phase transformation is modeled via the nucleation and growth of discrete martensitic regions embedded in the austenitic single crystal. At each instant during loading, the coupled elasto-plasto-transformation problem is solved using the superposition of analytical solutions for the discrete dislocations and discrete transformation regions embedded in an infinite homogeneous medium and the numerical solution of a complementary problem used to enforce the actual boundary conditions and the heterogeneities in the medium. In order to describe the nucleation and growth of martensitic regions, a nucleation criterion and a kinetic law suitable for discrete regions are specified. The constitutive rules used in discrete dislocation simulations are supplemented with additional evolution rules to account for the phase transformation. To illustrate the basic features of the model, simulations of specimens under plane-strain uniaxial extension and contraction are analyzed. The simulations indicate that plastic flow reduces the average stress at which transformation begins, but it also reduces the transformation rate when compared with benchmark simulations without plasticity. Furthermore, due to local stress fluctuations caused by dislocations, martensitic systems can be activated even though transformation would not appear to be favorable based on the average stress. Conversely, the simulations indicate that the plastic hardening behavior is influenced by the reduction in the effective austenitic grain size due to the evolution of transformation. During cyclic simulations, the coupled plasticity-transformation
On the physical relevance of the discrete Fourier transform
Greben, JM
1991-11-01
Full Text Available This paper originated from the author's dissatisfaction with the way the discrete Fourier transform is usually presented in the literature. Although mathematically correct, the physical meaning of the common representation is unsatisfactory...
Image Retrieval Algorithm Based on Discrete Fractional Transforms
Jindal, Neeru; Singh, Kulbir
2013-06-01
The discrete fractional transforms is a signal processing tool which suggests computational algorithms and solutions to various sophisticated applications. In this paper, a new technique to retrieve the encrypted and scrambled image based on discrete fractional transforms has been proposed. Two-dimensional image was encrypted using discrete fractional transforms with three fractional orders and two random phase masks placed in the two intermediate planes. The significant feature of discrete fractional transforms benefits from its extra degree of freedom that is provided by its fractional orders. Security strength was enhanced (1024!)4 times by scrambling the encrypted image. In decryption process, image retrieval is sensitive for both correct fractional order keys and scrambling algorithm. The proposed approach make the brute force attack infeasible. Mean square error and relative error are the recital parameters to verify validity of proposed method.
Discrete linear canonical transform computation by adaptive method.
Zhang, Feng; Tao, Ran; Wang, Yue
2013-07-29
The linear canonical transform (LCT) describes the effect of quadratic phase systems on a wavefield and generalizes many optical transforms. In this paper, the computation method for the discrete LCT using the adaptive least-mean-square (LMS) algorithm is presented. The computation approaches of the block-based discrete LCT and the stream-based discrete LCT using the LMS algorithm are derived, and the implementation structures of these approaches by the adaptive filter system are considered. The proposed computation approaches have the inherent parallel structures which make them suitable for efficient VLSI implementations, and are robust to the propagation of possible errors in the computation process.
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.
Properties of the Simpson discrete fourier transform | Singh ...
The Simpson discrete Fourier transform (SDFT) and its inverse are transformations relating the time and frequency domains. In this paper we state and prove the important properties of shift, circular convolution, conjugation, time reversal and Plancherel's theorem. In addition, we provide an alternative representation of the ...
An analysis of the Simpson Discrete Hartley transform | Ramsunder ...
The relatively new Simpson Discrete Hartley Transform (SDHT) has interesting mathematical properties, which are crucial for applications. These are developed and proved in this paper. This analysis gives one a comprehensive understanding of the transform. Mathematics Subject Classication (2010): 43A32. Key words: ...
Invariant object recognition based on the generalized discrete radon transform
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.
Nuclear data compression and reconstruction via discrete wavelet transform
Park, Young Ryong; Cho, Nam Zin [Korea Advanced Institute of Science and Technology, Taejon (Korea, Republic of)
1997-12-31
Discrete Wavelet Transforms (DWTs) are recent mathematics, and begin to be used in various fields. The wavelet transform can be used to compress the signal and image due to its inherent properties. We applied the wavelet transform compression and reconstruction to the neutron cross section data. Numerical tests illustrate that the signal compression using wavelet is very effective to reduce the data saving spaces. 7 refs., 4 figs., 3 tabs. (Author)
A discrete Fourier transform for virtual memory machines
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.
Nuclear data compression and reconstruction via discrete wavelet transform
Park, Young Ryong; Cho, Nam Zin [Korea Advanced Institute of Science and Technology, Taejon (Korea, Republic of)
1998-12-31
Discrete Wavelet Transforms (DWTs) are recent mathematics, and begin to be used in various fields. The wavelet transform can be used to compress the signal and image due to its inherent properties. We applied the wavelet transform compression and reconstruction to the neutron cross section data. Numerical tests illustrate that the signal compression using wavelet is very effective to reduce the data saving spaces. 7 refs., 4 figs., 3 tabs. (Author)
Discrete Orthogonal Transforms and Neural Networks for Image Interpolation
J. Polec
1999-09-01
Full Text Available In this contribution we present transform and neural network approaches to the interpolation of images. From transform point of view, the principles from [1] are modified for 1st and 2nd order interpolation. We present several new interpolation discrete orthogonal transforms. From neural network point of view, we present interpolation possibilities of multilayer perceptrons. We use various configurations of neural networks for 1st and 2nd order interpolation. The results are compared by means of tables.
Discrete fourier transform (DFT) analysis for applications using iterative transform methods
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.
Discrete linear canonical transforms based on dilated Hermite functions.
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 Transform in a Complex Vector Space
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.
Discrete-continuous bispectral operators and rational Darboux transformations
Boyallian, Carina; Portillo, Sofia
2010-01-01
In this Letter we construct examples of discrete-continuous bispectral operators obtained by rational Darboux transformations applied to a regular pseudo-difference operator with constant coefficients. Moreover, we give an explicit procedure to write down the differential operators involved in the bispectral situation corresponding to the pseudo-difference operator obtained by the Darboux process.
Discrete Hadamard transformation algorithm's parallelism analysis and achievement
Hu, Hui
2009-07-01
With respect to Discrete Hadamard Transformation (DHT) wide application in real-time signal processing while limitation in operation speed of DSP. The article makes DHT parallel research and its parallel performance analysis. Based on multiprocessor platform-TMS320C80 programming structure, the research is carried out to achieve two kinds of parallel DHT algorithms. Several experiments demonstrated the effectiveness of the proposed algorithms.
Discrete Fourier Transform Analysis in a Complex Vector Space
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.
A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula
Hale, Nicholas; Townsend, Alex
2014-01-01
-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the discrete cosine transform. Numerical results are provided to demonstrate the efficiency
The parallel algorithm for the 2D discrete wavelet transform
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.
A non-linear discrete transform for pattern recognition of discrete chaotic systems
Karanikas, C.; Proios, G.
2003-01-01
It is shown, by an invertible non-linear discrete transform that any finite sequence or any collection of strings of any length can be presented as a random walk on trees. These transforms create the mathematical background for coding any information, for exploring its local variability and diversity. With the underlying computational algorithms, with several examples and applications we propose that these transforms can be used for pattern recognition of immune type. In other words we propose a mathematical platform for detecting self and non-self strings of any alphabet, based on a negative selection algorithms, for scouting data's periodicity and self-similarity and for measuring the diversity of chaotic strings with fractal dimension methods. In particular we estimate successfully the entropy and the ratio of chaotic data with self similarity. Moreover we give some applications of a non-linear denoising filter
A non-linear discrete transform for pattern recognition of discrete chaotic systems
Karanikas, C
2003-01-01
It is shown, by an invertible non-linear discrete transform that any finite sequence or any collection of strings of any length can be presented as a random walk on trees. These transforms create the mathematical background for coding any information, for exploring its local variability and diversity. With the underlying computational algorithms, with several examples and applications we propose that these transforms can be used for pattern recognition of immune type. In other words we propose a mathematical platform for detecting self and non-self strings of any alphabet, based on a negative selection algorithms, for scouting data's periodicity and self-similarity and for measuring the diversity of chaotic strings with fractal dimension methods. In particular we estimate successfully the entropy and the ratio of chaotic data with self similarity. Moreover we give some applications of a non-linear denoising filter.
Viholainen Ari
2006-01-01
Full Text Available The recently introduced exponentially modulated filter bank (EMFB is a -channel uniform, orthogonal, critically sampled, and frequency-selective complex modulated filter bank that satisfies the perfect reconstruction (PR property if the prototype filter of an -channel PR cosine modulated filter bank (CMFB is used. The purpose of this paper is to present various implementation structures for the EMFBs in a unified framework. The key idea is to use cosine and sine modulated filter banks as building blocks and, therefore, polyphase, lattice, and extended lapped transform (ELT type of implementation solutions are studied. The ELT-based EMFBs are observed to be very competitive with the existing modified discrete Fourier transform filter banks (MDFT-FBs when comparing the number of multiplications/additions and the structural simplicity. In addition, EMFB provides an alternative channel stacking arrangement that could be more natural in certain subband processing applications and data transmission systems.
Discrete wavelet transform: a tool in smoothing kinematic data.
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.
Uniform sparse bounds for discrete quadratic phase Hilbert transforms
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 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.
Discrete Wavelet Transform for Fault Locations in Underground Distribution System
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.
Image processing tensor transform and discrete tomography with Matlab
Grigoryan, Artyom M
2012-01-01
Focusing on mathematical methods in computer tomography, Image Processing: Tensor Transform and Discrete Tomography with MATLAB(R) introduces novel approaches to help in solving the problem of image reconstruction on the Cartesian lattice. Specifically, it discusses methods of image processing along parallel rays to more quickly and accurately reconstruct images from a finite number of projections, thereby avoiding overradiation of the body during a computed tomography (CT) scan. The book presents several new ideas, concepts, and methods, many of which have not been published elsewhere. New co
Discretization of four types of Weyl group orbit functions
Hrivnák, Jiří
2013-01-01
The discrete Fourier calculus of the four families of special functions, called C–, S–, S s – and S l -functions, is summarized. Functions from each of the four families of special functions are discretely orthogonal over a certain finite set of points. The generalizations of discrete cosine and sine transforms of one variable — the discrete S s – and S l -transforms of the group F 4 — are considered in detail required for their exploitation in discrete Fourier spectral methods. The continuous interpolations, induced by the discrete expansions, are presented
Towards discrete wavelet transform-based human activity recognition
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.
On the discrete version of Gabor's signal expansion, the Gabor transform, and the Zak transform
Bastiaans, M.J.; Veen, J.P.
1996-01-01
Gabors expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal or synthesis window is introduced, along with the inverse operation, i.e., the Gabor transform, which uses an analysis window that is related to the synthesis window and with the help of
A robust image watermarking in contourlet transform domain
Sharma, Rajat; Gupta, Abhishek Kumar; Singh, Deepak; Verma, Vivek Singh; Bhardwaj, Anuj
2017-10-01
A lot of work has been done in the field of image watermarking to overcome the problems of rightful ownership, copyright protection etc. In order to provide a robust solution of such issues, the authors propose a hybrid approach that involves contourlet, lifting wavelet, and discrete cosine transform. The first level coefficients of the original image which are obtained using contourlet transform are further decomposed using one level lifting wavelet transform. After that, these coefficients are modified using discrete cosine transform. Whereas, second level subband of contourlet transform coefficients are used to obtain block wise modification parameter based on edge detection and entropy calculations. Watermark bits are embedded by quantizing the discrete cosine transform coefficient blocks obtained using HL sub-band of first level lifting wavelet transform coefficients. The experimental results reveal that the proposed scheme has high robustness and imperceptibility.
A difference tracking algorithm based on discrete sine transform
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.
A Ramp Cosine Cepstrum Model for the Parameter Estimation of Autoregressive Systems at Low SNR
Zhu Wei-Ping
2010-01-01
Full Text Available A new cosine cepstrum model-based scheme is presented for the parameter estimation of a minimum-phase autoregressive (AR system under low levels of signal-to-noise ratio (SNR. A ramp cosine cepstrum (RCC model for the one-sided autocorrelation function (OSACF of an AR signal is first proposed by considering both white noise and periodic impulse-train excitations. Using the RCC model, a residue-based least-squares optimization technique that guarantees the stability of the system is then presented in order to estimate the AR parameters from noisy output observations. For the purpose of implementation, the discrete cosine transform, which can efficiently handle the phase unwrapping problem and offer computational advantages as compared to the discrete Fourier transform, is employed. From extensive experimentations on AR systems of different orders, it is shown that the proposed method is capable of estimating parameters accurately and consistently in comparison to some of the existing methods for the SNR levels as low as −5 dB. As a practical application of the proposed technique, simulation results are also provided for the identification of a human vocal tract system using noise-corrupted natural speech signals demonstrating a superior estimation performance in terms of the power spectral density of the synthesized speech signals.
3-D discrete shearlet transform and video processing.
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.
SECURE VISUAL SECRET SHARING BASED ON DISCRETE WAVELET TRANSFORM
S. Jyothi Lekshmi
2015-08-01
Full Text Available Visual Cryptography Scheme (VCS is an encryption method to encode secret written materials. This method converts the secret written material into an image. Then encode this secret image into n shadow images called shares. For the recreation of the original secret, all or some selected subsets of shares are needed; individual shares are of no use on their own. The secret image can be recovered simply by selecting some subset of these n shares, makes transparencies of them and stacking on top of each other. Nowadays, the data security has an important role. The shares can be altered by an attacker. So providing security to the shares is important. This paper proposes a method of adding security to cryptographic shares. This method uses two dimensional discrete wavelet transform to hide visual secret shares. Then the hidden secrets are distributed among participants through the internet. All hidden shares are extracted to reconstruct the secret.
Psychoacoustic Music Analysis Based on the Discrete Wavelet Packet Transform
Xing He
2008-01-01
Full Text Available Psychoacoustical computational models are necessary for the perceptual processing of acoustic signals and have contributed significantly in the development of highly efficient audio analysis and coding. In this paper, we present an approach for the psychoacoustic analysis of musical signals based on the discrete wavelet packet transform. The proposed method mimics the multiresolution properties of the human ear closer than other techniques and it includes simultaneous and temporal auditory masking. Experimental results show that this method provides better masking capabilities and it reduces the signal-to-masking ratio substantially more than other approaches, without introducing audible distortion. This model can lead to greater audio compression by permitting further bit rate reduction and more secure watermarking by providing greater signal space for information hiding.
Long memory analysis by using maximal overlapping discrete wavelet transform
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.
A Laplace transform method for energy multigroup hybrid discrete ordinates
Segatto, C.F.; Vilhena, M.T.; Barros, R.C.
2010-01-01
In typical lattice cells where a highly absorbing, small fuel element is embedded in the moderator, a large weakly absorbing medium, high-order transport methods become unnecessary. In this work we describe a hybrid discrete ordinates (S N) method for energy multigroup slab lattice calculations. This hybrid S N method combines the convenience of a low-order S N method in the moderator with a high-order S N method in the fuel. The idea is based on the fact that in weakly absorbing media whose physical size is several neutron mean free paths in extent, even the S 2 method (P 1 approximation), leads to an accurate result. We use special fuel-moderator interface conditions and the Laplace transform (LTS N ) analytical numerical method to calculate the two-energy group neutron flux distributions and the thermal disadvantage factor. We present numerical results for a range of typical model problems.
The discrete Painleve II equations: Miura and auto-Baecklund transformations
Carstea, A S; Ramani, A; Willox, R; Grammaticos, B
2003-01-01
We present Miura transformations for all discrete Painleve II equations known to date. We then use these Miuras to derive special solutions in terms of discrete Airy functions and to construct auto-Baecklund transformations for the discrete Painleve equations. These transformations are then used to generate rational solutions. Some new forms of d-P II and d-P 34 are obtained as well
VARUN JEOTI
2011-12-01
Full Text Available High peak-to-average power ratio (PAPR reduction is one of the major challenges in orthogonal frequency division multiple access (OFDMA systems since last decades. High PAPR increases the complexity of analogue-to-digital (A/D and digital-to-analogue (D/A convertors and also reduces the efficiency of RF high-power-amplifier (HPA. In this paper, we present a new Discrete- Hartley transform (DHT precoding based interleaved-OFDMA uplink system for PAPR reduction in the upcoming 4G cellular networks. Extensive computer simulations have been performed to analyze the PAPR of the proposed system with root-raised-cosine (RRC pulse shaping. We also compare simulation results of the proposed system with the conventional interleaved-OFDMA uplink systems and the Walsh-Hadamard transform (WHT precoding based interleaved-OFDMA uplink systems. It is concluded from the computer simulations that the proposed system has low PAPR as compared to the conventional interleaved-OFDMA uplink systems and the WHT precoded interleaved-OFDMA uplink systems.
Generating Solutions to Discrete sine-Gordon Equation from Modified Baecklund Transformation
Kou Xin; Zhang Dajun; Shi Ying; Zhao Songlin
2011-01-01
We modify the bilinear Baecklund transformation for the discrete sine-Gordon equation and derive variety, of solutions by freely choosing parameters from the modified Baecklund transformation. Dynamics of solutions and continuum limits are also discussed. (general)
The Roadmaker's algorithm for the discrete pulse transform.
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
Application of the Sumudu Transform to Discrete Dynamic Systems
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…
Fast parallel approach for 2-D DHT-based real-valued discrete Gabor transform.
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.
Use of switched capacitor filters to implement the discrete wavelet transform
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.
Goodman, Roe W
2016-01-01
This textbook for undergraduate mathematics, science, and engineering students introduces the theory and applications of discrete Fourier and wavelet transforms using elementary linear algebra, without assuming prior knowledge of signal processing or advanced analysis.It explains how to use the Fourier matrix to extract frequency information from a digital signal and how to use circulant matrices to emphasize selected frequency ranges. It introduces discrete wavelet transforms for digital signals through the lifting method and illustrates through examples and computer explorations how these transforms are used in signal and image processing. Then the general theory of discrete wavelet transforms is developed via the matrix algebra of two-channel filter banks. Finally, wavelet transforms for analog signals are constructed based on filter bank results already presented, and the mathematical framework of multiresolution analysis is examined.
a pyramid algorithm for the haar discrete wavelet packet transform
PROF EKWUEME
computer-aided signal processing of non-stationary signals, this paper develops a pyramid algorithm for the discrete wavelet packet ... Edith T. Luhanga, School of Computational and Communication Sciences and Engineering, Nelson Mandela African. Institute of ..... Mathematics, Washington University. 134. EDITH T.
Notes on discrete subgroups of Möbius transformations
Abstract. Jørgensen's inequality gives a necessary condition for a nonelementary two generator subgroup of SL(2, C) to be discrete. By embedding SL(2, C) into. ˆU(1, 1; H), we obtain a new type of Jørgensen's inequality, which is in terms of the coefficients of involved isometries. We provide an example to show that this ...
The su(2)α Hahn oscillator and a discrete Fourier-Hahn transform
Jafarov, E I; Stoilova, N I; Van der Jeugt, J
2011-01-01
We define the quadratic algebra su(2) α which is a one-parameter deformation of the Lie algebra su(2) extended by a parity operator. The odd-dimensional representations of su(2) (with representation label j, a positive integer) can be extended to representations of su(2) α . We investigate a model of the finite one-dimensional harmonic oscillator based upon this algebra su(2) α . It turns out that in this model the spectrum of the position and momentum operator can be computed explicitly, and that the corresponding (discrete) wavefunctions can be determined in terms of Hahn polynomials. The operation mapping position wavefunctions into momentum wavefunctions is studied, and this so-called discrete Fourier-Hahn transform is computed explicitly. The matrix of this discrete Fourier-Hahn transform has many interesting properties, similar to those of the traditional discrete Fourier transform. (paper)
Efficient Algorithms for the Discrete Gabor Transform with a Long Fir Window
Søndergaard, Peter Lempel
2012-01-01
The Discrete Gabor Transform (DGT) is the most commonly used signal transform for signal analysis and synthesis using a linear frequency scale. The development of the Linear Time-Frequency Analysis Toolbox (LTFAT) has been based on a detailed study of many variants of the relevant algorithms. As ...
Discrete quantum Fourier transform in coupled semiconductor double quantum dot molecules
Dong Ping; Yang Ming; Cao Zhuoliang
2008-01-01
In this Letter, we present a physical scheme for implementing the discrete quantum Fourier transform in a coupled semiconductor double quantum dot system. The main controlled-R gate operation can be decomposed into many simple and feasible unitary transformations. The current scheme would be a useful step towards the realization of complex quantum algorithms in the quantum dot system
Yang, Shuang-Long; Liang, Li-Ping; Liu, Hou-De; Xu, Ke-Jun
2018-03-01
Aiming at reducing the estimation error of the sensor frequency response function (FRF) estimated by the commonly used window-based spectral estimation method, the error models of interpolation and transient errors are derived in the form of non-parameter models. Accordingly, window effects on the errors are analyzed and reveal that the commonly used hanning window leads to smaller interpolation error which can also be significantly eliminated by the cubic spline interpolation method when estimating the FRF from the step response data, and window with smaller front-end value can restrain more transient error. Thus, a new dual-cosine window with its non-zero discrete Fourier transform bins at -3, -1, 0, 1, and 3 is constructed for FRF estimation. Compared with the hanning window, the new dual-cosine window has the equivalent interpolation error suppression capability and better transient error suppression capability when estimating the FRF from the step response; specifically, it reduces the asymptotic property of the transient error from O(N-2) of the hanning window method to O(N-4) while only increases the uncertainty slightly (about 0.4 dB). Then, one direction of a wind tunnel strain gauge balance which is a high order, small damping, and non-minimum phase system is employed as the example for verifying the new dual-cosine window-based spectral estimation method. The model simulation result shows that the new dual-cosine window method is better than the hanning window method for FRF estimation, and compared with the Gans method and LPM method, it has the advantages of simple computation, less time consumption, and short data requirement; the actual data calculation result of the balance FRF is consistent to the simulation result. Thus, the new dual-cosine window is effective and practical for FRF estimation.
Optical movie encryption based on a discrete multiple-parameter fractional Fourier transform
Zhong, Zhi; Zhang, Yujie; Shan, Mingguang; Wang, Ying; Zhang, Yabin; Xie, Hong
2014-01-01
A movie encryption scheme is proposed using a discrete multiple-parameter fractional Fourier transform and theta modulation. After being modulated by sinusoidal amplitude grating, each frame of the movie is transformed by a filtering procedure and then multiplexed into a complex signal. The complex signal is multiplied by a pixel scrambling operation and random phase mask, and then encrypted by a discrete multiple-parameter fractional Fourier transform. The movie can be retrieved by using the correct keys, such as a random phase mask, a pixel scrambling operation, the parameters in a discrete multiple-parameter fractional Fourier transform and a time sequence. Numerical simulations have been performed to demonstrate the validity and the security of the proposed method. (paper)
Methods for performing fast discrete curvelet transforms of data
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.
Sines and Cosines. Part 1 of 3
Apostol, Tom M. (Editor)
1992-01-01
Applying the concept of similarities, the mathematical principles of circular motion and sine and cosine waves are presented utilizing both film footage and computer animation in this 'Project Mathematics' series video. Concepts presented include: the symmetry of sine waves; the cosine (complementary sine) and cosine waves; the use of sines and cosines on coordinate systems; the relationship they have to each other; the definitions and uses of periodic waves, square waves, sawtooth waves; the Gibbs phenomena; the use of sines and cosines as ratios; and the terminology related to sines and cosines (frequency, overtone, octave, intensity, and amplitude).
Pablo Soto-Quiros
2015-01-01
Full Text Available 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.
Comparative analysis of chosen transforms in the context of de-noising harmonic signals
Artur Zacniewski
2015-09-01
Full Text Available In the article, comparison of popular transforms used i.a. in denoising harmonical signals was presented. The division of signals submitted to mathematical analysis was shown and chosen transforms such as Short Time Fourier Transform, Wigner-Ville Distribution, Wavelet Transform and Discrete Cosine Transform were presented. Harmonic signal with white noise added was submitted for research. During research, the parameters of noise were changed to analyze the effects of using particular transform on noised signal. The importance of right choice for transform and its parameters (different for particular kind of transform was shown. Small changes in parameters or different functions used in transform can lead to considerably different results.[b]Keywords[/b]: denoising of harmonical signals, wavelet transform, discrete cosine transform, DCT
Cai Li; Wen Ji-Hong; Yu Dian-Long; Lu Zhi-Miao; Wen Xi-Sen
2014-01-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. (fundamental areas of phenomenology(including applications))
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.
Discrete Ramanujan transform for distinguishing the protein coding regions from other regions.
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.
Robust electrocardiogram (ECG) beat classification using discrete wavelet transform
Minhas, Fayyaz-ul-Amir Afsar; Arif, Muhammad
2008-01-01
This paper presents a robust technique for the classification of six types of heartbeats through an electrocardiogram (ECG). Features extracted from the QRS complex of the ECG using a wavelet transform along with the instantaneous RR-interval are used for beat classification. The wavelet transform utilized for feature extraction in this paper can also be employed for QRS delineation, leading to reduction in overall system complexity as no separate feature extraction stage would be required in the practical implementation of the system. Only 11 features are used for beat classification with the classification accuracy of ∼99.5% through a KNN classifier. Another main advantage of this method is its robustness to noise, which is illustrated in this paper through experimental results. Furthermore, principal component analysis (PCA) has been used for feature reduction, which reduces the number of features from 11 to 6 while retaining the high beat classification accuracy. Due to reduction in computational complexity (using six features, the time required is ∼4 ms per beat), a simple classifier and noise robustness (at 10 dB signal-to-noise ratio, accuracy is 95%), this method offers substantial advantages over previous techniques for implementation in a practical ECG analyzer
Transformation Matrix for Time Discretization Based on Tustin’s Method
Yiming Jiang
2014-01-01
Full Text Available This paper studies rules in transformation of transfer function through time discretization. A method of using transformation matrix to realize bilinear transform (also known as Tustin’s method is presented. This method can be described as the conversion between the coefficients of transfer functions, which are expressed as transform by certain matrix. For a polynomial of degree n, the corresponding transformation matrix of order n exists and is unique. Furthermore, the transformation matrix can be decomposed into an upper triangular matrix multiplied with another lower triangular matrix. And both have obvious regularity. The proposed method can achieve rapid bilinear transform used in automatic design of digital filter. The result of numerical simulation verifies the correctness of the theoretical results. Moreover, it also can be extended to other similar problems. Example in the last throws light on this point.
Lina Yang
2014-01-01
Full Text Available To reduce the computation complexity of wavelet transform, this paper presents a novel approach to be implemented. It consists of two key techniques: (1 fast number theoretic transform(FNTT In the FNTT, linear convolution is replaced by the circular one. It can speed up the computation of 2D discrete wavelet transform. (2 In two-dimensional overlap-save method directly calculating the FNTT to the whole input sequence may meet two difficulties; namely, a big modulo obstructs the effective implementation of the FNTT and a long input sequence slows the computation of the FNTT down. To fight with such deficiencies, a new technique which is referred to as 2D overlap-save method is developed. Experiments have been conducted. The fast number theoretic transform and 2D overlap-method have been used to implement the dyadic wavelet transform and applied to contour extraction in pattern recognition.
Oblique projections and standard-form transformations for discrete inverse problems
Hansen, Per Christian
2013-01-01
This tutorial paper considers a specific computational tool for the numerical solution of discrete inverse problems, known as the standard-form transformation, by which we can treat general Tikhonov regularization problems efficiently. In the tradition of B. N. Datta's expositions of numerical li...... linear algebra, we use the close relationship between oblique projections, pseudoinverses, and matrix computations to derive a simple geometric motivation and algebraic formulation of the standard-form transformation....
Moment-based method for computing the two-dimensional discrete Hartley transform
Dong, Zhifang; Wu, Jiasong; Shu, Huazhong
2009-10-01
In this paper, we present a fast algorithm for computing the two-dimensional (2-D) discrete Hartley transform (DHT). By using kernel transform and Taylor expansion, the 2-D DHT is approximated by a linear sum of 2-D geometric moments. This enables us to use the fast algorithms developed for computing the 2-D moments to efficiently calculate the 2-D DHT. The proposed method achieves a simple computational structure and is suitable to deal with any sequence lengths.
Review of finite fields: Applications to discrete Fourier, transforms and Reed-Solomon coding
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.
An Efficient Algorithm for the Discrete Gabor Transform using full length Windows
Søndergaard, Peter Lempel
2007-01-01
This paper extends the efficient factorization of the Gabor frame operator developed by Strohmer in [1] to the Gabor analysis/synthesis operator. This provides a fast method for computing the discrete Gabor transform (DGT) and several algorithms associated with it. The algorithm is used...
A discrete spherical X-ray transform of orientation distribution functions using bounding cubes
Kazantsev, Ivan G; Schmidt, Søren; Poulsen, Henning Friis
2009-01-01
We investigate a cubed sphere parametrization of orientation space with the aim of constructing a discrete voxelized version of the spherical x-ray transform. For tracing the propagation of a unit great circle through the partition subsets, the frustums of the cubed sphere, a fast procedure...
Feature Extraction Using Discrete Wavelet Transform for Gear Fault Diagnosis of Wind Turbine Gearbox
Bajric, Rusmir; Zuber, Ninoslav; Skrimpas, Georgios Alexandros
2016-01-01
, the vibration signals are decomposed into a series of subbands signals with the use of amultiresolution analytical property of the discrete wavelet transform.Then, 22 condition indicators are extracted fromthe TSA signal, residual signal, and difference signal.Through the case study analysis, a new approach...
Broadband time domain acoustic holography based on the discrete orthonormal S-transform
Zhou, H.; Lopez Arteaga, I.; Nijmeijer, H.; Lim, Kian Meng
2015-01-01
The purpose of this paper is to deal with the problem of nonstationary broadband sound fields more efficiently. A basis function of the discrete orthonormal S-transform (DOST) is used to analyze the measured signal. With respect to the time domain signal in a certain band, DOST leads to a
Kim, Seong-Whan; Suthaharan, Shan; Lee, Heung-Kyu; Rao, K. R.
2001-01-01
Quality of Service (QoS)-guarantee in real-time communication for multimedia applications is significantly important. An architectural framework for multimedia networks based on substreams or flows is effectively exploited for combining source and channel coding for multimedia data. But the existing frame by frame approach which includes Moving Pictures Expert Group (MPEG) cannot be neglected because it is a standard. In this paper, first, we designed an MPEG transcoder which converts an MPEG coded stream into variable rate packet sequences to be used for our joint source/channel coding (JSCC) scheme. Second, we designed a classification scheme to partition the packet stream into multiple substreams which have their own QoS requirements. Finally, we designed a management (reservation and scheduling) scheme for substreams to support better perceptual video quality such as the bound of end-to-end jitter. We have shown that our JSCC scheme is better than two other two popular techniques by simulation and real video experiments on the TCP/IP environment.
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.
Fast Algorithm for Computing the Discrete Hartley Transform of Type-II
Mounir Taha Hamood
2016-06-01
Full Text Available The generalized discrete Hartley transforms (GDHTs have proved to be an efficient alternative to the generalized discrete Fourier transforms (GDFTs for real-valued data applications. In this paper, the development of direct computation of radix-2 decimation-in-time (DIT algorithm for the fast calculation of the GDHT of type-II (DHT-II is presented. The mathematical analysis and the implementation of the developed algorithm are derived, showing that this algorithm possesses a regular structure and can be implemented in-place for efficient memory utilization.The performance of the proposed algorithm is analyzed and the computational complexity is calculated for different transform lengths. A comparison between this algorithm and existing DHT-II algorithms shows that it can be considered as a good compromise between the structural and computational complexities.
The spectral transform as a tool for solving nonlinear discrete evolution equations
Levi, D.
1979-01-01
In this contribution we study nonlinear differential difference equations which became important to the description of an increasing number of problems in natural science. Difference equations arise for instance in the study of electrical networks, in statistical problems, in queueing problems, in ecological problems, as computer models for differential equations and as models for wave excitation in plasma or vibrations of particles in an anharmonic lattice. We shall first review the passages necessary to solve linear discrete evolution equations by the discrete Fourier transfrom, then, starting from the Zakharov-Shabat discretized eigenvalue, problem, we shall introduce the spectral transform. In the following part we obtain the correlation between the evolution of the potentials and scattering data through the Wronskian technique, giving at the same time many other properties as, for example, the Baecklund transformations. Finally we recover some of the important equations belonging to this class of nonlinear discrete evolution equations and extend the method to equations with n-dependent coefficients. (HJ)
Dzhamay, Anton
2009-01-01
We study factorizations of rational matrix functions with simple poles on the Riemann sphere. For the quadratic case (two poles) we show, using multiplicative representations of such matrix functions, that a good coordinate system on this space is given by a mix of residue eigenvectors of the matrix and its inverse. Our approach is motivated by the theory of discrete isomonodromic transformations and their relationship with difference Painleve equations. In particular, in these coordinates, basic isomonodromic transformations take the form of the discrete Euler-Lagrange equations. Secondly we show that dPV equations, previously obtained in this context by D Arinkin and A Borodin, can be understood as simple relationships between the residues of such matrices and their inverses.
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.
A study of renal blood flow regulation using the discrete wavelet transform
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.
Farokhi, Sajad; Shamsuddin, S.M.; Sheikh, U.U.; Flusser, Jan; Khansari, M.; Jafari-Khouzani, K.
2014-01-01
Roč. 31, č. 1 (2014), s. 13-27 ISSN 1051-2004 R&D Projects: GA ČR GAP103/11/1552 Institutional support: RVO:67985556 Keywords : Zernike moments * Undecimated discrete wavelet transform * Decision fusion * Near infrared * Face recognition Subject RIV: JD - Computer Applications, Robotics Impact factor: 1.256, year: 2014 http://library.utia.cas.cz/separaty/2014/ZOI/flusser-0428536.pdf
Liu Shaowei; Cheng Yi
2010-01-01
Two kinds of symmetries, Sato's Baecklund transformations and additional symmetries, for the discrete KP (dKP) hierarchy are introduced, and the ASvM formula which demonstrates the equivalence of these two kinds of symmetries is obtained. In this process the Fay identity and the difference Fay identity of the dKP hierarchy are introduced and the ASvM formula in the form of tau function is calculated.
Transformation of nonlinear discrete-time system into the extended observer form
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.
Improved cosine similarity measures of simplified neutrosophic setsfor medical diagnoses
Jun Ye
2014-01-01
In pattern recognition and medical diagnosis, similarity measure is an important mathematicaltool. To overcome some disadvantages of existing cosine similarity measures of simplified neutrosophicsets (SNSs) in vector space, this paper proposed improved cosine similarity measures of SNSs based oncosine function, including single valued neutrosophic cosine similarity measures and interval neutro-sophic cosine similarity measures. Then, weighted cosine similarity measures of SNSs were introduced...
State transformations and Hamiltonian structures for optimal control in discrete systems
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 θ.
Discrete Multiwavelet Critical-Sampling Transform-Based OFDM System over Rayleigh Fading Channels
Sameer A. Dawood
2015-01-01
Full Text Available Discrete multiwavelet critical-sampling transform (DMWCST has been proposed instead of fast Fourier transform (FFT in the realization of the orthogonal frequency division multiplexing (OFDM system. The proposed structure further reduces the level of interference and improves the bandwidth efficiency through the elimination of the cyclic prefix due to the good orthogonality and time-frequency localization properties of the multiwavelet transform. The proposed system was simulated using MATLAB to allow various parameters of the system to be varied and tested. The performance of DMWCST-based OFDM (DMWCST-OFDM was compared with that of the discrete wavelet transform-based OFDM (DWT-OFDM and the traditional FFT-based OFDM (FFT-OFDM over flat fading and frequency-selective fading channels. Results obtained indicate that the performance of the proposed DMWCST-OFDM system achieves significant improvement compared to those of DWT-OFDM and FFT-OFDM systems. DMWCST improves the performance of the OFDM system by a factor of 1.5–2.5 dB and 13–15.5 dB compared with the DWT and FFT, respectively. Therefore the proposed system offers higher data rate in wireless mobile communications.
Li Qi; Duan Qiuyuan; Zhang Jianbing
2012-01-01
The mixed discrete modified Korteweg-de Vries (mKdV) hierarchy and the Lax pair are derived. The hierarchy related to the Ablowitz-Ladik spectral problem is reduced to the isospectral discrete mKdV hierarchy and to the non-isospectral discrete mKdV hierarchy. N-soliton solutions of the hierarchies are obtained through inverse scattering transform.
Improved FHT Algorithms for Fast Computation of the Discrete Hartley Transform
M. T. Hamood
2013-05-01
Full Text Available In this paper, by using the symmetrical properties of the discrete Hartley transform (DHT, an improved radix-2 fast Hartley transform (FHT algorithm with arithmetic complexity comparable to that of the real-valued fast Fourier transform (RFFT is developed. It has a simple and regular butterfly structure and possesses the in-place computation property. Furthermore, using the same principles, the development can be extended to more efficient radix-based FHT algorithms. An example for the improved radix-4 FHT algorithm is given to show the validity of the presented method. The arithmetic complexity for the new algorithms are computed and then compared with the existing FHT algorithms. The results of these comparisons have shown that the developed algorithms reduce the number of multiplications and additions considerably.
Fang Fang
2018-05-01
Full Text Available In geometrically frustrated clusters of polyhedra, gaps between faces can be closed without distorting the polyhedra by the long established method of discrete curvature, which consists of curving the space into a fourth dimension, resulting in a dihedral angle at the joint between polyhedra in 4D. An alternative method—the twist method—has been recently suggested for a particular case, whereby the gaps are closed by twisting the cluster in 3D, resulting in an angular offset of the faces at the joint between adjacent polyhedral. In this paper, we show the general applicability of the twist method, for local clusters, and present the surprising result that both the required angle of the twist transformation and the consequent angle at the joint are the same, respectively, as the angle of bending to 4D in the discrete curvature and its resulting dihedral angle. The twist is therefore not only isomorphic, but isogonic (in terms of the rotation angles to discrete curvature. Our results apply to local clusters, but in the discussion we offer some justification for the conjecture that the isomorphism between twist and discrete curvature can be extended globally. Furthermore, we present examples for tetrahedral clusters with three-, four-, and fivefold symmetry.
Discrete Hilbert transformation and its application to estimate the wind speed in Hong Kong
Zhu, Zuojin [Department of Thermal Science and Energy Engineering, Institute of Engineering Science, University of Science and Technology of China, Hefei, Anhui (China); Yang, Hongxing [Department of Building Services Engineering, The Hong Kong Polytechnic University, Hong Kong (Hong Kong)
2002-01-01
Discrete Hilbert Transform (DHT) has been applied to estimate the wind speed with the sample data sequence selected from the data record observed by the observatory in Hong Kong in June 1989, during which the data pertain to deep valleys and sharp crests due to manifold weather conditions in this region. To confirm the performance of the discrete Hilbert transformer, two harmonic input sequences were used to inspect the output signals, whether good agreement with the theoretical results is obtained. It was found that the energy spectrum and the outputs for the two different harmonic discrete waves are certainly correct. After the inspection of the DHT filter, the sample data for wind speed in Hong Kong were used for wind speed forecasting. For zero mean input sequence, the variance of the output is the same as that of the input signals, and so is the energy spectrum. The DHT of an individual input sample can really reflect the local variation performance, since it is the convolution with the reciprocal of time and the input data sequence, but there exists phase shift. For harmonic signals, the output signal holds a 90 phase delay.
Algorithms for Fast Computing of the 3D-DCT Transform
S. Hanus
2003-04-01
Full Text Available The algorithm for video compression based on the Three-DimensionalDiscrete Cosine Transform (3D-DCT is presented. The original algorithmof the 3D-DCT has high time complexity. We propose several enhancementsto the original algorithm and make the calculation of the DCT algorithmfeasible for future real-time video compression.
Fedorenko, Sergei V.
2011-01-01
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of even extension degree is the best known method of the discrete Fourier transform computation. A constructive method of constructing for a cyclic convolution over a finite field is introduced.
ANIMATION STRATEGIES FOR SMOOTH TRANSFORMATIONS BETWEEN DISCRETE LODS OF 3D BUILDING MODELS
M. Kada
2016-06-01
Full Text Available 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.
Animation Strategies for Smooth Transformations Between Discrete Lods of 3d Building Models
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.
Application of Discrete Fourier Transform in solving the inverse problem in gamma-ray logging
Zorski, T.
1980-01-01
A new approach to the solution of inverse problem in gamma-ray logging is presented. The equation: I(z) = ∫sup(+infinite)sub(-infinite) phi (z-z')Isub(infinite)(z')dz', which relates the measured intensity I(z) with the intensity Isub(infinite)(z) not disturbed by finite thickness of an elementary layer, is solved for Isub(infinite)(z). Discrete Fourier Transform and convolution theorem are used. As a result of our solution discrete values of Isub(infinite)(z) given at a step of Δh are obtained. Examples of application of this method for Δh <= 4.5 cm and for the curves I(z) theoretically calculated are also discussed. (author)
Elementary Baecklund transformations for a discrete Ablowitz-Ladik eigenvalue problem
Rourke, David E
2004-01-01
Elementary Baecklund transformations (BTs) are described for a discretization of the Zakharov-Shabat eigenvalue problem (a special case of the Ablowitz-Ladik eigenvalue problem). Elementary BTs allow the process of adding bound states to a system (i.e., the add-one-soliton BT) to be 'factorized' to solving two simpler sub-problems. They are used to determine the effect on the scattering data when bound states are added. They are shown to provide a method of calculating discrete solitons-this is achieved by constructing a lattice of intermediate potentials, with the parameters used in the calculation of the lattice simply related to the soliton scattering data. When the potentials, S n , T n , in the system are related by S n = -T n , they enable simple derivations to be obtained of the add-one-soliton BT and the nonlinear superposition formula
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.
Humbert, Ph.
2005-01-01
In this paper we consider the probability distribution of neutrons in a multiplying assembly. The problem is studied using a space independent one group neutron point reactor model without delayed neutrons. We recall the generating function methodology and analytical results obtained by G.I. Bell when the c 2 approximation is used and we present numerical solutions in the general case, without this approximation. The neutron source induced distribution is calculated using the single initial neutron distribution which satisfies a master (Kolmogorov backward) equation. This equation is solved using the generating function method. The generating function satisfies a differential equation and the probability distribution is derived by inversion of the generating function. Numerical results are obtained using the same methodology where the generating function is the Fourier transform of the probability distribution. Discrete Fourier transforms are used to calculate the discrete time dependent distributions and continuous Fourier transforms are used to calculate the asymptotic continuous probability distributions. Numerical applications are presented to illustrate the method. (author)
Shuo-Tsung Chen
2015-01-01
Full Text Available Purpose. 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. Methods. 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. Results. 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. Conclusion. 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.
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.
Gareis, I; Gentiletti, G; Acevedo, R; Rufiner, L
2011-01-01
The purpose of this work is to evaluate different feature extraction alternatives to detect the event related evoked potential signal on brain computer interfaces, trying to minimize the time employed and the classification error, in terms of sensibility and specificity of the method, looking for alternatives to coherent averaging. In this context the results obtained performing the feature extraction using discrete dyadic wavelet transform using different mother wavelets are presented. For the classification a single layer perceptron was used. The results obtained with and without the wavelet decomposition were compared; showing an improvement on the classification rate, the specificity and the sensibility for the feature vectors obtained using some mother wavelets.
The Pegg–Barnett phase operator and the discrete Fourier transform
Perez-Leija, Armando; Szameit, Alexander; Andrade-Morales, Luis A; Soto-Eguibar, Francisco; Moya-Cessa, Héctor M
2016-01-01
In quantum mechanics the position and momentum operators are related to each other via the Fourier transform. In the same way, here we show that the so-called Pegg–Barnett phase operator can be obtained by the application of the discrete Fourier transform to the number operators defined in a finite-dimensional Hilbert space. Furthermore, we show that the structure of the London–Susskind–Glogower phase operator, whose natural logarithm gives rise to the Pegg–Barnett phase operator, is contained in the Hamiltonian of circular waveguide arrays. Our results may find applications in the development of new finite-dimensional photonic systems with interesting phase-dependent properties. (invited comment)
Novel structures for Discrete Hartley Transform based on first-order moments
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.
FAST DISCRETE CURVELET TRANSFORM BASED ANISOTROPIC FEATURE EXTRACTION FOR IRIS RECOGNITION
Amol D. Rahulkar
2010-11-01
Full Text Available The feature extraction plays a very important role in iris recognition. Recent researches on multiscale analysis provide good opportunity to extract more accurate information for iris recognition. In this work, a new directional iris texture features based on 2-D Fast Discrete Curvelet Transform (FDCT is proposed. The proposed approach divides the normalized iris image into six sub-images and the curvelet transform is applied independently on each sub-image. The anisotropic feature vector for each sub-image is derived using the directional energies of the curvelet coefficients. These six feature vectors are combined to create the resultant feature vector. During recognition, the nearest neighbor classifier based on Euclidean distance has been used for authentication. The effectiveness of the proposed approach has been tested on two different databases namely UBIRIS and MMU1. Experimental results show the superiority of the proposed approach.
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.
Vieira, Fabio P.B.; Bevilacqua, Joyce S.
2014-01-01
The use of electron paramagnetic resonance spectrometers - EPR - in radiation dosimetry is known for more than four decades. It is an important tool in the retrospective determination of doses absorbed. To estimate the dose absorbed by the sample, it is necessary to know the amplitude of the peak to peak signature of the substance in its EPR spectrum. This information can be compromised by the presence of spurious information: noise - of random and low intensity nature; and the behavior of the baseline - coming from the coupling between the resonator tube and the sample analyzed. Due to the intrinsic characteristics of the three main components of the signal, i.e. signature, noise, and baseline - the analysis in the frequency domain allows, through post-processing techniques to filter spurious information. In this work, an algorithm that retrieves the signature of a substance has been implemented. The Discrete Fourier Transform is applied to the signal and without user intervention, the noise is filtered. From the filtered signal, recovers the signature by Inverse Discrete Fourier Transform. The peak to peak amplitude, and the absorbed dose is calculated with an error of less than 1% for signals wherein the base line is linearized. Some more general cases are under investigation and with little user intervention, you can get the same error
Qiu Bo
2008-01-01
Full Text Available Binaural cue coding (BCC is an efficient technique for spatial audio rendering by using the side information such as interchannel level difference (ICLD, interchannel time difference (ICTD, and interchannel correlation (ICC. Of the side information, the ICTD plays an important role to the auditory spatial image. However, inaccurate estimation of the ICTD may lead to the audio quality degradation. In this paper, we develop a novel ICTD estimation algorithm based on the nonuniform discrete Fourier transform (NDFT and integrate it with the BCC approach to improve the decoded auditory image. Furthermore, a new subjective assessment method is proposed for the evaluation of auditory image widths of decoded signals. The test results demonstrate that the NDFT-based scheme can achieve much wider and more externalized auditory image than the existing BCC scheme based on the discrete Fourier transform (DFT. It is found that the present technique, regardless of the image width, does not deteriorate the sound quality at the decoder compared to the traditional scheme without ICTD estimation.
Effective Approach to Calculate Analysis Window in Infinite Discrete Gabor Transform
Rui Li
2018-01-01
Full Text Available The long-periodic/infinite discrete Gabor transform (DGT is more effective than the periodic/finite one in many applications. In this paper, a fast and effective approach is presented to efficiently compute the Gabor analysis window for arbitrary given synthesis window in DGT of long-periodic/infinite sequences, in which the new orthogonality constraint between analysis window and synthesis window in DGT for long-periodic/infinite sequences is derived and proved to be equivalent to the completeness condition of the long-periodic/infinite DGT. By using the property of delta function, the original orthogonality can be expressed as a certain number of linear equation sets in both the critical sampling case and the oversampling case, which can be fast and efficiently calculated by fast discrete Fourier transform (FFT. The computational complexity of the proposed approach is analyzed and compared with that of the existing canonical algorithms. The numerical results indicate that the proposed approach is efficient and fast for computing Gabor analysis window in both the critical sampling case and the oversampling case in comparison to existing algorithms.
Neutrosophic Refined Similarity Measure Based on Cosine Function
Said Broumi
2014-12-01
Full Text Available In this paper, the cosine similarity measure of neutrosophic refined (multi- sets is proposed and its properties are studied. The concept of this cosine similarity measure of neutrosophic refined sets is the extension of improved cosine similarity measure of single valued neutrosophic. Finally, using this cosine similarity measure of neutrosophic refined set, the application of medical diagnosis is presented.
A new stationary gridline artifact suppression method based on the 2D discrete wavelet transform
Tang, Hui; Tong, Dan; Dong Bao, Xu; Dillenseger, Jean-Louis
2015-01-01
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 subimages 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
A new stationary gridline artifact suppression method based on the 2D discrete wavelet transform
Tang, Hui, E-mail: corinna@seu.edu.cn [Laboratory of Image Science and Technology, School of Computer Science and Engineering, Southeast University, Nanjing 210096 (China); Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education, Nanjing 210000 (China); Centre de Recherche en Information Biomédicale sino-français, Laboratoire International Associé, Inserm, Université de Rennes 1, Rennes 35000 (France); Southeast University, Nanjing 210000 (China); Tong, Dan; Dong Bao, Xu [Laboratory of Image Science and Technology, School of Computer Science and Engineering, Southeast University, Nanjing 210096 (China); Dillenseger, Jean-Louis [INSERM, U1099, Rennes F-35000 (France); Université de Rennes 1, LTSI, Rennes F-35000 (France); Centre de Recherche en Information Biomédicale sino-français, Laboratoire International Associé, Inserm, Université de Rennes 1, Rennes 35000 (France); Southeast University, Nanjing 210000 (China)
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 subimages 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.
Schmidt, Jürgen M.
2012-01-01
Two commonly employed angular-mobility models for describing amino-acid side-chain χ 1 torsion conformation, the staggered-rotamer jump and the normal probability density, are discussed and performance differences in applications to scalar-coupling data interpretation highlighted. Both models differ in their distinct statistical concepts, representing discrete and continuous angle distributions, respectively. Circular statistics, introduced for describing torsion-angle distributions by using a universal circular order parameter central to all models, suggest another distribution of the continuous class, here referred to as the elliptic model. Characteristic of the elliptic model is that order parameter and circular variance form complementary moduli. Transformations between the parameter sets that describe the probability density functions underlying the different models are provided. Numerical aspects of parameter optimization are considered. The issues are typified by using a set of χ 1 related 3 J coupling constants available for FK506-binding protein. The discrete staggered-rotamer model is found generally to produce lower order parameters, implying elevated rotatory variability in the amino-acid side chains, whereas continuous models tend to give higher order parameters that suggest comparatively less variation in angle conformations. The differences perceived regarding angular mobility are attributed to conceptually different features inherent to the models.
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.
Detection of short-term anomaly using parasitic discrete wavelet transform
Nagamatsu, Takashi; Gofuku, Akio
2013-01-01
A parasitic discrete wavelet transform (P-DWT) that has a large flexibility in design of the mother wavelet (MW) and a high processing speed was applied for simulation and measured anomalies. First, we applied the P-DWT to detection of the short-term anomalies. Second, we applied the P-DWT to detection of the collision of pump using the pump diagnostic experiment equipment that was designed taking into consideration the structure of the pump used for the water-steam system of the fast breeder reactor 'Monju'. The vibration signals were measured by the vibration sensor attached to the pump when injecting four types of small objects (sphere, small sphere, cube, and rectangular parallelepiped). Anomaly detection was performed by calculating the fast wavelet instantaneous correlation using the parasitic filter that was constructed on the basis of the measured signals. The results suggested that the anomalies could be detected for all types of the supposed anomalies. (author)
Discrete Fourier transformation processor based on complex radix (−1 + j number system
Anidaphi Shadap
2017-02-01
Full Text Available Complex radix (−1 + j allows the arithmetic operations of complex numbers to be done without treating the divide and conquer rules, which offers the significant speed improvement of complex numbers computation circuitry. Design and hardware implementation of complex radix (−1 + j converter has been introduced in this paper. Extensive simulation results have been incorporated and an application of this converter towards the implementation of discrete Fourier transformation (DFT processor has been presented. The functionality of the DFT processor have been verified in Xilinx ISE design suite version 14.7 and performance parameters like propagation delay and dynamic switching power consumption have been calculated by Virtuoso platform in Cadence. The proposed DFT processor has been implemented through conversion, multiplication and addition. The performance parameter matrix in terms of delay and power consumption offered a significant improvement over other traditional implementation of DFT processor.
ISAR Imaging of Maneuvering Targets Based on the Modified Discrete Polynomial-Phase Transform
Yong Wang
2015-09-01
Full Text Available Inverse synthetic aperture radar (ISAR imaging of a maneuvering target is a challenging task in the field of radar signal processing. The azimuth echo can be characterized as a multi-component polynomial phase signal (PPS after the translational compensation, and the high quality ISAR images can be obtained by the parameters estimation of it combined with the Range-Instantaneous-Doppler (RID technique. In this paper, a novel parameters estimation algorithm of the multi-component PPS with order three (cubic phase signal-CPS based on the modified discrete polynomial-phase transform (MDPT is proposed, and the corresponding new ISAR imaging algorithm is presented consequently. This algorithm is efficient and accurate to generate a focused ISAR image, and the results of real data demonstrate the effectiveness of it.
Evaluation of cardiac signals using discrete wavelet transform with MATLAB graphical user interface.
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.
Fault location in underground cables using ANFIS nets and discrete wavelet transform
Shimaa Barakat
2014-12-01
Full Text Available This paper presents an accurate algorithm for locating faults in a medium voltage underground power cable using a combination of Adaptive Network-Based Fuzzy Inference System (ANFIS and discrete wavelet transform (DWT. The proposed method uses five ANFIS networks and consists of 2 stages, including fault type classification and exact fault location. In the first part, an ANFIS is used to determine the fault type, applying four inputs, i.e., the maximum detailed energy of three phase and zero sequence currents. Other four ANFIS networks are utilized to pinpoint the faults (one for each fault type. Four inputs, i.e., the maximum detailed energy of three phase and zero sequence currents, are used to train the neuro-fuzzy inference systems in order to accurately locate the faults on the cable. The proposed method is evaluated under different fault conditions such as different fault locations, different fault inception angles and different fault resistances.
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.
Rogelio Ramos
2017-01-01
Full Text Available The present work discusses the problem of induced external electrical noise as well as its removal from the electrical potential obtained from Scanning Vibrating Electrode Technique (SVET in the pitting corrosion process of aluminum alloy A96061 in 3.5% NaCl. An accessible and efficient solution of this problem is presented with the use of virtual instrumentation (VI, embedded systems, and the discrete wavelet transform (DWT. The DWT is a computational algorithm for digital processing that allows obtaining electrical noise with Signal to Noise Ratio (SNR superior to those obtained with Lock-In Amplifier equipment. The results show that DWT and the threshold method are efficient and powerful alternatives to carry out electrical measurements of potential signals from localized corrosion processes measured by SVET.
VANCEA, F.
2014-11-01
Full Text Available The paper presents two methods for detecting anomalies in data series derived from network traffic. Intrusion detection systems based on network traffic analysis are able to respond to incidents never seen before by detecting anomalies in data series extracted from the traffic. Some anomalies manifest themselves as pulses of various sizes and shapes, superimposed on series corresponding to normal traffic. In order to detect those impulses we propose two methods based on discrete wavelet transformation. Their effectiveness expressed in relative thresholds on pulse amplitude for no false negatives and no false positives is then evaluated against pulse duration and Hurst characteristic of original series. Different base functions are also evaluated for efficiency in the context of the proposed methods.
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).
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.
Xinhua Nie
Full Text Available Magnetic anomaly detection (MAD is a passive approach for detection of a ferromagnetic target, and its performance is often limited by external noises. In consideration of one major noise source is the fractal noise (or called 1/f noise with a power spectral density of 1/fa (0discrete wavelet transform (UDWT is proposed in this paper. Firstly, the foundations of magnetic anomaly detection and UDWT are introduced in brief, while a possible detection system based on giant magneto-impedance (GMI magnetic sensor is also given out. Then our proposed energy detection based on UDWT is described in detail, and the probabilities of false alarm and detection for given the detection threshold in theory are presented. It is noticeable that no a priori assumptions regarding the ferromagnetic target or the magnetic noise probability are necessary for our method, and different from the discrete wavelet transform (DWT, the UDWT is shift invariant. Finally, some simulations are performed and the results show that the detection performance of our proposed detector is better than that of the conventional energy detector even utilized in the Gaussian white noise, especially when the spectral parameter α is less than 1.0. In addition, a real-world experiment was done to demonstrate the advantages of the proposed method.
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.
Da Ros, Francesco; Nolle, Markus; Meuer, C.
2014-01-01
We experimentally demonstrate the demultiplexing of 8×13.4 Gbaud OFDM-QPSK subcarriers using a silicon nanophotonic-based discrete Fourier transform (DFT) filter. All eight subcarriers showed less than 1.5 dB OSNR penalty compared to the theoretical limit.......We experimentally demonstrate the demultiplexing of 8×13.4 Gbaud OFDM-QPSK subcarriers using a silicon nanophotonic-based discrete Fourier transform (DFT) filter. All eight subcarriers showed less than 1.5 dB OSNR penalty compared to the theoretical limit....
Khaled Loukhaoukha
2017-12-01
Full Text Available Among emergent applications of digital watermarking are copyright protection and proof of ownership. Recently, Makbol and Khoo (2013 have proposed for these applications a new robust blind image watermarking scheme based on the redundant discrete wavelet transform (RDWT and the singular value decomposition (SVD. In this paper, we present two ambiguity attacks on this algorithm that have shown that this algorithm fails when used to provide robustness applications like owner identification, proof of ownership, and transaction tracking. Keywords: Ambiguity attack, Image watermarking, Singular value decomposition, Redundant discrete wavelet transform
Initial performance of the COSINE-100 experiment
Adhikari, G.; Adhikari, P. [Sejong University, Department of Physics, Seoul (Korea, Republic of); Souza, E.B. de; Jo, J.H.; Lim, K.E.; Maruyama, R.H.; Pierpoint, Z.P.; Thompson, W.G. [Yale University, Department of Physics, New Haven, CT (United States); Carlin, N. [University of Sao Paulo, Physics Institute, Sao Paulo (Brazil); Choi, S.; Joo, H.W.; Kim, S.K. [Seoul National University, Department of Physics and Astronomy, Seoul (Korea, Republic of); Choi, W.Q. [Korea Institute of Science and Technology Information, Daejeon (Korea, Republic of); Karlsruher Institut fuer Technologie (KIT), Institut fuer Experimentelle Kernphysik, Eggenstein-Leopoldshafen (Germany); Djamal, M.; Prihtiadi, H. [Bandung Institute of Technology, Department of Physics, Bandung (Indonesia); Ezeribe, A.C.; Kudryavtsev, V.A.; Lynch, W.A.; Mouton, F.; Spooner, N.J.C. [University of Sheffield, Department of Physics and Astronomy, Sheffield (United Kingdom); Ha, C.; Jeon, E.J.; Kang, W.G.; Kim, B.H.; Kim, H.; Kim, K.W.; Kim, N.Y.; Lee, H.S.; Lee, J.; Lee, M.H.; Leonard, D.S.; Olsen, S.L.; Park, H.K.; Park, K.S.; Ra, S.; Yong, S.H. [Institute for Basic Science (IBS), Center for Underground Physics, Daejeon (Korea, Republic of); Hahn, I.S. [Ewha Womans University, Department of Science Education, Seoul (Korea, Republic of); Hubbard, A.J.F. [Yale University, Department of Physics, New Haven, CT (United States); Northwestern University, Department of Physics and Astronomy, Evanston, IL (United States); Kang, W.; Rott, C. [Sungkyunkwan University, Department of Physics, Seoul (Korea, Republic of); Kauer, M. [University of Wisconsin-Madison, Department of Physics and Wisconsin IceCube Particle Astrophysics Center, Madison, WI (United States); Kim, H.J.; Lee, J.Y. [Kyungpook National University, Department of Physics, Daegu (Korea, Republic of); Kim, M.C. [Sungkyunkwan University, Department of Physics, Seoul (Korea, Republic of); Chiba University, Department of Physics, Chiba (Japan); Kim, Y.D. [Sejong University, Department of Physics, Seoul (Korea, Republic of); Institute for Basic Science (IBS), Center for Underground Physics, Daejeon (Korea, Republic of); Kim, Y.H. [Institute for Basic Science (IBS), Center for Underground Physics, Daejeon (Korea, Republic of); Korea Research Institute of Standards and Science, Daejeon (Korea, Republic of); Park, H.S. [Korea Research Institute of Standards and Science, Daejeon (Korea, Republic of); Park, J.S. [Institute for Basic Science (IBS), Center for Underground Physics, Daejeon (Korea, Republic of); High Energy Accelerator Research Organization (KEK), Ibaraki (Japan); Pettus, W. [Yale University, Department of Physics, New Haven, CT (United States); University of Washington, Department of Physics, Center for Experimental Nuclear Physics and Astrophysics, Seattle, WA (United States); Rogers, F.R. [Yale University, Department of Physics, New Haven, CT (United States); Massachusetts Institute of Technology, Department of Physics, Cambridge, MA (United States); Scarff, A. [University of Sheffield, Department of Physics and Astronomy, Sheffield (United Kingdom); University of British Columbia, Department of Physics and Astronomy, Vancouver, BC (Canada); Yang, L. [University of Illinois at Urbana-Champaign, Department of Physics, Urbana, IL (United States)
2018-02-15
COSINE is a dark matter search experiment based on an array of low background NaI(Tl) crystals located at the Yangyang underground laboratory. The assembly of COSINE-100 was completed in the summer of 2016 and the detector is currently collecting physics quality data aimed at reproducing the DAMA/LIBRA experiment that reported an annual modulation signal. Stable operation has been achieved and will continue for at least 2 years. Here, we describe the design of COSINE-100, including the shielding arrangement, the configuration of the NaI(Tl) crystal detection elements, the veto systems, and the associated operational systems, and we show the current performance of the experiment. (orig.)
Electro-mechanical sine/cosine generator
Flagge, B. (Inventor)
1972-01-01
An electromechanical device for generating both sine and cosine functions is described. A motor rotates a cylinder about an axis parallel to and a slight distance from the central axis of the cylinder. Two noncontacting displacement sensing devices are placed ninety degrees apart, equal distances from the axis of rotation of the cylinder and short distances above the surface of cylinder. Each of these sensing devices produces an electrical signal proportional to the distance that it is away from the cylinder. Consequently, as the cylinder is rotated the outputs from the two sensing devices are the sine and cosine functions.
Damage Detection on Sudden Stiffness Reduction Based on Discrete Wavelet Transform
Bo Chen
2014-01-01
Full Text Available 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.
On E-discretization of tori of compact simple Lie groups. II
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.
On distributional assumptions and whitened cosine similarities
Loog, Marco
2008-01-01
Recently, an interpretation of the whitened cosine similarity measure as a Bayes decision rule was proposed (C. Liu, "The Bayes Decision Rule Induced Similarity Measures,'' IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 6, pp. 1086-1090, June 2007. This communication makes th...
Metric distances derived from cosine similarity and Pearson and Spearman correlations
van Dongen, Stijn; Enright, Anton J.
2012-01-01
We investigate two classes of transformations of cosine similarity and Pearson and Spearman correlations into metric distances, utilising the simple tool of metric-preserving functions. The first class puts anti-correlated objects maximally far apart. Previously known transforms fall within this class. The second class collates correlated and anti-correlated objects. An example of such a transformation that yields a metric distance is the sine function when applied to centered data.
Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms
Gregorio de Miguel Casado
2007-01-01
Full Text Available This paper presents a method to improve the calculation of functions which specially demand a great amount of computing resources. The method is based on the choice of a weighted primitive which enables the calculation of function values under the scope of a recursive operation. When tackling the design level, the method shows suitable for developing a processor which achieves a satisfying trade-off between time delay, area costs, and stability. The method is particularly suitable for the mathematical transforms used in signal processing applications. A generic calculation scheme is developed for the discrete fast Fourier transform (DFT and then applied to other integral transforms such as the discrete Hartley transform (DHT, the discrete cosine transform (DCT, and the discrete sine transform (DST. Some comparisons with other well-known proposals are also provided.
Eldin, A.A. Hossam; Refaey, M.A. [Electrical Engineering Department, Alexandria University, Alexandria (Egypt)
2011-01-15
This paper proposes a novel methodology for transformer differential protection, based on wave shape recognition of the discriminating criterion extracted of the instantaneous differential currents. Discrete wavelet transform has been applied to the differential currents due to internal fault and inrush currents. The diagnosis criterion is based on median absolute deviation (MAD) of wavelet coefficients over a specified frequency band. The proposed algorithm is examined using various simulated inrush and internal fault current cases on a power transformer that has been modeled using electromagnetic transients program EMTDC software. Results of evaluation study show that, proposed wavelet based differential protection scheme can discriminate internal faults from inrush currents. (author)
Hyperbolic Cross Truncations for Stochastic Fourier Cosine Series
Zhang, Zhihua
2014-01-01
Based on our decomposition of stochastic processes and our asymptotic representations of Fourier cosine coefficients, we deduce an asymptotic formula of approximation errors of hyperbolic cross truncations for bivariate stochastic Fourier cosine series. Moreover we propose a kind of Fourier cosine expansions with polynomials factors such that the corresponding Fourier cosine coefficients decay very fast. Although our research is in the setting of stochastic processes, our results are also new for deterministic functions. PMID:25147842
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.
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.
Shift-invariant discrete wavelet transform analysis for retinal image classification.
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.
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.
A high-throughput two channel discrete wavelet transform architecture for the JPEG2000 standard
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.
Maheswari Subramanian
2018-01-01
Full Text Available Information hiding techniques have a significant role in recent application areas. Steganography is the embedding of information within an innocent cover work in a way which cannot be detected by any person without accessing the steganographic key. The proposed work uses a steganographic scheme for useful information with the help of human skin tone regions as cover image. The proposed algorithm has undergone Lagrange interpolation encryption for enhancement of the security of the hidden information. First, the skin tone regions are identified by using YCbCr color space which can be used as a cover image. Image pixels which belong to the skin regions are used to carry more secret bits, and the secret information is hidden in both horizontal and vertical sequences of the skin areas of the cover image. The secret information will hide behind the human skin regions rather than other objects in the same image because the skin pixels have high intensity value. The performance of embedding is done and is quite invisible by the vector discrete wavelet transformation (VDWT technique. A new Lagrange interpolation-based encryption method is introduced to achieve high security of the hidden information with higher payload and better visual quality.
Mahin K. Atiq
2013-09-01
Full Text Available Measurement of the active, reactive, and apparent power is one of the most fundamental tasks of smart meters in energy systems. Recently, a number of studies have employed the discrete wavelet transform (DWT for power measurement in smart meters. The most common way to implement DWT is the pyramid algorithm; however, this is not feasible for practical DWT computation because it requires either a log N cascaded filter or O (N word size memory storage for an input signal of the N-point. Both solutions are too expensive for practical applications of smart meters. It is proposed that the recursive pyramid algorithm is more suitable for smart meter implementation because it requires only word size storage of L × Log (N-L, where L is the length of filter. We also investigated the effect of varying different system parameters, such as the sampling rate, dc offset, phase offset, linearity error in current and voltage sensors, analog to digital converter resolution, and number of harmonics in a non-sinusoidal system, on the reactive energy measurement using DWT. The error analysis is depicted in the form of the absolute difference between the measured and the true value of the reactive energy.
Chowdhury, Suman Kanti; Nimbarte, Ashish D; Jaridi, Majid; Creese, Robert C
2013-10-01
Assessment of neuromuscular fatigue is essential for early detection and prevention of risks associated with work-related musculoskeletal disorders. In recent years, discrete wavelet transform (DWT) of surface electromyography (SEMG) has been used to evaluate muscle fatigue, especially during dynamic contractions when the SEMG signal is non-stationary. However, its application to the assessment of work-related neck and shoulder muscle fatigue is not well established. Therefore, the purpose of this study was to establish DWT analysis as a suitable method to conduct quantitative assessment of neck and shoulder muscle fatigue under dynamic repetitive conditions. Ten human participants performed 40min of fatiguing repetitive arm and neck exertions while SEMG data from the upper trapezius and sternocleidomastoid muscles were recorded. The ten of the most commonly used wavelet functions were used to conduct the DWT analysis. Spectral changes estimated using power of wavelet coefficients in the 12-23Hz frequency band showed the highest sensitivity to fatigue induced by the dynamic repetitive exertions. Although most of the wavelet functions tested in this study reasonably demonstrated the expected power trend with fatigue development and recovery, the overall performance of the "Rbio3.1" wavelet in terms of power estimation and statistical significance was better than the remaining nine wavelets. Copyright © 2013 Elsevier Ltd. All rights reserved.
Marinescu, D.C.; Radulescu, T.G.
1977-06-01
The Integral Fourier Transform has a large range of applications in such areas as communication theory, circuit theory, physics, etc. In order to perform discrete Fourier Transform the Finite Fourier Transform is defined; it operates upon N samples of a uniformely sampled continuous function. All the properties known in the continuous case can be found in the discrete case also. The first part of the paper presents the relationship between the Finite Fourier Transform and the Integral one. The computing of a Finite Fourier Transform is a problem in itself since in order to transform a set of N data we have to perform N 2 ''operations'' if the transformation relations are used directly. An algorithm known as the Fast Fourier Transform (FFT) reduces this figure from N 2 to a more reasonable Nlog 2 N, when N is a power of two. The original Cooley and Tuckey algorithm for FFT can be further improved when higher basis are used. The price to be paid in this case is the increase in complexity of such algorithms. The recurrence relations and a comparation among such algorithms are presented. The key point in understanding the application of FFT resides in the convolution theorem which states that the convolution (an N 2 type procedure) of the primitive functions is equivalent to the ordinar multiplication of their transforms. Since filtering is actually a convolution process we present several procedures to perform digital filtering by means of FFT. The best is the one using the segmentation of records and the transformation of pairs of records. In the digital processing of signals, besides digital filtering a special attention is paid to the estimation of various statistical characteristics of a signal as: autocorrelation and correlation functions, periodiograms, density power sepctrum, etc. We give several algorithms for the consistent and unbiased estimation of such functions, by means of FFT. (author)
Multirate-based fast parallel algorithms for 2-D DHT-based real-valued discrete Gabor transform.
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.
Muon detector for the COSINE-100 experiment
Prihtiadi, H.; Adhikari, G.; Adhikari, P.; Barbosa de Souza, E.; Carlin, N.; Choi, S.; Choi, W. Q.; Djamal, M.; Ezeribe, A. C.; Ha, C.; Hahn, I. S.; Hubbard, A. J. F.; Jeon, E. J.; Jo, J. H.; Joo, H. W.; Kang, W.; Kang, W. G.; Kauer, M.; Kim, B. H.; Kim, H.; Kim, H. J.; Kim, K. W.; Kim, N. Y.; Kim, S. K.; Kim, Y. D.; Kim, Y. H.; Kudryavtsev, V. A.; Lee, H. S.; Lee, J.; Lee, J. Y.; Lee, M. H.; Leonard, D. S.; Lim, K. E.; Lynch, W. A.; Maruyama, R. H.; Mouton, F.; Olsen, S. L.; Park, H. K.; Park, H. S.; Park, J. S.; Park, K. S.; Pettus, W.; Pierpoint, Z. P.; Ra, S.; Rogers, F. R.; Rott, C.; Scarff, A.; Spooner, N. J. C.; Thompson, W. G.; Yang, L.; Yong, S. H.
2018-02-01
The COSINE-100 dark matter search experiment has started taking physics data with the goal of performing an independent measurement of the annual modulation signal observed by DAMA/LIBRA. A muon detector was constructed by using plastic scintillator panels in the outermost layer of the shield surrounding the COSINE-100 detector. It detects cosmic ray muons in order to understand the impact of the muon annual modulation on dark matter analysis. Assembly and initial performance tests of each module have been performed at a ground laboratory. The installation of the detector in the Yangyang Underground Laboratory (Y2L) was completed in the summer of 2016. Using three months of data, the muon underground flux was measured to be 328 ± 1(stat.)± 10(syst.) muons/m2/day. In this report, the assembly of the muon detector and the results from the analysis are presented.
Zhang, B.; Oosterlee, C.W.
2013-01-01
We propose an efficient pricing method for arithmetic and geometric Asian options under exponential Lévy processes based on Fourier cosine expansions and Clenshaw–Curtis quadrature. The pricing method is developed for both European style and American-style Asian options and for discretely and
O. Chavez
2010-12-01
Full Text Available The geomagnetic observatory of Juriquilla Mexico, located at longitude –100.45° and latitude 20.70°, and 1946 m a.s.l., has been operational since June 2004 compiling geomagnetic field measurements with a three component fluxgate magnetometer. In this paper, the results of the analysis of these measurements in relation to important seismic activity in the period of 2007 to 2009 are presented. For this purpose, we used superposed epochs of Discrete Wavelet Transform of filtered signals for the three components of the geomagnetic field during relative seismic calm, and it was compared with seismic events of magnitudes greater than M_{s} > 5.5, which have occurred in Mexico. The analysed epochs consisted of 18 h of observations for a dataset corresponding to 18 different earthquakes (EQs. The time series were processed for a period of 9 h prior to and 9 h after each seismic event. This data processing was compared with the same number of observations during a seismic calm. The proposed methodology proved to be an efficient tool to detect signals associated with seismic activity, especially when the seismic events occur in a distance (D from the observatory to the EQ, such that the ratio D/ρ < 1.8 where ρ is the earthquake radius preparation zone. The methodology presented herein shows important anomalies in the Ultra Low Frequency Range (ULF; 0.005–1 Hz, primarily for 0.25 to 0.5 Hz. Furthermore, the time variance (σ^{2} increases prior to, during and after the seismic event in relation to the coefficient D1 obtained, principally in the Bx (N-S and By (E-W geomagnetic components. Therefore, this paper proposes and develops a new methodology to extract the abnormal signals of the geomagnetic anomalies related to different stages of the EQs.
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
Fast and Scalable Computation of the Forward and Inverse Discrete Periodic Radon Transform.
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
Robert W. Johnson
2013-06-01
Full Text Available The properties of the Gabor and Morlet transforms are examined with respect to the Fourier analysis of discretely sampled data. Forward and inverse transform pairs based on a fixed window with uniform sampling of the frequency axis can satisfy numerically the energy and reconstruction theorems; however, transform pairs based on a variable window or nonuniform frequency sampling in general do not. Instead of selecting the shape of the window as some function of the central frequency, we propose constructing a single window with unit energy from an arbitrary set of windows that is applied over the entire frequency axis. By virtue of using a fixed window with uniform frequency sampling, such a transform satisfies the energy and reconstruction theorems. The shape of the window can be tailored to meet the requirements of the investigator in terms of time/frequency resolution. The algorithm extends naturally to the case of nonuniform signal sampling without modification beyond identification of the Nyquist interval.
Alternating multivariate trigonometric functions and corresponding Fourier transforms
Klimyk, A U; Patera, J
2008-01-01
We define and study multivariate sine and cosine functions, symmetric with respect to the alternating group A n , which is a subgroup of the permutation (symmetric) group S n . These functions are eigenfunctions of the Laplace operator. They determine Fourier-type transforms. There exist three types of such transforms: expansions into corresponding sine-Fourier and cosine-Fourier series, integral sine-Fourier and cosine-Fourier transforms, and multivariate finite sine and cosine transforms. In all these transforms, alternating multivariate sine and cosine functions are used as a kernel
Sines and Cosines. Part 2 of 3
Apostol, Tom M. (Editor)
1993-01-01
The Law of Sines and the Law of Cosines are introduced and demonstrated in this 'Project Mathematics' series video using both film footage and computer animation. This video deals primarily with the mathematical field of Trigonometry and explains how these laws were developed and their applications. One significant use is geographical and geological surveying. This includes both the triangulation method and the spirit leveling method. With these methods, it is shown how the height of the tallest mountain in the world, Mt. Everest, was determined.
Sines and Cosines. Part 3 of 3
Apostol, Tom M. (Editor)
1994-01-01
In this 'Project Mathematics' series video, the addition formulas of sines and cosines are explained and their real life applications are demonstrated. Both film footage and computer animation is used. Several mathematical concepts are discussed and include: Ptolemy's theorem concerned with quadrilaterals; the difference between a central angle and an inscribed angle; sines and chord lengths; special angles; subtraction formulas; and a application to simple harmonic motion. A brief history of the city Alexandria, its mathematicians, and their contribution to the field of mathematics is shown.
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.
Formal degrees of unipotent discrete series representations and the exotic Fourier transform
Ciubotaru, D.; Opdam, E.
2015-01-01
We introduce a notion of elliptic fake degrees for unipotent elliptic representations of a semisimple p-adic group. We conjecture, and verify in some cases, that the relation between the formal degrees of unipotent discrete series representations of a semisimple p-adic group and the elliptic fake
Bovens, M.A.P.; Zouridis, S.
2002-01-01
The use of ICT is rapidly changing the structure of a number of large executive public agencies. They used to be machine bureaucracies in which street level officials exercised ample administrative discretion in dealing with individual clients. This was kept in check by elaborate systems of external
2017-01-01
Systems, methods, apparatuses, and computer program products for generating sequences for zero-tail discrete fourier transform (DFT)-spread-orthogonal frequency division multiplexing (OFDM) (ZT DFT-s-OFDM) reference signals. One method includes adding a zero vector to an input sequence...... of each of the elements, converting the sequence to time domain, generating a zero-padded sequence by forcing a zero head and tail of the sequence, and repeating the steps until a final sequence with zero-tail and flat frequency response is obtained....
A planar waveguide optical discrete Fourier transformer design for 160 Gb/s all-optical OFDM systems
Li, Wei; Liang, Xiaojun; Ma, Weidong; Zhou, Tianhong; Huang, Benxiong; Liu, Deming
2010-01-01
A cost-effective all-optical discrete Fourier transformer (ODFT) is designed based on a silicon planar lightwave circuit (PLC), which can be applied to all-optical orthogonal frequency division multiplexing (OFDM) transmission systems and can be achieved by current techniques. It consists of 2 × 2 directional couplers, phase shifters and optical delay lines. Metal-film heaters are used as phase shifters, according to the thermooptic effect of SiO 2. Based on the ODFT, a 160 Gb/s OFDM system is set up. Simulation results show excellent bit error rate (BER) and optical signal-to-noise ratio (OSNR) performances after 400 km transmission.
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.
Development status of the lattice physics code in COSINE project
Chen, Y.; Yu, H.; Li, S.; Liu, Z.; Yan, Y. [State Nuclear Power Software Development Center, SNPTC, National Energy Key Laboratory of Nuclear Power Software NEKLS, North Third Ring Road, Beijing 100029 (China)
2013-07-01
LATC is an essential part of COSINE code package, which stands for Core and System Integrated Engine for design and analysis. LATC performs 2D multi-group assembly transport calculation and generates few group constants and the required cross-section data for CORE, the core simulator code. LATC is designed to have the capability of modeling the API 000 series assemblies. The development is a continuously improved process. Currently, LATC uses well-proven technology to achieve the key functions. In the next stage, more advanced methods and modules will be implemented. At present, WIMS and WIMS improved format library could be read in LATC code. For resonance calculation, equivalent relation with rational approximations is utilized. For transport calculation, two options are available. One choice is collision probability method in cell homogenization while discrete coordinate method in assembly homogenization, the other is method of characteristics in assembly homogenization directly. For depletion calculation, an improved linear rate 'constant power' depletion method has been developed. (authors)
Development status of the lattice physics code in COSINE project
Chen, Y.; Yu, H.; Li, S.; Liu, Z.; Yan, Y.
2013-01-01
LATC is an essential part of COSINE code package, which stands for Core and System Integrated Engine for design and analysis. LATC performs 2D multi-group assembly transport calculation and generates few group constants and the required cross-section data for CORE, the core simulator code. LATC is designed to have the capability of modeling the API 000 series assemblies. The development is a continuously improved process. Currently, LATC uses well-proven technology to achieve the key functions. In the next stage, more advanced methods and modules will be implemented. At present, WIMS and WIMS improved format library could be read in LATC code. For resonance calculation, equivalent relation with rational approximations is utilized. For transport calculation, two options are available. One choice is collision probability method in cell homogenization while discrete coordinate method in assembly homogenization, the other is method of characteristics in assembly homogenization directly. For depletion calculation, an improved linear rate 'constant power' depletion method has been developed. (authors)
Multicriteria decision-making method based on a cosine similarity ...
the cosine similarity measure is often used in information retrieval, citation analysis, and automatic classification. However, it scarcely deals with trapezoidal fuzzy information and multicriteria decision-making problems. For this purpose, a cosine similarity measure between trapezoidal fuzzy numbers is proposed based on ...
Gan, Yanfen; Zhong, Junliu
2015-12-01
With the aid of sophisticated photo-editing software, such as Photoshop, copy-move image forgery operation has been widely applied and has become a major concern in the field of information security in the modern society. A lot of work on detecting this kind of forgery has gained great achievements, but the detection results of geometrical transformations of copy-move regions are not so satisfactory. In this paper, a new method based on the Polar Complex Exponential Transform is proposed. This method addresses issues in image geometric moment, focusing on constructing rotation invariant moment and extracting features of the rotation invariant moment. In order to reduce rounding errors of the transform from the Polar coordinate system to the Cartesian coordinate system, a new transformation method is presented and discussed in detail at the same time. The new method constructs a 9 × 9 shrunk template to transform the Cartesian coordinate system back to the Polar coordinate system. It can reduce transform errors to a much greater degree. Forgery detection, such as copy-move image forgery detection, is a difficult procedure, but experiments prove our method is a great improvement in detecting and identifying forgery images affected by the rotated transform.
On d -Dimensional Lattice (co)sine n -Algebra
Yao Shao-Kui; Zhang Chun-Hong; Zhao Wei-Zhong; Ding Lu; Liu Peng
2016-01-01
We present the (co)sine n-algebra which is indexed by the d-dimensional integer lattice. Due to the associative operators, this generalized (co)sine n-algebra is the higher order Lie algebra for the n even case. The particular cases are the d-dimensional lattice sine 3 and cosine 5-algebras with the special parameter values. We find that the corresponding d-dimensional lattice sine 3 and cosine 5-algebras are the Nambu 3-algebra and higher order Lie algebra, respectively. The limiting case of the d-dimensional lattice (co)sine n-algebra is also discussed. Moreover we construct the super sine n-algebra, which is the super higher order Lie algebra for the n even case. (paper)
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.
Large quantum Fourier transforms are never exactly realized by braiding conformal blocks
Freedman, Michael H.; Wang, Zhenghan
2007-01-01
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set {U(2), controlled-NOT}, the discrete Fourier transforms F N =(ω ij ) NxN , i,j=0,1,...,N-1, ω=e 2πi at ∼sol∼ at N , can be realized exactly by quantum circuits of size O(n 2 ), n=ln N, and so can the discrete sine or cosine transforms. In topological quantum computing, the simplest universal topological quantum computer is based on the Fibonacci (2+1)-topological quantum field theory (TQFT), where the standard quantum circuits are replaced by unitary transformations realized by braiding conformal blocks. We report here that the large Fourier transforms F N and the discrete sine or cosine transforms can never be realized exactly by braiding conformal blocks for a fixed TQFT. It follows that an approximation is unavoidable in the implementation of Fourier transforms by braiding conformal blocks
Ragnisco, Orlando; Zullo, Federico
2010-01-01
We construct a two-parameter family of Baecklund transformations for the trigonometric classical Gaudin magnet. The approach follows closely the one introduced by Sklyanin and Kuznetsov (1998 J. Phys. A: Math. Gen. 31 2241-51) in a number of seminal papers and takes advantage of the intimate relation between the trigonometric and the rational case. As in the paper by Hone, Kuznetsov and one of the authors (OR) (2001 J. Phys. A: Math. Gen. 34 2477-90) the Baecklund transformations are presented as explicit symplectic maps, starting from their Lax representation. The (expected) connection with the xxz Heisenberg chain is established and the rational (xxx) case is recovered in a suitable limit. It is shown how to obtain a 'physical' transformation mapping real variables into real variables. The interpolating Hamiltonian flow is derived and some numerical iterations of the map are presented.
K. Parvathi
2009-01-01
Full Text Available The watershed transformation is a useful morphological segmentation tool for a variety of grey-scale images. However, over segmentation and under segmentation have become the key problems for the conventional algorithm. In this paper, an efficient segmentation method for high-resolution remote sensing image analysis is presented. Wavelet analysis is one of the most popular techniques that can be used to detect local intensity variation and hence the wavelet transformation is used to analyze the image. Wavelet transform is applied to the image, producing detail (horizontal, vertical, and diagonal and Approximation coefficients. The image gradient with selective regional minima is estimated with the grey-scale morphology for the Approximation image at a suitable resolution, and then the watershed is applied to the gradient image to avoid over segmentation. The segmented image is projected up to high resolutions using the inverse wavelet transform. The watershed segmentation is applied to small subset size image, demanding less computational time. We have applied our new approach to analyze remote sensing images. The algorithm was implemented in MATLAB. Experimental results demonstrated the method to be effective.
OBS Data Denoising Based on Compressed Sensing Using Fast Discrete Curvelet Transform
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
Pang Chaoyang; Hu Benqiong
2008-01-01
The discrete Fourier transform (DFT) is the base of modern signal processing. 1-dimensional fast Fourier transform (ID FFT) and 2D FFT have time complexity O (N log N) and O (N 2 log N) respectively. Since 1965, there has been no more essential breakthrough for the design of fast DFT algorithm. DFT has two properties. One property is that DFT is energy conservation transform. The other property is that many DFT coefficients are close to zero. The basic idea of this paper is that the generalized Grover's iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy. One-dimensional quantum DFT (ID QDFT) and two-dimensional quantum DFT (2D QDFT) are presented in this paper. The quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, ID and 2D QDFT have time complexity O(√N) and O (N) respectively. QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible. (general)
Sidky, Emil; Jørgensen, Jakob Heide; Pan, Xiaochuan
2012-01-01
Iterative image reconstruction in computed tomography often employs a discrete-to-discrete (DD) linear data model, and many of the aspects of the image recovery relate directly to the properties of this linear model. While much is known about the properties of the continuous X-ray, the correspond...
Gui, Tao; Lu, Chao; Lau, Alan Pak Tao; Wai, P K A
2017-08-21
In this paper, we experimentally investigate high-order modulation over a single discrete eigenvalue under the nonlinear Fourier transform (NFT) framework and exploit all degrees of freedom for encoding information. For a fixed eigenvalue, we compare different 4 bit/symbol modulation formats on the spectral amplitude and show that a 2-ring 16-APSK constellation achieves optimal performance. We then study joint spectral phase, spectral magnitude and eigenvalue modulation and found that while modulation on the real part of the eigenvalue induces pulse timing drift and leads to neighboring pulse interactions and nonlinear inter-symbol interference (ISI), it is more bandwidth efficient than modulation on the imaginary part of the eigenvalue in practical settings. We propose a spectral amplitude scaling method to mitigate such nonlinear ISI and demonstrate a record 4 GBaud 16-APSK on the spectral amplitude plus 2-bit eigenvalue modulation (total 6 bit/symbol at 24 Gb/s) transmission over 1000 km.
Fei Dong
2018-01-01
Full Text Available In order to enhance the performance of bearing fault diagnosis and classification, features extraction and features dimensionality reduction have become more important. The original statistical feature set was calculated from single branch reconstruction vibration signals obtained by using maximal overlap discrete wavelet packet transform (MODWPT. In order to reduce redundancy information of original statistical feature set, features selection by adjusted rand index and sum of within-class mean deviations (FSASD was proposed to select fault sensitive features. Furthermore, a modified features dimensionality reduction method, supervised neighborhood preserving embedding with label information (SNPEL, was proposed to realize low-dimensional representations for high-dimensional feature space. Finally, vibration signals collected from two experimental test rigs were employed to evaluate the performance of the proposed procedure. The results show that the effectiveness, adaptability, and superiority of the proposed procedure can serve as an intelligent bearing fault diagnosis system.
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.
Zhang, B.; Oosterlee, C.W.
2011-01-01
We propose an efficient pricing method for arithmetic, and geometric, Asian options under Levy processes, based on Fourier cosine expansions and Clenshaw–Curtis quadrature. The pricing method is developed for both European–style and American–style Asian options, and for discretely and continuously
Bhagavatula, Chandrasekhar; Venugopalan, Shreyas; Blue, Rebecca; Friedman, Robert; Griofa, Marc O; Savvides, Marios; Kumar, B V K Vijaya
2012-01-01
In this paper we explore how a Radio Frequency Impedance Interrogation (RFII) signal may be used as a biometric feature. This could allow the identification of subjects in operational and potentially hostile environments. Features extracted from the continuous and discrete wavelet decompositions of the signal are investigated for biometric identification. In the former case, the most discriminative features in the wavelet space were extracted using a Fisher ratio metric. Comparisons in the wavelet space were done using the Euclidean distance measure. In the latter case, the signal was decomposed at various levels using different wavelet bases, in order to extract both low frequency and high frequency components. Comparisons at each decomposition level were performed using the same distance measure as before. The data set used consists of four subjects, each with a 15 minute RFII recording. The various data samples for our experiments, corresponding to a single heart beat duration, were extracted from these recordings. We achieve identification rates of up to 99% using the CWT approach and rates of up to 100% using the DWT approach. While the small size of the dataset limits the interpretation of these results, further work with larger datasets is expected to develop better algorithms for subject identification.
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.
Vehicle Classification Using the Discrete Fourier Transform with Traffic Inductive Sensors
José J. Lamas-Seco
2015-10-01
Full Text Available 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.
Vehicle Classification Using the Discrete Fourier Transform with Traffic Inductive Sensors.
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.
Iterative algorithm of discrete Fourier transform for processing randomly sampled NMR data sets
Stanek, Jan; Kozminski, Wiktor
2010-01-01
Spectra obtained by application of multidimensional Fourier Transformation (MFT) to sparsely sampled nD NMR signals are usually corrupted due to missing data. In the present paper this phenomenon is investigated on simulations and experiments. An effective iterative algorithm for artifact suppression for sparse on-grid NMR data sets is discussed in detail. It includes automated peak recognition based on statistical methods. The results enable one to study NMR spectra of high dynamic range of peak intensities preserving benefits of random sampling, namely the superior resolution in indirectly measured dimensions. Experimental examples include 3D 15 N- and 13 C-edited NOESY-HSQC spectra of human ubiquitin.
Dai, Xianglu; Xie, Huimin; Wang, Huaixi; Li, Chuanwei; Wu, Lifu; Liu, Zhanwei
2014-01-01
The geometric phase analysis (GPA) method based on the local high resolution discrete Fourier transform (LHR-DFT) for deformation measurement, defined as LHR-DFT GPA, is proposed to improve the measurement accuracy. In the general GPA method, the fundamental frequency of the image plays a crucial role. However, the fast Fourier transform, which is generally employed in the general GPA method, could make it difficult to locate the fundamental frequency accurately when the fundamental frequency is not located at an integer pixel position in the Fourier spectrum. This study focuses on this issue and presents a LHR-DFT algorithm that can locate the fundamental frequency with sub-pixel precision in a specific frequency region for the GPA method. An error analysis is offered and simulation is conducted to verify the effectiveness of the proposed method; both results show that the LHR-DFT algorithm can accurately locate the fundamental frequency and improve the measurement accuracy of the GPA method. Furthermore, typical tensile and bending tests are carried out and the experimental results verify the effectiveness of the proposed method. (paper)
Cosine-Modulated Multitone for Very-High-Speed Digital Subscriber Lines
Lin Lekun
2006-01-01
Full Text Available In this paper, the use of cosine-modulated filter banks (CMFBs for multicarrier modulation in the application of very-high-speed digital subscriber lines (VDSLs is studied. We refer to this modulation technique as cosine-modulated multitone (CMT. CMT has the same transmitter structure as discrete wavelet multitone (DWMT. However, the receiver structure in CMT is different from its DWMT counterpart. DWMT uses linear combiner equalizers, which typically have more than 20 taps per subcarrier. CMT, on the other hand, adopts a receiver structure that uses only two taps per subcarrier for equalization. This paper has the following contributions. (i A modification that reduces the computational complexity of the receiver structure of CMT is proposed. (ii Although traditionally CMFBs are designed to satisfy perfect-reconstruction (PR property, in transmultiplexing applications, the presence of channel destroys the PR property of the filter bank, and thus other criteria of filter design should be adopted. We propose one such method. (iii Through extensive computer simulations, we compare CMT with zipper discrete multitone (z-DMT and filtered multitone (FMT, the two modulation techniques that have been included in the VDSL draft standard. Comparisons are made in terms of computational complexity, transmission latency, achievable bit rate, and resistance to radio ingress noise.
A. Araghi
2014-12-01
Full Text Available Period and trend are two main effective and important factors in hydro-climatological time series and because of this importance, different methods have been introduced and applied to study of them, until now. Most of these methods are statistical basis and they are classified in the non-parametric tests. Wavelet transform is a mathematical based powerful method which has been widely used in signal processing and time series analysis in recent years. In this research, trend and main periodic patterns similarity in temperature and vapor pressure has been studied in Babolsar, Tehran and Shahroud synoptic stations during 55 years period (from 1956 to 2010, using wavelet method and the sequential Mann-Kendall trend test. The results show that long term fluctuation patterns in temperature and vapor pressure have more correlations in the arid and semi-arid climates, as well as short term oscillation patterns in temperature and vapor pressure in the humid climates, and these dominant periods increase with the aridity of region.
Improved cosine similarity measures of simplified neutrosophic sets for medical diagnoses.
Ye, Jun
2015-03-01
In pattern recognition and medical diagnosis, similarity measure is an important mathematical tool. To overcome some disadvantages of existing cosine similarity measures of simplified neutrosophic sets (SNSs) in vector space, this paper proposed improved cosine similarity measures of SNSs based on cosine function, including single valued neutrosophic cosine similarity measures and interval neutrosophic cosine similarity measures. Then, weighted cosine similarity measures of SNSs were introduced by taking into account the importance of each element. Further, a medical diagnosis method using the improved cosine similarity measures was proposed to solve medical diagnosis problems with simplified neutrosophic information. The improved cosine similarity measures between SNSs were introduced based on cosine function. Then, we compared the improved cosine similarity measures of SNSs with existing cosine similarity measures of SNSs by numerical examples to demonstrate their effectiveness and rationality for overcoming some shortcomings of existing cosine similarity measures of SNSs in some cases. In the medical diagnosis method, we can find a proper diagnosis by the cosine similarity measures between the symptoms and considered diseases which are represented by SNSs. Then, the medical diagnosis method based on the improved cosine similarity measures was applied to two medical diagnosis problems to show the applications and effectiveness of the proposed method. Two numerical examples all demonstrated that the improved cosine similarity measures of SNSs based on the cosine function can overcome the shortcomings of the existing cosine similarity measures between two vectors in some cases. By two medical diagnoses problems, the medical diagnoses using various similarity measures of SNSs indicated the identical diagnosis results and demonstrated the effectiveness and rationality of the diagnosis method proposed in this paper. The improved cosine measures of SNSs based on cosine
Fang Li
2017-09-01
Full Text Available A modeling method based on discrete wavelet transform (DWT was introduced to analyze the concentration of chromium, copper, zinc, arsenic and lead in soil with a portable X-ray fluorescence (XRF spectrometer. A total of 111 soil samples were collected and observed. Denoising and baseline correction were performed on each spectrum before modeling. The optimum conditions for pre-processing were denoising with Coiflet 3 on the 3rd level and baseline correction with Coiflet 3 on the 9th level. Calibration curves were established for the five heavy metals (HMs. The detection limits were compared before and after the application of DWT, the qualitative detection limits and the quantitative detection limits were calculated to be three and ten times as high as the standard deviation with silicon dioxide (blank, respectively. The results showed that the detection limits of the instrument using DWT were lower, and that they were below national soil standards; the determination coefficients (R2 based on DWT-processed spectra were higher, and ranged from 0.990 to 0.996, indicating a high degree of linearity between the contents of the HMs in soil and the XRF spectral characteristic peak intensity with the instrument measurement.
Debesh Jha
2017-01-01
Full Text Available Accurate diagnosis of pathological brain images is important for patient care, particularly in the early phase of the disease. Although numerous studies have used machine-learning techniques for the computer-aided diagnosis (CAD of pathological brain, previous methods encountered challenges in terms of the diagnostic efficiency owing to deficiencies in the choice of proper filtering techniques, neuroimaging biomarkers, and limited learning models. Magnetic resonance imaging (MRI is capable of providing enhanced information regarding the soft tissues, and therefore MR images are included in the proposed approach. In this study, we propose a new model that includes Wiener filtering for noise reduction, 2D-discrete wavelet transform (2D-DWT for feature extraction, probabilistic principal component analysis (PPCA for dimensionality reduction, and a random subspace ensemble (RSE classifier along with the K-nearest neighbors (KNN algorithm as a base classifier to classify brain images as pathological or normal ones. The proposed methods provide a significant improvement in classification results when compared to other studies. Based on 5×5 cross-validation (CV, the proposed method outperforms 21 state-of-the-art algorithms in terms of classification accuracy, sensitivity, and specificity for all four datasets used in the study.
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.
Carlos Duarte-Galvan
2014-10-01
Full Text Available 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.
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.
Alexander J. Casson
2015-12-01
Full Text Available 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.
Zhang Zhaoyun; Gao Yang; Zhao Xinghai; Zhao Xiang
2011-01-01
Laser's optical output power and frequency are modulated when the optical beam is back-scattered into the active cavity of the laser. By signal processing, the Doppler frequency can be acquired, and the target's velocity can be calculated. Based on these properties, an interferometry velocity sensor can be designed. When target move in time-varying velocity mode, it is difficult to extract the target's velocity. Time-varying velocity measurement by self-mixing laser diode is explored. A mathematics model was proposed for the time-varying velocity (invariable acceleration) measurement by self-mixing laser diode. Based on this model, a Discrete Chirp-Fourier Transform (DCFT) method was applied, DCFT is analogous to DFT. We show that when the signal length N is prime, the magnitudes of all the side lobes are 1, whereas the magnitudes of the main lobe is √N, And the coordinates of the main lobe shows the target's velocity and acceleration information. The simulation results prove the validity of the algorithm even in the situation of low SNR when N is prime.
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.
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.
Samadder, Swetadri; Ghosh, Koushik; Basu, Tapasendra
2015-01-01
The behaviour of Indian stock markets has a persistent close association with the behaviour of American stock exchange. The present work is an effort in this direction and the purpose of the present work is to investigate the periodicity of the two prime Indian stock market indices viz. SENSEX and NIFTY and the prime American stock market indices viz. DOW-JONES and S&P500. To serve the present purpose we have here used SENSEX logarithmic daily close data during the period from 1st January, 1990 to 31st December, 2013, NIFTY logarithmic daily close data during the period from 3rd July, 1990 to 31st December, 2013, DOW-JONES logarithmic daily close data during the period from 10th January, 1928 to 31st December, 2013 and S&P500 logarithmic daily close data during the period 3rd January, 1950 to 31st December, 2013. For the present analysis we have first used double exponential smoothing on all the four time series in order to remove the trend and next we have generated monthly averages of the smoothed time series in order to remove the irregular fluctuations. At the final stage Ferraz-Mello method of date-compensated discrete Fourier transform (DCDFT) has been applied on the present four double-smoothed monthly averaged time series. Study reveals periods for SENSEX of 11, 53 and 142 months; for NIFTY periods of 22, 38, 52 and 139 months; for DOW-JONES periods of 23, 25, 27, 30, 59, 107, 138, 194 and 494 months and for S&P500 periods of 28, 66, 74, 149 and 384 months. With this specific periodic behaviour we have also observed some pseudo-periods in the present four financial time series which certainly adds to the uncertainty in the process of prediction for the same
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.
Patcharoen Theerasak
2018-04-01
Full Text Available 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.
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.
The Law of Cosines for an "n"-Dimensional Simplex
Ding, Yiren
2008-01-01
Using the divergence theorem technique of L. Eifler and N.H. Rhee, "The n-dimensional Pythagorean Theorem via the Divergence Theorem" (to appear: Amer. Math. Monthly), we extend the law of cosines for a triangle in a plane to an "n"-dimensional simplex in an "n"-dimensional space.
A Classroom Note on Generating Examples for the Laws of Sines and Cosines from Pythagorean Triangles
Sher, Lawrence; Sher, David
2007-01-01
By selecting certain special triangles, students can learn about the laws of sines and cosines without wrestling with long decimal representations or irrational numbers. Since the law of cosines requires only one of the three angles of a triangle, there are many examples of triangles with integral sides and a cosine that can be represented exactly…
Development of sine/cosine coil based on cross-section modulation
Harada, Takahiro; Kondoh, Junji; Tsuji-Iio, Shunji; Shimada, Ryuichi
1996-01-01
New type sine and cosine coils whose areas of cross sections vary as sine and cosine are proposed. The measurements of current position by the new coils showed their availability. Traditional sine or cosine coil is wound with a pitch which varies as sine or cosine. However these coils have a problem of manufacturing, i.e. it is not easy to wind wire exactly with a pitch of sine or cosine. This new modulation, i.e. varying cross section, provides handy and accurate measurements of the current position. (author)
Lee, Seongjun; Kim, Jonghoon
2015-01-01
Sophisticated data of the experimental DCV (discharging/charging voltage) of a lithium-ion battery is required for high-accuracy SOC (state-of-charge) estimation algorithms based on the state-space ECM (electrical circuit model) in BMSs (battery management systems). However, when sensing noisy DCV signals, erroneous SOC estimation (which results in low BMS performance) is inevitable. Therefore, this manuscript describes the design and implementation of a DWT (discrete wavelet transform)-based denoising technique for DCV signals. The steps for denoising a noisy DCV measurement in the proposed approach are as follows. First, using MRA (multi-resolution analysis), the noise-riding DCV signal is decomposed into different frequency sub-bands (low- and high-frequency components, A n and D n ). Specifically, signal processing of the high frequency component D n that focuses on a short-time interval is necessary to reduce noise in the DCV measurement. Second, a hard-thresholding-based denoising rule is applied to adjust the wavelet coefficients of the DWT to achieve a clear separation between the signal and the noise. Third, the desired de-noised DCV signal is reconstructed by taking the IDWT (inverse discrete wavelet transform) of the filtered detailed coefficients. Finally, this signal is sent to the ECM-based SOC estimation algorithm using an EKF (extended Kalman filter). Experimental results indicate the robustness of the proposed approach for reliable SOC estimation. - Highlights: • Sophisticated data of the experimental DCV is required for high-accuracy SOC. • DWT (discrete wavelet transform)-based denoising technique is newly investigated. • Three steps for denoising a noisy DCV measurement in this work are implemented. • Experimental results indicate the robustness of the proposed work for reliable SOC
Vladimir A. Batura
2014-11-01
Full Text Available The efficiency of orthogonal transformations application in the frequency algorithms of the digital watermarking of still images is examined. Discrete Hadamard transform, discrete cosine transform and discrete Haar transform are selected. Their effectiveness is determined by the invisibility of embedded in digital image watermark and its resistance to the most common image processing operations: JPEG-compression, noising, changing of the brightness and image size, histogram equalization. The algorithm for digital watermarking and its embedding parameters remain unchanged at these orthogonal transformations. Imperceptibility of embedding is defined by the peak signal to noise ratio, watermark stability– by Pearson's correlation coefficient. Embedding is considered to be invisible, if the value of the peak signal to noise ratio is not less than 43 dB. Embedded watermark is considered to be resistant to a specific attack, if the Pearson’s correlation coefficient is not less than 0.5. Elham algorithm based on the image entropy is chosen for computing experiment. Computing experiment is carried out according to the following algorithm: embedding of a digital watermark in low-frequency area of the image (container by Elham algorithm, exposure to a harmful influence on the protected image (cover image, extraction of a digital watermark. These actions are followed by quality assessment of cover image and watermark on the basis of which efficiency of orthogonal transformation is defined. As a result of computing experiment it was determined that the choice of the specified orthogonal transformations at identical algorithm and parameters of embedding doesn't influence the degree of imperceptibility for a watermark. Efficiency of discrete Hadamard transform and discrete cosine transformation in relation to the attacks chosen for experiment was established based on the correlation indicators. Application of discrete Hadamard transform increases
Bastiaans, M.J.
1995-01-01
Gabor's expansion of a signal into a discrete set of shifted and modulated versions of an elementary signal is introduced and its relation to sampling of the sliding-window spectrum is shown. It is shown how Gabor's expansion coefficients can be found as samples of the sliding-window spectrum, where
Cosine components in water levels at Yucca Mountain
Rice, J.; Lehman, L.; Keen, K.
1990-01-01
Water-level records from wells at Yucca Mountain, Nevada are analyzed periodically to determine if they contain periodic (cosine) components. Water-level data from selected wells are input to an iterative numerical procedure that determines a best fitting cosine function. The available water-level data, with coverage of up to 5 years, appear to be representative of the natural water-level changes. From our analysis of 9 water-level records, it appears that there may be periodic components (periods of 2-3 years) in the groundwater-level fluctuations at Yucca Mountain, Nevada, although some records are fit better than others by cosine functions. It also appears that the periodic behavior has a spatial distribution. Wells west of Yucca Mountain have different periods and phase shifts from wells on and east of Yucca Mountain. Interestingly, a similar spatial distribution of groundwater chemistry at Yucca Mountain is reported by Matuska (1988). This suggests a physical cause may underlie the different physical and chemical groundwater conditions. Although a variety of natural processes could cause water-level fluctuations, hydrologic processes are the most likely, because the periodicities are only a few years. A possible cause could be periodic recharge related to a periodicity in precipitation. It is interesting that Cochran et al., (1988), show a crude two-year cycle of precipitation for 1961 to 1970 in southern Nevada. Why periods and phase shifts may differ across Yucca Mountain is unknown. Different phase shifts could indicate different lag times of response to hydrologic stimuli. Difference in periods could mean that the geologic media is heterogeneous and displays heterogeneous response to a single stimulus, or that stimuli differ in certain regions, or that a hydraulic barrier separates the groundwater system into two regions having different water chemistry and recharge areas. 13 refs., 5 figs., 1 tab
Cosine problem in EPRL/FK spinfoam model
Vojinović, Marko
2014-01-01
We calculate the classical limit effective action of the EPRL/FK spinfoam model of quantum gravity coupled to matter fields. By employing the standard QFT background field method adapted to the spinfoam setting, we find that the model has many different classical effective actions. Most notably, these include the ordinary Einstein-Hilbert action coupled to matter, but also an action which describes antigravity. All those multiple classical limits appear as a consequence of the fact that the EPRL/FK vertex amplitude has cosine-like large spin asymptotics. We discuss some possible ways to eliminate the unwanted classical limits.
Deyu Cui
2018-04-01
Full Text Available State of charge (SOC estimation is becoming increasingly important, along with electric vehicle (EV rapid development, while SOC is one of the most significant parameters for the battery management system, indicating remaining energy and ensuring the safety and reliability of EV. In this paper, a hybrid wavelet neural network (WNN model combining the discrete wavelet transform (DWT method and adaptive WNN is proposed to estimate the SOC of lithium-ion batteries. The WNN model is trained by Levenberg-Marquardt (L-M algorithm, whose inputs are processed by discrete wavelet decomposition and reconstitution. Compared with back-propagation neural network (BPNN, L-M based BPNN (LMBPNN, L-M based WNN (LMWNN, DWT with L-M based BPNN (DWTLMBPNN and extend Kalman filter (EKF, the proposed intelligent SOC estimation method is validated and proved to be effective. Under the New European Driving Cycle (NEDC, the mean absolute error and maximum error can be reduced to 0.59% and 3.13%, respectively. The characteristics of high accuracy and strong robustness of the proposed method are verified by comparison study and robustness evaluation results (e.g., measurement noise test and untrained driving cycle test.
Maurice R. Kibler
2010-07-01
Full Text Available We propose a group-theoretical approach to the generalized oscillator algebra Aκ recently investigated in J. Phys. A: Math. Theor. 2010, 43, 115303. The case κ ≥ 0 corresponds to the noncompact group SU(1,1 (as for the harmonic oscillator and the Pöschl-Teller systems while the case κ < 0 is described by the compact group SU(2 (as for the Morse system. We construct the phase operators and the corresponding temporally stable phase eigenstates for Aκ in this group-theoretical context. The SU(2 case is exploited for deriving families of mutually unbiased bases used in quantum information. Along this vein, we examine some characteristics of a quadratic discrete Fourier transform in connection with generalized quadratic Gauss sums and generalized Hadamard matrices.
COSINE software development based on code generation technology
Ren Hao; Mo Wentao; Liu Shuo; Zhao Guang
2013-01-01
The code generation technology can significantly improve the quality and productivity of software development and reduce software development risk. At present, the code generator is usually based on UML model-driven technology, which can not satisfy the development demand of nuclear power calculation software. The feature of scientific computing program was analyzed and the FORTRAN code generator (FCG) based on C# was developed in this paper. FCG can generate module variable definition FORTRAN code automatically according to input metadata. FCG also can generate memory allocation interface for dynamic variables as well as data access interface. FCG was applied to the core and system integrated engine for design and analysis (COSINE) software development. The result shows that FCG can greatly improve the development efficiency of nuclear power calculation software, and reduce the defect rate of software development. (authors)
Kazaryan Maretta
2017-01-01
Full Text Available The paper investigates multivariate Wavelet Haar’s series. To study on the correctness is made by means of Tikhonov’s method. A theorem on stability and uniform convergence of a regularized summable function of the wavelet-Haar’s series functions in Lipschitz class with approximate coefficients is proved. An experiment confirms the validity of Tikhonov’s method using space monitoring of waste disposal facilities is conducted as an example. Namely, the decoding of space images-images using N-dimensional Haar’s wavelet transform is used.
A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula
Hale, Nicholas
2014-02-06
A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree N polynomial in O(N(log N)2/ log log N) operations is derived. The fundamental idea of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the discrete cosine transform. Numerical results are provided to demonstrate the efficiency and numerical stability. Since the algorithm evaluates a Legendre expansion at an N +1 Chebyshev grid as an intermediate step, it also provides a fast transform between Legendre coefficients and values on a Chebyshev grid. © 2014 Society for Industrial and Applied Mathematics.
Integral transformations applied to image encryption
Vilardy, Juan M.; Torres, Cesar O.; Perez, Ronal
2017-01-01
In this paper we consider the application of the integral transformations for image encryption through optical systems, a mathematical algorithm under Matlab platform using fractional Fourier transform (FrFT) and Random Phase Mask (RPM) for digital images encryption is implemented. The FrFT can be related to others integral transforms, such as: Fourier transform, Sine and Cosine transforms, Radial Hilbert transform, fractional Sine transform, fractional Cosine transform, fractional Hartley transform, fractional Wavelet transform and Gyrator transform, among other transforms. The encryption scheme is based on the use of the FrFT, the joint transform correlator and two RPMs, which provide security and robustness to the implemented security system. One of the RPMs used during encryption-decryption and the fractional order of the FrFT are the keys to improve security and make the system more resistant against security attacks. (paper)
Bock, Lars Nicolai
2011-01-01
Artiklen diskuterer ordet "transformation" med udgangspunkt i dels hvorledes ordet bruges i arkitektfaglig terminologi og dels med fokus på ordets potentielle indhold og egnethed i samme teminologi.......Artiklen diskuterer ordet "transformation" med udgangspunkt i dels hvorledes ordet bruges i arkitektfaglig terminologi og dels med fokus på ordets potentielle indhold og egnethed i samme teminologi....
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 was 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).
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.
Fourier transformation for engineering and natural science
Klingen, B.
2001-01-01
The following topics are covered: functions, Dirac delta function, Fourier operators, Fourier integrals, Fourier transformation and periodic functions, discrete Fourier transformations and discrete filters, applications. (WL)
Baker, W.R.
1959-08-25
Transformers of a type adapted for use with extreme high power vacuum tubes where current requirements may be of the order of 2,000 to 200,000 amperes are described. The transformer casing has the form of a re-entrant section being extended through an opening in one end of the cylinder to form a coaxial terminal arrangement. A toroidal multi-turn primary winding is disposed within the casing in coaxial relationship therein. In a second embodiment, means are provided for forming the casing as a multi-turn secondary. The transformer is characterized by minimized resistance heating, minimized external magnetic flux, and an economical construction.
Human Motion Capture Data Tailored Transform Coding.
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.
Barrie, Alexander C.; Yeh, Penshu; Dorelli, John C.; Clark, George B.; Paterson, William R.; Adrian, Mark L.; Holland, Matthew P.; Lobell, James V.; Simpson, David G.; Pollock, Craig J.;
2015-01-01
Plasma measurements in space are becoming increasingly faster, higher resolution, and distributed over multiple instruments. As raw data generation rates can exceed available data transfer bandwidth, data compression is becoming a critical design component. Data compression has been a staple of imaging instruments for years, but only recently have plasma measurement designers become interested in high performance data compression. Missions will often use a simple lossless compression technique yielding compression ratios of approximately 2:1, however future missions may require compression ratios upwards of 10:1. This study aims to explore how a Discrete Wavelet Transform combined with a Bit Plane Encoder (DWT/BPE), implemented via a CCSDS standard, can be used effectively to compress count information common to plasma measurements to high compression ratios while maintaining little or no compression error. The compression ASIC used for the Fast Plasma Investigation (FPI) on board the Magnetospheric Multiscale mission (MMS) is used for this study. Plasma count data from multiple sources is examined: resampled data from previous missions, randomly generated data from distribution functions, and simulations of expected regimes. These are run through the compression routines with various parameters to yield the greatest possible compression ratio while maintaining little or no error, the latter indicates that fully lossless compression is obtained. Finally, recommendations are made for future missions as to what can be achieved when compressing plasma count data and how best to do so.
Preclinical Diagnosis of Magnetic Resonance (MR Brain Images via Discrete Wavelet Packet Transform with Tsallis Entropy and Generalized Eigenvalue Proximal Support Vector Machine (GEPSVM
Yudong Zhang
2015-03-01
Full Text Available Background: Developing an accurate computer-aided diagnosis (CAD system of MR brain images is essential for medical interpretation and analysis. In this study, we propose a novel automatic CAD system to distinguish abnormal brains from normal brains in MRI scanning. Methods: The proposed method simplifies the task to a binary classification problem. We used discrete wavelet packet transform (DWPT to extract wavelet packet coefficients from MR brain images. Next, Shannon entropy (SE and Tsallis entropy (TE were harnessed to obtain entropy features from DWPT coefficients. Finally, generalized eigenvalue proximate support vector machine (GEPSVM, and GEPSVM with radial basis function (RBF kernel, were employed as classifier. We tested the four proposed diagnosis methods (DWPT + SE + GEPSVM, DWPT + TE + GEPSVM, DWPT + SE + GEPSVM + RBF, and DWPT + TE + GEPSVM + RBF on three benchmark datasets of Dataset-66, Dataset-160, and Dataset-255. Results: The 10 repetition of K-fold stratified cross validation results showed the proposed DWPT + TE + GEPSVM + RBF method excelled not only other three proposed classifiers but also existing state-of-the-art methods in terms of classification accuracy. In addition, the DWPT + TE + GEPSVM + RBF method achieved accuracy of 100%, 100%, and 99.53% on Dataset-66, Dataset-160, and Dataset-255, respectively. For Dataset-255, the offline learning cost 8.4430s and online prediction cost merely 0.1059s. Conclusions: We have proved the effectiveness of the proposed method, which achieved nearly 100% accuracy over three benchmark datasets.
Traveling Wave Solutions of ZK-BBM Equation Sine-Cosine Method
Sadaf Bibi
2014-03-01
Full Text Available Travelling wave solutions are obtained by using a relatively new technique which is called sine-cosine method for ZK-BBM equations. Solution procedure and obtained results re-confirm the efficiency of the proposed scheme.
Rost, Martin C.; Sayood, Khalid
1991-01-01
A method for efficiently coding natural images using a vector-quantized variable-blocksized transform source coder is presented. The method, mixture block coding (MBC), incorporates variable-rate coding by using a mixture of discrete cosine transform (DCT) source coders. Which coders are selected to code any given image region is made through a threshold driven distortion criterion. In this paper, MBC is used in two different applications. The base method is concerned with single-pass low-rate image data compression. The second is a natural extension of the base method which allows for low-rate progressive transmission (PT). Since the base method adapts easily to progressive coding, it offers the aesthetic advantage of progressive coding without incorporating extensive channel overhead. Image compression rates of approximately 0.5 bit/pel are demonstrated for both monochrome and color images.
Discrete fourier transformations with weight
Wang Qin; Jiang Yong
1988-01-01
DFT and FFT with weight were considered and their properties were studied. The usual DFT and FFT were modified by reducing the number of sample points within a certain error band and therefore speeded up the computation. Finally, the practical applications of the new method in the fields of spectrum analysis, pulse tracing research and so on were pointed out
Sørensen, John Aasted
2011-01-01
The objectives of Discrete Mathematics (IDISM2) are: The introduction of the mathematics needed for analysis, design and verification of discrete systems, including the application within programming languages for computer systems. Having passed the IDISM2 course, the student will be able...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics......; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...
Cosine and sine operators related to orthogonal polynomial sets on the interval [-1, 1
Appl, Thomas; Schiller, Diethard H
2005-01-01
The quantization of phase is still an open problem. In the approach of Susskind and Glogower, the so-called cosine and sine operators play a fundamental role. Their eigenstates in the Fock representation are related to the Chebyshev polynomials of the second kind. Here we introduce more general cosine and sine operators whose eigenfunctions in the Fock basis are related in a similar way to arbitrary orthogonal polynomial sets on the interval [-1, 1]. To each polynomial set defined in terms of a weight function there corresponds a pair of cosine and sine operators. Depending on the symmetry of the weight function, we distinguish generalized or extended operators. Their eigenstates are used to define cosine and sine representations and probability distributions. We also consider the arccosine and arcsine operators and use their eigenstates to define cosine-phase and sine-phase distributions, respectively. Specific, numerical and graphical results are given for the classical orthogonal polynomials and for particular Fock and coherent states
Ebrahimi, Farideh; Setarehdan, Seyed-Kamaledin; Ayala-Moyeda, Jose; Nazeran, Homer
2013-10-01
The conventional method for sleep staging is to analyze polysomnograms (PSGs) recorded in a sleep lab. The electroencephalogram (EEG) is one of the most important signals in PSGs but recording and analysis of this signal presents a number of technical challenges, especially at home. Instead, electrocardiograms (ECGs) are much easier to record and may offer an attractive alternative for home sleep monitoring. The heart rate variability (HRV) signal proves suitable for automatic sleep staging. Thirty PSGs from the Sleep Heart Health Study (SHHS) database were used. Three feature sets were extracted from 5- and 0.5-min HRV segments: time-domain features, nonlinear-dynamics features and time-frequency features. The latter was achieved by using empirical mode decomposition (EMD) and discrete wavelet transform (DWT) methods. Normalized energies in important frequency bands of HRV signals were computed using time-frequency methods. ANOVA and t-test were used for statistical evaluations. Automatic sleep staging was based on HRV signal features. The ANOVA followed by a post hoc Bonferroni was used for individual feature assessment. Most features were beneficial for sleep staging. A t-test was used to compare the means of extracted features in 5- and 0.5-min HRV segments. The results showed that the extracted features means were statistically similar for a small number of features. A separability measure showed that time-frequency features, especially EMD features, had larger separation than others. There was not a sizable difference in separability of linear features between 5- and 0.5-min HRV segments but separability of nonlinear features, especially EMD features, decreased in 0.5-min HRV segments. HRV signal features were classified by linear discriminant (LD) and quadratic discriminant (QD) methods. Classification results based on features from 5-min segments surpassed those obtained from 0.5-min segments. The best result was obtained from features using 5-min HRV
Delgorge, C
2001-01-01
.... For the purpose of this work, we selected seven compression methods : Fourier Transform, Discrete Cosine Transform, Wavelets, Quadtrees Transform, Fractals, Histogram Thresholding, and Run Length Coding...
Sørensen, John Aasted
2011-01-01
; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics...... to new problems. Relations and functions: Define a product set; define and apply equivalence relations; construct and apply functions. Apply these concepts to new problems. Natural numbers and induction: Define the natural numbers; apply the principle of induction to verify a selection of properties...
Busch, Peter Andre; Zinner Henriksen, Helle
2018-01-01
discretion is suggested to reduce this footprint by influencing or replacing their discretionary practices using ICT. What is less researched is whether digital discretion can cause changes in public policy outcomes, and under what conditions such changes can occur. Using the concept of public service values......This study reviews 44 peer-reviewed articles on digital discretion published in the period from 1998 to January 2017. Street-level bureaucrats have traditionally had a wide ability to exercise discretion stirring debate since they can add their personal footprint on public policies. Digital......, we suggest that digital discretion can strengthen ethical and democratic values but weaken professional and relational values. Furthermore, we conclude that contextual factors such as considerations made by policy makers on the macro-level and the degree of professionalization of street...
Zhang, Y. S.; Cai, F.; Xu, W. M.
2011-01-01
The ship motion equation with a cosine wave excitement force describes the slip moments in regular waves. A new kind of wave excitement force model, with the form as sums of cosine functions was proposed to describe ship rolling in irregular waves. Ship rolling time series were obtained by solving the ship motion equation with the fourth-order-Runger-Kutta method. These rolling time series were synthetically analyzed with methods of phase-space track, power spectrum, primary component analysis, and the largest Lyapunove exponent. Simulation results show that ship rolling presents some chaotic characteristic when the wave excitement force was applied by sums of cosine functions. The result well explains the course of ship rolling's chaotic mechanism and is useful for ship hydrodynamic study.
Wei Xu
2018-05-01
Full Text Available Cosine-modulated filter banks play a major role in digital signal processing. Sparse FIR filter banks have lower implementation complexity than full filter banks, while keeping a good performance level. This paper presents a fast design paradigm for sparse nearly perfect-reconstruction (NPR cosine-modulated filter banks. First, an approximation function is introduced to reduce the non-convex quadratically constrained optimization problem to a linearly constrained optimization problem. Then, the desired sparse linear phase FIR prototype filter is derived through the orthogonal matching pursuit (OMP performed under the weighted l 2 norm. The simulation results demonstrate that the proposed scheme is an effective paradigm to design sparse NPR cosine-modulated filter banks.
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.
On organizing principles of discrete differential geometry. Geometry of spheres
Bobenko, Alexander I; Suris, Yury B
2007-01-01
Discrete differential geometry aims to develop discrete equivalents of the geometric notions and methods of classical differential geometry. This survey contains a discussion of the following two fundamental discretization principles: the transformation group principle (smooth geometric objects and their discretizations are invariant with respect to the same transformation group) and the consistency principle (discretizations of smooth parametrized geometries can be extended to multidimensional consistent nets). The main concrete geometric problem treated here is discretization of curvature-line parametrized surfaces in Lie geometry. Systematic use of the discretization principles leads to a discretization of curvature-line parametrization which unifies circular and conical nets.
Cuspidal discrete series for projective hyperbolic spaces
Andersen, Nils Byrial; Flensted-Jensen, Mogens
2013-01-01
Abstract. We have in [1] proposed a definition of cusp forms on semisimple symmetric spaces G/H, involving the notion of a Radon transform and a related Abel transform. For the real non-Riemannian hyperbolic spaces, we showed that there exists an infinite number of cuspidal discrete series......, and at most finitely many non-cuspidal discrete series, including in particular the spherical discrete series. For the projective spaces, the spherical discrete series are the only non-cuspidal discrete series. Below, we extend these results to the other hyperbolic spaces, and we also study the question...
Image Compression using Haar and Modified Haar Wavelet Transform
Mohannad Abid Shehab Ahmed
2013-04-01
Full Text Available Efficient image compression approaches can provide the best solutions to the recent growth of the data intensive and multimedia based applications. As presented in many papers the Haar matrix–based methods and wavelet analysis can be used in various areas of image processing such as edge detection, preserving, smoothing or filtering. In this paper, color image compression analysis and synthesis based on Haar and modified Haar is presented. The standard Haar wavelet transformation with N=2 is composed of a sequence of low-pass and high-pass filters, known as a filter bank, the vertical and horizontal Haar filters are composed to construct four 2-dimensional filters, such filters applied directly to the image to speed up the implementation of the Haar wavelet transform. Modified Haar technique is studied and implemented for odd based numbers i.e. (N=3 & N=5 to generate many solution sets, these sets are tested using the energy function or numerical method to get the optimum one.The Haar transform is simple, efficient in memory usage due to high zero value spread (it can use sparse principle, and exactly reversible without the edge effects as compared to DCT (Discrete Cosine Transform. The implemented Matlab simulation results prove the effectiveness of DWT (Discrete Wave Transform algorithms based on Haar and Modified Haar techniques in attaining an efficient compression ratio (C.R, achieving higher peak signal to noise ratio (PSNR, and the resulting images are of much smoother as compared to standard JPEG especially for high C.R. A comparison between standard JPEG, Haar, and Modified Haar techniques is done finally which approves the highest capability of Modified Haar between others.
Discrete systems and integrability
Hietarinta, J; Nijhoff, F W
2016-01-01
This first introductory text to discrete integrable systems introduces key notions of integrability from the vantage point of discrete systems, also making connections with the continuous theory where relevant. While treating the material at an elementary level, the book also highlights many recent developments. Topics include: Darboux and Bäcklund transformations; difference equations and special functions; multidimensional consistency of integrable lattice equations; associated linear problems (Lax pairs); connections with Padé approximants and convergence algorithms; singularities and geometry; Hirota's bilinear formalism for lattices; intriguing properties of discrete Painlevé equations; and the novel theory of Lagrangian multiforms. The book builds the material in an organic way, emphasizing interconnections between the various approaches, while the exposition is mostly done through explicit computations on key examples. Written by respected experts in the field, the numerous exercises and the thoroug...
Sørensen, John Aasted
2010-01-01
The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Spring 2010 Ectent: 5 ects Class size: 18......The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Spring 2010 Ectent: 5 ects Class size: 18...
Sørensen, John Aasted
2010-01-01
The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Autumn 2010 Ectent: 5 ects Class size: 15......The introduction of the mathematics needed for analysis, design and verification of discrete systems, including applications within programming languages for computer systems. Course sessions and project work. Semester: Autumn 2010 Ectent: 5 ects Class size: 15...
AXIFLUX, Cosine Function Fit of Experimental Axial Flux in Cylindrical Reactor
Holte, O.
1980-01-01
1 - Nature of physical problem solved: Calculates the parameters of the cosine function that will best fit data from axial flux distribution measurements in a cylindrical reactor. 2 - Method of solution: Steepest descent for the minimization. 3 - Restrictions on the complexity of the problem: Number of measured points less than 200
Discovering Trigonometric Relationships Implied by the Law of Sines and the Law of Cosines
Skurnick, Ronald; Javadi, Mohammad
2006-01-01
The Law of Sines and The Law of Cosines are of paramount importance in the field of trigonometry because these two theorems establish relationships satisfied by the three sides and the three angles of any triangle. In this article, the authors use these two laws to discover a host of other trigonometric relationships that exist within any…
The relation between Pearson’s correlation coefficient r and Salton’s cosine measure
Egghe, L.; Leydesdorff, L.
2009-01-01
The relation between Pearson's correlation coefficient and Salton's cosine measure is revealed based on the different possible values of the division of the L1-norm and the L2-norm of a vector. These different values yield a sheaf of increasingly straight lines which together form a cloud of points,
A Novel Robust Audio Watermarking Algorithm by Modifying the Average Amplitude in Transform Domain
Qiuling Wu
2018-05-01
Full Text Available In order to improve the robustness and imperceptibility in practical application, a novel audio watermarking algorithm with strong robustness is proposed by exploring the multi-resolution characteristic of discrete wavelet transform (DWT and the energy compaction capability of discrete cosine transform (DCT. The human auditory system is insensitive to the minor changes in the frequency components of the audio signal, so the watermarks can be embedded by slightly modifying the frequency components of the audio signal. The audio fragments segmented from the cover audio signal are decomposed by DWT to obtain several groups of wavelet coefficients with different frequency bands, and then the fourth level detail coefficient is selected to be divided into the former packet and the latter packet, which are executed for DCT to get two sets of transform domain coefficients (TDC respectively. Finally, the average amplitudes of the two sets of TDC are modified to embed the binary image watermark according to the special embedding rule. The watermark extraction is blind without the carrier audio signal. Experimental results confirm that the proposed algorithm has good imperceptibility, large payload capacity and strong robustness when resisting against various attacks such as MP3 compression, low-pass filtering, re-sampling, re-quantization, amplitude scaling, echo addition and noise corruption.
Caltagirone, Jean-Paul
2014-01-01
This book presents the fundamental principles of mechanics to re-establish the equations of Discrete Mechanics. It introduces physics and thermodynamics associated to the physical modeling. The development and the complementarity of sciences lead to review today the old concepts that were the basis for the development of continuum mechanics. The differential geometry is used to review the conservation laws of mechanics. For instance, this formalism requires a different location of vector and scalar quantities in space. The equations of Discrete Mechanics form a system of equations where the H
Lee, T.D.
1985-01-01
This paper reviews the role of time throughout all phases of mechanics: classical mechanics, non-relativistic quantum mechanics, and relativistic quantum theory. As an example of the relativistic quantum field theory, the case of a massless scalar field interacting with an arbitrary external current is discussed. The comparison between the new discrete theory and the usual continuum formalism is presented. An example is given of a two-dimensional random lattice and its duel. The author notes that there is no evidence that the discrete mechanics is more appropriate than the usual continuum mechanics
Explicit solutions to the semi-discrete modified KdV equation and motion of discrete plane curves
Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro
2012-01-01
We construct explicit solutions to continuous motion of discrete plane curves described by a semi-discrete potential modified KdV equation. Explicit formulas in terms of the τ function are presented. Bäcklund transformations of the discrete curves are also discussed. We finally consider the continuous limit of discrete motion of discrete plane curves described by the discrete potential modified KdV equation to motion of smooth plane curves characterized by the potential modified KdV equation. (paper)
A Posteriori Restoration of Block Transform-Compressed Data
Brown, R.; Boden, A. F.
1995-01-01
The Galileo spacecraft will use lossy data compression for the transmission of its science imagery over the low-bandwidth communication system. The technique chosen for image compression is a block transform technique based on the Integer Cosine Transform, a derivative of the JPEG image compression standard. Considered here are two known a posteriori enhancement techniques, which are adapted.
Cosine bend-linear waveguide digital optical switch with parabolic heater
Yulianti, Ian; Supa'at, Abu Sahmah Mohd.; Idrus, Sevia M.; Al-hetar, Abdulaziz M.
2010-02-01
A new digital optical switch (DOS) with large branching angle and short device length that exhibits low crosstalk and low power consumption is demonstrated. The Y-branch shape was optimized by introducing constant effective refractive index difference between branches (Δ N eff) along the propagation direction through beam propagation method (BPM) scheme. To provide decreasing local branching angle that results in the improvement of the crosstalk, two modified cosine bend was introduced to form the Y-branch. The modified cosine branch was then connected to a linear branch. The heater electrode was optimized so that the temperature fields induce a constant Δ N eff to satisfy initial assumption in designing the Y-branch shape. With branching angle of 0.299° and device length of only 5 mm, the simulation shows that the device could exhibits crosstalk of -33 dB at calculated required power of only 26 mW.
Research on V and V strategy of reactor physics code of COSINE
Liu Zhanquan; Chen Yixue; Yang Chao; Dang Halei
2013-01-01
Verification and validation (V and V) is very important for the software quality assurance. Reasonable and efficient V and V strategy can achieve twice the result with half the effort. Core and system integrated engine for design and analysis (COSINE) software package contains three reactor physics codes, the lattice code (LATC), the core simulator (CORE) and the kinetics code (KIND), which is called the reactor physics subsystem. The V and V strategy for the physics subsystem was researched based on the foundation of scientific software's V and V method. The module based verification method and the function based validation method were proposed, composing the physical subsystem V and V strategy of COSINE software package. (authors)
Wigner distribution function of Hermite-cosine-Gaussian beams through an apertured optical system.
Sun, Dong; Zhao, Daomu
2005-08-01
By introducing the hard-aperture function into a finite sum of complex Gaussian functions, the approximate analytical expressions of the Wigner distribution function for Hermite-cosine-Gaussian beams passing through an apertured paraxial ABCD optical system are obtained. The analytical results are compared with the numerically integrated ones, and the absolute errors are also given. It is shown that the analytical results are proper and that the calculation speed for them is much faster than for the numerical results.
Empirical algorithm to estimate the average cosine of underwater light field at 490 nm
Talaulikar, M.; Suresh, T.; Desa, E.; Matondkar, S.G.P.; Kumar, T.S.; Lotliker, A.; Inamdar, A.
optical properties from water color, a multi-band quasi-analytical algorithm for optically deep waters. Applied Optic, 41, pp. 5755– 5772. MCCORMIC, N. J., 1995, Mathematical models for the mean cosine of irradiance and the diffuse attenuation... parameter to determine μ(490) from the measured data and from the ocean color satellite data is discussed. Absorption coefficients of water derived using μ(490) were also evaluated comparing with the synthetic data and in-situ measured data from other...
Status of reactor core design code system in COSINE code package
Chen, Y.; Yu, H.; Liu, Z.
2014-01-01
For self-reliance, COre and System INtegrated Engine for design and analysis (COSINE) code package is under development in China. In this paper, recent development status of the reactor core design code system (including the lattice physics code and the core simulator) is presented. The well-established theoretical models have been implemented. The preliminary verification results are illustrated. And some special efforts, such as updated theory models and direct data access application, are also made to achieve better software product. (author)
Status of reactor core design code system in COSINE code package
Chen, Y.; Yu, H.; Liu, Z., E-mail: yuhui@snptc.com.cn [State Nuclear Power Software Development Center, SNPTC, National Energy Key Laboratory of Nuclear Power Software (NEKLS), Beijiing (China)
2014-07-01
For self-reliance, COre and System INtegrated Engine for design and analysis (COSINE) code package is under development in China. In this paper, recent development status of the reactor core design code system (including the lattice physics code and the core simulator) is presented. The well-established theoretical models have been implemented. The preliminary verification results are illustrated. And some special efforts, such as updated theory models and direct data access application, are also made to achieve better software product. (author)
The relation between Pearson’s correlation coefficient r and Salton’s cosine measure
EGGHE, Leo; Leydesdorff, L.
2009-01-01
The relation between Pearson’s correlation coefficient and Salton’s cosine measure is revealed based on the different possible values of the division of the -norm and the norm of a vector. These different values yield a sheaf of increasingly straight lines which form together a cloud of points, being the investigated relation. These theoretical results are tested against the author co-citation relations among 24 informetricians for who two matrices can be constructed, based on co-citations: t...
Application of DFT Filter Banks and Cosine Modulated Filter Banks in Filtering
Lin, Yuan-Pei; Vaidyanathan, P. P.
1994-01-01
None given. This is a proposal for a paper to be presented at APCCAS '94 in Taipei, Taiwan. (From outline): This work is organized as follows: Sec. II is devoted to the construction of the new 2m channel under-decimated DFT filter bank. Implementation and complexity of this DFT filter bank are discussed therein. IN a similar manner, the new 2m channel cosine modulated filter bank is discussed in Sec. III. Design examples are given in Sec. IV.
An optimized cosine-modulated nonuniform filter bank design for subband coding of ECG signal
A. Kumar
2015-07-01
Full Text Available A simple iterative technique for the design of nonuniform cosine modulated filter banks (CMFBS is presented in this paper. The proposed technique employs a single parameter for optimization. The nonuniform cosine modulated filter banks are derived by merging the adjacent filters of uniform cosine modulated filter banks. The prototype filter is designed with the aid of different adjustable window functions such as Kaiser, Cosh and Exponential, and by using the constrained equiripple finite impulse response (FIR digital filter design technique. In this method, either cut off frequency or passband edge frequency is varied in order to adjust the filter coefficients so that reconstruction error could be optimized/minimized to zero. Performance and effectiveness of the proposed method in terms of peak reconstruction error (PRE, aliasing distortion (AD, computational (CPU time, and number of iteration (NOI have been shown through the numerical examples and comparative studies. Finally, the technique is exploited for the subband coding of electrocardiogram (ECG and speech signals.
Peringkasan Sentimen Esktraktif di Twitter Menggunakan Hybrid TF-IDF dan Cosine Similarity
Devid Haryalesmana Wahid
2016-07-01
Full Text Available The using of Twitter by selebrities has become a new trend of impression management strategy. Mining public reaction in social media is a good strategy to obtain feedbacks, but extracting it are not trivial matter. Reads hundred of tweets while determine their sentiment polarity are time consuming. Extractive sentiment summarization machine are needed to address this issue. Previous research generally do not include sentiment information contained in a tweet as weight factor, as a results only general topics of discussion are extracted. This research aimed to do an extractive sentiment summarization on both positive and negative sentiment mentioning Indonesian selebrity, Agnes Monica, by combining SentiStrength, Hybrid TF-IDF, and Cosine Similarity. SentiStrength is used to obtain sentiment strength score and classify tweet as a positive, negative or neutral. The summarization of posisitve and negative sentiment can be done by rank tweets using Hybrid TF-IDF summarization and sentiment strength score as additional weight then removing similar tweet by using Cosine Similarity. The test results showed that the combination of SentiStrength, Hybrid TF-IDF, and Cosine Similarity perform better than using Hybrid TF-IDF only, given an average 60% accuracy and 62% f-measure. This is due to the addition of sentiment score as a weight factor in sentiment summarization.
A method for optimizing the cosine response of solar UV diffusers
Pulli, Tomi; Kärhä, Petri; Ikonen, Erkki
2013-07-01
Instruments measuring global solar ultraviolet (UV) irradiance at the surface of the Earth need to collect radiation from the entire hemisphere. Entrance optics with angular response as close as possible to the ideal cosine response are necessary to perform these measurements accurately. Typically, the cosine response is obtained using a transmitting diffuser. We have developed an efficient method based on a Monte Carlo algorithm to simulate radiation transport in the solar UV diffuser assembly. The algorithm takes into account propagation, absorption, and scattering of the radiation inside the diffuser material. The effects of the inner sidewalls of the diffuser housing, the shadow ring, and the protective weather dome are also accounted for. The software implementation of the algorithm is highly optimized: a simulation of 109 photons takes approximately 10 to 15 min to complete on a typical high-end PC. The results of the simulations agree well with the measured angular responses, indicating that the algorithm can be used to guide the diffuser design process. Cost savings can be obtained when simulations are carried out before diffuser fabrication as compared to a purely trial-and-error-based diffuser optimization. The algorithm was used to optimize two types of detectors, one with a planar diffuser and the other with a spherically shaped diffuser. The integrated cosine errors—which indicate the relative measurement error caused by the nonideal angular response under isotropic sky radiance—of these two detectors were calculated to be f2=1.4% and 0.66%, respectively.
di Lauro, C.
2018-03-01
Transformations of vector or tensor properties from a space-fixed to a molecule-fixed axis system are often required in the study of rotating molecules. Spherical components λμ,ν of a first rank irreducible tensor can be obtained from the direction cosines between the two axis systems, and a second rank tensor with spherical components λμ,ν(2) can be built from the direct product λ × λ. It is shown that the treatment of the interaction between molecular rotation and the electric quadrupole of a nucleus is greatly simplified, if the coefficients in the axis-system transformation of the gradient of the electric field of the outer charges at the coupled nucleus are arranged as spherical components λμ,ν(2). Then the reduced matrix elements of the field gradient operators in a symmetric top eigenfunction basis, including their dependence on the molecule-fixed z-angular momentum component k, can be determined from the knowledge of those of λ(2) . The hyperfine structure Hamiltonian Hq is expressed as the sum of terms characterized each by a value of the molecule-fixed index ν, whose matrix elements obey the rule Δk = ν. Some of these terms may vanish because of molecular symmetry, and the specific cases of linear and symmetric top molecules, orthorhombic molecules, and molecules with symmetry lower than orthorhombic are considered. Each ν-term consists of a contraction of the rotational tensor λ(2) and the nuclear quadrupole tensor in the space-fixed frame, and its matrix elements in the rotation-nuclear spin coupled representation can be determined by the standard spherical tensor methods.
Parker, R Gary
1988-01-01
This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms.Several appendixes are included which review the fundamental ideas o
Discrete symmetries for spinor field in de Sitter space
Moradi, S.; Rouhani, S.; Takook, M.V.
2005-01-01
Discrete symmetries, parity, time reversal, antipodal, and charge conjugation transformations for spinor field in de Sitter space, are presented in the ambient space notation, i.e., in a coordinate independent way. The PT and PCT transformations are also discussed in this notation. The five-current density is studied and their transformation under the discrete symmetries is discussed
Discrete gradients in discrete classical mechanics
Renna, L.
1987-01-01
A simple model of discrete classical mechanics is given where, starting from the continuous Hamilton equations, discrete equations of motion are established together with a proper discrete gradient definition. The conservation laws of the total discrete momentum, angular momentum, and energy are demonstrated
Painleve test and discrete Boltzmann equations
Euler, N.; Steeb, W.H.
1989-01-01
The Painleve test for various discrete Boltzmann equations is performed. The connection with integrability is discussed. Furthermore the Lie symmetry vector fields are derived and group-theoretical reduction of the discrete Boltzmann equations to ordinary differentiable equations is performed. Lie Backlund transformations are gained by performing the Painleve analysis for the ordinary differential equations. 16 refs
Test of 10 GHz sin-cosin microwave reflectometer on CASTOR
Zacek, F.; Kletecka, P.
1994-09-01
The first microwave reflectometric device is described used at the CASTOR tokamak to measure fast density fluctuations. The device operates at the frequency of 10.26 GHz which makes it possible to detect fluctuations near the plasma periphery. The device was proved to work properly during the whole tokamak discharge despite the fact that the reflected signal level varied strongly. The construction of the reflectometric device is described as is its use of the so-called sin-cosin detection system, and the results obtained are discussed. (Z.S.) 8 figs., 3 refs
Soliton solution for nonlinear partial differential equations by cosine-function method
Ali, A.H.A.; Soliman, A.A.; Raslan, K.R.
2007-01-01
In this Letter, we established a traveling wave solution by using Cosine-function algorithm for nonlinear partial differential equations. The method is used to obtain the exact solutions for five different types of nonlinear partial differential equations such as, general equal width wave equation (GEWE), general regularized long wave equation (GRLW), general Korteweg-de Vries equation (GKdV), general improved Korteweg-de Vries equation (GIKdV), and Coupled equal width wave equations (CEWE), which are the important soliton equations
Effect of cosine current approximation in lattice cell calculations in cylindrical geometry
Mohanakrishnan, P.
1978-01-01
It is found that one-dimensional cylindrical geometry reactor lattice cell calculations using cosine angular current approximation at spatial mesh interfaces give results surprisingly close to the results of accurate neutron transport calculations as well as experimental measurements. This is especially true for tight light water moderated lattices. Reasons for this close agreement are investigated here. By re-examining the effects of reflective and white cell boundary conditions in these calculations it is concluded that one major reason is the use of white boundary condition necessitated by the approximation of the two-dimensional reactor lattice cell by a one-dimensional one. (orig.) [de
Study and application of microscopic depletion model in core simulator of COSINE project
Hu Xiaoyu; Wang Su; Yan Yuhang; Liu Zhanquan; Chen Yixue; Huang Kai
2013-01-01
Microscopic depletion correction is one of the commonly used techniques that could improve the historical effect and attain higher precision of diffusion calculation and alleviate the inaccuracy caused by historical effect. Core simulator of COSINE project (core and system integrated engine for design and analysis) has developed a hybrid macroscopic-microscopic depletion model to track important isotopes during each depletion history and correct the macro cross sections. The basic theory was discussed in this paper. The effect and results of microscopic depletion correction were also analyzed. The preliminary test results demonstrate that the microscopic depletion model is effective and practicable for improving the precision of core calculation. (authors)
Noether symmetries of discrete mechanico–electrical systems
Fu Jingli; Xie Fengping; Chen Benyong
2008-01-01
This paper focuses on studying Noether symmetries and conservation laws of the discrete mechanico-electrical systems with the nonconservative and the dissipative forces. Based on the invariance of discrete Hamilton action of the systems under the infinitesimal transformation with respect to the generalized coordinates, the generalized electrical quantities and time, it presents the discrete analogue of variational principle, the discrete analogue of Lagrange–Maxwell equations, the discrete analogue of Noether theorems for Lagrange–Maxwell and Lagrange mechanico-electrical systems. Also, the discrete Noether operator identity and the discrete Noether-type conservation laws are obtained for these systems. An actual example is given to illustrate these results. (general)
Jalnapurkar, Sameer M; Leok, Melvin; Marsden, Jerrold E; West, Matthew
2006-01-01
This paper develops the theory of Abelian Routh reduction for discrete mechanical systems and applies it to the variational integration of mechanical systems with Abelian symmetry. The reduction of variational Runge-Kutta discretizations is considered, as well as the extent to which symmetry reduction and discretization commute. These reduced methods allow the direct simulation of dynamical features such as relative equilibria and relative periodic orbits that can be obscured or difficult to identify in the unreduced dynamics. The methods are demonstrated for the dynamics of an Earth orbiting satellite with a non-spherical J 2 correction, as well as the double spherical pendulum. The J 2 problem is interesting because in the unreduced picture, geometric phases inherent in the model and those due to numerical discretization can be hard to distinguish, but this issue does not appear in the reduced algorithm, where one can directly observe interesting dynamical structures in the reduced phase space (the cotangent bundle of shape space), in which the geometric phases have been removed. The main feature of the double spherical pendulum example is that it has a non-trivial magnetic term in its reduced symplectic form. Our method is still efficient as it can directly handle the essential non-canonical nature of the symplectic structure. In contrast, a traditional symplectic method for canonical systems could require repeated coordinate changes if one is evoking Darboux' theorem to transform the symplectic structure into canonical form, thereby incurring additional computational cost. Our method allows one to design reduced symplectic integrators in a natural way, despite the non-canonical nature of the symplectic structure
Ding Qing
2007-01-01
We prove that the integrable-nonintegrable discrete nonlinear Schroedinger equation (AL-DNLS) introduced by Cai, Bishop and Gronbech-Jensen (Phys. Rev. Lett. 72 591(1994)) is the discrete gauge equivalent to an integrable-nonintegrable discrete Heisenberg model from the geometric point of view. Then we study whether the transmission and bifurcation properties of the AL-DNLS equation are preserved under the action of discrete gauge transformations. Our results reveal that the transmission property of the AL-DNLS equation is completely preserved and the bifurcation property is conditionally preserved to those of the integrable-nonintegrable discrete Heisenberg model
Rigid Body Attitude Control Based on a Manifold Representation of Direction Cosine Matrices
Nakath, David; Clemens, Joachim; Rachuy, Carsten
2017-01-01
Autonomous systems typically actively observe certain aspects of their surroundings, which makes them dependent on a suitable controller. However, building an attitude controller for three degrees of freedom is a challenging task, mainly due to singularities in the different parametrizations of the three dimensional rotation group SO (3). Thus, we propose an attitude controller based on a manifold representation of direction cosine matrices: In state space, the attitude is globally and uniquely represented as a direction cosine matrix R ∈ SO (3). However, differences in the state space, i.e., the attitude errors, are exposed to the controller in the vector space ℝ 3 . This is achieved by an operator, which integrates the matrix logarithm mapping from SO (3) to so(3) and the map from so(3) to ℝ 3 . Based on this representation, we derive a proportional and derivative feedback controller, whose output has an upper bound to prevent actuator saturation. Additionally, the feedback is preprocessed by a particle filter to account for measurement and state transition noise. We evaluate our approach in a simulator in three different spacecraft maneuver scenarios: (i) stabilizing, (ii) rest-to-rest, and (iii) nadir-pointing. The controller exhibits stable behavior from initial attitudes near and far from the setpoint. Furthermore, it is able to stabilize a spacecraft and can be used for nadir-pointing maneuvers. (paper)
Cahuantzi, Roberto; Buckley, Alastair
2017-09-01
Making accurate and reliable measurements of solar irradiance is important for understanding performance in the photovoltaic energy sector. In this paper, we present design details and performance of a number of fibre optic couplers for use in irradiance measurement systems employing remote light sensors applicable for either spectrally resolved or broadband measurement. The angular and spectral characteristics of different coupler designs are characterised and compared with existing state-of-the-art commercial technology. The new coupler designs are fabricated from polytetrafluorethylene (PTFE) rods and operate through forward scattering of incident sunlight on the front surfaces of the structure into an optic fibre located in a cavity to the rear of the structure. The PTFE couplers exhibit up to 4.8% variation in scattered transmission intensity between 425 nm and 700 nm and show minimal specular reflection, making the designs accurate and reliable over the visible region. Through careful geometric optimization near perfect cosine dependence on the angular response of the coupler can be achieved. The PTFE designs represent a significant improvement over the state of the art with less than 0.01% error compared with ideal cosine response for angles of incidence up to 50°.
Generation of heat on fuel rod in cosine pattern by using induction heating
Keettikkal, Felix; Sajeesh, Divya; Rao, Poornima; Hande, Shashank; Dakave, Ganesh; Kute, Tushar; Mahajan, Akshay; Kulkarni, R.D.
2017-01-01
Fuel rods are used in a nuclear reactor for fission process. When these rods are cooled by water during the heat transfer, the temperature stress causes undesirable defects in the fuel rod. Studying these defects occurring in the fuel rod in the nuclear cluster during nuclear reaction is a difficult task because fission reaction makes it difficult to analyse the changes in the rod. Hence there is a need to use a replica of the rod with similar thermal stress to study and analyse the rod for the defects. Normally the heat generated on the fuel rod follows a cosine pattern which is an inherent characteristic inside a nuclear reactor. In view of this, in this paper induction heating method is used on a rod to create an exact replica of the cosine pattern of heat by varying the pitch of the coil. First, a MATLAB simulation is done using simulink. Then a prototype of the model has been developed comprising of carbon steel pipe, with length and outside diameter of 1 meter and 48.2 mm, respectively. Instead of using water as coolant, rod is simulated in air. Therefore, the heat generated is lost by normal convection and radiation. Non-nuclear testing can be a valuable tool in the development or in some kind of experiment using nuclear reactor. Induction heating becomes an alternative to classical heating technologies because of its advantages such as efficiency, quickness, safety, clean heating and accurate power control. (author)
Toward an enhanced Arabic text classification using cosine similarity and Latent Semantic
Fawaz S. Al-Anzi
2017-04-01
Full Text Available Cosine similarity is one of the most popular distance measures in text classification problems. In this paper, we used this important measure to investigate the performance of Arabic language text classification. For textual features, vector space model (VSM is generally used as a model to represent textual information as numerical vectors. However, Latent Semantic Indexing (LSI is a better textual representation technique as it maintains semantic information between the words. Hence, we used the singular value decomposition (SVD method to extract textual features based on LSI. In our experiments, we conducted comparison between some of the well-known classification methods such as Naïve Bayes, k-Nearest Neighbors, Neural Network, Random Forest, Support Vector Machine, and classification tree. We used a corpus that contains 4,000 documents of ten topics (400 document for each topic. The corpus contains 2,127,197 words with about 139,168 unique words. The testing set contains 400 documents, 40 documents for each topics. As a weighing scheme, we used Term Frequency.Inverse Document Frequency (TF.IDF. This study reveals that the classification methods that use LSI features significantly outperform the TF.IDF-based methods. It also reveals that k-Nearest Neighbors (based on cosine measure and support vector machine are the best performing classifiers.
Yang, Junhua; Li, Yong; Cheng, Wei; Liu, Yang; Liu, Chenxi
2018-01-22
Received Signal Strength Indicator (RSSI) localization using fingerprint has become a prevailing approach for indoor localization. However, the fingerprint-collecting work is repetitive and time-consuming. After the original fingerprint radio map is built, it is laborious to upgrade the radio map. In this paper, we describe a Fingerprint Renovation System (FRS) based on crowdsourcing, which avoids the use of manual labour to obtain the up-to-date fingerprint status. Extended Kalman Filter (EKF) and Gaussian Process Regression (GPR) in FRS are combined to calculate the current state based on the original fingerprinting radio map. In this system, a method of subset acquisition also makes an immediate impression to reduce the huge computation caused by too many reference points (RPs). Meanwhile, adjusted cosine similarity (ACS) is employed in the online phase to solve the issue of outliers produced by cosine similarity. Both experiments and analytical simulation in a real Wireless Fidelity (Wi-Fi) environment indicate the usefulness of our system to significant performance improvements. The results show that FRS improves the accuracy by 19.6% in the surveyed area compared to the radio map un-renovated. Moreover, the proposed subset algorithm can bring less computation.
Yang, Junhua; Li, Yong; Cheng, Wei; Liu, Yang; Liu, Chenxi
2018-01-01
Received Signal Strength Indicator (RSSI) localization using fingerprint has become a prevailing approach for indoor localization. However, the fingerprint-collecting work is repetitive and time-consuming. After the original fingerprint radio map is built, it is laborious to upgrade the radio map. In this paper, we describe a Fingerprint Renovation System (FRS) based on crowdsourcing, which avoids the use of manual labour to obtain the up-to-date fingerprint status. Extended Kalman Filter (EKF) and Gaussian Process Regression (GPR) in FRS are combined to calculate the current state based on the original fingerprinting radio map. In this system, a method of subset acquisition also makes an immediate impression to reduce the huge computation caused by too many reference points (RPs). Meanwhile, adjusted cosine similarity (ACS) is employed in the online phase to solve the issue of outliers produced by cosine similarity. Both experiments and analytical simulation in a real Wireless Fidelity (Wi-Fi) environment indicate the usefulness of our system to significant performance improvements. The results show that FRS improves the accuracy by 19.6% in the surveyed area compared to the radio map un-renovated. Moreover, the proposed subset algorithm can bring less computation. PMID:29361805
Cahuantzi, Roberto; Buckley, Alastair
2017-09-01
Making accurate and reliable measurements of solar irradiance is important for understanding performance in the photovoltaic energy sector. In this paper, we present design details and performance of a number of fibre optic couplers for use in irradiance measurement systems employing remote light sensors applicable for either spectrally resolved or broadband measurement. The angular and spectral characteristics of different coupler designs are characterised and compared with existing state-of-the-art commercial technology. The new coupler designs are fabricated from polytetrafluorethylene (PTFE) rods and operate through forward scattering of incident sunlight on the front surfaces of the structure into an optic fibre located in a cavity to the rear of the structure. The PTFE couplers exhibit up to 4.8% variation in scattered transmission intensity between 425 nm and 700 nm and show minimal specular reflection, making the designs accurate and reliable over the visible region. Through careful geometric optimization near perfect cosine dependence on the angular response of the coupler can be achieved. The PTFE designs represent a significant improvement over the state of the art with less than 0.01% error compared with ideal cosine response for angles of incidence up to 50°.
Total number albedo and average cosine of the polar angle of low-energy photons reflected from water
Marković Srpko
2007-01-01
Full Text Available The total number albedo and average cosine of the polar angle for water and initial photon energy range from 20 keV to 100 keV are presented in this pa per. A water shield in the form of a thick, homogenous plate and per pendicular incidence of the monoenergetic photon beam are assumed. The results were obtained through Monte Carlo simulations of photon reflection by means of the MCNP computer code. Calculated values for the total number albedo were compared with data previously published and good agreement was confirmed. The dependence of the average cosine of the polar angle on energy is studied in detail. It has been found that the total average cosine of the polar angle has values in the narrow interval of 0.66-0.67, approximately corresponding to the reflection angle of 48°, and that it does not depend on the initial photon energy.
Discrete Curvatures and Discrete Minimal Surfaces
Sun, Xiang
2012-01-01
This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads
Hegde, Veena; Deekshit, Ravishankar; Satyanarayana, P. S.
2011-12-01
The electrocardiogram (ECG) is widely used for diagnosis of heart diseases. Good quality of ECG is utilized by physicians for interpretation and identification of physiological and pathological phenomena. However, in real situations, ECG recordings are often corrupted by artifacts or noise. Noise severely limits the utility of the recorded ECG and thus needs to be removed, for better clinical evaluation. In the present paper a new noise cancellation technique is proposed for removal of random noise like muscle artifact from ECG signal. A transform domain robust variable step size Griffiths' LMS algorithm (TVGLMS) is proposed for noise cancellation. For the TVGLMS, the robust variable step size has been achieved by using the Griffiths' gradient which uses cross-correlation between the desired signal contaminated with observation or random noise and the input. The algorithm is discrete cosine transform (DCT) based and uses symmetric property of the signal to represent the signal in frequency domain with lesser number of frequency coefficients when compared to that of discrete Fourier transform (DFT). The algorithm is implemented for adaptive line enhancer (ALE) filter which extracts the ECG signal in a noisy environment using LMS filter adaptation. The proposed algorithm is found to have better convergence error/misadjustment when compared to that of ordinary transform domain LMS (TLMS) algorithm, both in the presence of white/colored observation noise. The reduction in convergence error achieved by the new algorithm with desired signal decomposition is found to be lower than that obtained without decomposition. The experimental results indicate that the proposed method is better than traditional adaptive filter using LMS algorithm in the aspects of retaining geometrical characteristics of ECG signal.
Revisiting the quantum harmonic oscillator via unilateral Fourier transforms
Nogueira, Pedro H F; Castro, Antonio S de
2016-01-01
The literature on the exponential Fourier approach to the one-dimensional quantum harmonic oscillator problem is revised and criticized. It is shown that the solution of this problem has been built on faulty premises. The problem is revisited via the Fourier sine and cosine transform method and the stationary states are properly determined by requiring definite parity and square-integrable eigenfunctions. (paper)
Plazas-Nossa, Leonardo; Torres, Andrés
2014-01-01
The objective of this work is to introduce a forecasting method for UV-Vis spectrometry time series that combines principal component analysis (PCA) and discrete Fourier transform (DFT), and to compare the results obtained with those obtained by using DFT. Three time series for three different study sites were used: (i) Salitre wastewater treatment plant (WWTP) in Bogotá; (ii) Gibraltar pumping station in Bogotá; and (iii) San Fernando WWTP in Itagüí (in the south part of Medellín). Each of these time series had an equal number of samples (1051). In general terms, the results obtained are hardly generalizable, as they seem to be highly dependent on specific water system dynamics; however, some trends can be outlined: (i) for UV range, DFT and PCA/DFT forecasting accuracy were almost the same; (ii) for visible range, the PCA/DFT forecasting procedure proposed gives systematically lower forecasting errors and variability than those obtained with the DFT procedure; and (iii) for short forecasting times the PCA/DFT procedure proposed is more suitable than the DFT procedure, according to processing times obtained.
Discrete Curvatures and Discrete Minimal Surfaces
Sun, Xiang
2012-06-01
This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads to great interest in studying discrete surfaces. With the rich smooth surface theory in hand, one would hope that this elegant theory can still be applied to the discrete counter part. Such a generalization, however, is not always successful. While discrete surfaces have the advantage of being finite dimensional, thus easier to treat, their geometric properties such as curvatures are not well defined in the classical sense. Furthermore, the powerful calculus tool can hardly be applied. The methods in this thesis, including angular defect formula, cotangent formula, parallel meshes, relative geometry etc. are approaches based on offset meshes or generalized offset meshes. As an important application, we discuss discrete minimal surfaces and discrete Koenigs meshes.
Low Loss 1×2 Optical Coupler Based on Cosine S-bend with Segmented Waveguides
Yulianti, Ian; Sahmah, Abu; Supa'at, M.; Idrus, Sevia M.; Ridwanto, Muhammad; Al-hetar, Abdulaziz M.
2011-05-01
This paper presents an optimization of 1×2 polymer Y-junction optical coupler. The optimized optical coupler comprises straight polymer waveguide as the input waveguide, tapered waveguide, modified cosine S-bend and linear waveguide. At the branching point, N short waveguides with small width are introduced to reduce evanescent field. At operating wavelength of 1550 nm the excess loss of the coupler is ˜0.18 dB. In term of polarization dependence loss (PDL), the proposed coupler also shows a good performance with PDL value of less than 0.015 dB for wavelength range of 1470 nm-1550 nm. The proposed coupler could reduce excess loss more than 25% compared to conventional Y junction optical coupler.
Abdelmonem, M. S.; Abdel-Hady, Afaf; Nasser, I.
2017-07-01
The scaling laws are given for the entropies in the information theory, including the Shannon's entropy, its power, the Fisher's information and the Fisher-Shannon product, using the exponential-cosine screened Coulomb potential. The scaling laws are specified, in the r-space, as a function of |μ - μc, nℓ|, where μ is the screening parameter and μc, nℓ its critical value for the specific quantum numbers n and ℓ. Scaling laws for other physical quantities, such as energy eigenvalues, the moments, static polarisability, transition probabilities, etc. are also given. Some of these are reported for the first time. The outcome is compared with the available literatures' results.
Chebaane, Saleh; Fathallah, Habib; Seleem, Hussein; Machhout, Mohsen
2018-02-01
Dispersion management in few mode fiber (FMF) technology is crucial to support the upcoming standard that reaches 400 Gbps and Terabit/s per wavelength. Recently in Chebaane et al. (2016), we defined two potential differential mode delay (DMD) management strategies, namely sawtooth and triangular. Moreover we proposed a novel parametric refractive index profile for FMF, referred as raised cosine (RC) profile. In this article, we improve and optimize the RC profile design by including additional shaping parameters, in order to obtain much more attractive dispersion characteristics. Our improved design enabled to obtain a zero DMD (z-DMD), strong positive DMD (p-DMD) and near-zero DMD (nz-DMD) for six-mode fiber, all appropriate for dispersion management in FMF system. In addition, we propose a positive DMD (p-DMD) fiber designs for both, four-mode fiber (4-FMF) and six-mode fiber (6-FMF), respectively, having particularly attractive dispersion characteristics.
The Implementation of Cosine Similarity to Calculate Text Relevance between Two Documents
Gunawan, D.; Sembiring, C. A.; Budiman, M. A.
2018-03-01
Rapidly increasing number of web pages or documents leads to topic specific filtering in order to find web pages or documents efficiently. This is a preliminary research that uses cosine similarity to implement text relevance in order to find topic specific document. This research is divided into three parts. The first part is text-preprocessing. In this part, the punctuation in a document will be removed, then convert the document to lower case, implement stop word removal and then extracting the root word by using Porter Stemming algorithm. The second part is keywords weighting. Keyword weighting will be used by the next part, the text relevance calculation. Text relevance calculation will result the value between 0 and 1. The closer value to 1, then both documents are more related, vice versa.
Butler, Samuel D; Nauyoks, Stephen E; Marciniak, Michael A
2015-06-01
Of the many classes of bidirectional reflectance distribution function (BRDF) models, two popular classes of models are the microfacet model and the linear systems diffraction model. The microfacet model has the benefit of speed and simplicity, as it uses geometric optics approximations, while linear systems theory uses a diffraction approach to compute the BRDF, at the expense of greater computational complexity. In this Letter, nongrazing BRDF measurements of rough and polished surface-reflecting materials at multiple incident angles are scaled by the microfacet cross section conversion term, but in the linear systems direction cosine space, resulting in great alignment of BRDF data at various incident angles in this space. This results in a predictive BRDF model for surface-reflecting materials at nongrazing angles, while avoiding some of the computational complexities in the linear systems diffraction model.
Foundations of a discrete physics
McGoveran, D.; Noyes, P.
1988-01-01
Starting from the principles of finiteness, discreteness, finite computability and absolute nonuniqueness, we develop the ordering operator calculus, a strictly constructive mathematical system having the empirical properties required by quantum mechanical and special relativistic phenomena. We show how to construct discrete distance functions, and both rectangular and spherical coordinate systems(with a discrete version of ''π''). The richest discrete space constructible without a preferred axis and preserving translational and rotational invariance is shown to be a discrete 3-space with the usual symmetries. We introduce a local ordering parameter with local (proper) time-like properties and universal ordering parameters with global (cosmological) time-like properties. Constructed ''attribute velocities'' connect ensembles with attributes that are invariant as the appropriate time-like parameter increases. For each such attribute, we show how to construct attribute velocities which must satisfy the '' relativistic Doppler shift'' and the ''relativistic velocity composition law,'' as well as the Lorentz transformations. By construction, these velocities have finite maximum and minimum values. In the space of all attributes, the minimum of these maximum velocities will predominate in all multiple attribute computations, and hence can be identified as a fundamental limiting velocity, General commutation relations are constructed which under the physical interpretation are shown to reduce to the usual quantum mechanical commutation relations. 50 refs., 18 figs
Yusufoglu, E.; Bekir, A.; Alp, M.
2008-01-01
In this paper, we establish exact solutions for nonlinear evolution equations. The sine-cosine method is used to construct periodic and solitary wave solutions of the Kawahara and modified Kawahara equations. These solutions may be important of significance for the explanation of some practical physical problems
Robert M. Yamaleev
2013-01-01
Full Text Available The hyperbolic cosines and sines theorems for the curvilinear triangle bounded by circular arcs of three intersecting circles are formulated and proved by using the general complex calculus. The method is based on a key formula establishing a relationship between exponential function and the cross-ratio. The proofs are carried out on Euclidean plane.
Discrete wavelet transform on dynamically reconfigurable hardware.
Walters, K.H.G.; Smit, Gerardus Johannes Maria; Gerez, Sabih H.
2008-01-01
The increasing amount of data produced in satellites poses a problem for the limited data rate of its downlink. This discrepancy is solved by introducing more and more processing power on-board to compress data to a satisfiable rate. Currently, this processing power is often provided by
Symmetries in discrete-time mechanics
Khorrami, M.
1996-01-01
Based on a general formulation for discrete-time quantum mechanics, introduced by M. Khorrami (Annals Phys. 224 (1995), 101), symmetries in discrete-time quantum mechanics are investigated. It is shown that any classical continuous symmetry leads to a conserved quantity in classical mechanics, as well as quantum mechanics. The transformed wave function, however, has the correct evolution if and only if the symmetry is nonanomalous. Copyright copyright 1996 Academic Press, Inc
Spatially localized, temporally quasiperiodic, discrete nonlinear excitations
Cai, D.; Bishop, A.R.; Gronbech-Jensen, N.
1995-01-01
In contrast to the commonly discussed discrete breather, which is a spatially localized, time-periodic solution, we present an exact solution of a discrete nonlinear Schroedinger breather which is a spatially localized, temporally quasiperiodic nonlinear coherent excitation. This breather is a multiple-soliton solution in the sense of the inverse scattering transform. A discrete breather of multiple frequencies is conceptually important in studies of nonlinear lattice systems. We point out that, for this breather, the incommensurability of its frequencies is a discrete lattice effect and these frequencies become commensurate in the continuum limit. To understand the dynamical properties of the breather, we also discuss its stability and its behavior in the presence of an external potential. Finally, we indicate how to obtain an exact N-soliton breather as a discrete generalization of the continuum multiple-soliton solution
Laplacians on discrete and quantum geometries
Calcagni, Gianluca; Oriti, Daniele; Thürigen, Johannes
2013-01-01
We extend discrete calculus for arbitrary (p-form) fields on embedded lattices to abstract discrete geometries based on combinatorial complexes. We then provide a general definition of discrete Laplacian using both the primal cellular complex and its combinatorial dual. The precise implementation of geometric volume factors is not unique and, comparing the definition with a circumcentric and a barycentric dual, we argue that the latter is, in general, more appropriate because it induces a Laplacian with more desirable properties. We give the expression of the discrete Laplacian in several different sets of geometric variables, suitable for computations in different quantum gravity formalisms. Furthermore, we investigate the possibility of transforming from position to momentum space for scalar fields, thus setting the stage for the calculation of heat kernel and spectral dimension in discrete quantum geometries. (paper)
Mimetic discretization methods
Castillo, Jose E
2013-01-01
To help solve physical and engineering problems, mimetic or compatible algebraic discretization methods employ discrete constructs to mimic the continuous identities and theorems found in vector calculus. Mimetic Discretization Methods focuses on the recent mimetic discretization method co-developed by the first author. Based on the Castillo-Grone operators, this simple mimetic discretization method is invariably valid for spatial dimensions no greater than three. The book also presents a numerical method for obtaining corresponding discrete operators that mimic the continuum differential and
Time Discretization Techniques
Gottlieb, S.; Ketcheson, David I.
2016-01-01
The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include
Alternating-gradient canted cosine theta superconducting magnets for future compact proton gantries
Weishi Wan
2015-10-01
Full Text Available We present a design of superconducting magnets, optimized for application in a gantry for proton therapy. We have introduced a new magnet design concept, called an alternating-gradient canted cosine theta (AG-CCT concept, which is compatible with an achromatic layout. This layout allows a large momentum acceptance. The 15 cm radius of the bore aperture enables the application of pencil beam scanning in front of the SC-magnet. The optical and dynamic performance of a gantry based on these magnets has been analyzed using the fields derived (via Biot-Savart law from the actual windings of the AG-CCT combined with the full equations of motion. The results show that with appropriate higher order correction, a large 3D volume can be rapidly scanned with little beam shape distortion. A very big advantage is that all this can be done while keeping the AG-CCT fields fixed. This reduces the need for fast field ramping of the superconducting magnets between the successive beam energies used for the scanning in depth and it is important for medical application since this reduces the technical risk (e.g., a quench associated with fast field changes in superconducting magnets. For proton gantries the corresponding superconducting magnet system holds promise of dramatic reduction in weight. For heavier ion gantries there may furthermore be a significant reduction in size.
Non-uniform cosine modulated filter banks using meta-heuristic algorithms in CSD space
Shaeen Kalathil
2015-11-01
Full Text Available This paper presents an efficient design of non-uniform cosine modulated filter banks (CMFB using canonic signed digit (CSD coefficients. CMFB has got an easy and efficient design approach. Non-uniform decomposition can be easily obtained by merging the appropriate filters of a uniform filter bank. Only the prototype filter needs to be designed and optimized. In this paper, the prototype filter is designed using window method, weighted Chebyshev approximation and weighted constrained least square approximation. The coefficients are quantized into CSD, using a look-up-table. The finite precision CSD rounding, deteriorates the filter bank performances. The performances of the filter bank are improved using suitably modified meta-heuristic algorithms. The different meta-heuristic algorithms which are modified and used in this paper are Artificial Bee Colony algorithm, Gravitational Search algorithm, Harmony Search algorithm and Genetic algorithm and they result in filter banks with less implementation complexity, power consumption and area requirements when compared with those of the conventional continuous coefficient non-uniform CMFB.
Beam heating studies on an early model is a superconducting cosine theta magnet
Bozoki, G.; Bunce, G.; Danby, G.; Foelsche, H.; Jackson, J.; Prodell, A.; Soukas, A.; Stevens, A.; Stoehr, R.; Weisenbloom, J.
1980-01-01
Superconducting magnets for accelerators can be accidentally quenched by heat resulting from beam losses in the magnet. The threshold for such quenches is determined by the time structure of the beam loss and by details of the magnet application, construction and cooling. A 4.25 m long superconducting cosine theta dipole magnet, MARK VI, constructed during the research and development phase of the ISABELLE Project at BNL was installed in the 28.5 GeV/c primary proton beam line from the AGS. By energizing the magnet, the proton beam could be deflected into the magnet. The beam intensity required to quench the magnet was observed for different beam sizes and at several values of magnet current up to 2400 A or approximately 70% of the highest magnet operating current. The maximum current was limited by the gas-cooled power lead flow available using pool-boiling helium rather than single phase forced-flow helium at 5 atm for which the magnet system was designed. Details of the experimental setup including the magnet and cryogenic system, the beam-monitoring equipment and instrumentation are described. The measurements are discussed and compared with beam heating measurements made on another superconducting magnet and interpreted using the Cascade Simulation Program, CASIM
Hermite-cosine-Gaussian laser beam and its propagation characteristics in turbulent atmosphere.
Eyyuboğlu, Halil Tanyer
2005-08-01
Hermite-cosine-Gaussian (HcosG) laser beams are studied. The source plane intensity of the HcosG beam is introduced and its dependence on the source parameters is examined. By application of the Fresnel diffraction integral, the average receiver intensity of HcosG beam is formulated for the case of propagation in turbulent atmosphere. The average receiver intensity is seen to reduce appropriately to various special cases. When traveling in turbulence, the HcosG beam initially experiences the merging of neighboring beam lobes, and then a TEM-type cosh-Gaussian beam is formed, temporarily leading to a plain cosh-Gaussian beam. Eventually a pure Gaussian beam results. The numerical evaluation of the normalized beam size along the propagation axis at selected mode indices indicates that relative spreading of higher-order HcosG beam modes is less than that of the lower-order counterparts. Consequently, it is possible at some propagation distances to capture more power by using higher-mode-indexed HcosG beams.
Ohya, Kaoru; Kawata, Jun; Mori, Ichiro
1989-01-01
Incident angle dependence of kinetic secondary electron emission from metals resulting from incidence of keV ions is investigated by computer simulation with the TRIM Monte Carlo program of ion scattering in matter. The results show large deviations from the inverse cosine dependence, which derives from high-energy approximation, because of a series of elastic collisions of incident ions with metal atoms. In the keV energy region, the elastic collisions have two different effects on the angular dependence for relatively high-energy light ions and for low-energy heavy ions: they result in over- and under-inverse-cosine dependences, respectively. The properties are observed even with an experiment of the keV-neutral incidence on a contaminated surface. In addition, the effects of the thin oxide layer and roughness on the surface are examined with simplified models. (author)
From the continuous PV to discrete Painleve equations
Tokihiro, T.; Grammaticos, B.; Ramani, A.
2002-01-01
We study the discrete transformations that are associated with the auto-Baecklund of the (continuous) P V equation. We show that several two-parameter discrete Painleve equations can be obtained as contiguity relations of P V . Among them we find the asymmetric d-P II equation which is a well-known form of discrete P III . The relation between the ternary P I (previously obtained through the discrete dressing approach) and P V is also established. A new discrete Painleve equation is also derived. (author)
Someswara Rao, Chinta; Viswanadha Raju, S.
2016-01-01
In this paper, we consider correlation coefficient, rank correlation coefficient and cosine similarity measures for evaluating similarity between Homo sapiens and monkeys. We used DNA chromosomes of genome wide genes to determine the correlation between the chromosomal content and evolutionary relationship. The similarity among the H. sapiens and monkeys is measured for a total of 210 chromosomes related to 10 species. The similarity measures of these different species show the relationship b...
GUO Han-Ying,; LI Yu-Qi; WU Ke1; WANG Shi-Kun
2002-01-01
In this first paper of a series, we study the difference discrete variational principle in the framework of multi-parameter differential approach by regarding the forward difference as an entire geometric object in view of noncommutative differential geometry. Regarding the difference as an entire geometric object, the difference discrete version of Legendre transformation can be introduced. By virtue of this variational principle, we can discretely deal with the variation problems in both the Lagrangian and Hamiltonian formalisms to get difference discrete Euler-Lagrange equations and canonical ones for the difference discrete versions of the classical mechanics and classical field theory.
Fourier transforms principles and applications
Hansen, Eric W
2014-01-01
Fourier Transforms: Principles and Applications explains transform methods and their applications to electrical systems from circuits, antennas, and signal processors-ably guiding readers from vector space concepts through the Discrete Fourier Transform (DFT), Fourier series, and Fourier transform to other related transform methods. Featuring chapter end summaries of key results, over two hundred examples and four hundred homework problems, and a Solutions Manual this book is perfect for graduate students in signal processing and communications as well as practicing engineers.
A Transform-Based Feature Extraction Approach for Motor Imagery Tasks Classification
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
Li, Xiangyu; Huang, Zhanhua; Zhu, Meng; He, Jin; Zhang, Hao
2014-12-01
Hilbert transform (HT) is widely used in temporal speckle pattern interferometry, but errors from low modulations might propagate and corrupt the calculated phase. A spatio-temporal method for phase retrieval using temporal HT and spatial phase unwrapping is presented. In time domain, the wrapped phase difference between the initial and current states is directly determined by using HT. To avoid the influence of the low modulation intensity, the phase information between the two states is ignored. As a result, the phase unwrapping is shifted from time domain to space domain. A phase unwrapping algorithm based on discrete cosine transform is adopted by taking advantage of the information in adjacent pixels. An experiment is carried out with a Michelson-type interferometer to study the out-of-plane deformation field. High quality whole-field phase distribution maps with different fringe densities are obtained. Under the experimental conditions, the maximum number of fringes resolvable in a 416×416 frame is 30, which indicates a 15λ deformation along the direction of loading.
Integrable discretizations of the (2+1)-dimensional sinh-Gordon equation
Hu, Xing-Biao; Yu, Guo-Fu
2007-01-01
In this paper, we propose two semi-discrete equations and one fully discrete equation and study them by Hirota's bilinear method. These equations have continuum limits into a system which admits the (2+1)-dimensional generalization of the sinh-Gordon equation. As a result, two integrable semi-discrete versions and one fully discrete version for the sinh-Gordon equation are found. Baecklund transformations, nonlinear superposition formulae, determinant solution and Lax pairs for these discrete versions are presented
Discrete variable representation for singular Hamiltonians
Schneider, B. I.; Nygaard, Nicolai
2004-01-01
We discuss the application of the discrete variable representation (DVR) to Schrodinger problems which involve singular Hamiltonians. Unlike recent authors who invoke transformations to rid the eigenvalue equation of singularities at the cost of added complexity, we show that an approach based...
Sarvari, S. M. Hosseini
2017-09-01
The traditional form of discrete ordinates method is applied to solve the radiative transfer equation in plane-parallel semi-transparent media with variable refractive index through using the variable discrete ordinate directions and the concept of refracted radiative intensity. The refractive index are taken as constant in each control volume, such that the direction cosines of radiative rays remain non-variant through each control volume, and then, the directions of discrete ordinates are changed locally by passing each control volume, according to the Snell's law of refraction. The results are compared by the previous studies in this field. Despite simplicity, the results show that the variable discrete ordinate method has a good accuracy in solving the radiative transfer equation in the semi-transparent media with arbitrary distribution of refractive index.
Group-theoretical aspects of the discrete sine-Gordon equation
Orfanidis, S.J.
1980-01-01
The group-theoretical interpretation of the sine-Gordon equation in terms of connection forms on fiber bundles is extended to the discrete case. Solutions of the discrete sine-Gordon equation induce surfaces on a lattice in the SU(2) group space. The inverse scattering representation, expressing the parallel transport of fibers, is implemented by means of finite rotations. Discrete Baecklund transformations are realized as gauge transformations. The three-dimensional inverse scattering representation is used to derive a discrete nonlinear sigma model, and the corresponding Baecklund transformation and Pohlmeyer's R transformation are constructed
Absolute cosine-based SVM-RFE feature selection method for prostate histopathological grading.
Sahran, Shahnorbanun; Albashish, Dheeb; Abdullah, Azizi; Shukor, Nordashima Abd; Hayati Md Pauzi, Suria
2018-04-18
Feature selection (FS) methods are widely used in grading and diagnosing prostate histopathological images. In this context, FS is based on the texture features obtained from the lumen, nuclei, cytoplasm and stroma, all of which are important tissue components. However, it is difficult to represent the high-dimensional textures of these tissue components. To solve this problem, we propose a new FS method that enables the selection of features with minimal redundancy in the tissue components. We categorise tissue images based on the texture of individual tissue components via the construction of a single classifier and also construct an ensemble learning model by merging the values obtained by each classifier. Another issue that arises is overfitting due to the high-dimensional texture of individual tissue components. We propose a new FS method, SVM-RFE(AC), that integrates a Support Vector Machine-Recursive Feature Elimination (SVM-RFE) embedded procedure with an absolute cosine (AC) filter method to prevent redundancy in the selected features of the SV-RFE and an unoptimised classifier in the AC. We conducted experiments on H&E histopathological prostate and colon cancer images with respect to three prostate classifications, namely benign vs. grade 3, benign vs. grade 4 and grade 3 vs. grade 4. The colon benchmark dataset requires a distinction between grades 1 and 2, which are the most difficult cases to distinguish in the colon domain. The results obtained by both the single and ensemble classification models (which uses the product rule as its merging method) confirm that the proposed SVM-RFE(AC) is superior to the other SVM and SVM-RFE-based methods. We developed an FS method based on SVM-RFE and AC and successfully showed that its use enabled the identification of the most crucial texture feature of each tissue component. Thus, it makes possible the distinction between multiple Gleason grades (e.g. grade 3 vs. grade 4) and its performance is far superior to
Generalized reciprocity principle for discrete symplectic systems
Julia Elyseeva
2015-12-01
Full Text Available This paper studies transformations for conjoined bases of symplectic difference systems $Y_{i+1}=\\mathcal S_{i}Y_{i}$ with the symplectic coefficient matrices $\\mathcal S_i.$ For an arbitrary symplectic transformation matrix $P_{i}$ we formulate most general sufficient conditions for $\\mathcal S_{i},\\, P_{i}$ which guarantee that $P_{i}$ preserves oscillatory properties of conjoined bases $Y_{i}.$ We present examples which show that our new results extend the applicability of the discrete transformation theory.
Discrete Mathematics Re "Tooled."
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)
Someswara Rao, Chinta; Viswanadha Raju, S
2016-03-01
In this paper, we consider correlation coefficient, rank correlation coefficient and cosine similarity measures for evaluating similarity between Homo sapiens and monkeys. We used DNA chromosomes of genome wide genes to determine the correlation between the chromosomal content and evolutionary relationship. The similarity among the H. sapiens and monkeys is measured for a total of 210 chromosomes related to 10 species. The similarity measures of these different species show the relationship between the H. sapiens and monkey. This similarity will be helpful at theft identification, maternity identification, disease identification, etc.
Lin, C.Y.; Ho, Y.K.
2010-01-01
The screening effects due to the exponential-cosine-screened Coulomb and screened Coulomb (Yukawa) potentials on photoionization processes are explored within the framework of complex coordinate rotation method. The energy levels of H and He + in both screened potentials shifted with various Debye screening lengths are presented. The photoionization cross sections illustrate the considerable screening effects on photoionization processes in low energy region. The shape resonances can be found near ionization thresholds for certain of Debye screening lengths. The relations between the appearance of resonances and the existence of quasi-bound states under shielding conditions are discussed. (authors)
Homogenization of discrete media
Pradel, F.; Sab, K.
1998-01-01
Material such as granular media, beam assembly are easily seen as discrete media. They look like geometrical points linked together thanks to energetic expressions. Our purpose is to extend discrete kinematics to the one of an equivalent continuous material. First we explain how we build the localisation tool for periodic materials according to estimated continuum medium type (classical Cauchy, and Cosserat media). Once the bridge built between discrete and continuum media, we exhibit its application over two bidimensional beam assembly structures : the honey comb and a structural reinforced variation. The new behavior is then applied for the simple plan shear problem in a Cosserat continuum and compared with the real discrete solution. By the mean of this example, we establish the agreement of our new model with real structures. The exposed method has a longer range than mechanics and can be applied to every discrete problems like electromagnetism in which relationship between geometrical points can be summed up by an energetic function. (orig.)
Aydin, Alhun; Sisman, Altug
2016-01-01
By considering the quantum-mechanically minimum allowable energy interval, we exactly count number of states (NOS) and introduce discrete density of states (DOS) concept for a particle in a box for various dimensions. Expressions for bounded and unbounded continua are analytically recovered from discrete ones. Even though substantial fluctuations prevail in discrete DOS, they're almost completely flattened out after summation or integration operation. It's seen that relative errors of analytical expressions of bounded/unbounded continua rapidly decrease for high NOS values (weak confinement or high energy conditions), while the proposed analytical expressions based on Weyl's conjecture always preserve their lower error characteristic. - Highlights: • Discrete density of states considering minimum energy difference is proposed. • Analytical DOS and NOS formulas based on Weyl conjecture are given. • Discrete DOS and NOS functions are examined for various dimensions. • Relative errors of analytical formulas are much better than the conventional ones.
Aydin, Alhun; Sisman, Altug, E-mail: sismanal@itu.edu.tr
2016-03-22
By considering the quantum-mechanically minimum allowable energy interval, we exactly count number of states (NOS) and introduce discrete density of states (DOS) concept for a particle in a box for various dimensions. Expressions for bounded and unbounded continua are analytically recovered from discrete ones. Even though substantial fluctuations prevail in discrete DOS, they're almost completely flattened out after summation or integration operation. It's seen that relative errors of analytical expressions of bounded/unbounded continua rapidly decrease for high NOS values (weak confinement or high energy conditions), while the proposed analytical expressions based on Weyl's conjecture always preserve their lower error characteristic. - Highlights: • Discrete density of states considering minimum energy difference is proposed. • Analytical DOS and NOS formulas based on Weyl conjecture are given. • Discrete DOS and NOS functions are examined for various dimensions. • Relative errors of analytical formulas are much better than the conventional ones.
Okuyama, Yoshifumi
2014-01-01
Discrete Control Systems establishes a basis for the analysis and design of discretized/quantized control systemsfor continuous physical systems. Beginning with the necessary mathematical foundations and system-model descriptions, the text moves on to derive a robust stability condition. To keep a practical perspective on the uncertain physical systems considered, most of the methods treated are carried out in the frequency domain. As part of the design procedure, modified Nyquist–Hall and Nichols diagrams are presented and discretized proportional–integral–derivative control schemes are reconsidered. Schemes for model-reference feedback and discrete-type observers are proposed. Although single-loop feedback systems form the core of the text, some consideration is given to multiple loops and nonlinearities. The robust control performance and stability of interval systems (with multiple uncertainties) are outlined. Finally, the monograph describes the relationship between feedback-control and discrete ev...
Discrete repulsive oscillator wavefunctions
Munoz, Carlos A; Rueda-Paz, Juvenal; Wolf, Kurt Bernardo
2009-01-01
For the study of infinite discrete systems on phase space, the three-dimensional Lorentz algebra and group, so(2,1) and SO(2,1), provide a discrete model of the repulsive oscillator. Its eigenfunctions are found in the principal irreducible representation series, where the compact generator-that we identify with the position operator-has the infinite discrete spectrum of the integers Z, while the spectrum of energies is a double continuum. The right- and left-moving wavefunctions are given by hypergeometric functions that form a Dirac basis for l 2 (Z). Under contraction, the discrete system limits to the well-known quantum repulsive oscillator. Numerical computations of finite approximations raise further questions on the use of Dirac bases for infinite discrete systems.
Morris, J; Johnson, S
2007-12-03
The Distinct Element Method (also frequently referred to as the Discrete Element Method) (DEM) is a Lagrangian numerical technique where the computational domain consists of discrete solid elements which interact via compliant contacts. This can be contrasted with Finite Element Methods where the computational domain is assumed to represent a continuum (although many modern implementations of the FEM can accommodate some Distinct Element capabilities). Often the terms Discrete Element Method and Distinct Element Method are used interchangeably in the literature, although Cundall and Hart (1992) suggested that Discrete Element Methods should be a more inclusive term covering Distinct Element Methods, Displacement Discontinuity Analysis and Modal Methods. In this work, DEM specifically refers to the Distinct Element Method, where the discrete elements interact via compliant contacts, in contrast with Displacement Discontinuity Analysis where the contacts are rigid and all compliance is taken up by the adjacent intact material.
Exact discretization of Schrödinger equation
Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru
2016-01-08
There are different approaches to discretization of the Schrödinger equation with some approximations. In this paper we derive a discrete equation that can be considered as exact discretization of the continuous Schrödinger equation. The proposed discrete equation is an equation with difference of integer order that is represented by infinite series. We suggest differences, which are characterized by power-law Fourier transforms. These differences can be considered as exact discrete analogs of derivatives of integer orders. Physically the suggested discrete equation describes a chain (or lattice) model with long-range interaction of power-law form. Mathematically it is a uniquely highlighted difference equation that exactly corresponds to the continuous Schrödinger equation. Using the Young's inequality for convolution, we prove that suggested differences are operators on the Hilbert space of square-summable sequences. We prove that the wave functions, which are exact discrete analogs of the free particle and harmonic oscillator solutions of the continuous Schrödinger equations, are solutions of the suggested discrete Schrödinger equations. - Highlights: • Exact discretization of the continuous Schrödinger equation is suggested. • New long-range interactions of power-law form are suggested. • Solutions of discrete Schrödinger equation are exact discrete analogs of continuous solutions.
Exact discretization of Schrödinger equation
Tarasov, Vasily E.
2016-01-01
There are different approaches to discretization of the Schrödinger equation with some approximations. In this paper we derive a discrete equation that can be considered as exact discretization of the continuous Schrödinger equation. The proposed discrete equation is an equation with difference of integer order that is represented by infinite series. We suggest differences, which are characterized by power-law Fourier transforms. These differences can be considered as exact discrete analogs of derivatives of integer orders. Physically the suggested discrete equation describes a chain (or lattice) model with long-range interaction of power-law form. Mathematically it is a uniquely highlighted difference equation that exactly corresponds to the continuous Schrödinger equation. Using the Young's inequality for convolution, we prove that suggested differences are operators on the Hilbert space of square-summable sequences. We prove that the wave functions, which are exact discrete analogs of the free particle and harmonic oscillator solutions of the continuous Schrödinger equations, are solutions of the suggested discrete Schrödinger equations. - Highlights: • Exact discretization of the continuous Schrödinger equation is suggested. • New long-range interactions of power-law form are suggested. • Solutions of discrete Schrödinger equation are exact discrete analogs of continuous solutions.
Izadi, F A; Bagirov, G
2009-01-01
With its origins stretching back several centuries, discrete calculus is now an increasingly central methodology for many problems related to discrete systems and algorithms. The topics covered here usually arise in many branches of science and technology, especially in discrete mathematics, numerical analysis, statistics and probability theory as well as in electrical engineering, but our viewpoint here is that these topics belong to a much more general realm of mathematics; namely calculus and differential equations because of the remarkable analogy of the subject to this branch of mathemati
Discrete Symmetries Analysis and Exact Solutions of the Inviscid Burgers Equation
Hongwei Yang
2012-01-01
Full Text Available We discuss the Lie point symmetries and discrete symmetries of the inviscid Burgers equation. By employing the Lie group method of infinitesimal transformations, symmetry reductions and similarity solutions of the governing equation are given. Based on discrete symmetries analysis, two groups of discrete symmetries are obtained, which lead to new exact solutions of the inviscid Burgers equation.
A Fast Mellin and Scale Transform
Davide Rocchesso
2007-01-01
Full Text Available A fast algorithm for the discrete-scale (and β-Mellin transform is proposed. It performs a discrete-time discrete-scale approximation of the continuous-time transform, with subquadratic asymptotic complexity. The algorithm is based on a well-known relation between the Mellin and Fourier transforms, and it is practical and accurate. The paper gives some theoretical background on the Mellin, β-Mellin, and scale transforms. Then the algorithm is presented and analyzed in terms of computational complexity and precision. The effects of different interpolation procedures used in the algorithm are discussed.
A Fast Mellin and Scale Transform
Rocchesso Davide
2007-01-01
Full Text Available A fast algorithm for the discrete-scale (and -Mellin transform is proposed. It performs a discrete-time discrete-scale approximation of the continuous-time transform, with subquadratic asymptotic complexity. The algorithm is based on a well-known relation between the Mellin and Fourier transforms, and it is practical and accurate. The paper gives some theoretical background on the Mellin, -Mellin, and scale transforms. Then the algorithm is presented and analyzed in terms of computational complexity and precision. The effects of different interpolation procedures used in the algorithm are discussed.
Parallel Fast Legendre Transform
Alves de Inda, M.; Bisseling, R.H.; Maslen, D.K.
1998-01-01
We discuss a parallel implementation of a fast algorithm for the discrete polynomial Legendre transform We give an introduction to the DriscollHealy algorithm using polynomial arithmetic and present experimental results on the eciency and accuracy of our implementation The algorithms were
Finite Discrete Gabor Analysis
Søndergaard, Peter Lempel
2007-01-01
frequency bands at certain times. Gabor theory can be formulated for both functions on the real line and for discrete signals of finite length. The two theories are largely the same because many aspects come from the same underlying theory of locally compact Abelian groups. The two types of Gabor systems...... can also be related by sampling and periodization. This thesis extends on this theory by showing new results for window construction. It also provides a discussion of the problems associated to discrete Gabor bases. The sampling and periodization connection is handy because it allows Gabor systems...... on the real line to be well approximated by finite and discrete Gabor frames. This method of approximation is especially attractive because efficient numerical methods exists for doing computations with finite, discrete Gabor systems. This thesis presents new algorithms for the efficient computation of finite...
Adaptive Discrete Hypergraph Matching.
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.
Goodrich, Christopher
2015-01-01
This text provides the first comprehensive treatment of the discrete fractional calculus. Experienced researchers will find the text useful as a reference for discrete fractional calculus and topics of current interest. Students who are interested in learning about discrete fractional calculus will find this text to provide a useful starting point. Several exercises are offered at the end of each chapter and select answers have been provided at the end of the book. The presentation of the content is designed to give ample flexibility for potential use in a myriad of courses and for independent study. The novel approach taken by the authors includes a simultaneous treatment of the fractional- and integer-order difference calculus (on a variety of time scales, including both the usual forward and backwards difference operators). The reader will acquire a solid foundation in the classical topics of the discrete calculus while being introduced to exciting recent developments, bringing them to the frontiers of the...
Williams, Ruth M
2006-01-01
A review is given of a number of approaches to discrete quantum gravity, with a restriction to those likely to be relevant in four dimensions. This paper is dedicated to Rafael Sorkin on the occasion of his sixtieth birthday
Application of the numerical Laplace transform inversion to neutron transport theory
Ganapol, B.D.
1989-01-01
A numerical Laplace transform inversion is developed using the Hurwitz-Zweifel method of evaluating the Fourier cosine integral coupled with an Euler-Knopp transformation. The numerical inversion is then applied to problems in linear transport theory concerning slowing down, time-dependence and featuring the determination of the interior scalar flux solution to the one-group stationary transport equation in half-space geometry
An analogue of a theorem of Titchmarsh for Walsh-Fourier transformations
Golubov, B I
1998-01-01
Let f-hat c be the Fourier cosine transform of f. Then, as proved for functions of class L p (R + ) in Titchmarsh's book 'Introduction to the theory of Fourier integrals' (1937), the Hardy operator and the Hardy-Littlewood operator can be defined. In the present paper similar equalities are proved for functions of class L p (R + ), 1< p≤2, and the Walsh-Fourier transformation
Discrete computational structures
Korfhage, Robert R
1974-01-01
Discrete Computational Structures describes discrete mathematical concepts that are important to computing, covering necessary mathematical fundamentals, computer representation of sets, graph theory, storage minimization, and bandwidth. The book also explains conceptual framework (Gorn trees, searching, subroutines) and directed graphs (flowcharts, critical paths, information network). The text discusses algebra particularly as it applies to concentrates on semigroups, groups, lattices, propositional calculus, including a new tabular method of Boolean function minimization. The text emphasize
Manifestly gauge invariant discretizations of the Schrödinger equation
Halvorsen, Tore Gunnar; Kvaal, Simen
2012-01-01
Grid-based discretizations of the time dependent Schrödinger equation coupled to an external magnetic field are converted to manifest gauge invariant discretizations. This is done using generalizations of ideas used in classical lattice gauge theory, and the process defined is applicable to a large class of discretized differential operators. In particular, popular discretizations such as pseudospectral discretizations using the fast Fourier transform can be transformed to gauge invariant schemes. Also generic gauge invariant versions of generic time integration methods are considered, enabling completely gauge invariant calculations of the time dependent Schrödinger equation. Numerical examples illuminating the differences between a gauge invariant discretization and conventional discretization procedures are also presented. -- Highlights: ► We investigate the Schrödinger equation coupled to an external magnetic field. ► Any grid-based discretization is made trivially gauge invariant. ► An extension of classical lattice gauge theory.
The transformation techniques in path integration
Inomata, A.
1989-01-01
In this paper general remarks are made concerning the time transformation techniques in path integration and their implementations. Time transformations may be divided into two classes: global (integrable) time transformations and local (nonintegrable) time transformations. Although a brief account of global time transformations is given, attention is focused on local transformations. First, time transformations in the classical Kepler problem are reviewed. Then, problems encountered in implementing a local time transformation in quantum mechanics are analyzed. A several propositions pertinent to the implementation of local time transformations, particularly basic to the local time rescaling trick in a discretized path integral, are presented
Homogenization of discrete media
Pradel, F.; Sab, K. [CERAM-ENPC, Marne-la-Vallee (France)
1998-11-01
Material such as granular media, beam assembly are easily seen as discrete media. They look like geometrical points linked together thanks to energetic expressions. Our purpose is to extend discrete kinematics to the one of an equivalent continuous material. First we explain how we build the localisation tool for periodic materials according to estimated continuum medium type (classical Cauchy, and Cosserat media). Once the bridge built between discrete and continuum media, we exhibit its application over two bidimensional beam assembly structures : the honey comb and a structural reinforced variation. The new behavior is then applied for the simple plan shear problem in a Cosserat continuum and compared with the real discrete solution. By the mean of this example, we establish the agreement of our new model with real structures. The exposed method has a longer range than mechanics and can be applied to every discrete problems like electromagnetism in which relationship between geometrical points can be summed up by an energetic function. (orig.) 7 refs.
DISCRETE MATHEMATICS/NUMBER THEORY
Mrs. Manju Devi*
2017-01-01
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying "smoothly", the objects studied in discrete mathematics such as integers, graphs, and statements do not vary smoothly in this way, but have distinct, separated values. Discrete mathematics therefore excludes topics in "continuous mathematics" such as calculus and analysis. Discrete objects can often be enumerated by ...
Prateek Sharma
2015-04-01
Full Text Available Abstract Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the generation of the history of a system and then analyzing that history to predict the outcome and improve the working of real systems. Simulations can be of various kinds but the topic of interest here is one of the most important kind of simulation which is Discrete-Event Simulation which models the system as a discrete sequence of events in time. So this paper aims at introducing about Discrete-Event Simulation and analyzing how it is beneficial to the real world systems.
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.
Introductory discrete mathematics
Balakrishnan, V K
2010-01-01
This concise text offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics. Mathematics educators consider it vital that their students be exposed to a course in discrete methods that introduces them to combinatorial mathematics and to algebraic and logical structures focusing on the interplay between computer science and mathematics. The present volume emphasizes combinatorics, graph theory with applications to some stand network optimization problems, and algorithms to solve these problems.Chapters 0-3 cover fundamental operations involv
Prateek Sharma
2015-01-01
Abstract Simulation can be regarded as the emulation of the behavior of a real-world system over an interval of time. The process of simulation relies upon the generation of the history of a system and then analyzing that history to predict the outcome and improve the working of real systems. Simulations can be of various kinds but the topic of interest here is one of the most important kind of simulation which is Discrete-Event Simulation which models the system as a discrete sequence of ev...
Siddeq, M. M.; Rodrigues, M. A.
2015-09-01
Image compression techniques are widely used on 2D image 2D video 3D images and 3D video. There are many types of compression techniques and among the most popular are JPEG and JPEG2000. In this research, we introduce a new compression method based on applying a two level discrete cosine transform (DCT) and a two level discrete wavelet transform (DWT) in connection with novel compression steps for high-resolution images. The proposed image compression algorithm consists of four steps. (1) Transform an image by a two level DWT followed by a DCT to produce two matrices: DC- and AC-Matrix, or low and high frequency matrix, respectively, (2) apply a second level DCT on the DC-Matrix to generate two arrays, namely nonzero-array and zero-array, (3) apply the Minimize-Matrix-Size algorithm to the AC-Matrix and to the other high-frequencies generated by the second level DWT, (4) apply arithmetic coding to the output of previous steps. A novel decompression algorithm, Fast-Match-Search algorithm (FMS), is used to reconstruct all high-frequency matrices. The FMS-algorithm computes all compressed data probabilities by using a table of data, and then using a binary search algorithm for finding decompressed data inside the table. Thereafter, all decoded DC-values with the decoded AC-coefficients are combined in one matrix followed by inverse two levels DCT with two levels DWT. The technique is tested by compression and reconstruction of 3D surface patches. Additionally, this technique is compared with JPEG and JPEG2000 algorithm through 2D and 3D root-mean-square-error following reconstruction. The results demonstrate that the proposed compression method has better visual properties than JPEG and JPEG2000 and is able to more accurately reconstruct surface patches in 3D.
String constraints on discrete symmetries in MSSM type II quivers
Anastasopoulos, Pascal [Technische Univ. Wien (Austria). Inst. fur Theor. Phys.; Cvetic, Mirjam [Univ. of Pennsylvania, Philadelphia PA (United States). Dept. of Physics and Astronomy; Univ. of Maribor (Slovenia). Center for Applied Mathematics and Theoretical Physics; Richter, Robert [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik; Vaudrevange, Patrick K.S. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)
2012-11-15
We study the presence of discrete gauge symmetries in D-brane semirealistic compactifications. After establishing the constraints on the transformation behaviour of the chiral matter for the presence of a discrete gauge symmetry we perform a systematic search for discrete gauge symmetries within semi-realistic D-brane realizations, based on four D-brane stacks, of the MSSM and the MSSM with three right-handed neutrinos. The systematic search reveals that Proton hexality, a discrete symmetry which ensures the absence of R-parity violating terms as well as the absence of dangerous dimension 5 proton decay operators, is only rarely realized. Moreover, none of the semi-realistic local D-brane configurations exhibit any family dependent discrete gauge symmetry.
We also describe discrete-time systems in terms of difference ... A more modern alternative, especially for larger systems, is to convert ... In other words, ..... picture?) State-variable equations are also called state-space equations because the ...
Discrete Lorentzian quantum gravity
Loll, R.
2000-01-01
Just as for non-abelian gauge theories at strong coupling, discrete lattice methods are a natural tool in the study of non-perturbative quantum gravity. They have to reflect the fact that the geometric degrees of freedom are dynamical, and that therefore also the lattice theory must be formulated
Sharp, Karen Tobey
This paper cites information received from a number of sources, e.g., mathematics teachers in two-year colleges, publishers, and convention speakers, about the nature of discrete mathematics and about what topics a course in this subject should contain. Note is taken of the book edited by Ralston and Young which discusses the future of college…
Fu Jing-Li; He Yu-Fang; Hong Fang-Yu; Song Duan; Fu Hao
2013-01-01
In this paper, we present a new method to obtain the Lie symmetries and conserved quantities of the discrete wave equation with the Ablowitz—Ladik—Lattice equations. Firstly, the wave equation is transformed into a simple difference equation with the Ablowitz—Ladik—Lattice method. Secondly, according to the invariance of the discrete wave equation and the Ablowitz—Ladik—Lattice equations under infinitesimal transformation of dependent and independent variables, we derive the discrete determining equation and the discrete restricted equations. Thirdly, a series of the discrete analogs of conserved quantities, the discrete analogs of Lie groups, and the characteristic equations are obtained for the wave equation. Finally, we study a model of a biological macromolecule chain of mechanical behaviors, the Lie symmetry theory of discrete wave equation with the Ablowitz—Ladik—Lattice method is verified. (general)
Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations
Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi
2017-01-01
A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy
An integrable semi-discretization of the Boussinesq equation
Zhang, Yingnan; Tian, Lixin
2016-01-01
Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.
An integrable semi-discretization of the Boussinesq equation
Zhang, Yingnan, E-mail: ynzhang@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Tian, Lixin, E-mail: tianlixin@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Nonlinear Scientific Research Center, Jiangsu University, Zhenjiang, Jiangsu (China)
2016-10-23
Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.
Discrete mKdV and discrete sine-Gordon flows on discrete space curves
Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro
2014-01-01
In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving equidistant deformation on the osculating plane which satisfies the isoperimetric condition. The curve is reconstructed from the deformation data by using the Sym–Tafel formula. The isoperimetric equidistant deformation of the space curves does not preserve the torsion in general. However, it is possible to construct the torsion-preserving deformation by tuning the deformation parameters. Further, it is also possible to make an arbitrary choice of the deformation described by the discrete mKdV equation or by the discrete sine-Gordon equation at each step. We finally show that the discrete deformation of discrete space curves yields the discrete K-surfaces. (paper)
Discrete mathematics with applications
Koshy, Thomas
2003-01-01
This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.* Covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals * Emphasizes problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof techniques, algorithm development and correctness, and numeric computations* Weaves numerous applications into the text* Helps students learn by doing with a wealth of examples and exercises: - 560 examples worked out in detail - More than 3,700 exercises - More than 150 computer assignments - More than 600 writing projects*...
Discrete and computational geometry
Devadoss, Satyan L
2011-01-01
Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincaré conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also fe...
2002-01-01
Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity and it is a foundation for fields such as computational geometry or combinatorial optimization. This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner. It also contains more advanced material in separate sections and thus it can serve as a collection of surveys in several narrower subfields. The main topics include: basics on convex sets, convex polytopes, and hyperplane arrangements; combinatorial complexity of geometric configurations; intersection patterns and transversals of convex sets; geometric Ramsey-type results; polyhedral combinatorics and high-dimensional convexity; and lastly, embeddings of finite metric spaces into normed spaces. Jiri Matousek is Professor of Com...
Time Discretization Techniques
Gottlieb, S.
2016-10-12
The time discretization of hyperbolic partial differential equations is typically the evolution of a system of ordinary differential equations obtained by spatial discretization of the original problem. Methods for this time evolution include multistep, multistage, or multiderivative methods, as well as a combination of these approaches. The time step constraint is mainly a result of the absolute stability requirement, as well as additional conditions that mimic physical properties of the solution, such as positivity or total variation stability. These conditions may be required for stability when the solution develops shocks or sharp gradients. This chapter contains a review of some of the methods historically used for the evolution of hyperbolic PDEs, as well as cutting edge methods that are now commonly used.
Mesiar, Radko; Li, J.; Pap, E.
2013-01-01
Roč. 54, č. 3 (2013), s. 357-364 ISSN 0888-613X R&D Projects: GA ČR GAP402/11/0378 Institutional support: RVO:67985556 Keywords : concave integral * pseudo-addition * pseudo-multiplication Subject RIV: BA - General Mathematics Impact factor: 1.977, year: 2013 http://library.utia.cas.cz/separaty/2013/E/mesiar-discrete pseudo-integrals.pdf
Discrete variational Hamiltonian mechanics
Lall, S; West, M
2006-01-01
The main contribution of this paper is to present a canonical choice of a Hamiltonian theory corresponding to the theory of discrete Lagrangian mechanics. We make use of Lagrange duality and follow a path parallel to that used for construction of the Pontryagin principle in optimal control theory. We use duality results regarding sensitivity and separability to show the relationship between generating functions and symplectic integrators. We also discuss connections to optimal control theory and numerical algorithms
Digital watermarking and steganography fundamentals and techniques
Shih, Frank Y
2007-01-01
Introduction Digital Watermarking Digital Steganography Differences between Watermarking and Steganography A Brief History Appendix: Selected List of Books on Watermarking and Steganography Classification in Digital Watermarking Classification Based on Characteristics Classification Based on Applications Mathematical Preliminaries Least-Significant-Bit Substitution Discrete Fourier Transform (DFT) Discrete Cosine Transform Discrete Wavelet Transform Random Sequence Generation The Chaotic M
Discrete port-Hamiltonian systems
Talasila, V.; Clemente-Gallardo, J.; Schaft, A.J. van der
2006-01-01
Either from a control theoretic viewpoint or from an analysis viewpoint it is necessary to convert smooth systems to discrete systems, which can then be implemented on computers for numerical simulations. Discrete models can be obtained either by discretizing a smooth model, or by directly modeling
A paradigm for discrete physics
Noyes, H.P.; McGoveran, D.; Etter, T.; Manthey, M.J.; Gefwert, C.
1987-01-01
An example is outlined for constructing a discrete physics using as a starting point the insight from quantum physics that events are discrete, indivisible and non-local. Initial postulates are finiteness, discreteness, finite computability, absolute nonuniqueness (i.e., homogeneity in the absence of specific cause) and additivity
Rational solutions of the discrete time Toda lattice and the alternate discrete Painleve II equation
Common, Alan K; Hone, Andrew N W
2008-01-01
The Yablonskii-Vorob'ev polynomials y n (t), which are defined by a second-order bilinear differential-difference equation, provide rational solutions of the Toda lattice. They are also polynomial tau-functions for the rational solutions of the second Painleve equation (P II ). Here we define two-variable polynomials Y n (t, h) on a lattice with spacing h, by considering rational solutions of the discrete time Toda lattice as introduced by Suris. These polynomials are shown to have many properties that are analogous to those of the Yablonskii-Vorob'ev polynomials, to which they reduce when h = 0. They also provide rational solutions for a particular discretization of P II , namely the so-called alternate discrete P II , and this connection leads to an expression in terms of the Umemura polynomials for the third Painleve equation (P III ). It is shown that the Baecklund transformation for the alternate discrete Painleve equation is a symplectic map, and the shift in time is also symplectic. Finally we present a Lax pair for the alternate discrete P II , which recovers Jimbo and Miwa's Lax pair for P II in the continuum limit h → 0
Modeling contact angle hysteresis of a liquid droplet sitting on a cosine wave-like pattern surface.
Promraksa, Arwut; Chen, Li-Jen
2012-10-15
A liquid droplet sitting on a hydrophobic surface with a cosine wave-like square-array pattern in the Wenzel state is simulated by using the Surface Evolver to determine the contact angle. For a fixed drop volume, multiple metastable states are obtained at two different surface roughnesses. Unusual and non-circular shape of the three-phase contact line of a liquid droplet sitting on the model surface is observed due to corrugation and distortion of the contact line by structure of the roughness. The contact angle varies along the contact line for each metastable state. The maximum and minimum contact angles among the multiple metastable states at a fixed viewing angle correspond to the advancing and the receding contact angles, respectively. It is interesting to observe that the advancing/receding contact angles (and contact angle hysteresis) are a function of viewing angle. In addition, the receding (or advancing) contact angles at different viewing angles are determined at different metastable states. The contact angle of minimum energy among the multiple metastable states is defined as the most stable (equilibrium) contact angle. The Wenzel model is not able to describe the contact angle along the three-phase contact line. The contact angle hysteresis at different drop volumes is determined. The number of the metastable states increases with increasing drop volume. Drop volume effect on the contact angles is also discussed. Crown Copyright © 2012. Published by Elsevier Inc. All rights reserved.
Shaeen Kalathil
2016-03-01
Full Text Available Forthcoming software defined radios require filter banks which satisfy stringent specifications efficiently with low implementation complexity. Cosine modulated filter banks (CMFB have simple and efficient design procedure. The different wireless standards have different channel spacing or bandwidths and hence demand non-uniform decomposition of subbands. The non-uniform CMFB can be obtained from a uniform CMFB in a simple and efficient approach by merging the adjacent channels of the uniform CMFB. Very narrow transition width filters with low complexity can be achieved using frequency response masking (FRM filter as prototype filter. The complexity is further reduced by the multiplier-less realization of filter banks in which the least number of signed power of two (SPT terms is achieved by representing the filter coefficients using canonic signed digit (CSD representation and then optimizing using suitable modified meta-heuristic algorithms. Hybrid meta-heuristic algorithms are used in this paper. A hybrid algorithm combines the qualities of two meta-heuristic algorithms and results in improved performances with low implementation complexity. Highly frequency selective filter banks characterized by small passband ripple, narrow transition width and high stopband attenuation with non-uniform decomposition of subbands can be designed with least the implementation complexity, using this approach. A digital channelizer can be designed for SDR implementations, using the proposed approach. In this paper, the non-uniform CMFB is designed for various existing wireless standards.
Chen, Xin; Wang, Shuhong; Liu, Zhen; Wei, Xizhang
2017-07-01
Localization of a source whose half-wavelength is smaller than the array aperture would suffer from serious phase ambiguity problem, which also appears in recently proposed phase-based algorithms. In this paper, by using the centro-symmetry of fixed uniform circular array (UCA) with even number of sensors, the source's angles and range can be decoupled and a novel ambiguity resolving approach is addressed for phase-based algorithms of source's 3-D localization (azimuth angle, elevation angle, and range). In the proposed method, by using the cosine property of unambiguous phase differences, ambiguity searching and actual-value matching are first employed to obtain actual phase differences and corresponding source's angles. Then, the unambiguous angles are utilized to estimate the source's range based on a one dimension multiple signal classification (1-D MUSIC) estimator. Finally, simulation experiments investigate the influence of step size in search and SNR on performance of ambiguity resolution and demonstrate the satisfactory estimation performance of the proposed method.
Two new discrete integrable systems
Chen Xiao-Hong; Zhang Hong-Qing
2013-01-01
In this paper, we focus on the construction of new (1+1)-dimensional discrete integrable systems according to a subalgebra of loop algebra Ã 1 . By designing two new (1+1)-dimensional discrete spectral problems, two new discrete integrable systems are obtained, namely, a 2-field lattice hierarchy and a 3-field lattice hierarchy. When deriving the two new discrete integrable systems, we find the generalized relativistic Toda lattice hierarchy and the generalized modified Toda lattice hierarchy. Moreover, we also obtain the Hamiltonian structures of the two lattice hierarchies by means of the discrete trace identity
A semi-discrete integrable multi-component coherently coupled nonlinear Schrödinger system
Zhao, Hai-qiong; Yuan, Jinyun
2016-01-01
A new integrable semi-discrete version is proposed for the multi-component coherently coupled nonlinear Schrödinger equation. The integrability of the semi-discrete system is confirmed by existence of Lax pair and infinite number of conservation laws. With the aid of gauge transformations, explicit formulas for N -fold Darboux transformations are derived whereby some physically important solutions of the system are presented. Furthermore, the theory of the semi-discrete system including Lax pair, Darboux transformations, exact solutions and infinite number of conservation laws are shown for their continuous counterparts in the continuous limit. (paper)
Discrete Chebyshev nets and a universal permutability theorem
Schief, W K
2007-01-01
The Pohlmeyer-Lund-Regge system which was set down independently in the contexts of Lagrangian field theories and the relativistic motion of a string and which played a key role in the development of a geometric interpretation of soliton theory is known to appear in a variety of important guises such as the vectorial Lund-Regge equation, the O(4) nonlinear σ-model and the SU(2) chiral model. Here, it is demonstrated that these avatars may be discretized in such a manner that both integrability and equivalence are preserved. The corresponding discretization procedure is geometric and algebraic in nature and based on discrete Chebyshev nets and generalized discrete Lelieuvre formulae. In connection with the derivation of associated Baecklund transformations, it is shown that a generalized discrete Lund-Regge equation may be interpreted as a universal permutability theorem for integrable equations which admit commuting matrix Darboux transformations acting on su(2) linear representations. Three-dimensional coordinate systems and lattices of 'Lund-Regge' type related to particular continuous and discrete Zakharov-Manakov systems are obtained as a by-product of this analysis
Lorente, M.
2003-01-01
We explore the mathematical consequences of the assumption of a discrete space-time. The fundamental laws of physics have to be translated into the language of discrete mathematics. We find integral transformations that leave the lattice of any dimension invariant and apply these transformations to field equations.
Hirsch, M; Peinado, E; Valle, J W F
2010-01-01
We propose a new motivation for the stability of dark matter (DM). We suggest that the same non-abelian discrete flavor symmetry which accounts for the observed pattern of neutrino oscillations, spontaneously breaks to a Z2 subgroup which renders DM stable. The simplest scheme leads to a scalar doublet DM potentially detectable in nuclear recoil experiments, inverse neutrino mass hierarchy, hence a neutrinoless double beta decay rate accessible to upcoming searches, while reactor angle equal to zero gives no CP violation in neutrino oscillations.
Wuensche, Andrew
DDLab is interactive graphics software for creating, visualizing, and analyzing many aspects of Cellular Automata, Random Boolean Networks, and Discrete Dynamical Networks in general and studying their behavior, both from the time-series perspective — space-time patterns, and from the state-space perspective — attractor basins. DDLab is relevant to research, applications, and education in the fields of complexity, self-organization, emergent phenomena, chaos, collision-based computing, neural networks, content addressable memory, genetic regulatory networks, dynamical encryption, generative art and music, and the study of the abstract mathematical/physical/dynamical phenomena in their own right.
Discrete variable representation for singular Hamiltonians
Schneider, B. I.; Nygaard, Nicolai
2004-01-01
We discuss the application of the discrete variable representation (DVR) to Schrodinger problems which involve singular Hamiltonians. Unlike recent authors who invoke transformations to rid the eigenvalue equation of singularities at the cost of added complexity, we show that an approach based...... solely on an orthogonal polynomial basis is adequate, provided the Gauss-Lobatto or Gauss-Radau quadrature rule is used. This ensures that the mesh contains the singular points and by simply discarding the DVR functions corresponding to those points, all matrix elements become well behaved. the boundary...
Souza, Manoelito M. de
1997-01-01
We discuss the physical meaning and the geometric interpretation of implementation in classical field theories. The origin of infinities and other inconsistencies in field theories is traced to fields defined with support on the light cone; a finite and consistent field theory requires a light-cone generator as the field support. Then, we introduce a classical field theory with support on the light cone generators. It results on a description of discrete (point-like) interactions in terms of localized particle-like fields. We find the propagators of these particle-like fields and discuss their physical meaning, properties and consequences. They are conformally invariant, singularity-free, and describing a manifestly covariant (1 + 1)-dimensional dynamics in a (3 = 1) spacetime. Remarkably this conformal symmetry remains even for the propagation of a massive field in four spacetime dimensions. We apply this formalism to Classical electrodynamics and to the General Relativity Theory. The standard formalism with its distributed fields is retrieved in terms of spacetime average of the discrete field. Singularities are the by-products of the averaging process. This new formalism enlighten the meaning and the problem of field theory, and may allow a softer transition to a quantum theory. (author)
Properties of wavelet discretization of Black-Scholes equation
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.
Integrable discretization s of derivative nonlinear Schroedinger equations
Tsuchida, Takayuki
2002-01-01
We propose integrable discretizations of derivative nonlinear Schroedinger (DNLS) equations such as the Kaup-Newell equation, the Chen-Lee-Liu equation and the Gerdjikov-Ivanov equation by constructing Lax pairs. The discrete DNLS systems admit the reduction of complex conjugation between two dependent variables and possess bi-Hamiltonian structure. Through transformations of variables and reductions, we obtain novel integrable discretizations of the nonlinear Schroedinger (NLS), modified KdV (mKdV), mixed NLS, matrix NLS, matrix KdV, matrix mKdV, coupled NLS, coupled Hirota, coupled Sasa-Satsuma and Burgers equations. We also discuss integrable discretizations of the sine-Gordon equation, the massive Thirring model and their generalizations. (author)
Choi, Je-Eun; Takei, Masahiro; Doh, Deog-Hee; Jo, Hyo-Jae; Hassan, Yassin A.; Ortiz-Villafuerte, Javier
2008-01-01
Currently, wavelet transforms are widely used for the analyses of particle image velocimetry (PIV) velocity vector fields. This is because the wavelet provides not only spatial information of the velocity vectors, but also of the time and frequency domains. In this study, a discrete wavelet transform is applied to real PIV images of bubbly flows. The vector fields obtained by a self-made cross-correlation PIV algorithm were used for the discrete wavelet transform. The performances of the discrete wavelet transforms were investigated by changing the level of power of discretization. The images decomposed by wavelet multi-resolution showed conspicuous characteristics of the bubbly flows for the different levels. A high spatial bubble concentrated area could be evaluated by the constructed discrete wavelet transform algorithm, in which high-leveled wavelets play dominant roles in revealing the flow characteristics
Discrete Exterior Calculus Discretization of Incompressible Navier-Stokes Equations
Mohamed, Mamdouh S.
2017-05-23
A conservative discretization of incompressible Navier-Stokes equations over surface simplicial meshes is developed using discrete exterior calculus (DEC). Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy otherwise. The mimetic character of many of the DEC operators provides exact conservation of both mass and vorticity, in addition to superior kinetic energy conservation. The employment of barycentric Hodge star allows the discretization to admit arbitrary simplicial meshes. The discretization scheme is presented along with various numerical test cases demonstrating its main characteristics.
DOMINO, Coupling of Discrete Ordinate Program DOT with Monte-Carlo Program MORSE
1974-01-01
1 - Nature of physical problem solved: DOMINO is a general purpose code for coupling discrete ordinates and Monte Carlo radiation transport calculations. 2 - Method of solution: DOMINO transforms the angular flux as a function of energy group, mesh interval and discrete angle into current and subsequently into normalized probability distributions. 3 - Restrictions on the complexity of the problem: The discrete ordinates calculation is limited to an r-z geometry
On discrete 2D integrable equations of higher order
Adler, V E; Postnikov, V V
2014-01-01
We study two-dimensional discrete integrable equations of order 1 with respect to one independent variable and m with respect to another one. A generalization of the multidimensional consistency property is proposed for this type of equations. The examples are related to the Bäcklund–Darboux transformations for the lattice equations of Bogoyavlensky type. (paper)
Wang, Lu; Xu, Lisheng; Zhao, Dazhe; Yao, Yang; Song, Dan
2015-04-01
Because arterial pulse waves contain vital information related to the condition of the cardiovascular system, considerable attention has been devoted to the study of pulse waves in recent years. Accurate acquisition is essential to investigate arterial pulse waves. However, at the stage of developing equipment for acquiring and analyzing arterial pulse waves, specific pulse signals may be unavailable for debugging and evaluating the system under development. To produce test signals that reflect specific physiological conditions, in this paper, an arterial pulse wave generator has been designed and implemented using a field programmable gate array (FPGA), which can produce the desired pulse waves according to the feature points set by users. To reconstruct a periodic pulse wave from the given feature points, a method known as piecewise Gaussian-cosine fitting is also proposed in this paper. Using a test database that contains four types of typical pulse waves with each type containing 25 pulse wave signals, the maximum residual error of each sampling point of the fitted pulse wave in comparison with the real pulse wave is within 8%. In addition, the function for adding baseline drift and three types of noises is integrated into the developed system because the baseline occasionally wanders, and noise needs to be added for testing the performance of the designed circuits and the analysis algorithms. The proposed arterial pulse wave generator can be considered as a special signal generator with a simple structure, low cost and compact size, which can also provide flexible solutions for many other related research purposes. Copyright © 2015 Elsevier Ltd. All rights reserved.
M. Rasoulpoor; M. Banejad; A. Ahmadyfard
2011-01-01
This paper presents a novel technique for transformer differential protection to prevent incorrect operation due to inrush current. The proposed method in this paper is based on time-frequency transform known as the Wavelet transform. The discrete Wavelet transform is used for analysis the differential current signals in time and frequency domains. The investigation on the energy distribution of the signal on the discrete Wavelet transform components shows the difference distribution between ...
Advances in discrete differential geometry
2016-01-01
This is one of the first books on a newly emerging field of discrete differential geometry and an excellent way to access this exciting area. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics. The authors take a closer look at discrete models in differential geometry and dynamical systems. Their curves are polygonal, surfaces are made from triangles and quadrilaterals, and time is discrete. Nevertheless, the difference between the corresponding smooth curves, surfaces and classical dynamical systems with continuous time can hardly be seen. This is the paradigm of structure-preserving discretizations. Current advances in this field are stimulated to a large extent by its relevance for computer graphics and mathematical physics. This book is written by specialists working together on a common research project. It is about differential geometry and dynamical systems, smooth and discrete theories, ...
Poisson hierarchy of discrete strings
Ioannidou, Theodora; Niemi, Antti J.
2016-01-01
The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.
Poisson hierarchy of discrete strings
Ioannidou, Theodora, E-mail: ti3@auth.gr [Faculty of Civil Engineering, School of Engineering, Aristotle University of Thessaloniki, 54249, Thessaloniki (Greece); Niemi, Antti J., E-mail: Antti.Niemi@physics.uu.se [Department of Physics and Astronomy, Uppsala University, P.O. Box 803, S-75108, Uppsala (Sweden); Laboratoire de Mathematiques et Physique Theorique CNRS UMR 6083, Fédération Denis Poisson, Université de Tours, Parc de Grandmont, F37200, Tours (France); Department of Physics, Beijing Institute of Technology, Haidian District, Beijing 100081 (China)
2016-01-28
The Poisson geometry of a discrete string in three dimensional Euclidean space is investigated. For this the Frenet frames are converted into a spinorial representation, the discrete spinor Frenet equation is interpreted in terms of a transfer matrix formalism, and Poisson brackets are introduced in terms of the spinor components. The construction is then generalised, in a self-similar manner, into an infinite hierarchy of Poisson algebras. As an example, the classical Virasoro (Witt) algebra that determines reparametrisation diffeomorphism along a continuous string, is identified as a particular sub-algebra, in the hierarchy of the discrete string Poisson algebra. - Highlights: • Witt (classical Virasoro) algebra is derived in the case of discrete string. • Infinite dimensional hierarchy of Poisson bracket algebras is constructed for discrete strings. • Spinor representation of discrete Frenet equations is developed.
Doliwa, A.; Grinevich, P.; Nieszporski, M.; Santini, P. M.
2007-01-01
We present the sublattice approach, a procedure to generate, from a given integrable lattice, a sublattice which inherits its integrability features. We consider, as illustrative example of this approach, the discrete Moutard 4-point equation and its sublattice, the self-adjoint 5-point scheme on the star of the square lattice, which are relevant in the theory of the integrable discrete geometries and in the theory of discrete holomorphic and harmonic functions (in this last context, the discrete Moutard equation is called discrete Cauchy-Riemann equation). Therefore an integrable, at one energy, discretization of elliptic two-dimensional operators is considered. We use the sublattice point of view to derive, from the Darboux transformations and superposition formulas of the discrete Moutard equation, the Darboux transformations and superposition formulas of the self-adjoint 5-point scheme. We also construct, from algebro-geometric solutions of the discrete Moutard equation, algebro-geometric solutions of the self-adjoint 5-point scheme. In particular, we show that the corresponding restrictions on the finite-gap data are of the same type as those for the fixed energy problem for the two-dimensional Schroedinger operator. We finally use these solutions to construct explicit examples of discrete holomorphic and harmonic functions, as well as examples of quadrilateral surfaces in R 3
A new twist to fourier transforms
Meikle, Hamish D
2004-01-01
Making use of the inherent helix in the Fourier transform expression, this book illustrates both Fourier transforms and their properties in the round. The author draws on elementary complex algebra to manipulate the transforms, presenting the ideas in such a way as to avoid pages of complicated mathematics. Similarly, abbreviations are not used throughout and the language is kept deliberately clear so that the result is a text that is accessible to a much wider readership.The treatment is extended with the use of sampled data to finite and discrete transforms, the fast Fourier transform, or FFT, being a special case of a discrete transform. The application of Fourier transforms in statistics is illustrated for the first time using the examples operational research and later radar detection. In addition, a whole chapter on tapering or weighting functions is added for reference. The whole is rounded off by a glossary and examples of diagrams in three dimensions made possible by today's mathematics programs
Hopf Bifurcation Analysis for a Stochastic Discrete-Time Hyperchaotic System
Jie Ran
2015-01-01
Full Text Available The dynamics of a discrete-time hyperchaotic system and the amplitude control of Hopf bifurcation for a stochastic discrete-time hyperchaotic system are investigated in this paper. Numerical simulations are presented to exhibit the complex dynamical behaviors in the discrete-time hyperchaotic system. Furthermore, the stochastic discrete-time hyperchaotic system with random parameters is transformed into its equivalent deterministic system with the orthogonal polynomial theory of discrete random function. In addition, the dynamical features of the discrete-time hyperchaotic system with random disturbances are obtained through its equivalent deterministic system. By using the Hopf bifurcation conditions of the deterministic discrete-time system, the specific conditions for the existence of Hopf bifurcation in the equivalent deterministic system are derived. And the amplitude control with random intensity is discussed in detail. Finally, the feasibility of the control method is demonstrated by numerical simulations.
Data-Driven Process Discovery: A Discrete Time Algebra for Relational Signal Analysis
Conrad, David
1996-01-01
.... Proposed is a time series transformation that encodes and compresses real-valued data into a well defined, discrete-space of 13 primitive elements where comparative evaluation between variables...
Single-crossover recombination in discrete time.
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.
An essay on discrete foundations for physics
Noyes, H.P.; McGoveran, D.O.
1988-07-01
We base our theory of physics and cosmology on the five principles of finiteness, discreteness, finite computability, absolute non-uniqueness, and strict construction. Our modeling methodology starts from the current practice of physics, constructs a self-consistent representation based on the ordering operator calculus and provides rules of correspondence that allow us to test the theory by experiment. We use program universe to construct a growing collection of bit strings whose initial portions (labels) provide the quantum numbers that are conserved in the events defined by the construction. The labels are followed by content strings which are used to construct event-based finite and discrete coordinates. On general grounds such a theory has a limiting velocity, and positions and velocities do not commute. We therefore reconcile quantum mechanics with relativity at an appropriately fundamental stage in the construction. We show that events in different coordinate systems are connected by the appropriate finite and discrete version of the Lorentz transformation, that 3-momentum is conserved in events, and that this conservation law is the same as the requirement that different paths can ''interfere'' only when they differ by an integral number of deBroglie wavelengths. 38 refs., 12 figs., 3 tabs
An essay on discrete foundations for physics
Noyes, H.P.; McGoveran, D.O.
1988-07-01
We base our theory of physics and cosmology on the five principles of finiteness, discreteness, finite computability, absolute non-uniqueness, and strict construction. Our modeling methodology starts from the current practice of physics, constructs a self-consistent representation based on the ordering operator calculus and provides rules of correspondence that allow us to test the theory by experiment. We use program universe to construct a growing collection of bit strings whose initial portions (labels) provide the quantum numbers that are conserved in the events defined by the construction. The labels are followed by content strings which are used to construct event-based finite and discrete coordinates. On general grounds such a theory has a limiting velocity, and positions and velocities do not commute. We therefore reconcile quantum mechanics with relativity at an appropriately fundamental stage in the construction. We show that events in different coordinate systems are connected by the appropriate finite and discrete version of the Lorentz transformation, that 3-momentum is conserved in events, and that this conservation law is the same as the requirement that different paths can ''interfere'' only when they differ by an integral number of deBroglie wavelengths. 38 refs., 12 figs., 3 tabs.
An essay on discrete foundations for physics
Noyes, H.P.; McGoveran, D.O.
1988-10-05
We base our theory of physics and cosmology on the five principles of finiteness, discreteness, finite computability, absolute non- uniqueness, and strict construction. Our modeling methodology starts from the current practice of physics, constructs a self-consistent representation based on the ordering operator calculus and provides rules of correspondence that allow us to test the theory by experiment. We use program universe to construct a growing collection of bit strings whose initial portions (labels) provide the quantum numbers that are conserved in the events defined by the construction. The labels are followed by content strings which are used to construct event-based finite and discrete coordinates. On general grounds such a theory has a limiting velocity, and positions and velocities do not commute. We therefore reconcile quantum mechanics with relativity at an appropriately fundamental stage in the construction. We show that events in different coordinate systems are connected by the appropriate finite and discrete version of the Lorentz transformation, that 3-momentum is conserved in events, and that this conservation law is the same as the requirement that different paths can ''interfere'' only when they differ by an integral number of deBroglie wavelengths. 38 refs., 12 figs., 3 tabs.
An essay on discrete foundations for physics
Noyes, H.P.; McGoveran, D.O.
1988-01-01
We base our theory of physics and cosmology on the five principles of finiteness, discreteness, finite computability, absolute non- uniqueness, and strict construction. Our modeling methodology starts from the current practice of physics, constructs a self-consistent representation based on the ordering operator calculus and provides rules of correspondence that allow us to test the theory by experiment. We use program universe to construct a growing collection of bit strings whose initial portions (labels) provide the quantum numbers that are conserved in the events defined by the construction. The labels are followed by content strings which are used to construct event-based finite and discrete coordinates. On general grounds such a theory has a limiting velocity, and positions and velocities do not commute. We therefore reconcile quantum mechanics with relativity at an appropriately fundamental stage in the construction. We show that events in different coordinate systems are connected by the appropriate finite and discrete version of the Lorentz transformation, that 3-momentum is conserved in events, and that this conservation law is the same as the requirement that different paths can ''interfere'' only when they differ by an integral number of deBroglie wavelengths. 38 refs., 12 figs., 3 tabs
Principles of discrete time mechanics
Jaroszkiewicz, George
2014-01-01
Could time be discrete on some unimaginably small scale? Exploring the idea in depth, this unique introduction to discrete time mechanics systematically builds the theory up from scratch, beginning with the historical, physical and mathematical background to the chronon hypothesis. Covering classical and quantum discrete time mechanics, this book presents all the tools needed to formulate and develop applications of discrete time mechanics in a number of areas, including spreadsheet mechanics, classical and quantum register mechanics, and classical and quantum mechanics and field theories. A consistent emphasis on contextuality and the observer-system relationship is maintained throughout.
Dark discrete gauge symmetries
Batell, Brian
2011-01-01
We investigate scenarios in which dark matter is stabilized by an Abelian Z N discrete gauge symmetry. Models are surveyed according to symmetries and matter content. Multicomponent dark matter arises when N is not prime and Z N contains one or more subgroups. The dark sector interacts with the visible sector through the renormalizable kinetic mixing and Higgs portal operators, and we highlight the basic phenomenology in these scenarios. In particular, multiple species of dark matter can lead to an unconventional nuclear recoil spectrum in direct detection experiments, while the presence of new light states in the dark sector can dramatically affect the decays of the Higgs at the Tevatron and LHC, thus providing a window into the gauge origin of the stability of dark matter.
Noyes, H.P.; Starson, S.
1991-03-01
Discrete physics, because it replaces time evolution generated by the energy operator with a global bit-string generator (program universe) and replaces ''fields'' with the relativistic Wheeler-Feynman ''action at a distance,'' allows the consistent formulation of the concept of signed gravitational charge for massive particles. The resulting prediction made by this version of the theory is that free anti-particles near the surface of the earth will ''fall'' up with the same acceleration that the corresponding particles fall down. So far as we can see, no current experimental information is in conflict with this prediction of our theory. The experiment crusis will be one of the anti-proton or anti-hydrogen experiments at CERN. Our prediction should be much easier to test than the small effects which those experiments are currently designed to detect or bound. 23 refs
Discretization analysis of bifurcation based nonlinear amplifiers
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.
A new discrete dipole kernel for quantitative susceptibility mapping.
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.
Control of Discrete Event Systems
Smedinga, Rein
1989-01-01
Systemen met discrete gebeurtenissen spelen in vele gebieden een rol. In dit proefschrift staat de volgorde van gebeurtenissen centraal en worden tijdsaspecten buiten beschouwing gelaten. In dat geval kunnen systemen met discrete gebeurtenissen goed worden gemodelleerd door gebruik te maken van
Discrete Mathematics and Its Applications
Oxley, Alan
2010-01-01
The article gives ideas that lecturers of undergraduate Discrete Mathematics courses can use in order to make the subject more interesting for students and encourage them to undertake further studies in the subject. It is possible to teach Discrete Mathematics with little or no reference to computing. However, students are more likely to be…
Discrete Mathematics and Curriculum Reform.
Kenney, Margaret J.
1996-01-01
Defines discrete mathematics as the mathematics necessary to effect reasoned decision making in finite situations and explains how its use supports the current view of mathematics education. Discrete mathematics can be used by curriculum developers to improve the curriculum for students of all ages and abilities. (SLD)
Connections on discrete fibre bundles
Manton, N.S.; Cambridge Univ.
1987-01-01
A new approach to gauge fields on a discrete space-time is proposed, in which the fundamental object is a discrete version of a principal fibre bundle. If the bundle is twisted, the gauge fields are topologically non-trivial automatically. (orig.)
Discrete dynamics versus analytic dynamics
Toxværd, Søren
2014-01-01
For discrete classical Molecular dynamics obtained by the “Verlet” algorithm (VA) with the time increment h there exists a shadow Hamiltonian H˜ with energy E˜(h) , for which the discrete particle positions lie on the analytic trajectories for H˜ . Here, we proof that there, independent...... of such an analytic analogy, exists an exact hidden energy invariance E * for VA dynamics. The fact that the discrete VA dynamics has the same invariances as Newtonian dynamics raises the question, which of the formulations that are correct, or alternatively, the most appropriate formulation of classical dynamics....... In this context the relation between the discrete VA dynamics and the (general) discrete dynamics investigated by Lee [Phys. Lett. B122, 217 (1983)] is presented and discussed....
Modern approaches to discrete curvature
Romon, Pascal
2017-01-01
This book provides a valuable glimpse into discrete curvature, a rich new field of research which blends discrete mathematics, differential geometry, probability and computer graphics. It includes a vast collection of ideas and tools which will offer something new to all interested readers. Discrete geometry has arisen as much as a theoretical development as in response to unforeseen challenges coming from applications. Discrete and continuous geometries have turned out to be intimately connected. Discrete curvature is the key concept connecting them through many bridges in numerous fields: metric spaces, Riemannian and Euclidean geometries, geometric measure theory, topology, partial differential equations, calculus of variations, gradient flows, asymptotic analysis, probability, harmonic analysis, graph theory, etc. In spite of its crucial importance both in theoretical mathematics and in applications, up to now, almost no books have provided a coherent outlook on this emerging field.
Discretion and Disproportionality
Jason A. Grissom
2015-12-01
Full Text Available Students of color are underrepresented in gifted programs relative to White students, but the reasons for this underrepresentation are poorly understood. We investigate the predictors of gifted assignment using nationally representative, longitudinal data on elementary students. We document that even among students with high standardized test scores, Black students are less likely to be assigned to gifted services in both math and reading, a pattern that persists when controlling for other background factors, such as health and socioeconomic status, and characteristics of classrooms and schools. We then investigate the role of teacher discretion, leveraging research from political science suggesting that clients of government services from traditionally underrepresented groups benefit from diversity in the providers of those services, including teachers. Even after conditioning on test scores and other factors, Black students indeed are referred to gifted programs, particularly in reading, at significantly lower rates when taught by non-Black teachers, a concerning result given the relatively low incidence of assignment to own-race teachers among Black students.
Vlad, Valentin I.; Ionescu-Pallas, Nicholas
2000-10-01
The Planck radiation spectrum of ideal cubic and spherical cavities, in the region of small adiabatic invariance, γ = TV 1/3 , is shown to be discrete and strongly dependent on the cavity geometry and temperature. This behavior is the consequence of the random distribution of the state weights in the cubic cavity and of the random overlapping of the successive multiplet components, for the spherical cavity. The total energy (obtained by summing up the exact contributions of the eigenvalues and their weights, for low values of the adiabatic invariance) does not obey any longer Stefan-Boltzmann law. The new law includes a corrective factor depending on γ and imposes a faster decrease of the total energy to zero, for γ → 0. We have defined the double quantized regime both for cubic and spherical cavities by the superior and inferior limits put on the principal quantum numbers or the adiabatic invariance. The total energy of the double quantized cavities shows large differences from the classical calculations over unexpected large intervals, which are measurable and put in evidence important macroscopic quantum effects. (author)
a pyramid algorithm for the haar discrete wavelet packet transform
PROF EKWUEME
GLOBAL JOURNAL OF PURE AND APPLIED SCIENCES VOL. 20, 2014: ..... In moving from Level 1 to Level 2 of Fig.2, the mathematical operations just described are repeated but now the .... Banks, Wellesley-Cambridge Press, Welleysley.
Discrete Wavelet Transform-Partial Least Squares Versus Derivative ...
DWT-PLS method was successfully applied for the analysis of raw materials and the dosage form. For. DD1 method ... from each stock standard solutions separately in. 250 mL ..... good agreement with the data indicated in the formulations ...
Riccati transformations and principal solutions of discrete linear systems
Ahlbrandt, C.D.; Hooker, J.W.
1984-01-01
Consider a second-order linear matrix difference equation. A definition of principal and anti-principal, or recessive and dominant, solutions of the equation are given and the existence of principal and anti-principal solutions and the essential uniqueness of principal solutions is proven
Stevens, G.F.; Wood, R.W.; Pryzbylski, J.
1968-09-01
Burnout results are given for an annular test section 12ft long and having an inner heated rod 0.625 in diameter, and an outer unheated tube of 0.825in bore. In one case the rod was uniformly heated and in the other case the rod was given a symmetrical chopped cosine heat flux profile. The Freon data is shown to compare well with equivalent water data using an established scaling technique; this applied both to burnout power and to burnout position. The comparison is made at pressures of 1000 psia and 750 psia water equivalent and the same scaling factors are shown to work at both pressures. (author)
Lee, Sungman; Kim, Jongyul; Moon, Myung Kook; Lee, Kye Hong; Lee, Seung Wook; Ino, Takashi; Skoy, Vadim R.; Lee, Manwoo; Kim, Guinyun
2013-02-01
For use as a neutron spin polarizer or analyzer in the neutron beam lines of the HANARO (High-flux Advanced Neutron Application ReactOr) nuclear research reactor, a 3He polarizer was designed based on both a compact solenoid coil and a VBG (volume Bragg grating) diode laser with a narrow spectral linewidth of 25 GHz. The nuclear magnetic resonance (NMR) signal was measured and analyzed using both a built-in cosine radio-frequency (RF) coil and a pick-up coil. Using a neutron transmission measurement, we estimated the polarization ratio of the 3He cell as 18% for an optical pumping time of 8 hours.
An optical Fourier transform coprocessor with direct phase determination.
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.
Perfect discretization of path integrals
Steinhaus, Sebastian
2012-01-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.
Perfect discretization of path integrals
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.
The origin of discrete particles
Bastin, T
2009-01-01
This book is a unique summary of the results of a long research project undertaken by the authors on discreteness in modern physics. In contrast with the usual expectation that discreteness is the result of mathematical tools for insertion into a continuous theory, this more basic treatment builds up the world from the discrimination of discrete entities. This gives an algebraic structure in which certain fixed numbers arise. As such, one agrees with the measured value of the fine-structure constant to one part in 10,000,000 (10 7 ). Sample Chapter(s). Foreword (56 KB). Chapter 1: Introduction
Dora M Ballesteros
2012-04-01
Full Text Available This paper presents FPGA design of ECG compression by using the Discrete Wavelet Transform (DWT and one lossless encoding method. Unlike the classical works based on off-line mode, the current work allows the real-time processing of the ECG signal to reduce the redundant information. A model is developed for a fixed-point convolution scheme which has a good performance in relation to the throughput, the latency, the maximum frequency of operation and the quality of the compressed signal. The quantization of the coefficients of the filters and the selected fixed-threshold give a low error in relation to clinical applications.Este documento presenta el diseño basado en FPGA para la compresión de señales ECG utilizando la Transformada Wavelet Discreta y un método de codificación sin pérdida de información. A diferencia de los trabajos clásicos para modo off-line, el trabajo actual permite la compresión en tiempo real de la señal ECG por medio de la reducción de la información redundante. Se propone un modelo para el esquema de convolución en formato punto fijo, el cual tiene buen desempeño en relación a la tasa de salida, la latencia del sistema, la máxima frecuencia de operación y la calidad de la señal comprimida. La arquitectura propuesta, la cuantización utilizada y el método de codificación proporcionan un PRD que es apto para el análisis clínico.
Synchronization Techniques in Parallel Discrete Event Simulation
Lindén, Jonatan
2018-01-01
Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the performance of large-scale discrete event simulations, several techniques to parallelize discrete event simulation have been developed. In parallel discrete event simulation, the work of a single discrete event simulation is distributed over multiple processing elements. A key challenge in parallel discrete event simulation is to ensure that causally dependent ...
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.
Exact analysis of discrete data
Hirji, Karim F
2005-01-01
Researchers in fields ranging from biology and medicine to the social sciences, law, and economics regularly encounter variables that are discrete or categorical in nature. While there is no dearth of books on the analysis and interpretation of such data, these generally focus on large sample methods. When sample sizes are not large or the data are otherwise sparse, exact methods--methods not based on asymptotic theory--are more accurate and therefore preferable.This book introduces the statistical theory, analysis methods, and computation techniques for exact analysis of discrete data. After reviewing the relevant discrete distributions, the author develops the exact methods from the ground up in a conceptually integrated manner. The topics covered range from univariate discrete data analysis, a single and several 2 x 2 tables, a single and several 2 x K tables, incidence density and inverse sampling designs, unmatched and matched case -control studies, paired binary and trinomial response models, and Markov...
Discrete geometric structures for architecture
Pottmann, Helmut
2010-01-01
. The talk will provide an overview of recent progress in this field, with a particular focus on discrete geometric structures. Most of these result from practical requirements on segmenting a freeform shape into planar panels and on the physical realization
Causal Dynamics of Discrete Surfaces
Pablo Arrighi
2014-03-01
Full Text Available We formalize the intuitive idea of a labelled discrete surface which evolves in time, subject to two natural constraints: the evolution does not propagate information too fast; and it acts everywhere the same.
Influence of discretization method on the digital control system performance
Futás József
2003-12-01
Full Text Available The design of control system can be divided into two steps. First the process or plant have to be convert into mathematical model form, so that its behavior can be analyzed. Then an appropriate controller have to be design in order to get the desired response of the controlled system. In the continuous time domain the system is represented by differential equations. Replacing a continuous system into discrete time form is always an approximation of the continuous system. The different discretization methods give different digital controller performance. The methods presented on the paper are Step Invariant or Zero Order Hold (ZOH Method, Matched Pole-Zero Method, Backward difference Method and Bilinear transformation. The above mentioned discretization methods are used in developing PI position controller of a dc motor. The motor model was converted by the ZOH method. The performances of the different methods are compared and the results are presented.
Perfect discretization of path integrals
Steinhaus, Sebastian
2011-01-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 discu...
High voltage isolation transformer
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.
Alfa, Attahiru S
2016-01-01
This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are includ...
Leptonic Dirac CP violation predictions from residual discrete symmetries
I. Girardi
2016-01-01
Full Text Available Assuming that the observed pattern of 3-neutrino mixing is related to the existence of a (lepton flavour symmetry, corresponding to a non-Abelian discrete symmetry group Gf, and that Gf is broken to specific residual symmetries Ge and Gν of the charged lepton and neutrino mass terms, we derive sum rules for the cosine of the Dirac phase δ of the neutrino mixing matrix U. The residual symmetries considered are: i Ge=Z2 and Gν=Zn, n>2 or Zn×Zm, n,m≥2; ii Ge=Zn, n>2 or Zn×Zm, n,m≥2 and Gν=Z2; iii Ge=Z2 and Gν=Z2; iv Ge is fully broken and Gν=Zn, n>2 or Zn×Zm, n,m≥2; and v Ge=Zn, n>2 or Zn×Zm, n,m≥2 and Gν is fully broken. For given Ge and Gν, the sum rules for cosδ thus derived are exact, within the approach employed, and are valid, in particular, for any Gf containing Ge and Gν as subgroups. We identify the cases when the value of cosδ cannot be determined, or cannot be uniquely determined, without making additional assumptions on unconstrained parameters. In a large class of cases considered the value of cosδ can be unambiguously predicted once the flavour symmetry Gf is fixed. We present predictions for cosδ in these cases for the flavour symmetry groups Gf=S4, A4, T′ and A5, requiring that the measured values of the 3-neutrino mixing parameters sin2θ12, sin2θ13 and sin2θ23, taking into account their respective 3σ uncertainties, are successfully reproduced.
Discretization and Numerical Solution of a Plane Problem in the Mechanics of Interfacial Cracks
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
Discrete computational mechanics for stiff phenomena
Michels, Dominik L.
2016-11-28
Many natural phenomena which occur in the realm of visual computing and computational physics, like the dynamics of cloth, fibers, fluids, and solids as well as collision scenarios are described by stiff Hamiltonian equations of motion, i.e. differential equations whose solution spectra simultaneously contain extremely high and low frequencies. This usually impedes the development of physically accurate and at the same time efficient integration algorithms. We present a straightforward computationally oriented introduction to advanced concepts from classical mechanics. We provide an easy to understand step-by-step introduction from variational principles over the Euler-Lagrange formalism and the Legendre transformation to Hamiltonian mechanics. Based on such solid theoretical foundations, we study the underlying geometric structure of Hamiltonian systems as well as their discrete counterparts in order to develop sophisticated structure preserving integration algorithms to efficiently perform high fidelity simulations.
Wang, Victor C. X.; Cranton, Patricia
2011-01-01
The theory of transformative learning has been explored by different theorists and scholars. However, few scholars have made an attempt to make a comparison between transformative learning and Confucianism or between transformative learning and andragogy. The authors of this article address these comparisons to develop new and different insights…
Discrete Curvature Theories and Applications
Sun, Xiang
2016-08-25
Discrete Di erential Geometry (DDG) concerns discrete counterparts of notions and methods in di erential geometry. This thesis deals with a core subject in DDG, discrete curvature theories on various types of polyhedral surfaces that are practically important for free-form architecture, sunlight-redirecting shading systems, and face recognition. Modeled as polyhedral surfaces, the shapes of free-form structures may have to satisfy di erent geometric or physical constraints. We study a combination of geometry and physics { the discrete surfaces that can stand on their own, as well as having proper shapes for the manufacture. These proper shapes, known as circular and conical meshes, are closely related to discrete principal curvatures. We study curvature theories that make such surfaces possible. Shading systems of freeform building skins are new types of energy-saving structures that can re-direct the sunlight. From these systems, discrete line congruences across polyhedral surfaces can be abstracted. We develop a new curvature theory for polyhedral surfaces equipped with normal congruences { a particular type of congruences de ned by linear interpolation of vertex normals. The main results are a discussion of various de nitions of normality, a detailed study of the geometry of such congruences, and a concept of curvatures and shape operators associated with the faces of a triangle mesh. These curvatures are compatible with both normal congruences and the Steiner formula. In addition to architecture, we consider the role of discrete curvatures in face recognition. We use geometric measure theory to introduce the notion of asymptotic cones associated with a singular subspace of a Riemannian manifold, which is an extension of the classical notion of asymptotic directions. We get a simple expression of these cones for polyhedral surfaces, as well as convergence and approximation theorems. We use the asymptotic cones as facial descriptors and demonstrate the
Quasicanonical structure of optimal control in constrained discrete systems
Sieniutycz, S.
2003-06-01
This paper considers discrete processes governed by difference rather than differential equations for the state transformation. The basic question asked is if and when Hamiltonian canonical structures are possible in optimal discrete systems. Considering constrained discrete control, general optimization algorithms are derived that constitute suitable theoretical and computational tools when evaluating extremum properties of constrained physical models. The mathematical basis of the general theory is the Bellman method of dynamic programming (DP) and its extension in the form of the so-called Carathéodory-Boltyanski (CB) stage criterion which allows a variation of the terminal state that is otherwise fixed in the Bellman's method. Two relatively unknown, powerful optimization algorithms are obtained: an unconventional discrete formalism of optimization based on a Hamiltonian for multistage systems with unconstrained intervals of holdup time, and the time interval constrained extension of the formalism. These results are general; namely, one arrives at: the discrete canonical Hamilton equations, maximum principles, and (at the continuous limit of processes with free intervals of time) the classical Hamilton-Jacobi theory along with all basic results of variational calculus. Vast spectrum of applications of the theory is briefly discussed.
Discrete symmetries in the Weyl expansion for quantum billiards
Pavloff, N.
1994-01-01
2 and 3 dimensional quantum billiards with discrete symmetries are considered. The boundary condition is either Dirichlet or Neumann. The first terms of the Weyl expansion are derived for the level density projected onto the irreducible representations of the symmetry group. The formulae require only the knowledge of the character table of the group and the geometrical properties (such as surface, perimeter etc.) of sub-parts of the billiard invariant under a group transformation. (author). 17 refs., 1 fig., 1 tab
Discrete systems related to the sixth Painleve equation
Ramani, A; Ohta, Y; Grammaticos, B
2006-01-01
We present discrete Painleve equations which can be obtained as contiguity relations of the solutions of the continuous Painleve VI. The derivation is based on the geometry of the affine Weyl group D (1) 4 associated with the bilinear formalism. As an offshoot we also present the contiguity relations of the solutions of the Bureau-Ablowitz-Fokas equation, which is a Miura transformed, 'modified', P VI
Discrete transparent boundary conditions for Schroedinger-type equations
Schmidt, F.; Yevick, D.
1997-01-01
We present a general technique for constructing nonlocal transparent boundary conditions for one-dimensional Schroedinger-type equations. Our method supplies boundary conditions for the θ-family of implicit one-step discretizations of Schroedinger's equation in time. The use of Mikusinski's operator approach in time avoids direct and inverse transforms between time and frequency domains and thus implements the boundary conditions in a direct manner. 14 refs., 9 figs
Backlund transformations as canonical transformations
Villani, A.; Zimerman, A.H.
1977-01-01
Toda and Wadati as well as Kodama and Wadati have shown that the Backlund transformations, for the exponential lattice equation, sine-Gordon equation, K-dV (Korteweg de Vries) equation and modifies K-dV equation, are canonical transformation. It is shown that the Backlund transformation for the Boussinesq equation, for a generalized K-dV equation, for a model equation for shallow water waves and for the nonlinear Schroedinger equation are also canonical transformations [pt
The continous Legendre transform, its inverse transform, and applications
P. L. Butzer
1980-01-01
Full Text Available This paper is concerned with the continuous Legendre transform, derived from the classical discrete Legendre transform by replacing the Legendre polynomial Pk(x by the function Pλ(x with λ real. Another approach to T.M. MacRobert's inversion formula is found; for this purpose an inverse Legendre transform, mapping L1(ℝ+ into L2(−1,1, is defined. Its inversion in turn is naturally achieved by the continuous Legendre transform. One application is devoted to the Shannon sampling theorem in the Legendre frame together with a new type of error estimate. The other deals with a new representation of Legendre functions giving information about their behaviour near the point x=−1.
Special relativity with a discrete spectrum of singular velocities
Gonzales Gascon, F.
1977-01-01
The introduction of real transformation formulae containing a whole discrete spectrum of singularities is suggested. Some phenomenological hypotheses are introduced and the group property is substituted by weaker conditions. The first singular speed (c 1 =c) is invariant with respect to the measures of it from subluminal frames, but the remaining speeds are not invariant. The proposed transformations do not form a closed set (for the superluminal speeds) and, therefore, the problem of having (within this framework) a principle of relativity valid for any velocity remains open
Analysis of Discrete Mittag - Leffler Functions
N. Shobanadevi
2015-03-01
Full Text Available Discrete Mittag - Leffler functions play a major role in the development of the theory of discrete fractional calculus. In the present article, we analyze qualitative properties of discrete Mittag - Leffler functions and establish sufficient conditions for convergence, oscillation and summability of the infinite series associated with discrete Mittag - Leffler functions.
Discrete differential geometry. Consistency as integrability
Bobenko, Alexander I.; Suris, Yuri B.
2005-01-01
A new field of discrete differential geometry is presently emerging on the border between differential and discrete geometry. Whereas classical differential geometry investigates smooth geometric shapes (such as surfaces), and discrete geometry studies geometric shapes with finite number of elements (such as polyhedra), the discrete differential geometry aims at the development of discrete equivalents of notions and methods of smooth surface theory. Current interest in this field derives not ...
Integrable structure in discrete shell membrane theory.
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.