A simple and efficient algorithm operating with linear time for MCEEG data compression.

PubMed

Titus, Geevarghese; Sudhakar, M S

2017-09-01

Popularisation of electroencephalograph (EEG) signals in diversified fields have increased the need for devices capable of operating at lower power and storage requirements. This has led to a great deal of research in data compression, that can address (a) low latency in the coding of the signal, (b) reduced hardware and software dependencies, (c) quantify the system anomalies, and (d) effectively reconstruct the compressed signal. This paper proposes a computationally simple and novel coding scheme named spatial pseudo codec (SPC), to achieve lossy to near lossless compression of multichannel EEG (MCEEG). In the proposed system, MCEEG signals are initially normalized, followed by two parallel processes: one operating on integer part and the other, on fractional part of the normalized data. The redundancies in integer part are exploited using spatial domain encoder, and the fractional part is coded as pseudo integers. The proposed method has been tested on a wide range of databases having variable sampling rates and resolutions. Results indicate that the algorithm has a good recovery performance with an average percentage root mean square deviation (PRD) of 2.72 for an average compression ratio (CR) of 3.16. Furthermore, the algorithm has a complexity of only O(n) with an average encoding and decoding time per sample of 0.3 ms and 0.04 ms respectively. The performance of the algorithm is comparable with recent methods like fast discrete cosine transform (fDCT) and tensor decomposition methods. The results validated the feasibility of the proposed compression scheme for practical MCEEG recording, archiving and brain computer interfacing systems.

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

PubMed

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

2014-01-01

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

The whole number axis integer linear transformation reversible information hiding algorithm on wavelet domain

NASA Astrophysics Data System (ADS)

Jiang, Zhuo; Xie, Chengjun

2013-12-01

This paper improved the algorithm of reversible integer linear transform on finite interval [0,255], which can realize reversible integer linear transform in whole number axis shielding data LSB (least significant bit). Firstly, this method use integer wavelet transformation based on lifting scheme to transform the original image, and select the transformed high frequency areas as information hiding area, meanwhile transform the high frequency coefficients blocks in integer linear way and embed the secret information in LSB of each coefficient, then information hiding by embedding the opposite steps. To extract data bits and recover the host image, a similar reverse procedure can be conducted, and the original host image can be lossless recovered. The simulation experimental results show that this method has good secrecy and concealment, after conducted the CDF (m, n) and DD (m, n) series of wavelet transformed. This method can be applied to information security domain, such as medicine, law and military.

Optimal block cosine transform image coding for noisy channels

NASA Technical Reports Server (NTRS)

Vaishampayan, V.; Farvardin, N.

1986-01-01

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

Discrete cosine and sine transforms generalized to honeycomb lattice

NASA Astrophysics Data System (ADS)

Hrivnák, Jiří; Motlochová, Lenka

2018-06-01

The discrete cosine and sine transforms are generalized to a triangular fragment of the honeycomb lattice. The honeycomb point sets are constructed by subtracting the root lattice from the weight lattice points of the crystallographic root system A2. The two-variable orbit functions of the Weyl group of A2, discretized simultaneously on the weight and root lattices, induce a novel parametric family of extended Weyl orbit functions. The periodicity and von Neumann and Dirichlet boundary properties of the extended Weyl orbit functions are detailed. Three types of discrete complex Fourier-Weyl transforms and real-valued Hartley-Weyl transforms are described. Unitary transform matrices and interpolating behavior of the discrete transforms are exemplified. Consequences of the developed discrete transforms for transversal eigenvibrations of the mechanical graphene model are discussed.

Integers as Transformations.

ERIC Educational Resources Information Center

Thompson, Patrick W.; Dreyfus, Tommy

1988-01-01

Investigates whether elementary school students can construct operations of thought for integers and integer addition crucial for understanding elementary algebra. Two sixth graders were taught using a computer. Results included both students being able to construct mental operations for negating arbitrary integers and determining sign and…

Qualitative and semiquantitative Fourier transformation using a noncoherent system.

PubMed

Rogers, G L

1979-09-15

A number of authors have pointed out that a system of zone plates combined with a diffuse source, transparent input, lens, and focusing screen will display on the output screen the Fourier transform of the input. Strictly speaking, the transform normally displayed is the cosine transform, and the bipolar output is superimposed on a dc gray level to give a positive-only intensity variation. By phase-shifting one zone plate the sine transform is obtained. Temporal modulation is possible. It is also possible to redesign the system to accept a diffusely reflecting input at the cost of introducing a phase gradient in the output. Results are given of the sine and cosine transforms of a small circular aperture. As expected, the sine transform is a uniform gray. Both transforms show unwanted artifacts beyond 0.1 rad off-axis. An analysis shows this is due to unwanted circularly symmetrical moire patterns between the zone plates.

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

NASA Technical Reports Server (NTRS)

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

1986-01-01

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

Removing tidal-period variations from time-series data using low-pass digital filters

USGS Publications Warehouse

Walters, Roy A.; Heston, Cynthia

1982-01-01

Several low-pass, digital filters are examined for their ability to remove tidal Period Variations from a time-series of water surface elevation for San Francisco Bay. The most efficient filter is the one which is applied to the Fourier coefficients of the transformed data, and the filtered data recovered through an inverse transform. The ability of the filters to remove the tidal components increased in the following order: 1) cosine-Lanczos filter, 2) cosine-Lanczos squared filter; 3) Godin filter; and 4) a transform fitter. The Godin fitter is not sufficiently sharp to prevent severe attenuation of 2–3 day variations in surface elevation resulting from weather events.

Choice of word length in the design of a specialized hardware for lossless wavelet compression of medical images

NASA Astrophysics Data System (ADS)

Urriza, Isidro; Barragan, Luis A.; Artigas, Jose I.; Garcia, Jose I.; Navarro, Denis

1997-11-01

Image compression plays an important role in the archiving and transmission of medical images. Discrete cosine transform (DCT)-based compression methods are not suitable for medical images because of block-like image artifacts that could mask or be mistaken for pathology. Wavelet transforms (WTs) are used to overcome this problem. When implementing WTs in hardware, finite precision arithmetic introduces quantization errors. However, lossless compression is usually required in the medical image field. Thus, the hardware designer must look for the optimum register length that, while ensuring the lossless accuracy criteria, will also lead to a high-speed implementation with small chip area. In addition, wavelet choice is a critical issue that affects image quality as well as system design. We analyze the filters best suited to image compression that appear in the literature. For them, we obtain the maximum quantization errors produced in the calculation of the WT components. Thus, we deduce the minimum word length required for the reconstructed image to be numerically identical to the original image. The theoretical results are compared with experimental results obtained from algorithm simulations on random test images. These results enable us to compare the hardware implementation cost of the different filter banks. Moreover, to reduce the word length, we have analyzed the case of increasing the integer part of the numbers while maintaining constant the word length when the scale increases.

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

NASA Astrophysics Data System (ADS)

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

2018-07-01

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

Analysis of nulling phase functions suitable to image plane coronagraphy

NASA Astrophysics Data System (ADS)

Hénault, François; Carlotti, Alexis; Vérinaud, Christophe

2016-07-01

Coronagraphy is a very efficient technique for identifying and characterizing extra-solar planets orbiting in the habitable zone of their parent star, especially in a space environment. An important family of coronagraphs is actually based on phase plates located at an intermediate image plane of the optical system, and spreading the starlight outside the "Lyot" exit pupil plane of the instrument. In this commutation we present a set of candidate phase functions generating a central null at the Lyot plane, and study how it propagates to the image plane of the coronagraph. These functions include linear azimuthal phase ramps (the well-known optical vortex), azimuthally cosine-modulated phase profiles, and circular phase gratings. Nnumerical simulations of the expected null depth, inner working angle, sensitivity to pointing errors, effect of central obscuration located at the pupil or image planes, and effective throughput including image mask and Lyot stop transmissions are presented and discussed. The preliminary conclusion is that azimuthal cosine functions appear as an interesting alternative to the classical optical vortex of integer topological charge.

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

PubMed

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

2012-08-01

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

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

Balsa Terzic, Gabriele Bassi

In this paper we discuss representations of charge particle densities in particle-in-cell (PIC) simulations, analyze the sources and profiles of the intrinsic numerical noise, and present efficient methods for their removal. We devise two alternative estimation methods for charged particle distribution which represent significant improvement over the Monte Carlo cosine expansion used in the 2d code of Bassi, designed to simulate coherent synchrotron radiation (CSR) in charged particle beams. The improvement is achieved by employing an alternative beam density estimation to the Monte Carlo cosine expansion. The representation is first binned onto a finite grid, after which two grid-based methodsmore » are employed to approximate particle distributions: (i) truncated fast cosine transform (TFCT); and (ii) thresholded wavelet transform (TWT). We demonstrate that these alternative methods represent a staggering upgrade over the original Monte Carlo cosine expansion in terms of efficiency, while the TWT approximation also provides an appreciable improvement in accuracy. The improvement in accuracy comes from a judicious removal of the numerical noise enabled by the wavelet formulation. The TWT method is then integrated into Bassi's CSR code, and benchmarked against the original version. We show that the new density estimation method provides a superior performance in terms of efficiency and spatial resolution, thus enabling high-fidelity simulations of CSR effects, including microbunching instability.« less

A fast complex integer convolution using a hybrid transform

NASA Technical Reports Server (NTRS)

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

1978-01-01

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

Determination of Fourier Transforms on an Instructional Analog Computer

ERIC Educational Resources Information Center

Anderson, Owen T.; Greenwood, Stephen R.

1974-01-01

An analog computer program to find and display the Fourier transform of some real, even functions is described. Oscilloscope traces are shown for Fourier transforms of a rectangular pulse, a Gaussian, a cosine wave, and a delayed narrow pulse. Instructional uses of the program are discussed briefly. (DT)

Fast and secure encryption-decryption method based on chaotic dynamics

DOEpatents

Protopopescu, Vladimir A.; Santoro, Robert T.; Tolliver, Johnny S.

1995-01-01

A method and system for the secure encryption of information. The method comprises the steps of dividing a message of length L into its character components; generating m chaotic iterates from m independent chaotic maps; producing an "initial" value based upon the m chaotic iterates; transforming the "initial" value to create a pseudo-random integer; repeating the steps of generating, producing and transforming until a pseudo-random integer sequence of length L is created; and encrypting the message as ciphertext based upon the pseudo random integer sequence. A system for accomplishing the invention is also provided.

Down-Regulation of Olfactory Receptors in Response to Traumatic Brain Injury Promotes Risk for Alzheimers Disease

DTIC Science & Technology

2015-12-01

group assignment of samples in unsupervised hierarchical clustering by the Unweighted Pair-Group Method using Arithmetic averages ( UPGMA ) based on...log2 transformed MAS5.0 signal values; probe set clustering was performed by the UPGMA method using Cosine correlation as the similarity met- ric. For...differentially-regulated genes identified were subjected to unsupervised hierarchical clustering analysis using the UPGMA algorithm with cosine correlation as

Designing for Compressive Sensing: Compressive Art, Camouflage, Fonts, and Quick Response Codes

DTIC Science & Technology

2018-01-01

an example where the signal is non-sparse in the standard basis, but sparse in the discrete cosine basis . The top plot shows the signal from the...previous example, now used as sparse discrete cosine transform (DCT) coefficients . The next plot shows the non-sparse signal in the standard...Romberg JK, Tao T. Stable signal recovery from incomplete and inaccurate measurements. Commun Pure Appl Math . 2006;59(8):1207–1223. 3. Donoho DL

Discrete Cosine Transform Image Coding With Sliding Block Codes

NASA Astrophysics Data System (ADS)

Divakaran, Ajay; Pearlman, William A.

1989-11-01

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

Vesicle sizing by static light scattering: a Fourier cosine transform approach

NASA Astrophysics Data System (ADS)

Wang, Jianhong; Hallett, F. Ross

1995-08-01

A Fourier cosine transform method, based on the Rayleigh-Gans-Debye thin-shell approximation, was developed to retrieve vesicle size distribution directly from the angular dependence of scattered light intensity. Its feasibility for real vesicles was partially tested on scattering data generated by the exact Mie solutions for isotropic vesicles. The noise tolerance of the method in recovering unimodal and biomodal distributions was studied with the simulated data. Applicability of this approach to vesicles with weak anisotropy was examined using Mie theory for anisotropic hollow spheres. A primitive theory about the first four moments of the radius distribution about the origin, excluding the mean radius, was obtained as an alternative to the direct retrieval of size distributions.

Testing Fixture For Microwave Integrated Circuits

NASA Technical Reports Server (NTRS)

Romanofsky, Robert; Shalkhauser, Kurt

1989-01-01

Testing fixture facilitates radio-frequency characterization of microwave and millimeter-wave integrated circuits. Includes base onto which two cosine-tapered ridge waveguide-to-microstrip transitions fastened. Length and profile of taper determined analytically to provide maximum bandwidth and minimum insertion loss. Each cosine taper provides transformation from high impedance of waveguide to characteristic impedance of microstrip. Used in conjunction with automatic network analyzer to provide user with deembedded scattering parameters of device under test. Operates from 26.5 to 40.0 GHz, but operation extends to much higher frequencies.

The fast decoding of Reed-Solomon codes using number theoretic transforms

NASA Technical Reports Server (NTRS)

Reed, I. S.; Welch, L. R.; Truong, T. K.

1976-01-01

It is shown that Reed-Solomon (RS) codes can be encoded and decoded by using a fast Fourier transform (FFT) algorithm over finite fields. The arithmetic utilized to perform these transforms requires only integer additions, circular shifts and a minimum number of integer multiplications. The computing time of this transform encoder-decoder for RS codes is less than the time of the standard method for RS codes. More generally, the field GF(q) is also considered, where q is a prime of the form K x 2 to the nth power + 1 and K and n are integers. GF(q) can be used to decode very long RS codes by an efficient FFT algorithm with an improvement in the number of symbols. It is shown that a radix-8 FFT algorithm over GF(q squared) can be utilized to encode and decode very long RS codes with a large number of symbols. For eight symbols in GF(q squared), this transform over GF(q squared) can be made simpler than any other known number theoretic transform with a similar capability. Of special interest is the decoding of a 16-tuple RS code with four errors.

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

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

Recognition of Activities of Daily Living Based on Environmental Analyses Using Audio Fingerprinting Techniques: A Systematic Review

PubMed Central

Santos, Rui; Pombo, Nuno; Flórez-Revuelta, Francisco

2018-01-01

An increase in the accuracy of identification of Activities of Daily Living (ADL) is very important for different goals of Enhanced Living Environments and for Ambient Assisted Living (AAL) tasks. This increase may be achieved through identification of the surrounding environment. Although this is usually used to identify the location, ADL recognition can be improved with the identification of the sound in that particular environment. This paper reviews audio fingerprinting techniques that can be used with the acoustic data acquired from mobile devices. A comprehensive literature search was conducted in order to identify relevant English language works aimed at the identification of the environment of ADLs using data acquired with mobile devices, published between 2002 and 2017. In total, 40 studies were analyzed and selected from 115 citations. The results highlight several audio fingerprinting techniques, including Modified discrete cosine transform (MDCT), Mel-frequency cepstrum coefficients (MFCC), Principal Component Analysis (PCA), Fast Fourier Transform (FFT), Gaussian mixture models (GMM), likelihood estimation, logarithmic moduled complex lapped transform (LMCLT), support vector machine (SVM), constant Q transform (CQT), symmetric pairwise boosting (SPB), Philips robust hash (PRH), linear discriminant analysis (LDA) and discrete cosine transform (DCT). PMID:29315232

Nonlinear oscillator with power-form elastic-term: Fourier series expansion of the exact solution

NASA Astrophysics Data System (ADS)

Beléndez, Augusto; Francés, Jorge; Beléndez, Tarsicio; Bleda, Sergio; Pascual, Carolina; Arribas, Enrique

2015-05-01

A family of conservative, truly nonlinear, oscillators with integer or non-integer order nonlinearity is considered. These oscillators have only one odd power-form elastic-term and exact expressions for their period and solution were found in terms of Gamma functions and a cosine-Ateb function, respectively. Only for a few values of the order of nonlinearity, is it possible to obtain the periodic solution in terms of more common functions. However, for this family of conservative truly nonlinear oscillators we show in this paper that it is possible to obtain the Fourier series expansion of the exact solution, even though this exact solution is unknown. The coefficients of the Fourier series expansion of the exact solution are obtained as an integral expression in which a regularized incomplete Beta function appears. These coefficients are a function of the order of nonlinearity only and are computed numerically. One application of this technique is to compare the amplitudes for the different harmonics of the solution obtained using approximate methods with the exact ones computed numerically as shown in this paper. As an example, the approximate amplitudes obtained via a modified Ritz method are compared with the exact ones computed numerically.

Information Hiding In Digital Video Using DCT, DWT and CvT

NASA Astrophysics Data System (ADS)

Abed Shukur, Wisam; Najah Abdullah, Wathiq; Kareem Qurban, Luheb

2018-05-01

The type of video that used in this proposed hiding a secret information technique is .AVI; the proposed technique of a data hiding to embed a secret information into video frames by using Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Curvelet Transform (CvT). An individual pixel consists of three color components (RGB), the secret information is embedded in Red (R) color channel. On the receiver side, the secret information is extracted from received video. After extracting secret information, robustness of proposed hiding a secret information technique is measured and obtained by computing the degradation of the extracted secret information by comparing it with the original secret information via calculating the Normalized cross Correlation (NC). The experiments shows the error ratio of the proposed technique is (8%) while accuracy ratio is (92%) when the Curvelet Transform (CvT) is used, but compared with Discrete Wavelet Transform (DWT) and Discrete Cosine Transform (DCT), the error rates are 11% and 14% respectively, while the accuracy ratios are (89%) and (86%) respectively. So, the experiments shows the Poisson noise gives better results than other types of noises, while the speckle noise gives worst results compared with other types of noises. The proposed technique has been established by using MATLAB R2016a programming language.

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

NASA Astrophysics Data System (ADS)

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

2017-02-01

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

Formalism for the solution of quadratic Hamiltonians with large cosine terms

NASA Astrophysics Data System (ADS)

Ganeshan, Sriram; Levin, Michael

2016-02-01

We consider quantum Hamiltonians of the form H =H0-U ∑jcos(Cj) , where H0 is a quadratic function of position and momentum variables {x1,p1,x2,p2,⋯} and the Cj's are linear in these variables. We allow H0 and Cj to be completely general with only two restrictions: we require that (1) the Cj's are linearly independent and (2) [Cj,Ck] is an integer multiple of 2 π i for all j ,k so that the different cosine terms commute with one another. Our main result is a recipe for solving these Hamiltonians and obtaining their exact low-energy spectrum in the limit U →∞ . This recipe involves constructing creation and annihilation operators and is similar in spirit to the procedure for diagonalizing quadratic Hamiltonians. In addition to our exact solution in the infinite U limit, we also discuss how to analyze these systems when U is large but finite. Our results are relevant to a number of different physical systems, but one of the most natural applications is to understanding the effects of electron scattering on quantum Hall edge modes. To demonstrate this application, we use our formalism to solve a toy model for a fractional quantum spin Hall edge with different types of impurities.

Polarization singularity indices in Gaussian laser beams

NASA Astrophysics Data System (ADS)

Freund, Isaac

2002-01-01

Two types of point singularities in the polarization of a paraxial Gaussian laser beam are discussed in detail. V-points, which are vector point singularities where the direction of the electric vector of a linearly polarized field becomes undefined, and C-points, which are elliptic point singularities where the ellipse orientations of elliptically polarized fields become undefined. Conventionally, V-points are characterized by the conserved integer valued Poincaré-Hopf index η, with generic value η=±1, while C-points are characterized by the conserved half-integer singularity index IC, with generic value IC=±1/2. Simple algorithms are given for generating V-points with arbitrary positive or negative integer indices, including zero, at arbitrary locations, and C-points with arbitrary positive or negative half-integer or integer indices, including zero, at arbitrary locations. Algorithms are also given for generating continuous lines of these singularities in the plane, V-lines and C-lines. V-points and C-points may be transformed one into another. A topological index based on directly measurable Stokes parameters is used to discuss this transformation. The evolution under propagation of V-points and C-points initially embedded in the beam waist is studied, as is the evolution of V-dipoles and C-dipoles.

Pure and Poetic: Butterfly in the Quantum World

NASA Astrophysics Data System (ADS)

Satija, Indubala

Story of the Hofstadter butterfly is a magical occurrence in a quantum flatland of two-dimensional crystals in a magnetic field. In this drama, the magnetic flux plays the role of Planck constant, linking the variables x and p in the butterfly Hamiltonian H = cosx + cosp as [ x , p ] = iℏ . It is a story of reunion of Descartes and Pythagoras and tale of this quantum fractal is related to Integral Apollonian gaskets. Integers rule the butterfly landscape as quantum numbers of Hall conductivity while irrational numbers emerge as the asymptotic magnification of these topological integers in the kaleidoscopic images of the butterfly. Simple variations of the above Hamiltonian generates a wide spectrum of physical phenomenon. For example, the Hamiltonian H = cosx + λcosp with the parameter λ ≠ 1 in its zero energy solution hides the critical point of a topological transition in a superconducting chain and thus barely misses the Majorana fermions. Another example is the Hamiltonian obtained by including terms like cos (x +/- p) which for flux half exhibits Dirac semi-metallic states in addition to all integer quantum Hall states corresponding to all possible solutions of the Diophantine equation for this value of the magnetic flux. In this analytically tractable model where the parameter λ varies periodically with time, the topological states are described by edge modes whose dispersion is given by a pure cosine function. Finally, nature has composed beautiful variations of the Hofstadter butterfly not only in systems such as Penrose and Kagame lattices and also in the relativistic colorful world of quarks and antiquarks.

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

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

Huang, Lei; Zuo, Chao; Idir, Mourad

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

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

DOE PAGES

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

2015-04-21

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

Cosine beamforming

NASA Astrophysics Data System (ADS)

Ruigrok, Elmer; Wapenaar, Kees

2014-05-01

In various application areas, e.g., seismology, astronomy and geodesy, arrays of sensors are used to characterize incoming wavefields due to distant sources. Beamforming is a general term for phased-adjusted summations over the different array elements, for untangling the directionality and elevation angle of the incoming waves. For characterizing noise sources, beamforming is conventionally applied with a temporal Fourier and a 2D spatial Fourier transform, possibly with additional weights. These transforms become aliased for higher frequencies and sparser array-element distributions. As a partial remedy, we derive a kernel for beamforming crosscorrelated data and call it cosine beamforming (CBF). By applying beamforming not directly to the data, but to crosscorrelated data, the sampling is effectively increased. We show that CBF, due to this better sampling, suffers less from aliasing and yields higher resolution than conventional beamforming. As a flip-side of the coin, the CBF output shows more smearing for spherical waves than conventional beamforming.

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

NASA Astrophysics Data System (ADS)

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

2017-11-01

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

A Method to Compute the Force Signature of a Body Impacting on a Linear Elastic Structure Using Fourier Analysis

DTIC Science & Technology

1982-09-17

FK * 1PK (2) The convolution of two transforms in time domain is the inverse transform of the product in frequency domain. Thus Rp(s) - Fgc() Ipg(*) (3...its inverse transform by: R,(r)- R,(a.)e’’ do. (5)2w In order to nuke use f a very accurate numerical method to ompute Fourier "ke and coil...taorm. When the inverse transform it tken by using Eq. (15), the cosine transform, because it converges faster than the sine transform refu-ft the

New density estimation methods for charged particle beams with applications to microbunching instability

NASA Astrophysics Data System (ADS)

Terzić, Balša; Bassi, Gabriele

2011-07-01

In this paper we discuss representations of charge particle densities in particle-in-cell simulations, analyze the sources and profiles of the intrinsic numerical noise, and present efficient methods for their removal. We devise two alternative estimation methods for charged particle distribution which represent significant improvement over the Monte Carlo cosine expansion used in the 2D code of Bassi et al. [G. Bassi, J. A. Ellison, K. Heinemann, and R. Warnock, Phys. Rev. ST Accel. Beams 12, 080704 (2009); PRABFM1098-440210.1103/PhysRevSTAB.12.080704G. Bassi and B. Terzić, in Proceedings of the 23rd Particle Accelerator Conference, Vancouver, Canada, 2009 (IEEE, Piscataway, NJ, 2009), TH5PFP043], designed to simulate coherent synchrotron radiation (CSR) in charged particle beams. The improvement is achieved by employing an alternative beam density estimation to the Monte Carlo cosine expansion. The representation is first binned onto a finite grid, after which two grid-based methods are employed to approximate particle distributions: (i) truncated fast cosine transform; and (ii) thresholded wavelet transform (TWT). We demonstrate that these alternative methods represent a staggering upgrade over the original Monte Carlo cosine expansion in terms of efficiency, while the TWT approximation also provides an appreciable improvement in accuracy. The improvement in accuracy comes from a judicious removal of the numerical noise enabled by the wavelet formulation. The TWT method is then integrated into the CSR code [G. Bassi, J. A. Ellison, K. Heinemann, and R. Warnock, Phys. Rev. ST Accel. Beams 12, 080704 (2009)PRABFM1098-440210.1103/PhysRevSTAB.12.080704], and benchmarked against the original version. We show that the new density estimation method provides a superior performance in terms of efficiency and spatial resolution, thus enabling high-fidelity simulations of CSR effects, including microbunching instability.

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

NASA Astrophysics Data System (ADS)

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

2015-09-01

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

Some operational tools for solving fractional and higher integer order differential equations: A survey on their mutual relations

NASA Astrophysics Data System (ADS)

Kiryakova, Virginia S.

2012-11-01

The Laplace Transform (LT) serves as a basis of the Operational Calculus (OC), widely explored by engineers and applied scientists in solving mathematical models for their practical needs. This transform is closely related to the exponential and trigonometric functions (exp, cos, sin) and to the classical differentiation and integration operators, reducing them to simple algebraic operations. Thus, the classical LT and the OC give useful tool to handle differential equations and systems with constant coefficients. Several generalizations of the LT have been introduced to allow solving, in a similar way, of differential equations with variable coefficients and of higher integer orders, as well as of fractional (arbitrary non-integer) orders. Note that fractional order mathematical models are recently widely used to describe better various systems and phenomena of the real world. This paper surveys briefly some of our results on classes of such integral transforms, that can be obtained from the LT by means of "transmutations" which are operators of the generalized fractional calculus (GFC). On the list of these Laplace-type integral transforms, we consider the Borel-Dzrbashjan, Meijer, Krätzel, Obrechkoff, generalized Obrechkoff (multi-index Borel-Dzrbashjan) transforms, etc. All of them are G- and H-integral transforms of convolutional type, having as kernels Meijer's G- or Fox's H-functions. Besides, some special functions (also being G- and H-functions), among them - the generalized Bessel-type and Mittag-Leffler (M-L) type functions, are generating Gel'fond-Leontiev (G-L) operators of generalized differentiation and integration, which happen to be also operators of GFC. Our integral transforms have operational properties analogous to those of the LT - they do algebrize the G-L generalized integrations and differentiations, and thus can serve for solving wide classes of differential equations with variable coefficients of arbitrary, including non-integer order. Throughout the survey, we illustrate the parallels in the relationships: Laplace type integral transforms - special functions as kernels - operators of generalized integration and differentiation generated by special functions - special functions as solutions of related differential equations. The role of the so-called Special Functions of Fractional Calculus is emphasized.

Reversible integer wavelet transform for blind image hiding method

PubMed Central

Bibi, Nargis; Mahmood, Zahid; Akram, Tallha; Naqvi, Syed Rameez

2017-01-01

In this article, a blind data hiding reversible methodology to embed the secret data for hiding purpose into cover image is proposed. The key advantage of this research work is to resolve the privacy and secrecy issues raised during the data transmission over the internet. Firstly, data is decomposed into sub-bands using the integer wavelets. For decomposition, the Fresnelet transform is utilized which encrypts the secret data by choosing a unique key parameter to construct a dummy pattern. The dummy pattern is then embedded into an approximated sub-band of the cover image. Our proposed method reveals high-capacity and great imperceptibility of the secret embedded data. With the utilization of family of integer wavelets, the proposed novel approach becomes more efficient for hiding and retrieving process. It retrieved the secret hidden data from the embedded data blindly, without the requirement of original cover image. PMID:28498855

[Similarity system theory to evaluate similarity of chromatographic fingerprints of traditional Chinese medicine].

PubMed

Liu, Yongsuo; Meng, Qinghua; Jiang, Shumin; Hu, Yuzhu

2005-03-01

The similarity evaluation of the fingerprints is one of the most important problems in the quality control of the traditional Chinese medicine (TCM). Similarity measures used to evaluate the similarity of the common peaks in the chromatogram of TCM have been discussed. Comparative studies were carried out among correlation coefficient, cosine of the angle and an improved extent similarity method using simulated data and experimental data. Correlation coefficient and cosine of the angle are not sensitive to the differences of the data set. They are still not sensitive to the differences of the data even after normalization. According to the similarity system theory, an improved extent similarity method was proposed. The improved extent similarity is more sensitive to the differences of the data sets than correlation coefficient and cosine of the angle. And the character of the data sets needs not to be changed compared with log-transformation. The improved extent similarity can be used to evaluate the similarity of the chromatographic fingerprints of TCM.

Natural convection heat transfer in an oscillating vertical cylinder

PubMed Central

Ali Shah, Nehad; Tassaddiq, Asifa; Mustapha, Norzieha; Kechil, Seripah Awang

2018-01-01

This paper studies the heat transfer analysis caused due to free convection in a vertically oscillating cylinder. Exact solutions are determined by applying the Laplace and finite Hankel transforms. Expressions for temperature distribution and velocity field corresponding to cosine and sine oscillations are obtained. The solutions that have been obtained for velocity are presented in the forms of transient and post-transient solutions. Moreover, these solutions satisfy both the governing differential equation and all imposed initial and boundary conditions. Numerical computations and graphical illustrations are used in order to study the effects of Prandtl and Grashof numbers on velocity and temperature for various times. The transient solutions for both cosine and sine oscillations are also computed in tables. It is found that, the transient solutions are of considerable interest up to the times t = 15 for cosine oscillations and t = 1.75 for sine oscillations. After these moments, the transient solutions can be neglected and, the fluid moves according with the post-transient solutions. PMID:29304161

Natural convection heat transfer in an oscillating vertical cylinder.

PubMed

Khan, Ilyas; Ali Shah, Nehad; Tassaddiq, Asifa; Mustapha, Norzieha; Kechil, Seripah Awang

2018-01-01

This paper studies the heat transfer analysis caused due to free convection in a vertically oscillating cylinder. Exact solutions are determined by applying the Laplace and finite Hankel transforms. Expressions for temperature distribution and velocity field corresponding to cosine and sine oscillations are obtained. The solutions that have been obtained for velocity are presented in the forms of transient and post-transient solutions. Moreover, these solutions satisfy both the governing differential equation and all imposed initial and boundary conditions. Numerical computations and graphical illustrations are used in order to study the effects of Prandtl and Grashof numbers on velocity and temperature for various times. The transient solutions for both cosine and sine oscillations are also computed in tables. It is found that, the transient solutions are of considerable interest up to the times t = 15 for cosine oscillations and t = 1.75 for sine oscillations. After these moments, the transient solutions can be neglected and, the fluid moves according with the post-transient solutions.

Area and power efficient DCT architecture for image compression

NASA Astrophysics Data System (ADS)

Dhandapani, Vaithiyanathan; Ramachandran, Seshasayanan

2014-12-01

The discrete cosine transform (DCT) is one of the major components in image and video compression systems. The final output of these systems is interpreted by the human visual system (HVS), which is not perfect. The limited perception of human visualization allows the algorithm to be numerically approximate rather than exact. In this paper, we propose a new matrix for discrete cosine transform. The proposed 8 × 8 transformation matrix contains only zeros and ones which requires only adders, thus avoiding the need for multiplication and shift operations. The new class of transform requires only 12 additions, which highly reduces the computational complexity and achieves a performance in image compression that is comparable to that of the existing approximated DCT. Another important aspect of the proposed transform is that it provides an efficient area and power optimization while implementing in hardware. To ensure the versatility of the proposal and to further evaluate the performance and correctness of the structure in terms of speed, area, and power consumption, the model is implemented on Xilinx Virtex 7 field programmable gate array (FPGA) device and synthesized with Cadence® RTL Compiler® using UMC 90 nm standard cell library. The analysis obtained from the implementation indicates that the proposed structure is superior to the existing approximation techniques with a 30% reduction in power and 12% reduction in area.

Comparative performance evaluation of transform coding in image pre-processing

NASA Astrophysics Data System (ADS)

Menon, Vignesh V.; NB, Harikrishnan; Narayanan, Gayathri; CK, Niveditha

2017-07-01

We are in the midst of a communication transmute which drives the development as largely as dissemination of pioneering communication systems with ever-increasing fidelity and resolution. Distinguishable researches have been appreciative in image processing techniques crazed by a growing thirst for faster and easier encoding, storage and transmission of visual information. In this paper, the researchers intend to throw light on many techniques which could be worn at the transmitter-end in order to ease the transmission and reconstruction of the images. The researchers investigate the performance of different image transform coding schemes used in pre-processing, their comparison, and effectiveness, the necessary and sufficient conditions, properties and complexity in implementation. Whimsical by prior advancements in image processing techniques, the researchers compare various contemporary image pre-processing frameworks- Compressed Sensing, Singular Value Decomposition, Integer Wavelet Transform on performance. The paper exposes the potential of Integer Wavelet transform to be an efficient pre-processing scheme.

Topology of surfaces for molecular Stark energy, alignment, and orientation generated by combined permanent and induced electric dipole interactions.

PubMed

Schmidt, Burkhard; Friedrich, Bretislav

2014-02-14

We show that combined permanent and induced electric dipole interactions of linear polar and polarizable molecules with collinear electric fields lead to a sui generis topology of the corresponding Stark energy surfaces and of other observables - such as alignment and orientation cosines - in the plane spanned by the permanent and induced dipole interaction parameters. We find that the loci of the intersections of the surfaces can be traced analytically and that the eigenstates as well as the number of their intersections can be characterized by a single integer index. The value of the index, distinctive for a particular ratio of the interaction parameters, brings out a close kinship with the eigenproperties obtained previously for a class of Stark states via the apparatus of supersymmetric quantum mechanics.

A trace map comparison algorithm for the discrete fracture network models of rock masses

NASA Astrophysics Data System (ADS)

Han, Shuai; Wang, Gang; Li, Mingchao

2018-06-01

Discrete fracture networks (DFN) are widely used to build refined geological models. However, validating whether a refined model can match to reality is a crucial problem, concerning whether the model can be used for analysis. The current validation methods include numerical validation and graphical validation. However, the graphical validation, aiming at estimating the similarity between a simulated trace map and the real trace map by visual observation, is subjective. In this paper, an algorithm for the graphical validation of DFN is set up. Four main indicators, including total gray, gray grade curve, characteristic direction and gray density distribution curve, are presented to assess the similarity between two trace maps. A modified Radon transform and loop cosine similarity are presented based on Radon transform and cosine similarity respectively. Besides, how to use Bézier curve to reduce the edge effect is described. Finally, a case study shows that the new algorithm can effectively distinguish which simulated trace map is more similar to the real trace map.

ASIC implementation of recursive scaled discrete cosine transform algorithm

NASA Astrophysics Data System (ADS)

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

1994-05-01

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

A novel joint timing/frequency synchronization scheme based on Radon-Wigner transform of LFM signals in CO-OFDM systems

NASA Astrophysics Data System (ADS)

Liu, Jianfei; Wei, Ying; Zeng, Xiangye; Lu, Jia; Zhang, Shuangxi; Wang, Mengjun

2018-03-01

A joint timing and frequency synchronization method has been proposed for coherent optical orthogonal frequency-division multiplexing (CO-OFDM) system in this paper. The timing offset (TO), integer frequency offset (FO) and the fractional FO can be realized by only one training symbol, which consists of two linear frequency modulation (LFM) signals with opposite chirp rates. By detecting the peak of LFM signals after Radon-Wigner transform (RWT), the TO and the integer FO can be estimated at the same time, moreover, the fractional FO can be acquired correspondingly through the self-correlation characteristic of the same training symbol. Simulation results show that the proposed method can give a more accurate TO estimation than the existing methods, especially at poor OSNR conditions; for the FO estimation, both the fractional and the integer FO can be estimated through the proposed training symbol with no extra overhead, a more accurate estimation and a large FO estimation range of [ - 5 GHz, 5GHz] can be acquired.

Error analysis and new dual-cosine window for estimating the sensor frequency response function from the step response data

NASA Astrophysics Data System (ADS)

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.

Constructing and Deriving Reciprocal Trigonometric Relations: A Functional Analytic Approach

ERIC Educational Resources Information Center

Ninness, Chris; Dixon, Mark; Barnes-Holmes, Dermot; Rehfeldt, Ruth Anne; Rumph, Robin; McCuller, Glen; Holland, James; Smith, Ronald; Ninness, Sharon K.; McGinty, Jennifer

2009-01-01

Participants were pretrained and tested on mutually entailed trigonometric relations and combinatorially entailed relations as they pertained to positive and negative forms of sine, cosine, secant, and cosecant. Experiment 1 focused on training and testing transformations of these mathematical functions in terms of amplitude and frequency followed…

Stability of strongly nonlinear normal modes

NASA Astrophysics Data System (ADS)

Recktenwald, Geoffrey; Rand, Richard

2007-10-01

It is shown that a transformation of time can allow the periodic solution of a strongly nonlinear oscillator to be written as a simple cosine function. This enables the stability of strongly nonlinear normal modes in multidegree of freedom systems to be investigated by standard procedures such as harmonic balance.

A 16X16 Discrete Cosine Transform Chip

NASA Astrophysics Data System (ADS)

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

1987-10-01

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

Method and Apparatus for Evaluating the Visual Quality of Processed Digital Video Sequences

NASA Technical Reports Server (NTRS)

Watson, Andrew B. (Inventor)

2002-01-01

A Digital Video Quality (DVQ) apparatus and method that incorporate a model of human visual sensitivity to predict the visibility of artifacts. The DVQ method and apparatus are used for the evaluation of the visual quality of processed digital video sequences and for adaptively controlling the bit rate of the processed digital video sequences without compromising the visual quality. The DVQ apparatus minimizes the required amount of memory and computation. The input to the DVQ apparatus is a pair of color image sequences: an original (R) non-compressed sequence, and a processed (T) sequence. Both sequences (R) and (T) are sampled, cropped, and subjected to color transformations. The sequences are then subjected to blocking and discrete cosine transformation, and the results are transformed to local contrast. The next step is a time filtering operation which implements the human sensitivity to different time frequencies. The results are converted to threshold units by dividing each discrete cosine transform coefficient by its respective visual threshold. At the next stage the two sequences are subtracted to produce an error sequence. The error sequence is subjected to a contrast masking operation, which also depends upon the reference sequence (R). The masked errors can be pooled in various ways to illustrate the perceptual error over various dimensions, and the pooled error can be converted to a visual quality measure.

Image coding of SAR imagery

NASA Technical Reports Server (NTRS)

Chang, C. Y.; Kwok, R.; Curlander, J. C.

1987-01-01

Five coding techniques in the spatial and transform domains have been evaluated for SAR image compression: linear three-point predictor (LTPP), block truncation coding (BTC), microadaptive picture sequencing (MAPS), adaptive discrete cosine transform (ADCT), and adaptive Hadamard transform (AHT). These techniques have been tested with Seasat data. Both LTPP and BTC spatial domain coding techniques provide very good performance at rates of 1-2 bits/pixel. The two transform techniques, ADCT and AHT, demonstrate the capability to compress the SAR imagery to less than 0.5 bits/pixel without visible artifacts. Tradeoffs such as the rate distortion performance, the computational complexity, the algorithm flexibility, and the controllability of compression ratios are also discussed.

Chrestenson transform FPGA embedded factorizations.

PubMed

Corinthios, Michael J

2016-01-01

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

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

NASA Astrophysics Data System (ADS)

Paramanandham, Nirmala; Rajendiran, Kishore

2018-01-01

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

Fluorescence molecular tomography reconstruction via discrete cosine transform-based regularization

NASA Astrophysics Data System (ADS)

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

2015-05-01

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

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

PubMed

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

2016-06-01

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

Computer-Aided Diagnosis System for Alzheimer's Disease Using Different Discrete Transform Techniques.

PubMed

Dessouky, Mohamed M; Elrashidy, Mohamed A; Taha, Taha E; Abdelkader, Hatem M

2016-05-01

The different discrete transform techniques such as discrete cosine transform (DCT), discrete sine transform (DST), discrete wavelet transform (DWT), and mel-scale frequency cepstral coefficients (MFCCs) are powerful feature extraction techniques. This article presents a proposed computer-aided diagnosis (CAD) system for extracting the most effective and significant features of Alzheimer's disease (AD) using these different discrete transform techniques and MFCC techniques. Linear support vector machine has been used as a classifier in this article. Experimental results conclude that the proposed CAD system using MFCC technique for AD recognition has a great improvement for the system performance with small number of significant extracted features, as compared with the CAD system based on DCT, DST, DWT, and the hybrid combination methods of the different transform techniques. © The Author(s) 2015.

Optimal integer resolution for attitude determination using global positioning system signals

NASA Technical Reports Server (NTRS)

Crassidis, John L.; Markley, F. Landis; Lightsey, E. Glenn

1998-01-01

In this paper, a new motion-based algorithm for GPS integer ambiguity resolution is derived. The first step of this algorithm converts the reference sightline vectors into body frame vectors. This is accomplished by an optimal vectorized transformation of the phase difference measurements. The result of this transformation leads to the conversion of the integer ambiguities to vectorized biases. This essentially converts the problem to the familiar magnetometer-bias determination problem, for which an optimal and efficient solution exists. Also, the formulation in this paper is re-derived to provide a sequential estimate, so that a suitable stopping condition can be found during the vehicle motion. The advantages of the new algorithm include: it does not require an a-priori estimate of the vehicle's attitude; it provides an inherent integrity check using a covariance-type expression; and it can sequentially estimate the ambiguities during the vehicle motion. The only disadvantage of the new algorithm is that it requires at least three non-coplanar baselines. The performance of the new algorithm is tested on a dynamic hardware simulator.

Image Augmentation for Object Image Classification Based On Combination of Pre-Trained CNN and SVM

NASA Astrophysics Data System (ADS)

Shima, Yoshihiro

2018-04-01

Neural networks are a powerful means of classifying object images. The proposed image category classification method for object images combines convolutional neural networks (CNNs) and support vector machines (SVMs). A pre-trained CNN, called Alex-Net, is used as a pattern-feature extractor. Alex-Net is pre-trained for the large-scale object-image dataset ImageNet. Instead of training, Alex-Net, pre-trained for ImageNet is used. An SVM is used as trainable classifier. The feature vectors are passed to the SVM from Alex-Net. The STL-10 dataset are used as object images. The number of classes is ten. Training and test samples are clearly split. STL-10 object images are trained by the SVM with data augmentation. We use the pattern transformation method with the cosine function. We also apply some augmentation method such as rotation, skewing and elastic distortion. By using the cosine function, the original patterns were left-justified, right-justified, top-justified, or bottom-justified. Patterns were also center-justified and enlarged. Test error rate is decreased by 0.435 percentage points from 16.055% by augmentation with cosine transformation. Error rates are increased by other augmentation method such as rotation, skewing and elastic distortion, compared without augmentation. Number of augmented data is 30 times that of the original STL-10 5K training samples. Experimental test error rate for the test 8k STL-10 object images was 15.620%, which shows that image augmentation is effective for image category classification.

Improved cosine similarity measures of simplified neutrosophic sets for medical diagnoses.

PubMed

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 function can overcome some drawbacks of existing cosine similarity measures of SNSs in vector space, and then their diagnosis method is very suitable for handling the medical diagnosis problems with simplified neutrosophic information and demonstrates the effectiveness and rationality of medical diagnoses. Copyright © 2014 Elsevier B.V. All rights reserved.

Multifocus watermarking approach based on discrete cosine transform.

PubMed

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

2016-05-01

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

Infrared images target detection based on background modeling in the discrete cosine domain

NASA Astrophysics Data System (ADS)

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.

SPECT reconstruction using DCT-induced tight framelet regularization

NASA Astrophysics Data System (ADS)

Zhang, Jiahan; Li, Si; Xu, Yuesheng; Schmidtlein, C. R.; Lipson, Edward D.; Feiglin, David H.; Krol, Andrzej

2015-03-01

Wavelet transforms have been successfully applied in many fields of image processing. Yet, to our knowledge, they have never been directly incorporated to the objective function in Emission Computed Tomography (ECT) image reconstruction. Our aim has been to investigate if the ℓ1-norm of non-decimated discrete cosine transform (DCT) coefficients of the estimated radiotracer distribution could be effectively used as the regularization term for the penalized-likelihood (PL) reconstruction, where a regularizer is used to enforce the image smoothness in the reconstruction. In this study, the ℓ1-norm of 2D DCT wavelet decomposition was used as a regularization term. The Preconditioned Alternating Projection Algorithm (PAPA), which we proposed in earlier work to solve penalized likelihood (PL) reconstruction with non-differentiable regularizers, was used to solve this optimization problem. The DCT wavelet decompositions were performed on the transaxial reconstructed images. We reconstructed Monte Carlo simulated SPECT data obtained for a numerical phantom with Gaussian blobs as hot lesions and with a warm random lumpy background. Reconstructed images using the proposed method exhibited better noise suppression and improved lesion conspicuity, compared with images reconstructed using expectation maximization (EM) algorithm with Gaussian post filter (GPF). Also, the mean square error (MSE) was smaller, compared with EM-GPF. A critical and challenging aspect of this method was selection of optimal parameters. In summary, our numerical experiments demonstrated that the ℓ1-norm of discrete cosine transform (DCT) wavelet frame transform DCT regularizer shows promise for SPECT image reconstruction using PAPA method.

Integration of progressive hedging and dual decomposition in stochastic integer programs

DOE PAGES

Watson, Jean -Paul; Guo, Ge; Hackebeil, Gabriel; ...

2015-04-07

We present a method for integrating the Progressive Hedging (PH) algorithm and the Dual Decomposition (DD) algorithm of Carøe and Schultz for stochastic mixed-integer programs. Based on the correspondence between lower bounds obtained with PH and DD, a method to transform weights from PH to Lagrange multipliers in DD is found. Fast progress in early iterations of PH speeds up convergence of DD to an exact solution. As a result, we report computational results on server location and unit commitment instances.

Decomposition of ECG by linear filtering.

PubMed

Murthy, I S; Niranjan, U C

1992-01-01

A simple method is developed for the delineation of a given electrocardiogram (ECG) signal into its component waves. The properties of discrete cosine transform (DCT) are exploited for the purpose. The transformed signal is convolved with appropriate filters and the component waves are obtained by computing the inverse transform (IDCT) of the filtered signals. The filters are derived from the time signal itself. Analysis of continuous strips of ECG signals with various arrhythmias showed that the performance of the method is satisfactory both qualitatively and quantitatively. The small amplitude P wave usually had a high percentage rms difference (PRD) compared to the other large component waves.

The theory of the gravitational potential applied to orbit prediction

NASA Technical Reports Server (NTRS)

Kirkpatrick, J. C.

1976-01-01

A complete derivation of the geopotential function and its gradient is presented. Also included is the transformation of Laplace's equation from Cartesian to spherical coordinates. The analytic solution to Laplace's equation is obtained from the transformed version, in the classical manner of separating the variables. A cursory introduction to the method devised by Pines, using direction cosines to express the orientation of a point in space, is presented together with sample computer program listings for computing the geopotential function and the components of its gradient. The use of the geopotential function is illustrated.

Image Data Compression Having Minimum Perceptual Error

NASA Technical Reports Server (NTRS)

Watson, Andrew B. (Inventor)

1997-01-01

A method is presented for performing color or grayscale image compression that eliminates redundant and invisible image components. The image compression uses a Discrete Cosine Transform (DCT) and each DCT coefficient yielded by the transform is quantized by an entry in a quantization matrix which determines the perceived image quality and the bit rate of the image being compressed. The quantization matrix comprises visual masking by luminance and contrast technique all resulting in a minimum perceptual error for any given bit rate, or minimum bit rate for a given perceptual error.

Improved method of step length estimation based on inverted pendulum model.

PubMed

Zhao, Qi; Zhang, Boxue; Wang, Jingjing; Feng, Wenquan; Jia, Wenyan; Sun, Mingui

2017-04-01

Step length estimation is an important issue in areas such as gait analysis, sport training, or pedestrian localization. In this article, we estimate the step length of walking using a waist-worn wearable computer named eButton. Motion sensors within this device are used to record body movement from the trunk instead of extremities. Two signal-processing techniques are applied to our algorithm design. The direction cosine matrix transforms vertical acceleration from the device coordinates to the topocentric coordinates. The empirical mode decomposition is used to remove the zero- and first-order skew effects resulting from an integration process. Our experimental results show that our algorithm performs well in step length estimation. The effectiveness of the direction cosine matrix algorithm is improved from 1.69% to 3.56% while the walking speed increased.

Sparse Matrix Motivated Reconstruction of Far-Field Radiation Patterns

DTIC Science & Technology

2015-03-01

method for base - station antenna radiation patterns. IEEE Antennas Propagation Magazine. 2001;43(2):132. 4. Vasiliadis TG, Dimitriou D, Sergiadis JD...algorithm based on sparse representations of radiation patterns using the inverse Discrete Fourier Transform (DFT) and the inverse Discrete Cosine...patterns using a Model- Based Parameter Estimation (MBPE) technique that reduces the computational time required to model radiation patterns. Another

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

PubMed

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

2016-05-16

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

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

PubMed Central

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

2016-01-01

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

Sines and Cosines. Part 1 of 3

NASA Technical Reports Server (NTRS)

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).

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

NASA Astrophysics Data System (ADS)

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

2017-10-01

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

An image assessment study of image acceptability of the Galileo low gain antenna mission

NASA Technical Reports Server (NTRS)

Chuang, S. L.; Haines, R. F.; Grant, T.; Gold, Yaron; Cheung, Kar-Ming

1994-01-01

This paper describes a study conducted by NASA Ames Research Center (ARC) in collaboration with the Jet Propulsion Laboratory (JPL), Pasadena, California on the image acceptability of the Galileo Low Gain Antenna mission. The primary objective of the study is to determine the impact of the Integer Cosine Transform (ICT) compression algorithm on Galilean images of atmospheric bodies, moons, asteroids and Jupiter's rings. The approach involved fifteen volunteer subjects representing twelve institutions involved with the Galileo Solid State Imaging (SSI) experiment. Four different experiment specific quantization tables (q-table) and various compression stepsizes (q-factor) to achieve different compression ratios were used. It then determined the acceptability of the compressed monochromatic astronomical images as evaluated by Galileo SSI mission scientists. Fourteen different images were evaluated. Each observer viewed two versions of the same image side by side on a high resolution monitor, each was compressed using a different quantization stepsize. They were requested to select which image had the highest overall quality to support them in carrying out their visual evaluations of image content. Then they rated both images using a scale from one to five on its judged degree of usefulness. Up to four pre-selected types of images were presented with and without noise to each subject based upon results of a previously administered survey of their image preferences. Fourteen different images in seven image groups were studied. The results showed that: (1) acceptable compression ratios vary widely with the type of images; (2) noisy images detract greatly from image acceptability and acceptable compression ratios; and (3) atmospheric images of Jupiter seem to have higher compression ratios of 4 to 5 times that of some clear surface satellite images.

Improved digital filters for evaluating Fourier and Hankel transform integrals

USGS Publications Warehouse

Anderson, Walter L.

1975-01-01

New algorithms are described for evaluating Fourier (cosine, sine) and Hankel (J0,J1) transform integrals by means of digital filters. The filters have been designed with extended lengths so that a variable convolution operation can be applied to a large class of integral transforms having the same system transfer function. A f' lagged-convolution method is also presented to significantly decrease the computation time when computing a series of like-transforms over a parameter set spaced the same as the filters. Accuracy of the new filters is comparable to Gaussian integration, provided moderate parameter ranges and well-behaved kernel functions are used. A collection of Fortran IV subprograms is included for both real and complex functions for each filter type. The algorithms have been successfully used in geophysical applications containing a wide variety of integral transforms

A Fourier transform method for Vsin i estimations under nonlinear Limb-Darkening laws

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

Levenhagen, R. S., E-mail: ronaldo.levenhagen@gmail.com

Star rotation offers us a large horizon for the study of many important physical issues pertaining to stellar evolution. Currently, four methods are widely used to infer rotation velocities, namely those related to line width calibrations, on the fitting of synthetic spectra, interferometry, and on Fourier transforms (FTs) of line profiles. Almost all of the estimations of stellar projected rotation velocities using the Fourier method in the literature have been addressed with the use of linear limb-darkening (LD) approximations during the evaluation of rotation profiles and their cosine FTs, which in certain cases, lead to discrepant velocity estimates. In thismore » work, we introduce new mathematical expressions of rotation profiles and their Fourier cosine transforms assuming three nonlinear LD laws—quadratic, square-root, and logarithmic—and study their applications with and without gravity-darkening (GD) and geometrical flattening (GF) effects. Through an analysis of He I models in the visible range accounting for both limb and GD, we find out that, for classical models without rotationally driven effects, all the Vsin i values are too close to each other. On the other hand, taking into account GD and GF, the Vsin i obtained with the linear law result in Vsin i values that are systematically smaller than those obtained with the other laws. As a rule of thumb, we apply these expressions to the FT method to evaluate the projected rotation velocity of the emission B-type star Achernar (α Eri).« less

Influence of non-integer-order derivatives on unsteady unidirectional motions of an Oldroyd-B fluid with generalized boundary conditions

NASA Astrophysics Data System (ADS)

Zafar, A. A.; Riaz, M. B.; Shah, N. A.; Imran, M. A.

2018-03-01

The objective of this article is to study some unsteady Couette flows of an Oldroyd-B fluid with non-integer derivatives. The fluid fills an annular region of two infinite co-axial circular cylinders. Flows are due to the motion of the outer cylinder, that rotates about its axis with an arbitrary time-dependent velocity while the inner cylinder is held fixed. Closed form solutions of dimensionless velocity field and tangential tension are obtained by means of the finite Hankel transform and the theory of Laplace transform for fractional calculus. Several results in the literature including the rotational flows through an infinite cylinder can be obtained as limiting cases of our general solutions. Finally, the control of the fractional framework on the dynamics of fluid is analyzed by numerical simulations and graphical illustrations.

Techniques for Computing the DFT Using the Residue Fermat Number Systems and VLSI

NASA Technical Reports Server (NTRS)

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

1985-01-01

The integer complex multiplier and adder over the direct sum of two copies of a finite field is specialized to the direct sum of the rings of integers modulo Fermat numbers. 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 for the DFT can be reduced substantially over the previous approach. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

Photonic Hilbert transformers based on laterally apodized integrated waveguide Bragg gratings on a SOI wafer.

PubMed

Bazargani, Hamed Pishvai; Burla, Maurizio; Chrostowski, Lukas; Azaña, José

2016-11-01

We experimentally demonstrate high-performance integer and fractional-order photonic Hilbert transformers based on laterally apodized Bragg gratings in a silicon-on-insulator technology platform. The sub-millimeter-long gratings have been fabricated using single-etch electron beam lithography, and the resulting HT devices offer operation bandwidths approaching the THz range, with time-bandwidth products between 10 and 20.

Use of the fractional Fourier transform in {pi}/2 converters of laser modes

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

Malyutin, A A

2004-02-28

The possibility of using the fractional Fourier transform (FrFT) in optical schemes for astigmatic {pi}/2 converters of Hermite-Gaussian modes to donut Laguerre-Gaussian modes is considered. Several schemes of converters based on the FrFT of the half-integer and irrational orders are presented. The lowest FrFT order than can be used in astigmatic mode converters is found. The properties of converters based on the fractional and ordinary Fourier transforms are compared. (laser beams)

Statistical Characterization of MP3 Encoders for Steganalysis: ’CHAMP3’

DTIC Science & Technology

2004-04-27

compression exceeds those of typical stegano- graphic tools (e. g., LSB image embedding), the availability of commented source codes for MP3 encoders...developed by testing the approach on known and unknown reference data. 15. SUBJECT TERMS EOARD, Steganography , Digital Watermarking...Pages kbps Kilobits per Second LGPL Lesser General Public License LSB Least Significant Bit MB Megabyte MDCT Modified Discrete Cosine Transformation MP3

Comments on `Area and power efficient DCT architecture for image compression' by Dhandapani and Ramachandran

NASA Astrophysics Data System (ADS)

Cintra, Renato J.; Bayer, Fábio M.

2017-12-01

In [Dhandapani and Ramachandran, "Area and power efficient DCT architecture for image compression", EURASIP Journal on Advances in Signal Processing 2014, 2014:180] the authors claim to have introduced an approximation for the discrete cosine transform capable of outperforming several well-known approximations in literature in terms of additive complexity. We could not verify the above results and we offer corrections for their work.

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

NASA Astrophysics Data System (ADS)

Al-Mansoori, Saeed; Kunhu, Alavi

2013-10-01

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

A robust color image watermarking algorithm against rotation attacks

NASA Astrophysics Data System (ADS)

Han, Shao-cheng; Yang, Jin-feng; Wang, Rui; Jia, Gui-min

2018-01-01

A robust digital watermarking algorithm is proposed based on quaternion wavelet transform (QWT) and discrete cosine transform (DCT) for copyright protection of color images. The luminance component Y of a host color image in YIQ space is decomposed by QWT, and then the coefficients of four low-frequency subbands are transformed by DCT. An original binary watermark scrambled by Arnold map and iterated sine chaotic system is embedded into the mid-frequency DCT coefficients of the subbands. In order to improve the performance of the proposed algorithm against rotation attacks, a rotation detection scheme is implemented before watermark extracting. The experimental results demonstrate that the proposed watermarking scheme shows strong robustness not only against common image processing attacks but also against arbitrary rotation attacks.

Hyperbolic Cross Truncations for Stochastic Fourier Cosine Series

PubMed Central

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

Algebraic signal processing theory: 2-D spatial hexagonal lattice.

PubMed

Pünschel, Markus; Rötteler, Martin

2007-06-01

We develop the framework for signal processing on a spatial, or undirected, 2-D hexagonal lattice for both an infinite and a finite array of signal samples. This framework includes the proper notions of z-transform, boundary conditions, filtering or convolution, spectrum, frequency response, and Fourier transform. In the finite case, the Fourier transform is called discrete triangle transform. Like the hexagonal lattice, this transform is nonseparable. The derivation of the framework makes it a natural extension of the algebraic signal processing theory that we recently introduced. Namely, we construct the proper signal models, given by polynomial algebras, bottom-up from a suitable definition of hexagonal space shifts using a procedure provided by the algebraic theory. These signal models, in turn, then provide all the basic signal processing concepts. The framework developed in this paper is related to Mersereau's early work on hexagonal lattices in the same way as the discrete cosine and sine transforms are related to the discrete Fourier transform-a fact that will be made rigorous in this paper.

Flow to a well in a water-table aquifer: An improved laplace transform solution

USGS Publications Warehouse

Moench, A.F.

1996-01-01

An alternative Laplace transform solution for the problem, originally solved by Neuman, of constant discharge from a partially penetrating well in a water-table aquifer was obtained. The solution differs from existing solutions in that it is simpler in form and can be numerically inverted without the need for time-consuming numerical integration. The derivation invloves the use of the Laplace transform and a finite Fourier cosine series and avoids the Hankel transform used in prior derivations. The solution allows for water in the overlying unsaturated zone to be released either instantaneously in response to a declining water table as assumed by Neuman, or gradually as approximated by Boulton's convolution integral. Numerical evaluation yields results identical with results obtained by previously published methods with the advantage, under most well-aquifer configurations, of much reduced computation time.

Image data compression having minimum perceptual error

NASA Technical Reports Server (NTRS)

Watson, Andrew B. (Inventor)

1995-01-01

A method for performing image compression that eliminates redundant and invisible image components is described. The image compression uses a Discrete Cosine Transform (DCT) and each DCT coefficient yielded by the transform is quantized by an entry in a quantization matrix which determines the perceived image quality and the bit rate of the image being compressed. The present invention adapts or customizes the quantization matrix to the image being compressed. The quantization matrix comprises visual masking by luminance and contrast techniques and by an error pooling technique all resulting in a minimum perceptual error for any given bit rate, or minimum bit rate for a given perceptual error.

Image-adapted visually weighted quantization matrices for digital image compression

NASA Technical Reports Server (NTRS)

Watson, Andrew B. (Inventor)

1994-01-01

A method for performing image compression that eliminates redundant and invisible image components is presented. The image compression uses a Discrete Cosine Transform (DCT) and each DCT coefficient yielded by the transform is quantized by an entry in a quantization matrix which determines the perceived image quality and the bit rate of the image being compressed. The present invention adapts or customizes the quantization matrix to the image being compressed. The quantization matrix comprises visual masking by luminance and contrast techniques and by an error pooling technique all resulting in a minimum perceptual error for any given bit rate, or minimum bit rate for a given perceptual error.

A low-power and high-quality implementation of the discrete cosine transformation

NASA Astrophysics Data System (ADS)

Heyne, B.; Götze, J.

2007-06-01

In this paper a computationally efficient and high-quality preserving DCT architecture is presented. It is obtained by optimizing the Loeffler DCT based on the Cordic algorithm. The computational complexity is reduced from 11 multiply and 29 add operations (Loeffler DCT) to 38 add and 16 shift operations (which is similar to the complexity of the binDCT). The experimental results show that the proposed DCT algorithm not only reduces the computational complexity significantly, but also retains the good transformation quality of the Loeffler DCT. Therefore, the proposed Cordic based Loeffler DCT is especially suited for low-power and high-quality CODECs in battery-based systems.

The Use of Finite Fields and Rings to Compute Convolutions

DTIC Science & Technology

1975-06-06

showed in Ref. 1 that the convolution of two finite sequences of integers (a, ) and (b, ) for k = 1, 2, . . ., d can be obtained as the inverse transform of...since the T.’S are all distinct. Thus T~ exists and (7) can be solved as a = T A the inverse " transform .𔃻 Next let us impose on (7) the...the inverse transform d-1 Cn= (d) I Cka k=0 If an a can be found so that multiplications by powers of a are simple in hardware, the

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

PubMed

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

1996-01-01

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

Secure annotation for medical images based on reversible watermarking in the Integer Fibonacci-Haar transform domain

NASA Astrophysics Data System (ADS)

Battisti, F.; Carli, M.; Neri, A.

2011-03-01

The increasing use of digital image-based applications is resulting in huge databases that are often difficult to use and prone to misuse and privacy concerns. These issues are especially crucial in medical applications. The most commonly adopted solution is the encryption of both the image and the patient data in separate files that are then linked. This practice results to be inefficient since, in order to retrieve patient data or analysis details, it is necessary to decrypt both files. In this contribution, an alternative solution for secure medical image annotation is presented. The proposed framework is based on the joint use of a key-dependent wavelet transform, the Integer Fibonacci-Haar transform, of a secure cryptographic scheme, and of a reversible watermarking scheme. The system allows: i) the insertion of the patient data into the encrypted image without requiring the knowledge of the original image, ii) the encryption of annotated images without causing loss in the embedded information, and iii) due to the complete reversibility of the process, it allows recovering the original image after the mark removal. Experimental results show the effectiveness of the proposed scheme.

Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.

PubMed

Lyubetsky, Vassily; Gershgorin, Roman; Gorbunov, Konstantin

2017-12-06

Chromosome structure is a very limited model of the genome including the information about its chromosomes such as their linear or circular organization, the order of genes on them, and the DNA strand encoding a gene. Gene lengths, nucleotide composition, and intergenic regions are ignored. Although highly incomplete, such structure can be used in many cases, e.g., to reconstruct phylogeny and evolutionary events, to identify gene synteny, regulatory elements and promoters (considering highly conserved elements), etc. Three problems are considered; all assume unequal gene content and the presence of gene paralogs. The distance problem is to determine the minimum number of operations required to transform one chromosome structure into another and the corresponding transformation itself including the identification of paralogs in two structures. We use the DCJ model which is one of the most studied combinatorial rearrangement models. Double-, sesqui-, and single-operations as well as deletion and insertion of a chromosome region are considered in the model; the single ones comprise cut and join. In the reconstruction problem, a phylogenetic tree with chromosome structures in the leaves is given. It is necessary to assign the structures to inner nodes of the tree to minimize the sum of distances between terminal structures of each edge and to identify the mutual paralogs in a fairly large set of structures. A linear algorithm is known for the distance problem without paralogs, while the presence of paralogs makes it NP-hard. If paralogs are allowed but the insertion and deletion operations are missing (and special constraints are imposed), the reduction of the distance problem to integer linear programming is known. Apparently, the reconstruction problem is NP-hard even in the absence of paralogs. The problem of contigs is to find the optimal arrangements for each given set of contigs, which also includes the mutual identification of paralogs. We proved that these problems can be reduced to integer linear programming formulations, which allows an algorithm to redefine the problems to implement a very special case of the integer linear programming tool. The results were tested on synthetic and biological samples. Three well-known problems were reduced to a very special case of integer linear programming, which is a new method of their solutions. Integer linear programming is clearly among the main computational methods and, as generally accepted, is fast on average; in particular, computation systems specifically targeted at it are available. The challenges are to reduce the size of the corresponding integer linear programming formulations and to incorporate a more detailed biological concept in our model of the reconstruction.

Down-Regulation of Olfactory Receptors in Response to Traumatic Brain Injury Promotes Risk for Alzheimer’s Disease

DTIC Science & Technology

2013-10-01

correct group assignment of samples in unsupervised hierarchical clustering by the Unweighted Pair-Group Method using Arithmetic averages ( UPGMA ) based on...centering of log2 transformed MAS5.0 signal values; probe set clustering was performed by the UPGMA method using Cosine correlation as the similarity met...A) The 108 differentially-regulated genes identified were subjected to unsupervised hierarchical clustering analysis using the UPGMA algorithm with

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

PubMed

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

2007-01-01

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

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

NASA Technical Reports Server (NTRS)

Cheung, Kar-Ming; Lee, Charles H.

2012-01-01

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

Topological transformation of fractional optical vortex beams using computer generated holograms

NASA Astrophysics Data System (ADS)

Maji, Satyajit; Brundavanam, Maruthi M.

2018-04-01

Optical vortex beams with fractional topological charges (TCs) are generated by the diffraction of a Gaussian beam using computer generated holograms embedded with mixed screw-edge dislocations. When the input Gaussian beam has a finite wave-front curvature, the generated fractional vortex beams show distinct topological transformations in comparison to the integer charge optical vortices. The topological transformations at different fractional TCs are investigated through the birth and evolution of the points of phase singularity, the azimuthal momentum transformation, occurrence of critical points in the transverse momentum and the vorticity around the singular points. This study is helpful to achieve better control in optical micro-manipulation applications.

Optical Hilbert transform using fiber Bragg gratings

NASA Astrophysics Data System (ADS)

Ge, Jing; Wang, Chinhua; Zhu, Xiaojun

2010-11-01

In this paper, we demonstrate that a simple and practical phase-shifted fiber Bragg grating (PSFBG) operated in reflection can provide the required spectral response for implementing an all-optical Hilbert transformer (HT), including both integer and fractional orders. The PSFBG consists of two concatenated identical uniform FBGs with a phase shift between them. It can be proved that the phase shift of the FBG and the apodizing profile of the refractive index modulation determine the order of the transform. The device shows a good accuracy in calculating the Hilbert transform of the complex field of an arbitrary input optical waveforms when compared with the theoretical results.

A Classroom Note on Generating Examples for the Laws of Sines and Cosines from Pythagorean Triangles

ERIC Educational Resources Information Center

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…

A Thin Lens Model for Charged-Particle RF Accelerating Gaps

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

Allen, Christopher K.

Presented is a thin-lens model for an RF accelerating gap that considers general axial fields without energy dependence or other a priori assumptions. Both the cosine and sine transit time factors (i.e., Fourier transforms) are required plus two additional functions; the Hilbert transforms the transit-time factors. The combination yields a complex-valued Hamiltonian rotating in the complex plane with synchronous phase. Using Hamiltonians the phase and energy gains are computed independently in the pre-gap and post-gap regions then aligned using the asymptotic values of wave number. Derivations of these results are outlined, examples are shown, and simulations with the model aremore » presented.« less

Steganographic embedding in containers-images

NASA Astrophysics Data System (ADS)

Nikishova, A. V.; Omelchenko, T. A.; Makedonskij, S. A.

2018-05-01

Steganography is one of the approaches to ensuring the protection of information transmitted over the network. But a steganographic method should vary depending on a used container. According to statistics, the most widely used containers are images and the most common image format is JPEG. Authors propose a method of data embedding into a frequency area of images in format JPEG 2000. It is proposed to use the method of Benham-Memon- Yeo-Yeung, in which instead of discrete cosine transform, discrete wavelet transform is used. Two requirements for images are formulated. Structure similarity is chosen to obtain quality assessment of data embedding. Experiments confirm that requirements satisfaction allows achieving high quality assessment of data embedding.

Latent semantic analysis cosines as a cognitive similarity measure: Evidence from priming studies.

PubMed

Günther, Fritz; Dudschig, Carolin; Kaup, Barbara

2016-01-01

In distributional semantics models (DSMs) such as latent semantic analysis (LSA), words are represented as vectors in a high-dimensional vector space. This allows for computing word similarities as the cosine of the angle between two such vectors. In two experiments, we investigated whether LSA cosine similarities predict priming effects, in that higher cosine similarities are associated with shorter reaction times (RTs). Critically, we applied a pseudo-random procedure in generating the item material to ensure that we directly manipulated LSA cosines as an independent variable. We employed two lexical priming experiments with lexical decision tasks (LDTs). In Experiment 1 we presented participants with 200 different prime words, each paired with one unique target. We found a significant effect of cosine similarities on RTs. The same was true for Experiment 2, where we reversed the prime-target order (primes of Experiment 1 were targets in Experiment 2, and vice versa). The results of these experiments confirm that LSA cosine similarities can predict priming effects, supporting the view that they are psychologically relevant. The present study thereby provides evidence for qualifying LSA cosine similarities not only as a linguistic measure, but also as a cognitive similarity measure. However, it is also shown that other DSMs can outperform LSA as a predictor of priming effects.

Geometric quadratic stochastic operator on countable infinite set

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

Ganikhodjaev, Nasir; Hamzah, Nur Zatul Akmar

2015-02-03

In this paper we construct the family of Geometric quadratic stochastic operators defined on the countable sample space of nonnegative integers and investigate their trajectory behavior. Such operators can be reinterpreted in terms of of evolutionary operator of free population. We show that Geometric quadratic stochastic operators are regular transformations.

On the Use of Quartic Force Fields in Variational Calculations

NASA Technical Reports Server (NTRS)

Fortenberry, Ryan C.; Huang, Xinchuan; Yachmenev, Andrey; Thiel, Walter; Lee, Timothy J.

2013-01-01

The use of quartic force fields (QFFs) has been shown to be one of the most effective ways to efficiently compute vibrational frequencies for small molecules. In this paper we outline and discuss how the simple-internal or bond-length bond-angle (BLBA) coordinates can be transformed into Morse-cosine(-sine) coordinates which produce potential energy surfaces from QFFs that possess proper limiting behavior and can effectively describe the vibrational (or rovibrational) energy levels of an arbitrary molecular system. We investigate parameter scaling in the Morse coordinate, symmetry considerations, and examples of transformed QFFs making use of the MULTIMODE, TROVE, and VTET variational vibrational methods. Cases are referenced where variational computations coupled with transformed QFFs produce accuracies compared to experiment for fundamental frequencies on the order of 5 cm(exp -1) and often as good as 1 cm(exp -1).

Coordinate transformation by minimizing correlations between parameters

NASA Technical Reports Server (NTRS)

Kumar, M.

1972-01-01

This investigation was to determine the transformation parameters (three rotations, three translations and a scale factor) between two Cartesian coordinate systems from sets of coordinates given in both systems. The objective was the determination of well separated transformation parameters with reduced correlations between each other, a problem especially relevant when the sets of coordinates are not well distributed. The above objective is achieved by preliminarily determining the three rotational parameters and the scale factor from the respective direction cosines and chord distances (these being independent of the translation parameters) between the common points, and then computing all the seven parameters from a solution in which the rotations and the scale factor are entered as weighted constraints according to their variances and covariances obtained in the preliminary solutions. Numerical tests involving two geodetic reference systems were performed to evaluate the effectiveness of this approach.

Implementation of quantum and classical discrete fractional Fourier transforms.

PubMed

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.

Implementation of quantum and classical discrete fractional Fourier transforms

PubMed Central

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

Perceptual Optimization of DCT Color Quantization Matrices

NASA Technical Reports Server (NTRS)

Watson, Andrew B.; Statler, Irving C. (Technical Monitor)

1994-01-01

Many image compression schemes employ a block Discrete Cosine Transform (DCT) and uniform quantization. Acceptable rate/distortion performance depends upon proper design of the quantization matrix. In previous work, we showed how to use a model of the visibility of DCT basis functions to design quantization matrices for arbitrary display resolutions and color spaces. Subsequently, we showed how to optimize greyscale quantization matrices for individual images, for optimal rate/perceptual distortion performance. Here we describe extensions of this optimization algorithm to color images.

Reducing the complexity of the CCSDS standard for image compression decreasing the DWT filter order

NASA Astrophysics Data System (ADS)

Ito, Leandro H.; Pinho, Marcelo S.

2014-10-01

The goal for this work is to evaluate the impact of utilizing shorter wavelet filters in the CCSDS standard for lossy and lossless image compression. Another constraint considered was the existence of symmetry in the filters. That approach was desired to maintain the symmetric extension compatibility of the filter banks. Even though this strategy works well for oat wavelets, it is not always the case for their integer approximations. The periodic extension was utilized whenever symmetric extension was not applicable. Even though the latter outperforms the former, for fair comparison the symmetric extension compatible integer-to-integer wavelet approximations were evaluated under both extensions. The evaluation methods adopted were bit rate (bpp), PSNR and the number of operations required by each wavelet transforms. All these results were compared against the ones obtained utilizing the standard CCSDS with 9/7 filter banks, for lossy and lossless compression. The tests were performed over tallies (512x512) of raw remote sensing images from CBERS-2B (China-Brazil Earth Resources Satellites) captured from its high resolution CCD camera. These images were cordially made available by INPE (National Institute for Space Research) in Brazil. For the CCSDS implementation, it was utilized the source code developed by Hongqiang Wang from the Electrical Department at Nebraska-Lincoln University, applying the appropriate changes on the wavelet transform. For lossy compression, the results have shown that the filter bank built from the Deslauriers-Dubuc scaling function, with respectively 2 and 4 vanishing moments on the synthesis and analysis banks, presented not only a reduction of 21% in the number of operations required, but also a performance on par with the 9/7 filter bank. In the lossless case, the biorthogonal Cohen-Daubechies-Feauveau with 2 vanishing moments presented a performance close to the 9/7 integer approximation of the CCSDS, with the number of operations reduced by 1/3.

Log-gamma directed polymer with fixed endpoints via the replica Bethe Ansatz

NASA Astrophysics Data System (ADS)

Thiery, Thimothée; Le Doussal, Pierre

2014-10-01

We study the model of a discrete directed polymer (DP) on a square lattice with homogeneous inverse gamma distribution of site random Boltzmann weights, introduced by Seppalainen (2012 Ann. Probab. 40 19-73). The integer moments of the partition sum, \\overline{Z^n} , are studied using a transfer matrix formulation, which appears as a generalization of the Lieb-Liniger quantum mechanics of bosons to discrete time and space. In the present case of the inverse gamma distribution the model is integrable in terms of a coordinate Bethe Ansatz, as discovered by Brunet. Using the Brunet-Bethe eigenstates we obtain an exact expression for the integer moments of \\overline{Z^n} for polymers of arbitrary lengths and fixed endpoint positions. Although these moments do not exist for all integer n, we are nevertheless able to construct a generating function which reproduces all existing integer moments and which takes the form of a Fredholm determinant (FD). This suggests an analytic continuation via a Mellin-Barnes transform and we thereby propose a FD ansatz representation for the probability distribution function (PDF) of Z and its Laplace transform. In the limit of a very long DP, this ansatz yields that the distribution of the free energy converges to the Gaussian unitary ensemble (GUE) Tracy-Widom distribution up to a non-trivial average and variance that we calculate. Our asymptotic predictions coincide with a result by Borodin et al (2013 Commun. Math. Phys. 324 215-32) based on a formula obtained by Corwin et al (2011 arXiv:1110.3489) using the geometric Robinson-Schensted-Knuth (gRSK) correspondence. In addition we obtain the dependence on the endpoint position and the exact elastic coefficient at a large time. We argue the equivalence between our formula and that of Borodin et al. As we will discuss, this provides a connection between quantum integrability and tropical combinatorics.

Higher order supersymmetric truncated oscillators

NASA Astrophysics Data System (ADS)

Fernández C., David J.; Morales-Salgado, Vicente Said

2018-01-01

We study the supersymmetric partners of the harmonic oscillator with an infinite potential barrier at the origin and obtain the conditions under which it is possible to add levels to the energy spectrum of these systems. It is found that instead of the usual rule for non-singular potentials, where the order of the transformation corresponds to the maximum number of levels which can be added, now it is the integer part of half the order of the transformation which gives the maximum number of levels to be created.

Oscillation of a class of fractional differential equations with damping term.

PubMed

Qin, Huizeng; Zheng, Bin

2013-01-01

We investigate the oscillation of a class of fractional differential equations with damping term. Based on a certain variable transformation, the fractional differential equations are converted into another differential equations of integer order with respect to the new variable. Then, using Riccati transformation, inequality, and integration average technique, some new oscillatory criteria for the equations are established. As for applications, oscillation for two certain fractional differential equations with damping term is investigated by the use of the presented results.

Sparse dictionary for synthetic transmit aperture medical ultrasound imaging.

PubMed

Wang, Ping; Jiang, Jin-Yang; Li, Na; Luo, Han-Wu; Li, Fang; Cui, Shi-Gang

2017-07-01

It is possible to recover a signal below the Nyquist sampling limit using a compressive sensing technique in ultrasound imaging. However, the reconstruction enabled by common sparse transform approaches does not achieve satisfactory results. Considering the ultrasound echo signal's features of attenuation, repetition, and superposition, a sparse dictionary with the emission pulse signal is proposed. Sparse coefficients in the proposed dictionary have high sparsity. Images reconstructed with this dictionary were compared with those obtained with the three other common transforms, namely, discrete Fourier transform, discrete cosine transform, and discrete wavelet transform. The performance of the proposed dictionary was analyzed via a simulation and experimental data. The mean absolute error (MAE) was used to quantify the quality of the reconstructions. Experimental results indicate that the MAE associated with the proposed dictionary was always the smallest, the reconstruction time required was the shortest, and the lateral resolution and contrast of the reconstructed images were also the closest to the original images. The proposed sparse dictionary performed better than the other three sparse transforms. With the same sampling rate, the proposed dictionary achieved excellent reconstruction quality.

Galaxy Redshifts from Discrete Optimization of Correlation Functions

NASA Astrophysics Data System (ADS)

Lee, Benjamin C. G.; Budavári, Tamás; Basu, Amitabh; Rahman, Mubdi

2016-12-01

We propose a new method of constraining the redshifts of individual extragalactic sources based on celestial coordinates and their ensemble statistics. Techniques from integer linear programming (ILP) are utilized to optimize simultaneously for the angular two-point cross- and autocorrelation functions. Our novel formalism introduced here not only transforms the otherwise hopelessly expensive, brute-force combinatorial search into a linear system with integer constraints but also is readily implementable in off-the-shelf solvers. We adopt Gurobi, a commercial optimization solver, and use Python to build the cost function dynamically. The preliminary results on simulated data show potential for future applications to sky surveys by complementing and enhancing photometric redshift estimators. Our approach is the first application of ILP to astronomical analysis.

Numerical results on the transcendence of constants involving pi, e, and Euler's constant

NASA Technical Reports Server (NTRS)

Bailey, David H.

1988-01-01

The existence of simple polynomial equations (integer relations) for the constants e/pi, e + pi, log pi, gamma (Euler's constant), e exp gamma, gamma/e, gamma/pi, and log gamma is investigated by means of numerical computations. The recursive form of the Ferguson-Fourcade algorithm (Ferguson and Fourcade, 1979; Ferguson, 1986 and 1987) is implemented on the Cray-2 supercomputer at NASA Ames, applying multiprecision techniques similar to those described by Bailey (1988) except that FFTs are used instead of dual-prime-modulus transforms for multiplication. It is shown that none of the constants has an integer relation of degree eight or less with coefficients of Euclidean norm 10 to the 9th or less.

On Reductions of the Hirota-Miwa Equation

NASA Astrophysics Data System (ADS)

Hone, Andrew N. W.; Kouloukas, Theodoros E.; Ward, Chloe

2017-07-01

The Hirota-Miwa equation (also known as the discrete KP equation, or the octahedron recurrence) is a bilinear partial difference equation in three independent variables. It is integrable in the sense that it arises as the compatibility condition of a linear system (Lax pair). The Hirota-Miwa equation has infinitely many reductions of plane wave type (including a quadratic exponential gauge transformation), defined by a triple of integers or half-integers, which produce bilinear ordinary difference equations of Somos/Gale-Robinson type. Here it is explained how to obtain Lax pairs and presymplectic structures for these reductions, in order to demonstrate Liouville integrability of some associated maps, certain of which are related to reductions of discrete Toda and discrete KdV equations.

Spectrophotometric evaluation of stability constants of 1:1 weak complexes from continuous variation data.

PubMed

Sayago, Ana; Asuero, Agustin G

2006-09-14

A bilogarithmic hyperbolic cosine method for the spectrophotometric evaluation of stability constants of 1:1 weak complexes from continuous variation data has been devised and applied to literature data. A weighting scheme, however, is necessary in order to take into account the transformation for linearization. The method may be considered a useful alternative to methods in which one variable is involved on both sides of the basic equation (i.e. Heller and Schwarzenbach, Likussar and Adsul and Ramanathan). Classical least squares lead in those instances to biased and approximate stability constants and limiting absorbance values. The advantages of the proposed method are: the method gives a clear indication of the existence of only one complex in solution, it is flexible enough to allow for weighting of measurements and the computation procedure yield the best value of logbeta11 and its limit of error. The agreement between the values obtained by applying the weighted hyperbolic cosine method and the non-linear regression (NLR) method is good, being in both cases the mean quadratic error at a minimum.

A New Minimum Trees-Based Approach for Shape Matching with Improved Time Computing: Application to Graphical Symbols Recognition

NASA Astrophysics Data System (ADS)

Franco, Patrick; Ogier, Jean-Marc; Loonis, Pierre; Mullot, Rémy

Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to be powerful, the construction of graph induces an expensive algorithmic cost. In this article we discuss on the ways to reduce time computing. An alternative solution based on image compression concepts is provided and evaluated. The model no longer operates in the image space but in a compact space, namely the Discrete Cosine space. The use of block discrete cosine transform is discussed and justified. The experimental results led on the GREC2003 database show that the proposed method is characterized by a good discrimination power, a real robustness to noise with an acceptable time computing.

High-performance floating-point image computing workstation for medical applications

NASA Astrophysics Data System (ADS)

Mills, Karl S.; Wong, Gilman K.; Kim, Yongmin

1990-07-01

The medical imaging field relies increasingly on imaging and graphics techniques in diverse applications with needs similar to (or more stringent than) those of the military, industrial and scientific communities. However, most image processing and graphics systems available for use in medical imaging today are either expensive, specialized, or in most cases both. High performance imaging and graphics workstations which can provide real-time results for a number of applications, while maintaining affordability and flexibility, can facilitate the application of digital image computing techniques in many different areas. This paper describes the hardware and software architecture of a medium-cost floating-point image processing and display subsystem for the NeXT computer, and its applications as a medical imaging workstation. Medical imaging applications of the workstation include use in a Picture Archiving and Communications System (PACS), in multimodal image processing and 3-D graphics workstation for a broad range of imaging modalities, and as an electronic alternator utilizing its multiple monitor display capability and large and fast frame buffer. The subsystem provides a 2048 x 2048 x 32-bit frame buffer (16 Mbytes of image storage) and supports both 8-bit gray scale and 32-bit true color images. When used to display 8-bit gray scale images, up to four different 256-color palettes may be used for each of four 2K x 2K x 8-bit image frames. Three of these image frames can be used simultaneously to provide pixel selectable region of interest display. A 1280 x 1024 pixel screen with 1: 1 aspect ratio can be windowed into the frame buffer for display of any portion of the processed image or images. In addition, the system provides hardware support for integer zoom and an 82-color cursor. This subsystem is implemented on an add-in board occupying a single slot in the NeXT computer. Up to three boards may be added to the NeXT for multiple display capability (e.g., three 1280 x 1024 monitors, each with a 16-Mbyte frame buffer). Each add-in board provides an expansion connector to which an optional image computing coprocessor board may be added. Each coprocessor board supports up to four processors for a peak performance of 160 MFLOPS. The coprocessors can execute programs from external high-speed microcode memory as well as built-in internal microcode routines. The internal microcode routines provide support for 2-D and 3-D graphics operations, matrix and vector arithmetic, and image processing in integer, IEEE single-precision floating point, or IEEE double-precision floating point. In addition to providing a library of C functions which links the NeXT computer to the add-in board and supports its various operational modes, algorithms and medical imaging application programs are being developed and implemented for image display and enhancement. As an extension to the built-in algorithms of the coprocessors, 2-D Fast Fourier Transform (FF1), 2-D Inverse FFF, convolution, warping and other algorithms (e.g., Discrete Cosine Transform) which exploit the parallel architecture of the coprocessor board are being implemented.

A hybrid video codec based on extended block sizes, recursive integer transforms, improved interpolation, and flexible motion representation

NASA Astrophysics Data System (ADS)

Karczewicz, Marta; Chen, Peisong; Joshi, Rajan; Wang, Xianglin; Chien, Wei-Jung; Panchal, Rahul; Coban, Muhammed; Chong, In Suk; Reznik, Yuriy A.

2011-01-01

This paper describes video coding technology proposal submitted by Qualcomm Inc. in response to a joint call for proposal (CfP) issued by ITU-T SG16 Q.6 (VCEG) and ISO/IEC JTC1/SC29/WG11 (MPEG) in January 2010. Proposed video codec follows a hybrid coding approach based on temporal prediction, followed by transform, quantization, and entropy coding of the residual. Some of its key features are extended block sizes (up to 64x64), recursive integer transforms, single pass switched interpolation filters with offsets (single pass SIFO), mode dependent directional transform (MDDT) for intra-coding, luma and chroma high precision filtering, geometry motion partitioning, adaptive motion vector resolution. It also incorporates internal bit-depth increase (IBDI), and modified quadtree based adaptive loop filtering (QALF). Simulation results are presented for a variety of bit rates, resolutions and coding configurations to demonstrate the high compression efficiency achieved by the proposed video codec at moderate level of encoding and decoding complexity. For random access hierarchical B configuration (HierB), the proposed video codec achieves an average BD-rate reduction of 30.88c/o compared to the H.264/AVC alpha anchor. For low delay hierarchical P (HierP) configuration, the proposed video codec achieves an average BD-rate reduction of 32.96c/o and 48.57c/o, compared to the H.264/AVC beta and gamma anchors, respectively.

Efficient numerical simulation of non-integer-order space-fractional reaction-diffusion equation via the Riemann-Liouville operator

NASA Astrophysics Data System (ADS)

Owolabi, Kolade M.

2018-03-01

In this work, we are concerned with the solution of non-integer space-fractional reaction-diffusion equations with the Riemann-Liouville space-fractional derivative in high dimensions. We approximate the Riemann-Liouville derivative with the Fourier transform method and advance the resulting system in time with any time-stepping solver. In the numerical experiments, we expect the travelling wave to arise from the given initial condition on the computational domain (-∞, ∞), which we terminate in the numerical experiments with a large but truncated value of L. It is necessary to choose L large enough to allow the waves to have enough space to distribute. Experimental results in high dimensions on the space-fractional reaction-diffusion models with applications to biological models (Fisher and Allen-Cahn equations) are considered. Simulation results reveal that fractional reaction-diffusion equations can give rise to a range of physical phenomena when compared to non-integer-order cases. As a result, most meaningful and practical situations are found to be modelled with the concept of fractional calculus.

Visually Lossless Data Compression for Real-Time Frame/Pushbroom Space Science Imagers

NASA Technical Reports Server (NTRS)

Yeh, Pen-Shu; Venbrux, Jack; Bhatia, Prakash; Miller, Warner H.

2000-01-01

A visually lossless data compression technique is currently being developed for space science applications under the requirement of high-speed push-broom scanning. The technique is also applicable to frame based imaging and is error-resilient in that error propagation is contained within a few scan lines. The algorithm is based on a block transform of a hybrid of modulated lapped transform (MLT) and discrete cosine transform (DCT), or a 2-dimensional lapped transform, followed by bit-plane encoding; this combination results in an embedded bit string with exactly the desirable compression rate as desired by the user. The approach requires no unique table to maximize its performance. The compression scheme performs well on a suite of test images typical of images from spacecraft instruments. Flight qualified hardware implementations are in development; a functional chip set is expected by the end of 2001. The chip set is being designed to compress data in excess of 20 Msamples/sec and support quantizations from 2 to 16 bits.

A progressive data compression scheme based upon adaptive transform coding: Mixture block coding of natural images

NASA Technical Reports Server (NTRS)

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.

A closed form solution for constant flux pumping in a well under partial penetration condition

NASA Astrophysics Data System (ADS)

Yang, Shaw-Yang; Yeh, Hund-Der; Chiu, Pin-Yuan

2006-05-01

An analytical model for the constant flux pumping test is developed in a radial confined aquifer system with a partially penetrating well. The Laplace domain solution is derived by the application of the Laplace transforms with respect to time and the finite Fourier cosine transforms with respect to the vertical coordinates. A time domain solution is obtained using the inverse Laplace transforms, convolution theorem, and Bromwich integral method. The effect of partial penetration is apparent if the test well is completed with a short screen. An aquifer thickness 100 times larger than the screen length of the well can be considered as infinite. This solution can be used to investigate the effects of screen length and location on the drawdown distribution in a radial confined aquifer system and to produce type curves for the estimation of aquifer parameters with field pumping drawdown data.

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

NASA Technical Reports Server (NTRS)

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

1978-01-01

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

Human Motion Capture Data Tailored Transform Coding.

PubMed

Junhui Hou; Lap-Pui Chau; Magnenat-Thalmann, Nadia; Ying He

2015-07-01

Human motion capture (mocap) is a widely used technique for digitalizing human movements. With growing usage, compressing mocap data has received increasing attention, since compact data size enables efficient storage and transmission. Our analysis shows that mocap data have some unique characteristics that distinguish themselves from images and videos. Therefore, directly borrowing image or video compression techniques, such as discrete cosine transform, does not work well. In this paper, we propose a novel mocap-tailored transform coding algorithm that takes advantage of these features. Our algorithm segments the input mocap sequences into clips, which are represented in 2D matrices. Then it computes a set of data-dependent orthogonal bases to transform the matrices to frequency domain, in which the transform coefficients have significantly less dependency. Finally, the compression is obtained by entropy coding of the quantized coefficients and the bases. Our method has low computational cost and can be easily extended to compress mocap databases. It also requires neither training nor complicated parameter setting. Experimental results demonstrate that the proposed scheme significantly outperforms state-of-the-art algorithms in terms of compression performance and speed.

Dynamical property analysis of fractionally damped van der pol oscillator and its application

NASA Astrophysics Data System (ADS)

Zhong, Qiuhui; Zhang, Chunrui

2012-01-01

In this paper, the fractionally damped van der pol equation was studied. Firstly, the fractionally damped van der pol equation was transformed into a set of integer order equations. Then the Lyapunov exponents diagram was given. Secondly, it was transformed into a set of fractional integral equations and solved by a predictor-corrector method. The time domain diagrams and phase trajectory were used to describe the dynamic behavior. Finally, the fractionally damped van der pol equation was used to detect a weak signal.

A Method for Direct Determination of Real Height from Virtual Height Data for the Auroral Region of the Ionosphere.

DTIC Science & Technology

1979-11-14

except when n is an integer we write Eq. (13) in the form jj-g) (14) whose inverse transform is readily calculated as 2 d2 ’ F u(k)= H- J (F) dF (15...as "i(s) 1 s2 (45) r(+1 -2 s 7 The inverse transform of Eq. (45) is then _I_ d fF I H’ (F)dF (46) -J ’-(1+*) d Fr 1 r(l-A) which may be written as F

Maslov indices, Poisson brackets, and singular differential forms

NASA Astrophysics Data System (ADS)

Esterlis, I.; Haggard, H. M.; Hedeman, A.; Littlejohn, R. G.

2014-06-01

Maslov indices are integers that appear in semiclassical wave functions and quantization conditions. They are often notoriously difficult to compute. We present methods of computing the Maslov index that rely only on typically elementary Poisson brackets and simple linear algebra. We also present a singular differential form, whose integral along a curve gives the Maslov index of that curve. The form is closed but not exact, and transforms by an exact differential under canonical transformations. We illustrate the method with the 6j-symbol, which is important in angular-momentum theory and in quantum gravity.

Luminance-model-based DCT quantization for color image compression

NASA Technical Reports Server (NTRS)

Ahumada, Albert J., Jr.; Peterson, Heidi A.

1992-01-01

A model is developed to approximate visibility thresholds for discrete cosine transform (DCT) coefficient quantization error based on the peak-to-peak luminance of the error image. Experimentally measured visibility thresholds for R, G, and B DCT basis functions can be predicted by a simple luminance-based detection model. This model allows DCT coefficient quantization matrices to be designed for display conditions other than those of the experimental measurements: other display luminances, other veiling luminances, and other spatial frequencies (different pixel spacings, viewing distances, and aspect ratios).

CONSTRUCTING AND DERIVING RECIPROCAL TRIGONOMETRIC RELATIONS: A FUNCTIONAL ANALYTIC APPROACH

PubMed Central

Ninness, Chris; Dixon, Mark; Barnes-Holmes, Dermot; Rehfeldt, Ruth Anne; Rumph, Robin; McCuller, Glen; Holland, James; Smith, Ronald; Ninness, Sharon K; McGinty, Jennifer

2009-01-01

Participants were pretrained and tested on mutually entailed trigonometric relations and combinatorially entailed relations as they pertained to positive and negative forms of sine, cosine, secant, and cosecant. Experiment 1 focused on training and testing transformations of these mathematical functions in terms of amplitude and frequency followed by tests of novel relations. Experiment 2 addressed training in accordance with frames of coordination (same as) and frames of opposition (reciprocal of) followed by more tests of novel relations. All assessments of derived and novel formula-to-graph relations, including reciprocal functions with diversified amplitude and frequency transformations, indicated that all 4 participants demonstrated substantial improvement in their ability to identify increasingly complex trigonometric formula-to-graph relations pertaining to same as and reciprocal of to establish mathematically complex repertoires. PMID:19949509

Constructing and deriving reciprocal trigonometric relations: a functional analytic approach.

PubMed

Ninness, Chris; Dixon, Mark; Barnes-Holmes, Dermot; Rehfeldt, Ruth Anne; Rumph, Robin; McCuller, Glen; Holland, James; Smith, Ronald; Ninness, Sharon K; McGinty, Jennifer

2009-01-01

Participants were pretrained and tested on mutually entailed trigonometric relations and combinatorially entailed relations as they pertained to positive and negative forms of sine, cosine, secant, and cosecant. Experiment 1 focused on training and testing transformations of these mathematical functions in terms of amplitude and frequency followed by tests of novel relations. Experiment 2 addressed training in accordance with frames of coordination (same as) and frames of opposition (reciprocal of) followed by more tests of novel relations. All assessments of derived and novel formula-to-graph relations, including reciprocal functions with diversified amplitude and frequency transformations, indicated that all 4 participants demonstrated substantial improvement in their ability to identify increasingly complex trigonometric formula-to-graph relations pertaining to same as and reciprocal of to establish mathematically complex repertoires.

Efficiency optimization of a fast Poisson solver in beam dynamics simulation

NASA Astrophysics Data System (ADS)

Zheng, Dawei; Pöplau, Gisela; van Rienen, Ursula

2016-01-01

Calculating the solution of Poisson's equation relating to space charge force is still the major time consumption in beam dynamics simulations and calls for further improvement. In this paper, we summarize a classical fast Poisson solver in beam dynamics simulations: the integrated Green's function method. We introduce three optimization steps of the classical Poisson solver routine: using the reduced integrated Green's function instead of the integrated Green's function; using the discrete cosine transform instead of discrete Fourier transform for the Green's function; using a novel fast convolution routine instead of an explicitly zero-padded convolution. The new Poisson solver routine preserves the advantages of fast computation and high accuracy. This provides a fast routine for high performance calculation of the space charge effect in accelerators.

Comparison Of The Performance Of Hybrid Coders Under Different Configurations

NASA Astrophysics Data System (ADS)

Gunasekaran, S.; Raina J., P.

1983-10-01

Picture bandwidth reduction employing DPCM and Orthogonal Transform (OT) coding for TV transmission have been widely discussed in literature; both the techniques have their own advantages and limitations in terms of compression ratio, implementation, sensitivity to picture statistics and their sensitivity to the channel noise. Hybrid coding introduced by Habibi, - a cascade of the two techniques, offers excellent performance and proves to be attractive retaining the special advantages of both the techniques. In the recent times, the interest has shifted over to Hybrid coding, and in the absence of a report on the relative performance specifications of hybrid coders at different configurations, an attempt has been made to colate the information. Fourier, Hadamard, Slant, Sine, Cosine and Harr transforms have been considered for the present work.

Automatic blocking of nested loops

NASA Technical Reports Server (NTRS)

Schreiber, Robert; Dongarra, Jack J.

1990-01-01

Blocked algorithms have much better properties of data locality and therefore can be much more efficient than ordinary algorithms when a memory hierarchy is involved. On the other hand, they are very difficult to write and to tune for particular machines. The reorganization is considered of nested loops through the use of known program transformations in order to create blocked algorithms automatically. The program transformations used are strip mining, loop interchange, and a variant of loop skewing in which invertible linear transformations (with integer coordinates) of the loop indices are allowed. Some problems are solved concerning the optimal application of these transformations. It is shown, in a very general setting, how to choose a nearly optimal set of transformed indices. It is then shown, in one particular but rather frequently occurring situation, how to choose an optimal set of block sizes.

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

PubMed

Sheridan, Phil

2007-05-01

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

Extending ALE3D, an Arbitrarily Connected hexahedral 3D Code, to Very Large Problem Size (U)

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

Nichols, A L

2010-12-15

As the number of compute units increases on the ASC computers, the prospect of running previously unimaginably large problems is becoming a reality. In an arbitrarily connected 3D finite element code, like ALE3D, one must provide a unique identification number for every node, element, face, and edge. This is required for a number of reasons, including defining the global connectivity array required for domain decomposition, identifying appropriate communication patterns after domain decomposition, and determining the appropriate load locations for implicit solvers, for example. In most codes, the unique identification number is defined as a 32-bit integer. Thus the maximum valuemore » available is 231, or roughly 2.1 billion. For a 3D geometry consisting of arbitrarily connected hexahedral elements, there are approximately 3 faces for every element, and 3 edges for every node. Since the nodes and faces need id numbers, using 32-bit integers puts a hard limit on the number of elements in a problem at roughly 700 million. The first solution to this problem would be to replace 32-bit signed integers with 32-bit unsigned integers. This would increase the maximum size of a problem by a factor of 2. This provides some head room, but almost certainly not one that will last long. Another solution would be to replace all 32-bit int declarations with 64-bit long long declarations. (long is either a 32-bit or a 64-bit integer, depending on the OS). The problem with this approach is that there are only a few arrays that actually need to extended size, and thus this would increase the size of the problem unnecessarily. In a future computing environment where CPUs are abundant but memory relatively scarce, this is probably the wrong approach. Based on these considerations, we have chosen to replace only the global identifiers with the appropriate 64-bit integer. The problem with this approach is finding all the places where data that is specified as a 32-bit integer needs to be replaced with the 64-bit integer. that need to be replaced. In the rest of this paper we describe the techniques used to facilitate this transformation, issues raised, and issues still to be addressed. This poster will describe the reasons, methods, issues associated with extending the ALE3D code to run problems larger than 700 million elements.« less

Initial performance of the COSINE-100 experiment

NASA Astrophysics Data System (ADS)

Adhikari, G.; Adhikari, P.; de Souza, E. Barbosa; 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. G.; Kang, W.; Kauer, M.; Kim, B. H.; Kim, H.; Kim, H. J.; Kim, K. W.; Kim, M. C.; 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.; Prihtiadi, H.; Ra, S.; Rogers, F. R.; Rott, C.; Scarff, A.; Spooner, N. J. C.; Thompson, W. G.; Yang, L.; Yong, S. H.

2018-02-01

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.

Conjunctive management of multi-reservoir network system and groundwater system

NASA Astrophysics Data System (ADS)

Mani, A.; Tsai, F. T. C.

2015-12-01

This study develops a successive mixed-integer linear fractional programming (successive MILFP) method to conjunctively manage water resources provided by a multi-reservoir network system and a groundwater system. The conjunctive management objectives are to maximize groundwater withdrawals and maximize reservoir storages while satisfying water demands and raising groundwater level to a target level. The decision variables in the management problem are reservoir releases and spills, network flows and groundwater pumping rates. Using the fractional programming approach, the objective function is defined as a ratio of total groundwater withdraws to total reservoir storage deficits from the maximum storages. Maximizing this ratio function tends to maximizing groundwater use and minimizing surface water use. This study introduces a conditional constraint on groundwater head in order to sustain aquifers from overpumping: if current groundwater level is less than a target level, groundwater head at the next time period has to be raised; otherwise, it is allowed to decrease up to a certain extent. This conditional constraint is formulated into a set of mixed binary nonlinear constraints and results in a mixed-integer nonlinear fractional programming (MINLFP) problem. To solve the MINLFP problem, we first use the response matrix approach to linearize groundwater head with respect to pumping rate and reduce the problem to an MILFP problem. Using the Charnes-Cooper transformation, the MILFP is transformed to an equivalent mixed-integer linear programming (MILP). The solution of the MILP is successively updated by updating the response matrix in every iteration. The study uses IBM CPLEX to solve the MILP problem. The methodology is applied to water resources management in northern Louisiana. This conjunctive management approach aims to recover the declining groundwater level of the stressed Sparta aquifer by using surface water from a network of four reservoirs as an alternative source of supply.

One Shot Detection with Laplacian Object and Fast Matrix Cosine Similarity.

PubMed

Biswas, Sujoy Kumar; Milanfar, Peyman

2016-03-01

One shot, generic object detection involves searching for a single query object in a larger target image. Relevant approaches have benefited from features that typically model the local similarity patterns. In this paper, we combine local similarity (encoded by local descriptors) with a global context (i.e., a graph structure) of pairwise affinities among the local descriptors, embedding the query descriptors into a low dimensional but discriminatory subspace. Unlike principal components that preserve global structure of feature space, we actually seek a linear approximation to the Laplacian eigenmap that permits us a locality preserving embedding of high dimensional region descriptors. Our second contribution is an accelerated but exact computation of matrix cosine similarity as the decision rule for detection, obviating the computationally expensive sliding window search. We leverage the power of Fourier transform combined with integral image to achieve superior runtime efficiency that allows us to test multiple hypotheses (for pose estimation) within a reasonably short time. Our approach to one shot detection is training-free, and experiments on the standard data sets confirm the efficacy of our model. Besides, low computation cost of the proposed (codebook-free) object detector facilitates rather straightforward query detection in large data sets including movie videos.

Personalized Medicine in Veterans with Traumatic Brain Injuries

DTIC Science & Technology

2013-05-01

Pair-Group Method using Arithmetic averages ( UPGMA ) based on cosine correlation of row mean centered log2 signal values; this was the top 50%-tile...cluster- ing was performed by the UPGMA method using Cosine correlation as the similarity metric. For comparative purposes, clustered heat maps included...non-mTBI cases were subjected to unsupervised hierarchical clustering analysis using the UPGMA algorithm with cosine correlation as the similarity

Personalized Medicine in Veterans with Traumatic Brain Injuries

DTIC Science & Technology

2014-07-01

9 control cases are subjected to unsupervised hierarchical clustering analysis using the UPGMA algorithm with cosine correlation as the similarity...in unsu- pervised hierarchical clustering by the Un- weighted Pair-Group Method using Arithmetic averages ( UPGMA ) based on cosine correlation of row...of log2 trans- formed MAS5.0 signal values; probe set cluster- ing was performed by the UPGMA method using Cosine correlation as the similarity

Simultaneous compression and encryption for secure real-time secure transmission of sensitive video transmission

NASA Astrophysics Data System (ADS)

Al-Hayani, Nazar; Al-Jawad, Naseer; Jassim, Sabah A.

2014-05-01

Video compression and encryption became very essential in a secured real time video transmission. Applying both techniques simultaneously is one of the challenges where the size and the quality are important in multimedia transmission. In this paper we proposed a new technique for video compression and encryption. Both encryption and compression are based on edges extracted from the high frequency sub-bands of wavelet decomposition. The compression algorithm based on hybrid of: discrete wavelet transforms, discrete cosine transform, vector quantization, wavelet based edge detection, and phase sensing. The compression encoding algorithm treats the video reference and non-reference frames in two different ways. The encryption algorithm utilized A5 cipher combined with chaotic logistic map to encrypt the significant parameters and wavelet coefficients. Both algorithms can be applied simultaneously after applying the discrete wavelet transform on each individual frame. Experimental results show that the proposed algorithms have the following features: high compression, acceptable quality, and resistance to the statistical and bruteforce attack with low computational processing.

Estimated spectrum adaptive postfilter and the iterative prepost filtering algirighms

NASA Technical Reports Server (NTRS)

Linares, Irving (Inventor)

2004-01-01

The invention presents The Estimated Spectrum Adaptive Postfilter (ESAP) and the Iterative Prepost Filter (IPF) algorithms. These algorithms model a number of image-adaptive post-filtering and pre-post filtering methods. They are designed to minimize Discrete Cosine Transform (DCT) blocking distortion caused when images are highly compressed with the Joint Photographic Expert Group (JPEG) standard. The ESAP and the IPF techniques of the present invention minimize the mean square error (MSE) to improve the objective and subjective quality of low-bit-rate JPEG gray-scale images while simultaneously enhancing perceptual visual quality with respect to baseline JPEG images.

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

NASA Astrophysics Data System (ADS)

Selwyn, Ebenezer Juliet; Florinabel, D. Jemi

2018-04-01

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

Linear Transforms for Fourier Data on the Sphere: Application to High Angular Resolution Diffusion MRI of the Brain

PubMed Central

Haldar, Justin P.; Leahy, Richard M.

2013-01-01

This paper presents a novel family of linear transforms that can be applied to data collected from the surface of a 2-sphere in three-dimensional Fourier space. This family of transforms generalizes the previously-proposed Funk-Radon Transform (FRT), which was originally developed for estimating the orientations of white matter fibers in the central nervous system from diffusion magnetic resonance imaging data. The new family of transforms is characterized theoretically, and efficient numerical implementations of the transforms are presented for the case when the measured data is represented in a basis of spherical harmonics. After these general discussions, attention is focused on a particular new transform from this family that we name the Funk-Radon and Cosine Transform (FRACT). Based on theoretical arguments, it is expected that FRACT-based analysis should yield significantly better orientation information (e.g., improved accuracy and higher angular resolution) than FRT-based analysis, while maintaining the strong characterizability and computational efficiency of the FRT. Simulations are used to confirm these theoretical characteristics, and the practical significance of the proposed approach is illustrated with real diffusion weighted MRI brain data. These experiments demonstrate that, in addition to having strong theoretical characteristics, the proposed approach can outperform existing state-of-the-art orientation estimation methods with respect to measures such as angular resolution and robustness to noise and modeling errors. PMID:23353603

A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem

PubMed Central

Zamli, Kamal Z.; Din, Fakhrud; Bures, Miroslav

2018-01-01

The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically identify the best operation during runtime. Additionally, we integrate two new operations (Lévy flight motion and crossover) into the QLSCA to facilitate jumping out of local minima/maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is statistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95% confidence level. However, concerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95% confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90% confidence level. PMID:29771918

A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem.

PubMed

Zamli, Kamal Z; Din, Fakhrud; Ahmed, Bestoun S; Bures, Miroslav

2018-01-01

The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from -1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine- based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically identify the best operation during runtime. Additionally, we integrate two new operations (Lévy flight motion and crossover) into the QLSCA to facilitate jumping out of local minima/maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is statistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95% confidence level. However, concerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95% confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90% confidence level.

The Ablowitz–Ladik system on a finite set of integers

NASA Astrophysics Data System (ADS)

Xia, Baoqiang

2018-07-01

We show how to solve initial-boundary value problems for integrable nonlinear differential–difference equations on a finite set of integers. The method we employ is the discrete analogue of the unified transform (Fokas method). The implementation of this method to the Ablowitz–Ladik system yields the solution in terms of the unique solution of a matrix Riemann–Hilbert problem, which has a jump matrix with explicit -dependence involving certain functions referred to as spectral functions. Some of these functions are defined in terms of the initial value, while the remaining spectral functions are defined in terms of two sets of boundary values. These spectral functions are not independent but satisfy an algebraic relation called global relation. We analyze the global relation to characterize the unknown boundary values in terms of the given initial and boundary values. We also discuss the linearizable boundary conditions.

Disturbance observer-based adaptive sliding mode hybrid projective synchronisation of identical fractional-order financial systems

NASA Astrophysics Data System (ADS)

Khan, Ayub; Tyagi, Arti

2018-05-01

In this paper, we have studied the hybrid projective synchronisation for incommensurate, integer and commensurate fractional-order financial systems with unknown disturbance. To tackle the problem of unknown bounded disturbance, fractional-order disturbance observer is designed to approximate the unknown disturbance. Further, we have introduced simple sliding mode surface and designed adaptive sliding mode controllers incorporating with the designed fractional-order disturbance observer to achieve a bounded hybrid projective synchronisation between two identical fractional-order financial model with different initial conditions. It is shown that the slave system with disturbance can be synchronised with the projection of the master system generated through state transformation. Simulation results are presented to ensure the validity and effectiveness of the proposed sliding mode control scheme in the presence of external bounded unknown disturbance. Also, synchronisation error for commensurate, integer and incommensurate fractional-order financial systems is studied in numerical simulation.

Second rank direction cosine spherical tensor operators and the nuclear electric quadrupole hyperfine structure Hamiltonian of rotating molecules

NASA Astrophysics Data System (ADS)

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.

Geometric comparison of popular mixture-model distances.

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

Mitchell, Scott A.

2010-09-01

Statistical Latent Dirichlet Analysis produces mixture model data that are geometrically equivalent to points lying on a regular simplex in moderate to high dimensions. Numerous other statistical models and techniques also produce data in this geometric category, even though the meaning of the axes and coordinate values differs significantly. A distance function is used to further analyze these points, for example to cluster them. Several different distance functions are popular amongst statisticians; which distance function is chosen is usually driven by the historical preference of the application domain, information-theoretic considerations, or by the desirability of the clustering results. Relatively littlemore » consideration is usually given to how distance functions geometrically transform data, or the distances algebraic properties. Here we take a look at these issues, in the hope of providing complementary insight and inspiring further geometric thought. Several popular distances, {chi}{sup 2}, Jensen - Shannon divergence, and the square of the Hellinger distance, are shown to be nearly equivalent; in terms of functional forms after transformations, factorizations, and series expansions; and in terms of the shape and proximity of constant-value contours. This is somewhat surprising given that their original functional forms look quite different. Cosine similarity is the square of the Euclidean distance, and a similar geometric relationship is shown with Hellinger and another cosine. We suggest a geodesic variation of Hellinger. The square-root projection that arises in Hellinger distance is briefly compared to standard normalization for Euclidean distance. We include detailed derivations of some ratio and difference bounds for illustrative purposes. We provide some constructions that nearly achieve the worst-case ratios, relevant for contours.« less

The hyperbolic chemical bond: Fourier analysis of ground and first excited state potential energy curves of HX (X = H-Ne).

PubMed

Harrison, John A

2008-09-04

RHF/aug-cc-pVnZ, UHF/aug-cc-pVnZ, and QCISD/aug-cc-pVnZ, n = 2-5, potential energy curves of H2 X (1) summation g (+) are analyzed by Fourier transform methods after transformation to a new coordinate system via an inverse hyperbolic cosine coordinate mapping. The Fourier frequency domain spectra are interpreted in terms of underlying mathematical behavior giving rise to distinctive features. There is a clear difference between the underlying mathematical nature of the potential energy curves calculated at the HF and full-CI levels. The method is particularly suited to the analysis of potential energy curves obtained at the highest levels of theory because the Fourier spectra are observed to be of a compact nature, with the envelope of the Fourier frequency coefficients decaying in magnitude in an exponential manner. The finite number of Fourier coefficients required to describe the CI curves allows for an optimum sampling strategy to be developed, corresponding to that required for exponential and geometric convergence. The underlying random numerical noise due to the finite convergence criterion is also a clearly identifiable feature in the Fourier spectrum. The methodology is applied to the analysis of MRCI potential energy curves for the ground and first excited states of HX (X = H-Ne). All potential energy curves exhibit structure in the Fourier spectrum consistent with the existence of resonances. The compact nature of the Fourier spectra following the inverse hyperbolic cosine coordinate mapping is highly suggestive that there is some advantage in viewing the chemical bond as having an underlying hyperbolic nature.

A Robust Zero-Watermarking Algorithm for Audio

NASA Astrophysics Data System (ADS)

Chen, Ning; Zhu, Jie

2007-12-01

In traditional watermarking algorithms, the insertion of watermark into the host signal inevitably introduces some perceptible quality degradation. Another problem is the inherent conflict between imperceptibility and robustness. Zero-watermarking technique can solve these problems successfully. Instead of embedding watermark, the zero-watermarking technique extracts some essential characteristics from the host signal and uses them for watermark detection. However, most of the available zero-watermarking schemes are designed for still image and their robustness is not satisfactory. In this paper, an efficient and robust zero-watermarking technique for audio signal is presented. The multiresolution characteristic of discrete wavelet transform (DWT), the energy compression characteristic of discrete cosine transform (DCT), and the Gaussian noise suppression property of higher-order cumulant are combined to extract essential features from the host audio signal and they are then used for watermark recovery. Simulation results demonstrate the effectiveness of our scheme in terms of inaudibility, detection reliability, and robustness.

A visual detection model for DCT coefficient quantization

NASA Technical Reports Server (NTRS)

Ahumada, Albert J., Jr.; Peterson, Heidi A.

1993-01-01

The discrete cosine transform (DCT) is widely used in image compression, and is part of the JPEG and MPEG compression standards. The degree of compression, and the amount of distortion in the decompressed image are determined by the quantization of the transform coefficients. The standards do not specify how the DCT coefficients should be quantized. Our approach is to set the quantization level for each coefficient so that the quantization error is at the threshold of visibility. Here we combine results from our previous work to form our current best detection model for DCT coefficient quantization noise. This model predicts sensitivity as a function of display parameters, enabling quantization matrices to be designed for display situations varying in luminance, veiling light, and spatial frequency related conditions (pixel size, viewing distance, and aspect ratio). It also allows arbitrary color space directions for the representation of color.

A Fourier transform with speed improvements for microprocessor applications

NASA Technical Reports Server (NTRS)

Lokerson, D. C.; Rochelle, R.

1980-01-01

A fast Fourier transform algorithm for the RCA 1802microprocessor was developed for spacecraft instrument applications. The computations were tailored for the restrictions an eight bit machine imposes. The algorithm incorporates some aspects of Walsh function sequency to improve operational speed. This method uses a register to add a value proportional to the period of the band being processed before each computation is to be considered. If the result overflows into the DF register, the data sample is used in computation; otherwise computation is skipped. This operation is repeated for each of the 64 data samples. This technique is used for both sine and cosine portions of the computation. The processing uses eight bit data, but because of the many computations that can increase the size of the coefficient, floating point form is used. A method to reduce the alias problem in the lower bands is also described.

Analysis of Real Ship Rolling Dynamics under Wave Excitement Force Composed of Sums of Cosine Functions

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

Zhang, Y. S.; Cai, F.; Xu, W. M.

2011-09-28

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 ofmore » cosine functions. The result well explains the course of ship rolling's chaotic mechanism and is useful for ship hydrodynamic study.« less

Ultrafast Dephasing and Incoherent Light Photon Echoes in Organic Amorphous Systems

NASA Astrophysics Data System (ADS)

Yano, Ryuzi; Matsumoto, Yoshinori; Tani, Toshiro; Nakatsuka, Hiroki

1989-10-01

Incoherent light photon echoes were observed in organic amorphous systems (cresyl violet in polyvinyl alcohol and 1,4-dihydroxyanthraquinone in polymethacrylic acid) by using temporally-incoherent nanosecond laser pulses. It was found that an echo decay curve of an organic amorphous system is composed of a sharp peak which decays very rapidly and a slowly decaying wing at the tail. We show that the persistent hole burning (PHB) spectra were reproduced by the Fourier-cosine transforms of the echo decay curves. We claim that in general, we must take into account the multi-level feature of the system in order to explain ultrafast dephasing at very low temperatures.

Experimental Observation and Theoretical Description of Multisoliton Fission in Shallow Water

NASA Astrophysics Data System (ADS)

Trillo, S.; Deng, G.; Biondini, G.; Klein, M.; Clauss, G. F.; Chabchoub, A.; Onorato, M.

2016-09-01

We observe the dispersive breaking of cosine-type long waves [Phys. Rev. Lett. 15, 240 (1965)] in shallow water, characterizing the highly nonlinear "multisoliton" fission over variable conditions. We provide new insight into the interpretation of the results by analyzing the data in terms of the periodic inverse scattering transform for the Korteweg-de Vries equation. In a wide range of dispersion and nonlinearity, the data compare favorably with our analytical estimate, based on a rigorous WKB approach, of the number of emerging solitons. We are also able to observe experimentally the universal Fermi-Pasta-Ulam recurrence in the regime of moderately weak dispersion.

Solar Geometry

Atmospheric Science Data Center

2014-09-25

Solar Noon (GMT time) The time when the sun is due south in the northern hemisphere or due north in the southern ... The average cosine of the angle between the sun and directly overhead during daylight hours.   Cosine solar ...

An iris recognition algorithm based on DCT and GLCM

NASA Astrophysics Data System (ADS)

Feng, G.; Wu, Ye-qing

2008-04-01

With the enlargement of mankind's activity range, the significance for person's status identity is becoming more and more important. So many different techniques for person's status identity were proposed for this practical usage. Conventional person's status identity methods like password and identification card are not always reliable. A wide variety of biometrics has been developed for this challenge. Among those biologic characteristics, iris pattern gains increasing attention for its stability, reliability, uniqueness, noninvasiveness and difficult to counterfeit. The distinct merits of the iris lead to its high reliability for personal identification. So the iris identification technique had become hot research point in the past several years. This paper presents an efficient algorithm for iris recognition using gray-level co-occurrence matrix(GLCM) and Discrete Cosine transform(DCT). To obtain more representative iris features, features from space and DCT transformation domain are extracted. Both GLCM and DCT are applied on the iris image to form the feature sequence in this paper. The combination of GLCM and DCT makes the iris feature more distinct. Upon GLCM and DCT the eigenvector of iris extracted, which reflects features of spatial transformation and frequency transformation. Experimental results show that the algorithm is effective and feasible with iris recognition.

Multipurpose image watermarking algorithm based on multistage vector quantization.

PubMed

Lu, Zhe-Ming; Xu, Dian-Guo; Sun, Sheng-He

2005-06-01

The rapid growth of digital multimedia and Internet technologies has made copyright protection, copy protection, and integrity verification three important issues in the digital world. To solve these problems, the digital watermarking technique has been presented and widely researched. Traditional watermarking algorithms are mostly based on discrete transform domains, such as the discrete cosine transform, discrete Fourier transform (DFT), and discrete wavelet transform (DWT). Most of these algorithms are good for only one purpose. Recently, some multipurpose digital watermarking methods have been presented, which can achieve the goal of content authentication and copyright protection simultaneously. However, they are based on DWT or DFT. Lately, several robust watermarking schemes based on vector quantization (VQ) have been presented, but they can only be used for copyright protection. In this paper, we present a novel multipurpose digital image watermarking method based on the multistage vector quantizer structure, which can be applied to image authentication and copyright protection. In the proposed method, the semi-fragile watermark and the robust watermark are embedded in different VQ stages using different techniques, and both of them can be extracted without the original image. Simulation results demonstrate the effectiveness of our algorithm in terms of robustness and fragility.

Linear transforms for Fourier data on the sphere: application to high angular resolution diffusion MRI of the brain.

PubMed

Haldar, Justin P; Leahy, Richard M

2013-05-01

This paper presents a novel family of linear transforms that can be applied to data collected from the surface of a 2-sphere in three-dimensional Fourier space. This family of transforms generalizes the previously-proposed Funk-Radon Transform (FRT), which was originally developed for estimating the orientations of white matter fibers in the central nervous system from diffusion magnetic resonance imaging data. The new family of transforms is characterized theoretically, and efficient numerical implementations of the transforms are presented for the case when the measured data is represented in a basis of spherical harmonics. After these general discussions, attention is focused on a particular new transform from this family that we name the Funk-Radon and Cosine Transform (FRACT). Based on theoretical arguments, it is expected that FRACT-based analysis should yield significantly better orientation information (e.g., improved accuracy and higher angular resolution) than FRT-based analysis, while maintaining the strong characterizability and computational efficiency of the FRT. Simulations are used to confirm these theoretical characteristics, and the practical significance of the proposed approach is illustrated with real diffusion weighted MRI brain data. These experiments demonstrate that, in addition to having strong theoretical characteristics, the proposed approach can outperform existing state-of-the-art orientation estimation methods with respect to measures such as angular resolution and robustness to noise and modeling errors. Copyright © 2013 Elsevier Inc. All rights reserved.

A single-source photon source model of a linear accelerator for Monte Carlo dose calculation

PubMed Central

Glatting, Gerhard; Wenz, Frederik; Fleckenstein, Jens

2017-01-01

Purpose To introduce a new method of deriving a virtual source model (VSM) of a linear accelerator photon beam from a phase space file (PSF) for Monte Carlo (MC) dose calculation. Materials and methods A PSF of a 6 MV photon beam was generated by simulating the interactions of primary electrons with the relevant geometries of a Synergy linear accelerator (Elekta AB, Stockholm, Sweden) and recording the particles that reach a plane 16 cm downstream the electron source. Probability distribution functions (PDFs) for particle positions and energies were derived from the analysis of the PSF. These PDFs were implemented in the VSM using inverse transform sampling. To model particle directions, the phase space plane was divided into a regular square grid. Each element of the grid corresponds to an area of 1 mm2 in the phase space plane. The average direction cosines, Pearson correlation coefficient (PCC) between photon energies and their direction cosines, as well as the PCC between the direction cosines were calculated for each grid element. Weighted polynomial surfaces were then fitted to these 2D data. The weights are used to correct for heteroscedasticity across the phase space bins. The directions of the particles created by the VSM were calculated from these fitted functions. The VSM was validated against the PSF by comparing the doses calculated by the two methods for different square field sizes. The comparisons were performed with profile and gamma analyses. Results The doses calculated with the PSF and VSM agree to within 3% /1 mm (>95% pixel pass rate) for the evaluated fields. Conclusion A new method of deriving a virtual photon source model of a linear accelerator from a PSF file for MC dose calculation was developed. Validation results show that the doses calculated with the VSM and the PSF agree to within 3% /1 mm. PMID:28886048

A single-source photon source model of a linear accelerator for Monte Carlo dose calculation.

PubMed

Nwankwo, Obioma; Glatting, Gerhard; Wenz, Frederik; Fleckenstein, Jens

2017-01-01

To introduce a new method of deriving a virtual source model (VSM) of a linear accelerator photon beam from a phase space file (PSF) for Monte Carlo (MC) dose calculation. A PSF of a 6 MV photon beam was generated by simulating the interactions of primary electrons with the relevant geometries of a Synergy linear accelerator (Elekta AB, Stockholm, Sweden) and recording the particles that reach a plane 16 cm downstream the electron source. Probability distribution functions (PDFs) for particle positions and energies were derived from the analysis of the PSF. These PDFs were implemented in the VSM using inverse transform sampling. To model particle directions, the phase space plane was divided into a regular square grid. Each element of the grid corresponds to an area of 1 mm2 in the phase space plane. The average direction cosines, Pearson correlation coefficient (PCC) between photon energies and their direction cosines, as well as the PCC between the direction cosines were calculated for each grid element. Weighted polynomial surfaces were then fitted to these 2D data. The weights are used to correct for heteroscedasticity across the phase space bins. The directions of the particles created by the VSM were calculated from these fitted functions. The VSM was validated against the PSF by comparing the doses calculated by the two methods for different square field sizes. The comparisons were performed with profile and gamma analyses. The doses calculated with the PSF and VSM agree to within 3% /1 mm (>95% pixel pass rate) for the evaluated fields. A new method of deriving a virtual photon source model of a linear accelerator from a PSF file for MC dose calculation was developed. Validation results show that the doses calculated with the VSM and the PSF agree to within 3% /1 mm.

On the application of under-decimated filter banks

NASA Technical Reports Server (NTRS)

Lin, Y.-P.; Vaidyanathan, P. P.

1994-01-01

Maximally decimated filter banks have been extensively studied in the past. A filter bank is said to be under-decimated if the number of channels is more than the decimation ratio in the subbands. A maximally decimated filter bank is well known for its application in subband coding. Another application of maximally decimated filter banks is in block filtering. Convolution through block filtering has the advantages that parallelism is increased and data are processed at a lower rate. However, the computational complexity is comparable to that of direct convolution. More recently, another type of filter bank convolver has been developed. In this scheme, the convolution is performed in the subbands. Quantization and bit allocation of subband signals are based on signal variance, as in subband coding. Consequently, for a fixed rate, the result of convolution is more accurate than is direct convolution. This type of filter bank convolver also enjoys the advantages of block filtering, parallelism, and a lower working rate. Nevertheless, like block filtering, there is no computational saving. In this article, under-decimated systems are introduced to solve the problem. The new system is decimated only by half the number of channels. Two types of filter banks can be used in the under-decimated system: the discrete Fourier transform (DFT) filter banks and the cosine modulated filter banks. They are well known for their low complexity. In both cases, the system is approximately alias free, and the overall response is equivalent to a tunable multilevel filter. Properties of the DFT filter banks and the cosine modulated filter banks can be exploited to simultaneously achieve parallelism, computational saving, and a lower working rate. Furthermore, for both systems, the implementation cost of the analysis or synthesis bank is comparable to that of one prototype filter plus some low-complexity modulation matrices. The individual analysis and synthesis filters have complex coefficients in the DFT filter banks but have real coefficients in the cosine modulated filter banks.

On the application of under-decimated filter banks

NASA Astrophysics Data System (ADS)

Lin, Y.-P.; Vaidyanathan, P. P.

1994-11-01

Maximally decimated filter banks have been extensively studied in the past. A filter bank is said to be under-decimated if the number of channels is more than the decimation ratio in the subbands. A maximally decimated filter bank is well known for its application in subband coding. Another application of maximally decimated filter banks is in block filtering. Convolution through block filtering has the advantages that parallelism is increased and data are processed at a lower rate. However, the computational complexity is comparable to that of direct convolution. More recently, another type of filter bank convolver has been developed. In this scheme, the convolution is performed in the subbands. Quantization and bit allocation of subband signals are based on signal variance, as in subband coding. Consequently, for a fixed rate, the result of convolution is more accurate than is direct convolution. This type of filter bank convolver also enjoys the advantages of block filtering, parallelism, and a lower working rate. Nevertheless, like block filtering, there is no computational saving. In this article, under-decimated systems are introduced to solve the problem. The new system is decimated only by half the number of channels. Two types of filter banks can be used in the under-decimated system: the discrete Fourier transform (DFT) filter banks and the cosine modulated filter banks. They are well known for their low complexity. In both cases, the system is approximately alias free, and the overall response is equivalent to a tunable multilevel filter. Properties of the DFT filter banks and the cosine modulated filter banks can be exploited to simultaneously achieve parallelism, computational saving, and a lower working rate.

Spatio-temporal phase retrieval in speckle interferometry with Hilbert transform and two-dimensional phase unwrapping

NASA Astrophysics Data System (ADS)

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.

A Local DCT-II Feature Extraction Approach for Personal Identification Based on Palmprint

NASA Astrophysics Data System (ADS)

Choge, H. Kipsang; Oyama, Tadahiro; Karungaru, Stephen; Tsuge, Satoru; Fukumi, Minoru

Biometric applications based on the palmprint have recently attracted increased attention from various researchers. In this paper, a method is presented that differs from the commonly used global statistical and structural techniques by extracting and using local features instead. The middle palm area is extracted after preprocessing for rotation, position and illumination normalization. The segmented region of interest is then divided into blocks of either 8×8 or 16×16 pixels in size. The type-II Discrete Cosine Transform (DCT) is applied to transform the blocks into DCT space. A subset of coefficients that encode the low to medium frequency components is selected using the JPEG-style zigzag scanning method. Features from each block are subsequently concatenated into a compact feature vector and used in palmprint verification experiments with palmprints from the PolyU Palmprint Database. Results indicate that this approach achieves better results than many conventional transform-based methods, with an excellent recognition accuracy above 99% and an Equal Error Rate (EER) of less than 1.2% in palmprint verification.

An accurate surface topography restoration algorithm for white light interferometry

NASA Astrophysics Data System (ADS)

Yuan, He; Zhang, Xiangchao; Xu, Min

2017-10-01

As an important measuring technique, white light interferometry can realize fast and non-contact measurement, thus it is now widely used in the field of ultra-precision engineering. However, the traditional recovery algorithms of surface topographies have flaws and limits. In this paper, we propose a new algorithm to solve these problems. It is a combination of Fourier transform and improved polynomial fitting method. Because the white light interference signal is usually expressed as a cosine signal whose amplitude is modulated by a Gaussian function, its fringe visibility is not constant and varies with different scanning positions. The interference signal is processed first by Fourier transform, then the positive frequency part is selected and moved back to the center of the amplitude-frequency curve. In order to restore the surface morphology, a polynomial fitting method is used to fit the amplitude curve after inverse Fourier transform and obtain the corresponding topography information. The new method is then compared to the traditional algorithms. It is proved that the aforementioned drawbacks can be effectively overcome. The relative error is less than 0.8%.

Embedding multiple watermarks in the DFT domain using low- and high-frequency bands

NASA Astrophysics Data System (ADS)

Ganic, Emir; Dexter, Scott D.; Eskicioglu, Ahmet M.

2005-03-01

Although semi-blind and blind watermarking schemes based on Discrete Cosine Transform (DCT) or Discrete Wavelet Transform (DWT) are robust to a number of attacks, they fail in the presence of geometric attacks such as rotation, scaling, and translation. The Discrete Fourier Transform (DFT) of a real image is conjugate symmetric, resulting in a symmetric DFT spectrum. Because of this property, the popularity of DFT-based watermarking has increased in the last few years. In a recent paper, we generalized a circular watermarking idea to embed multiple watermarks in lower and higher frequencies. Nevertheless, a circular watermark is visible in the DFT domain, providing a potential hacker with valuable information about the location of the watermark. In this paper, our focus is on embedding multiple watermarks that are not visible in the DFT domain. Using several frequency bands increases the overall robustness of the proposed watermarking scheme. Specifically, our experiments show that the watermark embedded in lower frequencies is robust to one set of attacks, and the watermark embedded in higher frequencies is robust to a different set of attacks.

Microlens array processor with programmable weight mask and direct optical input

NASA Astrophysics Data System (ADS)

Schmid, Volker R.; Lueder, Ernst H.; Bader, Gerhard; Maier, Gert; Siegordner, Jochen

1999-03-01

We present an optical feature extraction system with a microlens array processor. The system is suitable for online implementation of a variety of transforms such as the Walsh transform and DCT. Operating with incoherent light, our processor accepts direct optical input. Employing a sandwich- like architecture, we obtain a very compact design of the optical system. The key elements of the microlens array processor are a square array of 15 X 15 spherical microlenses on acrylic substrate and a spatial light modulator as transmissive mask. The light distribution behind the mask is imaged onto the pixels of a customized a-Si image sensor with adjustable gain. We obtain one output sample for each microlens image and its corresponding weight mask area as summation of the transmitted intensity within one sensor pixel. The resulting architecture is very compact and robust like a conventional camera lens while incorporating a high degree of parallelism. We successfully demonstrate a Walsh transform into the spatial frequency domain as well as the implementation of a discrete cosine transform with digitized gray values. We provide results showing the transformation performance for both synthetic image patterns and images of natural texture samples. The extracted frequency features are suitable for neural classification of the input image. Other transforms and correlations can be implemented in real-time allowing adaptive optical signal processing.

THz-bandwidth photonic Hilbert transformers based on fiber Bragg gratings in transmission.

PubMed

Fernández-Ruiz, María R; Wang, Lixian; Carballar, Alejandro; Burla, Maurizio; Azaña, José; LaRochelle, Sophie

2015-01-01

THz-bandwidth photonic Hilbert transformers (PHTs) are implemented for the first time, to the best of our knowledge, based on fiber Bragg grating (FBG) technology. To increase the practical bandwidth limitation of FBGs (typically <200  GHz), a superstructure based on two superimposed linearly-chirped FBGs operating in transmission has been employed. The use of a transmission FBG involves first a conversion of the non-minimum phase response of the PHT into a minimum-phase response by adding an anticipated instantaneous component to the desired system temporal impulse response. Using this methodology, a 3-THz-bandwidth integer PHT and a fractional (order 0.81) PHT are designed, fabricated, and successfully characterized.

Infinite number of solvable generalizations of XY-chain, with cluster state, and with central charge c = m/2

NASA Astrophysics Data System (ADS)

Minami, Kazuhiko

2017-12-01

An infinite number of spin chains are solved and it is derived that the ground-state phase transitions belong to the universality classes with central charge c = m / 2, where m is an integer. The models are diagonalized by automatically obtained transformations, many of which are different from the Jordan-Wigner transformation. The free energies, correlation functions, string order parameters, exponents, central charges, and the phase diagram are obtained. Most of the examples consist of the stabilizers of the cluster state. A unified structure of the one-dimensional XY and cluster-type spin chains is revealed, and other series of solvable models can be obtained through this formula.

Symmetry classification of time-fractional diffusion equation

NASA Astrophysics Data System (ADS)

Naeem, I.; Khan, M. D.

2017-01-01

In this article, a new approach is proposed to construct the symmetry groups for a class of fractional differential equations which are expressed in the modified Riemann-Liouville fractional derivative. We perform a complete group classification of a nonlinear fractional diffusion equation which arises in fractals, acoustics, control theory, signal processing and many other applications. Introducing the suitable transformations, the fractional derivatives are converted to integer order derivatives and in consequence the nonlinear fractional diffusion equation transforms to a partial differential equation (PDE). Then the Lie symmetries are computed for resulting PDE and using inverse transformations, we derive the symmetries for fractional diffusion equation. All cases are discussed in detail and results for symmetry properties are compared for different values of α. This study provides a new way of computing symmetries for a class of fractional differential equations.

Electro-mechanical sine/cosine generator

NASA Technical Reports Server (NTRS)

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.

Cosine-Gauss plasmon beam: a localized long-range nondiffracting surface wave.

PubMed

Lin, Jiao; Dellinger, Jean; Genevet, Patrice; Cluzel, Benoit; de Fornel, Frederique; Capasso, Federico

2012-08-31

A new surface wave is introduced, the cosine-Gauss beam, which does not diffract while it propagates in a straight line and tightly bound to the metallic surface for distances up to 80 μm. The generation of this highly localized wave is shown to be straightforward and highly controllable, with varying degrees of transverse confinement and directionality, by fabricating a plasmon launcher consisting of intersecting metallic gratings. Cosine-Gauss beams have potential for applications in plasmonics, notably for efficient coupling to nanophotonic devices, opening up new design possibilities for next-generation optical interconnects.

Lossy to lossless object-based coding of 3-D MRI data.

PubMed

Menegaz, Gloria; Thiran, Jean-Philippe

2002-01-01

We propose a fully three-dimensional (3-D) object-based coding system exploiting the diagnostic relevance of the different regions of the volumetric data for rate allocation. The data are first decorrelated via a 3-D discrete wavelet transform. The implementation via the lifting steps scheme allows to map integer-to-integer values, enabling lossless coding, and facilitates the definition of the object-based inverse transform. The coding process assigns disjoint segments of the bitstream to the different objects, which can be independently accessed and reconstructed at any up-to-lossless quality. Two fully 3-D coding strategies are considered: embedded zerotree coding (EZW-3D) and multidimensional layered zero coding (MLZC), both generalized for region of interest (ROI)-based processing. In order to avoid artifacts along region boundaries, some extra coefficients must be encoded for each object. This gives rise to an overheading of the bitstream with respect to the case where the volume is encoded as a whole. The amount of such extra information depends on both the filter length and the decomposition depth. The system is characterized on a set of head magnetic resonance images. Results show that MLZC and EZW-3D have competitive performances. In particular, the best MLZC mode outperforms the others state-of-the-art techniques on one of the datasets for which results are available in the literature.

Displaying radiologic images on personal computers: image storage and compression--Part 2.

PubMed

Gillespy, T; Rowberg, A H

1994-02-01

This is part 2 of our article on image storage and compression, the third article of our series for radiologists and imaging scientists on displaying, manipulating, and analyzing radiologic images on personal computers. Image compression is classified as lossless (nondestructive) or lossy (destructive). Common lossless compression algorithms include variable-length bit codes (Huffman codes and variants), dictionary-based compression (Lempel-Ziv variants), and arithmetic coding. Huffman codes and the Lempel-Ziv-Welch (LZW) algorithm are commonly used for image compression. All of these compression methods are enhanced if the image has been transformed into a differential image based on a differential pulse-code modulation (DPCM) algorithm. The LZW compression after the DPCM image transformation performed the best on our example images, and performed almost as well as the best of the three commercial compression programs tested. Lossy compression techniques are capable of much higher data compression, but reduced image quality and compression artifacts may be noticeable. Lossy compression is comprised of three steps: transformation, quantization, and coding. Two commonly used transformation methods are the discrete cosine transformation and discrete wavelet transformation. In both methods, most of the image information is contained in a relatively few of the transformation coefficients. The quantization step reduces many of the lower order coefficients to 0, which greatly improves the efficiency of the coding (compression) step. In fractal-based image compression, image patterns are stored as equations that can be reconstructed at different levels of resolution.

A statistical mechanical approach to restricted integer partition functions

NASA Astrophysics Data System (ADS)

Zhou, Chi-Chun; Dai, Wu-Sheng

2018-05-01

The main aim of this paper is twofold: (1) suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions—a way of writing an integer as a sum of other integers under certain restrictions. In this approach, the generating function of restricted integer partition functions is constructed from the canonical partition functions of various quantum gases. (2) Introducing a new type of restricted integer partition functions corresponding to general statistics which is a generalization of Gentile statistics in statistical mechanics; many kinds of restricted integer partition functions are special cases of this restricted integer partition function. Moreover, with statistical mechanics as a bridge, we reveal a mathematical fact: the generating function of restricted integer partition function is just the symmetric function which is a class of functions being invariant under the action of permutation groups. Using this approach, we provide some expressions of restricted integer partition functions as examples.

Model-order reduction of lumped parameter systems via fractional calculus

NASA Astrophysics Data System (ADS)

Hollkamp, John P.; Sen, Mihir; Semperlotti, Fabio

2018-04-01

This study investigates the use of fractional order differential models to simulate the dynamic response of non-homogeneous discrete systems and to achieve efficient and accurate model order reduction. The traditional integer order approach to the simulation of non-homogeneous systems dictates the use of numerical solutions and often imposes stringent compromises between accuracy and computational performance. Fractional calculus provides an alternative approach where complex dynamical systems can be modeled with compact fractional equations that not only can still guarantee analytical solutions, but can also enable high levels of order reduction without compromising on accuracy. Different approaches are explored in order to transform the integer order model into a reduced order fractional model able to match the dynamic response of the initial system. Analytical and numerical results show that, under certain conditions, an exact match is possible and the resulting fractional differential models have both a complex and frequency-dependent order of the differential operator. The implications of this type of approach for both model order reduction and model synthesis are discussed.

Long-life electromechanical sine-cosine generator

NASA Technical Reports Server (NTRS)

Flagge, B.

1971-01-01

Sine-cosine generator with no sliding parts is capable of withstanding a 20 Hz oscillation for more than 14 hours. Tests show that generator is electrically equal to potentiometer and that it has excellent dynamic characteristics. Generator shows promise of higher-speed applications than was previously possible.

Detecting Disease in Radiographs with Intuitive Confidence

PubMed Central

2015-01-01

This paper argues in favor of a specific type of confidence for use in computer-aided diagnosis and disease classification, namely, sine/cosine values of angles represented by points on the unit circle. The paper shows how this confidence is motivated by Chinese medicine and how sine/cosine values are directly related with the two forces Yin and Yang. The angle for which sine and cosine are equal (45°) represents the state of equilibrium between Yin and Yang, which is a state of nonduality that indicates neither normality nor abnormality in terms of disease classification. The paper claims that the proposed confidence is intuitive and can be readily understood by physicians. The paper underpins this thesis with theoretical results in neural signal processing, stating that a sine/cosine relationship between the actual input signal and the perceived (learned) input is key to neural learning processes. As a practical example, the paper shows how to use the proposed confidence values to highlight manifestations of tuberculosis in frontal chest X-rays. PMID:26495433

Sampling functions for geophysics

NASA Technical Reports Server (NTRS)

Giacaglia, G. E. O.; Lunquist, C. A.

1972-01-01

A set of spherical sampling functions is defined such that they are related to spherical-harmonic functions in the same way that the sampling functions of information theory are related to sine and cosine functions. An orderly distribution of (N + 1) squared sampling points on a sphere is given, for which the (N + 1) squared spherical sampling functions span the same linear manifold as do the spherical-harmonic functions through degree N. The transformations between the spherical sampling functions and the spherical-harmonic functions are given by recurrence relations. The spherical sampling functions of two arguments are extended to three arguments and to nonspherical reference surfaces. Typical applications of this formalism to geophysical topics are sketched.

SAR data compression: Application, requirements, and designs

NASA Technical Reports Server (NTRS)

Curlander, John C.; Chang, C. Y.

1991-01-01

The feasibility of reducing data volume and data rate is evaluated for the Earth Observing System (EOS) Synthetic Aperture Radar (SAR). All elements of data stream from the sensor downlink data stream to electronic delivery of browse data products are explored. The factors influencing design of a data compression system are analyzed, including the signal data characteristics, the image quality requirements, and the throughput requirements. The conclusion is that little or no reduction can be achieved in the raw signal data using traditional data compression techniques (e.g., vector quantization, adaptive discrete cosine transform) due to the induced phase errors in the output image. However, after image formation, a number of techniques are effective for data compression.

Development of a low cost UV index datalogger and comparison between UV index sensors

NASA Astrophysics Data System (ADS)

Gomes, L. M.; Ventura, L.

2018-02-01

Ultraviolet radiation (UVR) is the part of radiation emitted by the Sun, with range between 280 nm and 400 nm, and that reaches the Earth's surface. The UV rays are essential to the human because it stimulates the production of vitamin D but this radiation may be related to several health problems, including skin cancer and ocular diseases like pterygium, photokeratitis, cataract and more. To inform people about UV radiation, it is adopted the Ultraviolet Index (UVI). This UVI consists in a measure of solar UV radiation level, which contributes to cause sunburn on skin, also known as Erythema, and is indicated as an integer number between 1 and 14, associated to categories from low to extreme respectively. The aim of this work was to develop a low cost UVI datalogger capable of measuring three different UVI sensors simultaneously, record their data with timestamp and serve the measures online through a dedicated server, so general public can access their data and see the current UV radiation conditions. We also compared three different UVI sensors (SGlux UV cosine, Skye SKU440 and SiLabs SI1145) between them and with meteorological models during a period of months to verify their compliance. With five months data, we could verify the sensors working characteristics and decide which among them are the most suitable for research purposes.

Analysis of embolic signals with directional dual tree rational dilation wavelet transform.

PubMed

Serbes, Gorkem; Aydin, Nizamettin

2016-08-01

The dyadic discrete wavelet transform (dyadic-DWT), which is based on fixed integer sampling factor, has been used before for processing piecewise smooth biomedical signals. However, the dyadic-DWT has poor frequency resolution due to the low-oscillatory nature of its wavelet bases and therefore, it is less effective in processing embolic signals (ESs). To process ESs more effectively, a wavelet transform having better frequency resolution than the dyadic-DWT is needed. Therefore, in this study two ESs, containing micro-emboli and artifact waveforms, are analyzed with the Directional Dual Tree Rational-Dilation Wavelet Transform (DDT-RADWT). The DDT-RADWT, which can be directly applied to quadrature signals, is based on rational dilation factors and has adjustable frequency resolution. The analyses are done for both low and high Q-factors. It is proved that, when high Q-factor filters are employed in the DDT-RADWT, clearer representations of ESs can be attained in decomposed sub-bands and artifacts can be successfully separated.

Efficient Remainder Rule

ERIC Educational Resources Information Center

Firozzaman, Firoz; Firoz, Fahim

2017-01-01

Understanding the solution of a problem may require the reader to have background knowledge on the subject. For instance, finding an integer which, when divided by a nonzero integer leaves a remainder; but when divided by another nonzero integer may leave a different remainder. To find a smallest positive integer or a set of integers following the…

Personalized Medicine in Veterans with Traumatic Brain Injuries

DTIC Science & Technology

2011-05-01

UPGMA algorithm with cosine correlation as the similarity metric. Results are present as a heat map (left panel) demonstrating that the panel of 18... UPGMA algorithm with cosine correlation as the similarity metric. Results are presented as heat maps demonstrating the efficacy of using all 13

Principle and analysis of a rotational motion Fourier transform infrared spectrometer

NASA Astrophysics Data System (ADS)

Cai, Qisheng; Min, Huang; Han, Wei; Liu, Yixuan; Qian, Lulu; Lu, Xiangning

2017-09-01

Fourier transform infrared spectroscopy is an important technique in studying molecular energy levels, analyzing material compositions, and environmental pollutants detection. A novel rotational motion Fourier transform infrared spectrometer with high stability and ultra-rapid scanning characteristics is proposed in this paper. The basic principle, the optical path difference (OPD) calculations, and some tolerance analysis are elaborated. The OPD of this spectrometer is obtained by the continuously rotational motion of a pair of parallel mirrors instead of the translational motion in traditional Michelson interferometer. Because of the rotational motion, it avoids the tilt problems occurred in the translational motion Michelson interferometer. There is a cosine function relationship between the OPD and the rotating angle of the parallel mirrors. An optical model is setup in non-sequential mode of the ZEMAX software, and the interferogram of a monochromatic light is simulated using ray tracing method. The simulated interferogram is consistent with the theoretically calculated interferogram. As the rotating mirrors are the only moving elements in this spectrometer, the parallelism of the rotating mirrors and the vibration during the scan are analyzed. The vibration of the parallel mirrors is the main error during the rotation. This high stability and ultra-rapid scanning Fourier transform infrared spectrometer is a suitable candidate for airborne and space-borne remote sensing spectrometer.

Fast algorithm for computing a primitive /2 to power p + 1/p-th root of unity in GF/q squared/

NASA Technical Reports Server (NTRS)

Reed, I. S.; Truong, T. K.; Miller, R. L.

1978-01-01

A quick method is described for finding the primitive (2 to power p + 1)p-th root of unity in the Galois field GF(q squared), where q = (2 to power p) - 1 and is known as a Mersenne prime. Determination of this root is necessary to implement complex integer transforms of length (2 to power k) times p over the Galois field, with k varying between 3 and p + 1.

Topological transformations of Hopf solitons in chiral ferromagnets and liquid crystals.

PubMed

Tai, Jung-Shen B; Ackerman, Paul J; Smalyukh, Ivan I

2018-01-30

Liquid crystals are widely known for their facile responses to external fields, which forms a basis of the modern information display technology. However, switching of molecular alignment field configurations typically involves topologically trivial structures, although singular line and point defects often appear as short-lived transient states. Here, we demonstrate electric and magnetic switching of nonsingular solitonic structures in chiral nematic and ferromagnetic liquid crystals. These topological soliton structures are characterized by Hopf indices, integers corresponding to the numbers of times that closed-loop-like spatial regions (dubbed "preimages") of two different single orientations of rod-like molecules or magnetization are linked with each other. We show that both dielectric and ferromagnetic response of the studied material systems allow for stabilizing a host of topological solitons with different Hopf indices. The field transformations during such switching are continuous when Hopf indices remain unchanged, even when involving transformations of preimages, but discontinuous otherwise.

Application of the Ramanujan Fourier Transform for the analysis of secondary structure content in amino acid sequences.

PubMed

Mainardi, L T; Pattini, L; Cerutti, S

2007-01-01

A novel method is presented for the investigation of protein properties of sequences using Ramanujan Fourier Transform (RFT). The new methodology involves the preprocessing of protein sequence data by numerically encoding it and then applying the RFT. The RFT is based on projecting the obtained numerical series on a set of basis functions constituted by Ramanujan sums (RS). In RS components, periodicities of finite integer length, rather than frequency, (as in classical harmonic analysis) are considered. The potential of the new approach is documented by a few examples in the analysis of hydrophobic profiles of proteins in two classes including abundance of alpha-helices (group A) or beta-strands (group B). Different patterns are provided as evidence. RFT can be used to characterize the structural properties of proteins and integrate complementary information provided by other signal processing transforms.

The Law of Cosines for an "n"-Dimensional Simplex

ERIC Educational Resources Information Center

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.

An Elementary Algorithm to Evaluate Trigonometric Functions to High Precision

ERIC Educational Resources Information Center

Johansson, B. Tomas

2018-01-01

Evaluation of the cosine function is done via a simple Cordic-like algorithm, together with a package for handling arbitrary-precision arithmetic in the computer program Matlab. Approximations to the cosine function having hundreds of correct decimals are presented with a discussion around errors and implementation.

Interplay between bulk and edge-bound topological defects in a square micromagnet

DOE PAGES

Sloetjes, Sam D.; Digernes, Einar; Olsen, Fredrik K.; ...

2018-01-22

A field-driven transformation of a domain pattern in a square micromagnet, defined in a thin film of La 0.7Sr 0.3MnO 3, is discussed in terms of creation and annihilation of bulk vortices and edge-bound topological defects with half-integer winding numbers. The evolution of the domain pattern was mapped with soft x-ray photoemission electron microscopy and magnetic force microscopy. Micromagnetic modeling, permitting detailed analysis of the spin texture, accurately reproduces the measured domain state transformation. The simulations also helped stipulate the energy barriers associated with the creation and annihilation of the topological charges and thus to assess the stability of themore » domain states in this magnetic microstructure.« less

Interplay between bulk and edge-bound topological defects in a square micromagnet

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

Sloetjes, Sam D.; Digernes, Einar; Olsen, Fredrik K.

A field-driven transformation of a domain pattern in a square micromagnet, defined in a thin film of La 0.7Sr 0.3MnO 3, is discussed in terms of creation and annihilation of bulk vortices and edge-bound topological defects with half-integer winding numbers. The evolution of the domain pattern was mapped with soft x-ray photoemission electron microscopy and magnetic force microscopy. Micromagnetic modeling, permitting detailed analysis of the spin texture, accurately reproduces the measured domain state transformation. The simulations also helped stipulate the energy barriers associated with the creation and annihilation of the topological charges and thus to assess the stability of themore » domain states in this magnetic microstructure.« less

An admissible level \\widehat{osp} ( 1 \\big \\vert 2 ) -model: modular transformations and the Verlinde formula

NASA Astrophysics Data System (ADS)

Snadden, John; Ridout, David; Wood, Simon

2018-05-01

The modular properties of the simple vertex operator superalgebra associated with the affine Kac-Moody superalgebra \\widehat{{osp}} (1|2) at level -5/4 are investigated. After classifying the relaxed highest-weight modules over this vertex operator superalgebra, the characters and supercharacters of the simple weight modules are computed and their modular transforms are determined. This leads to a complete list of the Grothendieck fusion rules by way of a continuous superalgebraic analog of the Verlinde formula. All Grothendieck fusion coefficients are observed to be non-negative integers. These results indicate that the extension to general admissible levels will follow using the same methodology once the classification of relaxed highest-weight modules is completed.

Compressed/reconstructed test images for CRAF/Cassini

NASA Technical Reports Server (NTRS)

Dolinar, S.; Cheung, K.-M.; Onyszchuk, I.; Pollara, F.; Arnold, S.

1991-01-01

A set of compressed, then reconstructed, test images submitted to the Comet Rendezvous Asteroid Flyby (CRAF)/Cassini project is presented as part of its evaluation of near lossless high compression algorithms for representing image data. A total of seven test image files were provided by the project. The seven test images were compressed, then reconstructed with high quality (root mean square error of approximately one or two gray levels on an 8 bit gray scale), using discrete cosine transforms or Hadamard transforms and efficient entropy coders. The resulting compression ratios varied from about 2:1 to about 10:1, depending on the activity or randomness in the source image. This was accomplished without any special effort to optimize the quantizer or to introduce special postprocessing to filter the reconstruction errors. A more complete set of measurements, showing the relative performance of the compression algorithms over a wide range of compression ratios and reconstruction errors, shows that additional compression is possible at a small sacrifice in fidelity.

An Asymmetric Image Encryption Based on Phase Truncated Hybrid Transform

NASA Astrophysics Data System (ADS)

Khurana, Mehak; Singh, Hukum

2017-09-01

To enhance the security of the system and to protect it from the attacker, this paper proposes a new asymmetric cryptosystem based on hybrid approach of Phase Truncated Fourier and Discrete Cosine Transform (PTFDCT) which adds non linearity by including cube and cube root operation in the encryption and decryption path respectively. In this cryptosystem random phase masks are used as encryption keys and phase masks generated after the cube operation in encryption process are reserved as decryption keys and cube root operation is required to decrypt image in decryption process. The cube and cube root operation introduced in the encryption and decryption path makes system resistant against standard attacks. The robustness of the proposed cryptosystem has been analysed and verified on the basis of various parameters by simulating on MATLAB 7.9.0 (R2008a). The experimental results are provided to highlight the effectiveness and suitability of the proposed cryptosystem and prove the system is secure.

A Kinect based sign language recognition system using spatio-temporal features

NASA Astrophysics Data System (ADS)

Memiş, Abbas; Albayrak, Songül

2013-12-01

This paper presents a sign language recognition system that uses spatio-temporal features on RGB video images and depth maps for dynamic gestures of Turkish Sign Language. Proposed system uses motion differences and accumulation approach for temporal gesture analysis. Motion accumulation method, which is an effective method for temporal domain analysis of gestures, produces an accumulated motion image by combining differences of successive video frames. Then, 2D Discrete Cosine Transform (DCT) is applied to accumulated motion images and temporal domain features transformed into spatial domain. These processes are performed on both RGB images and depth maps separately. DCT coefficients that represent sign gestures are picked up via zigzag scanning and feature vectors are generated. In order to recognize sign gestures, K-Nearest Neighbor classifier with Manhattan distance is performed. Performance of the proposed sign language recognition system is evaluated on a sign database that contains 1002 isolated dynamic signs belongs to 111 words of Turkish Sign Language (TSL) in three different categories. Proposed sign language recognition system has promising success rates.

Low complexity 1D IDCT for 16-bit parallel architectures

NASA Astrophysics Data System (ADS)

Bivolarski, Lazar

2007-09-01

This paper shows that using the Loeffler, Ligtenberg, and Moschytz factorization of 8-point IDCT [2] one-dimensional (1-D) algorithm as a fast approximation of the Discrete Cosine Transform (DCT) and using only 16 bit numbers, it is possible to create in an IEEE 1180-1990 compliant and multiplierless algorithm with low computational complexity. This algorithm as characterized by its structure is efficiently implemented on parallel high performance architectures as well as due to its low complexity is sufficient for wide range of other architectures. Additional constraint on this work was the requirement of compliance with the existing MPEG standards. The hardware implementation complexity and low resources where also part of the design criteria for this algorithm. This implementation is also compliant with the precision requirements described in MPEG IDCT precision specification ISO/IEC 23002-1. Complexity analysis is performed as an extension to the simple measure of shifts and adds for the multiplierless algorithm as additional operations are included in the complexity measure to better describe the actual transform implementation complexity.

A wavelet-based ECG delineation algorithm for 32-bit integer online processing

PubMed Central

2011-01-01

Background Since the first well-known electrocardiogram (ECG) delineator based on Wavelet Transform (WT) presented by Li et al. in 1995, a significant research effort has been devoted to the exploitation of this promising method. Its ability to reliably delineate the major waveform components (mono- or bi-phasic P wave, QRS, and mono- or bi-phasic T wave) would make it a suitable candidate for efficient online processing of ambulatory ECG signals. Unfortunately, previous implementations of this method adopt non-linear operators such as root mean square (RMS) or floating point algebra, which are computationally demanding. Methods This paper presents a 32-bit integer, linear algebra advanced approach to online QRS detection and P-QRS-T waves delineation of a single lead ECG signal, based on WT. Results The QRS detector performance was validated on the MIT-BIH Arrhythmia Database (sensitivity Se = 99.77%, positive predictive value P+ = 99.86%, on 109010 annotated beats) and on the European ST-T Database (Se = 99.81%, P+ = 99.56%, on 788050 annotated beats). The ECG delineator was validated on the QT Database, showing a mean error between manual and automatic annotation below 1.5 samples for all fiducial points: P-onset, P-peak, P-offset, QRS-onset, QRS-offset, T-peak, T-offset, and a mean standard deviation comparable to other established methods. Conclusions The proposed algorithm exhibits reliable QRS detection as well as accurate ECG delineation, in spite of a simple structure built on integer linear algebra. PMID:21457580

A wavelet-based ECG delineation algorithm for 32-bit integer online processing.

PubMed

Di Marco, Luigi Y; Chiari, Lorenzo

2011-04-03

Since the first well-known electrocardiogram (ECG) delineator based on Wavelet Transform (WT) presented by Li et al. in 1995, a significant research effort has been devoted to the exploitation of this promising method. Its ability to reliably delineate the major waveform components (mono- or bi-phasic P wave, QRS, and mono- or bi-phasic T wave) would make it a suitable candidate for efficient online processing of ambulatory ECG signals. Unfortunately, previous implementations of this method adopt non-linear operators such as root mean square (RMS) or floating point algebra, which are computationally demanding. This paper presents a 32-bit integer, linear algebra advanced approach to online QRS detection and P-QRS-T waves delineation of a single lead ECG signal, based on WT. The QRS detector performance was validated on the MIT-BIH Arrhythmia Database (sensitivity Se = 99.77%, positive predictive value P+ = 99.86%, on 109010 annotated beats) and on the European ST-T Database (Se = 99.81%, P+ = 99.56%, on 788050 annotated beats). The ECG delineator was validated on the QT Database, showing a mean error between manual and automatic annotation below 1.5 samples for all fiducial points: P-onset, P-peak, P-offset, QRS-onset, QRS-offset, T-peak, T-offset, and a mean standard deviation comparable to other established methods. The proposed algorithm exhibits reliable QRS detection as well as accurate ECG delineation, in spite of a simple structure built on integer linear algebra.

Simultaneous storage of medical images in the spatial and frequency domain: a comparative study.

PubMed

Nayak, Jagadish; Bhat, P Subbanna; Acharya U, Rajendra; Uc, Niranjan

2004-06-05

Digital watermarking is a technique of hiding specific identification data for copyright authentication. This technique is adapted here for interleaving patient information with medical images, to reduce storage and transmission overheads. The patient information is encrypted before interleaving with images to ensure greater security. The bio-signals are compressed and subsequently interleaved with the image. This interleaving is carried out in the spatial domain and Frequency domain. The performance of interleaving in the spatial, Discrete Fourier Transform (DFT), Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) coefficients is studied. Differential pulse code modulation (DPCM) is employed for data compression as well as encryption and results are tabulated for a specific example. It can be seen from results, the process does not affect the picture quality. This is attributed to the fact that the change in LSB of a pixel changes its brightness by 1 part in 256. Spatial and DFT domain interleaving gave very less %NRMSE as compared to DCT and DWT domain. The Results show that spatial domain the interleaving, the %NRMSE was less than 0.25% for 8-bit encoded pixel intensity. Among the frequency domain interleaving methods, DFT was found to be very efficient.

Transparency of the ab Planes of Bi2Sr2CaCu2O8+δ to Magnetic Fields

NASA Astrophysics Data System (ADS)

Kossler, W. J.; Dai, Y.; Petzinger, K. G.; Greer, A. J.; Williams, D. Ll.; Koster, E.; Harshman, D. R.; Mitzi, D. B.

1998-01-01

A sample composed of many Bi2Sr2CaCu2O8+δ single crystals was cooled to 2 K in a magnetic field of 100 G at 45° from the c axis. Muon-spin-rotation measurements were made for which the polarization was initially approximately in the ab plane. The time dependent polarization components along this initial direction and along the c axis were obtained. Cosine transforms of these and subsequent measurements were made. Upon removing the applied field, still at 2 K, only the c axis component of the field remained in the sample, thus providing microscopic evidence for extreme 2D behavior for the vortices even at this temperature.

Effect of data compression on diagnostic accuracy in digital hand and chest radiography

NASA Astrophysics Data System (ADS)

Sayre, James W.; Aberle, Denise R.; Boechat, Maria I.; Hall, Theodore R.; Huang, H. K.; Ho, Bruce K. T.; Kashfian, Payam; Rahbar, Guita

1992-05-01

Image compression is essential to handle a large volume of digital images including CT, MR, CR, and digitized films in a digital radiology operation. The full-frame bit allocation using the cosine transform technique developed during the last few years has been proven to be an excellent irreversible image compression method. This paper describes the effect of using the hardware compression module on diagnostic accuracy in hand radiographs with subperiosteal resorption and chest radiographs with interstitial disease. Receiver operating characteristic analysis using 71 hand radiographs and 52 chest radiographs with five observers each demonstrates that there is no statistical significant difference in diagnostic accuracy between the original films and the compressed images with a compression ratio as high as 20:1.

Performance of customized DCT quantization tables on scientific data

NASA Technical Reports Server (NTRS)

Ratnakar, Viresh; Livny, Miron

1994-01-01

We show that it is desirable to use data-specific or customized quantization tables for scaling the spatial frequency coefficients obtained using the Discrete Cosine Transform (DCT). DCT is widely used for image and video compression (MP89, PM93) but applications typically use default quantization matrices. Using actual scientific data gathered from divers sources such as spacecrafts and electron-microscopes, we show that the default compression/quality tradeoffs can be significantly improved upon by using customized tables. We also show that significant improvements are possible for the standard test images Lena and Baboon. This work is part of an effort to develop a practical scheme for optimizing quantization matrices for any given image or video stream, under any given quality or compression constraints.

Blood perfusion construction for infrared face recognition based on bio-heat transfer.

PubMed

Xie, Zhihua; Liu, Guodong

2014-01-01

To improve the performance of infrared face recognition for time-lapse data, a new construction of blood perfusion is proposed based on bio-heat transfer. Firstly, by quantifying the blood perfusion based on Pennes equation, the thermal information is converted into blood perfusion rate, which is stable facial biological feature of face image. Then, the separability discriminant criterion in Discrete Cosine Transform (DCT) domain is applied to extract the discriminative features of blood perfusion information. Experimental results demonstrate that the features of blood perfusion are more concentrative and discriminative for recognition than those of thermal information. The infrared face recognition based on the proposed blood perfusion is robust and can achieve better recognition performance compared with other state-of-the-art approaches.

Partially supervised speaker clustering.

PubMed

Tang, Hao; Chu, Stephen Mingyu; Hasegawa-Johnson, Mark; Huang, Thomas S

2012-05-01

Content-based multimedia indexing, retrieval, and processing as well as multimedia databases demand the structuring of the media content (image, audio, video, text, etc.), one significant goal being to associate the identity of the content to the individual segments of the signals. In this paper, we specifically address the problem of speaker clustering, the task of assigning every speech utterance in an audio stream to its speaker. We offer a complete treatment to the idea of partially supervised speaker clustering, which refers to the use of our prior knowledge of speakers in general to assist the unsupervised speaker clustering process. By means of an independent training data set, we encode the prior knowledge at the various stages of the speaker clustering pipeline via 1) learning a speaker-discriminative acoustic feature transformation, 2) learning a universal speaker prior model, and 3) learning a discriminative speaker subspace, or equivalently, a speaker-discriminative distance metric. We study the directional scattering property of the Gaussian mixture model (GMM) mean supervector representation of utterances in the high-dimensional space, and advocate exploiting this property by using the cosine distance metric instead of the euclidean distance metric for speaker clustering in the GMM mean supervector space. We propose to perform discriminant analysis based on the cosine distance metric, which leads to a novel distance metric learning algorithm—linear spherical discriminant analysis (LSDA). We show that the proposed LSDA formulation can be systematically solved within the elegant graph embedding general dimensionality reduction framework. Our speaker clustering experiments on the GALE database clearly indicate that 1) our speaker clustering methods based on the GMM mean supervector representation and vector-based distance metrics outperform traditional speaker clustering methods based on the “bag of acoustic features” representation and statistical model-based distance metrics, 2) our advocated use of the cosine distance metric yields consistent increases in the speaker clustering performance as compared to the commonly used euclidean distance metric, 3) our partially supervised speaker clustering concept and strategies significantly improve the speaker clustering performance over the baselines, and 4) our proposed LSDA algorithm further leads to state-of-the-art speaker clustering performance.

Some Cosine Relations and the Regular Heptagon

ERIC Educational Resources Information Center

Osler, Thomas J.; Heng, Phongthong

2007-01-01

The ancient Greek mathematicians sought to construct, by use of straight edge and compass only, all regular polygons. They had no difficulty with regular polygons having 3, 4, 5 and 6 sides, but the 7-sided heptagon eluded all their attempts. In this article, the authors discuss some cosine relations and the regular heptagon. (Contains 1 figure.)

Similarity Measures in Scientometric Research: The Jaccard Index versus Salton's Cosine Formula.

ERIC Educational Resources Information Center

Hamers, Lieve; And Others

1989-01-01

Describes two similarity measures used in citation and co-citation analysis--the Jaccard index and Salton's cosine formula--and investigates the relationship between the two measures. It is shown that Salton's formula yields a numerical value that is twice Jaccard's index in most cases, and an explanation is offered. (13 references) (CLB)

Non-integer viscoelastic constitutive law to model soft biological tissues to in-vivo indentation.

PubMed

Demirci, Nagehan; Tönük, Ergin

2014-01-01

During the last decades, derivatives and integrals of non-integer orders are being more commonly used for the description of constitutive behavior of various viscoelastic materials including soft biological tissues. Compared to integer order constitutive relations, non-integer order viscoelastic material models of soft biological tissues are capable of capturing a wider range of viscoelastic behavior obtained from experiments. Although integer order models may yield comparably accurate results, non-integer order material models have less number of parameters to be identified in addition to description of an intermediate material that can monotonically and continuously be adjusted in between an ideal elastic solid and an ideal viscous fluid. In this work, starting with some preliminaries on non-integer (fractional) calculus, the "spring-pot", (intermediate mechanical element between a solid and a fluid), non-integer order three element (Zener) solid model, finally a user-defined large strain non-integer order viscoelastic constitutive model was constructed to be used in finite element simulations. Using the constitutive equation developed, by utilizing inverse finite element method and in vivo indentation experiments, soft tissue material identification was performed. The results indicate that material coefficients obtained from relaxation experiments, when optimized with creep experimental data could simulate relaxation, creep and cyclic loading and unloading experiments accurately. Non-integer calculus viscoelastic constitutive models, having physical interpretation and modeling experimental data accurately is a good alternative to classical phenomenological viscoelastic constitutive equations.

Fast Integer Ambiguity Resolution for GPS Attitude Determination

NASA Technical Reports Server (NTRS)

Lightsey, E. Glenn; Crassidis, John L.; Markley, F. Landis

1999-01-01

In this paper, a new algorithm for GPS (Global Positioning System) integer ambiguity resolution is shown. The algorithm first incorporates an instantaneous (static) integer search to significantly reduce the search space using a geometric inequality. Then a batch-type loss function is used to check the remaining integers in order to determine the optimal integer. This batch function represents the GPS sightline vectors in the body frame as the sum of two vectors, one depending on the phase measurements and the other on the unknown integers. The new algorithm has several advantages: it does not require an a-priori estimate of the vehicle's attitude; it provides an inherent integrity check using a covariance-type expression; and it can resolve the integers even when coplanar baselines exist. The performance of the new algorithm is tested on a dynamic hardware simulator.

The Efficiency of Split Panel Designs in an Analysis of Variance Model

PubMed Central

Wang, Wei-Guo; Liu, Hai-Jun

2016-01-01

We consider split panel design efficiency in analysis of variance models, that is, the determination of the cross-sections series optimal proportion in all samples, to minimize parametric best linear unbiased estimators of linear combination variances. An orthogonal matrix is constructed to obtain manageable expression of variances. On this basis, we derive a theorem for analyzing split panel design efficiency irrespective of interest and budget parameters. Additionally, relative estimator efficiency based on the split panel to an estimator based on a pure panel or a pure cross-section is present. The analysis shows that the gains from split panel can be quite substantial. We further consider the efficiency of split panel design, given a budget, and transform it to a constrained nonlinear integer programming. Specifically, an efficient algorithm is designed to solve the constrained nonlinear integer programming. Moreover, we combine one at time designs and factorial designs to illustrate the algorithm’s efficiency with an empirical example concerning monthly consumer expenditure on food in 1985, in the Netherlands, and the efficient ranges of the algorithm parameters are given to ensure a good solution. PMID:27163447

Boundary layer flow of MHD generalized Maxwell fluid over an exponentially accelerated infinite vertical surface with slip and Newtonian heating at the boundary

NASA Astrophysics Data System (ADS)

Imran, M. A.; Riaz, M. B.; Shah, N. A.; Zafar, A. A.

2018-03-01

The aim of this article is to investigate the unsteady natural convection flow of Maxwell fluid with fractional derivative over an exponentially accelerated infinite vertical plate. Moreover, slip condition, radiation, MHD and Newtonian heating effects are also considered. A modern definition of fractional derivative operator recently introduced by Caputo and Fabrizio has been used to formulate the fractional model. Semi analytical solutions of the dimensionless problem are obtained by employing Stehfest's and Tzou's algorithms in order to find the inverse Laplace transforms for temperature and velocity fields. Temperature and rate of heat transfer for non-integer and integer order derivatives are computed and reduced to some known solutions from the literature. Finally, in order to get insight of the physical significance of the considered problem regarding velocity and Nusselt number, some graphical illustrations are made using Mathcad software. As a result, in comparison between Maxwell and viscous fluid (fractional and ordinary) we found that viscous (fractional and ordinary) fluids are swiftest than Maxwell (fractional and ordinary) fluids.

A hybrid inventory management system respondingto regular demand and surge demand

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

Mohammad S. Roni; Mingzhou Jin; Sandra D. Eksioglu

2014-06-01

This paper proposes a hybrid policy for a stochastic inventory system facing regular demand and surge demand. The combination of two different demand patterns can be observed in many areas, such as healthcare inventory and humanitarian supply chain management. The surge demand has a lower arrival rate but higher demand volume per arrival. The solution approach proposed in this paper incorporates the level crossing method and mixed integer programming technique to optimize the hybrid inventory policy with both regular orders and emergency orders. The level crossing method is applied to obtain the equilibrium distributions of inventory levels under a givenmore » policy. The model is further transformed into a mixed integer program to identify an optimal hybrid policy. A sensitivity analysis is conducted to investigate the impact of parameters on the optimal inventory policy and minimum cost. Numerical results clearly show the benefit of using the proposed hybrid inventory model. The model and solution approach could help healthcare providers or humanitarian logistics providers in managing their emergency supplies in responding to surge demands.« less

Secure multi-party quantum summation based on quantum Fourier transform

NASA Astrophysics Data System (ADS)

Yang, Hui-Yi; Ye, Tian-Yu

2018-06-01

In this paper, we propose a novel secure multi-party quantum summation protocol based on quantum Fourier transform, where the traveling particles are transmitted in a tree-type mode. The party who prepares the initial quantum states is assumed to be semi-honest, which means that she may misbehave on her own but will not conspire with anyone. The proposed protocol can resist both the outside attacks and the participant attacks. Especially, one party cannot obtain other parties' private integer strings; and it is secure for the colluding attack performed by at most n - 2 parties, where n is the number of parties. In addition, the proposed protocol calculates the addition of modulo d and implements the calculation of addition in a secret-by-secret way rather than a bit-by-bit way.

Learning Integer Addition: Is Later Better?

ERIC Educational Resources Information Center

Aqazade, Mahtob; Bofferding, Laura; Farmer, Sherri

2017-01-01

We investigate thirty-three second and fifth-grade students' solution strategies on integer addition problems before and after analyzing contrasting cases with integer addition and participating in a lesson on integers. The students took a pretest, participated in two small group sessions and a short lesson, and took a posttest. Even though the…

Online with Integers

ERIC Educational Resources Information Center

Siegel, Jonathan W.; Siegel, P. B.

2011-01-01

Integers are sometimes used in physics problems to simplify the mathematics so the arithmetic does not distract students from the physics concepts. This is particularly important in exams where students should not have to spend a lot of time using their calculators. Common uses of integers in physics problems include integer solutions to…

Integers Made Easy: Just Walk It Off

ERIC Educational Resources Information Center

Nurnberger-Haag, Julie

2007-01-01

This article describes a multisensory method for teaching students how to multiply and divide as well as add and subtract integers. The author uses sidewalk chalk and the underlying concept of integers to physically and mentally engage students in understanding the concepts of integers, making connections, and developing computational fluency.…

Bit-parallel arithmetic in a massively-parallel associative processor

NASA Technical Reports Server (NTRS)

Scherson, Isaac D.; Kramer, David A.; Alleyne, Brian D.

1992-01-01

A simple but powerful new architecture based on a classical associative processor model is presented. Algorithms for performing the four basic arithmetic operations both for integer and floating point operands are described. For m-bit operands, the proposed architecture makes it possible to execute complex operations in O(m) cycles as opposed to O(m exp 2) for bit-serial machines. A word-parallel, bit-parallel, massively-parallel computing system can be constructed using this architecture with VLSI technology. The operation of this system is demonstrated for the fast Fourier transform and matrix multiplication.

Towards spinning Mellin amplitudes

NASA Astrophysics Data System (ADS)

Chen, Heng-Yu; Kuo, En-Jui; Kyono, Hideki

2018-06-01

We construct the Mellin representation of four point conformal correlation function with external primary operators with arbitrary integer spacetime spins, and obtain a natural proposal for spinning Mellin amplitudes. By restricting to the exchange of symmetric traceless primaries, we generalize the Mellin transform for scalar case to introduce discrete Mellin variables for incorporating spin degrees of freedom. Based on the structures about spinning three and four point Witten diagrams, we also obtain a generalization of the Mack polynomial which can be regarded as a natural kinematical polynomial basis for computing spinning Mellin amplitudes using different choices of interaction vertices.

Operational method of solution of linear non-integer ordinary and partial differential equations.

PubMed

Zhukovsky, K V

2016-01-01

We propose operational method with recourse to generalized forms of orthogonal polynomials for solution of a variety of differential equations of mathematical physics. Operational definitions of generalized families of orthogonal polynomials are used in this context. Integral transforms and the operational exponent together with some special functions are also employed in the solutions. The examples of solution of physical problems, related to such problems as the heat propagation in various models, evolutional processes, Black-Scholes-like equations etc. are demonstrated by the operational technique.

Discovering Trigonometric Relationships Implied by the Law of Sines and the Law of Cosines

ERIC Educational Resources Information Center

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…

Tachometer

NASA Technical Reports Server (NTRS)

Nola, F. J. (Inventor)

1977-01-01

A tachometer in which sine and cosine signals responsive to the angular position of a shaft as it rotates are each multiplied by like, sine or cosine, functions of a carrier signal, the products summed, and the resulting frequency signal converted to fixed height, fixed width pulses of a like frequency. These pulses are then integrated, and the resulting dc output is an indication of shaft speed.

An Ellipse Morphs to a Cosine Graph!

ERIC Educational Resources Information Center

King, L .R.

2013-01-01

We produce a continuum of curves all of the same length, beginning with an ellipse and ending with a cosine graph. The curves in the continuum are made by cutting and unrolling circular cones whose section is the ellipse; the initial cone is degenerate (it is the plane of the ellipse); the final cone is a circular cylinder. The curves of the…

Enabling Technologies for Medium Additive Manufacturing (MAAM)

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

Richardson, Bradley S.; Love, Lonnie J.; Chesser, Phillip C.

ORNL has worked with Cosine Additive, Inc. on the design of MAAM extrusion components. The objective is to improve the print speed and part quality. A pellet extruder has been procured and integrated into the MAAM printer. Print speed has been greatly enhanced. In addition, ORNL and Cosine Additive have worked on alternative designs for a pellet drying and feed system.

New descriptor for skeletons of planar shapes: the calypter

NASA Astrophysics Data System (ADS)

Pirard, Eric; Nivart, Jean-Francois

1994-05-01

The mathematical definition of the skeleton as the locus of centers of maximal inscribed discs is a nondigitizable one. The idea presented in this paper is to incorporate the skeleton information and the chain-code of the contour into a single descriptor by associating to each point of a contour the center and radius of the maximum inscribed disc tangent at that point. This new descriptor is called calypter. The encoding of a calypter is a three stage algorithm: (1) chain coding of the contour; (2) euclidean distance transformation, (3) climbing on the distance relief from each point of the contour towards the corresponding maximal inscribed disc center. Here we introduce an integer euclidean distance transform called the holodisc distance transform. The major interest of this holodisc transform is to confer 8-connexity to the isolevels of the generated distance relief thereby allowing a climbing algorithm to proceed step by step towards the centers of the maximal inscribed discs. The calypter has a cyclic structure delivering high speed access to the skeleton data. Its potential uses are in high speed euclidean mathematical morphology, shape processing, and analysis.

Making Sense of Integer Arithmetic: The Effect of Using Virtual Manipulatives on Students' Representational Fluency

ERIC Educational Resources Information Center

Bolyard, Johnna; Moyer-Packenham, Patricia

2012-01-01

This study investigated how the use of virtual manipulatives in integer instruction impacts student achievement for integer addition and subtraction. Of particular interest was the influence of using virtual manipulatives on students' ability to create and translate among representations for integer computation. The research employed a…

Teachers' Construction of Meanings of Signed Quantities and Integer Operation

ERIC Educational Resources Information Center

Kumar, Ruchi S.; Subramaniam, K.; Naik, Shweta Shripad

2017-01-01

Understanding signed quantities and its arithmetic is one of the challenging topics of middle school mathematics. The "specialized content knowledge" (SCK) for teaching integers includes understanding of a variety of representations that may be used while teaching. In this study, we argue that meanings of integers and integer operations…

Anisotropic fractal media by vector calculus in non-integer dimensional space

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2014-08-01

A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensional space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media.

Transformation between surface spherical harmonic expansion of arbitrary high degree and order and double Fourier series on sphere

NASA Astrophysics Data System (ADS)

Fukushima, Toshio

2018-02-01

In order to accelerate the spherical harmonic synthesis and/or analysis of arbitrary function on the unit sphere, we developed a pair of procedures to transform between a truncated spherical harmonic expansion and the corresponding two-dimensional Fourier series. First, we obtained an analytic expression of the sine/cosine series coefficient of the 4 π fully normalized associated Legendre function in terms of the rectangle values of the Wigner d function. Then, we elaborated the existing method to transform the coefficients of the surface spherical harmonic expansion to those of the double Fourier series so as to be capable with arbitrary high degree and order. Next, we created a new method to transform inversely a given double Fourier series to the corresponding surface spherical harmonic expansion. The key of the new method is a couple of new recurrence formulas to compute the inverse transformation coefficients: a decreasing-order, fixed-degree, and fixed-wavenumber three-term formula for general terms, and an increasing-degree-and-order and fixed-wavenumber two-term formula for diagonal terms. Meanwhile, the two seed values are analytically prepared. Both of the forward and inverse transformation procedures are confirmed to be sufficiently accurate and applicable to an extremely high degree/order/wavenumber as 2^{30} {≈ } 10^9. The developed procedures will be useful not only in the synthesis and analysis of the spherical harmonic expansion of arbitrary high degree and order, but also in the evaluation of the derivatives and integrals of the spherical harmonic expansion.

Arikan and Alamouti matrices based on fast block-wise inverse Jacket transform

NASA Astrophysics Data System (ADS)

Lee, Moon Ho; Khan, Md Hashem Ali; Kim, Kyeong Jin

2013-12-01

Recently, Lee and Hou (IEEE Signal Process Lett 13: 461-464, 2006) proposed one-dimensional and two-dimensional fast algorithms for block-wise inverse Jacket transforms (BIJTs). Their BIJTs are not real inverse Jacket transforms from mathematical point of view because their inverses do not satisfy the usual condition, i.e., the multiplication of a matrix with its inverse matrix is not equal to the identity matrix. Therefore, we mathematically propose a fast block-wise inverse Jacket transform of orders N = 2 k , 3 k , 5 k , and 6 k , where k is a positive integer. Based on the Kronecker product of the successive lower order Jacket matrices and the basis matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse and fast algorithms of Arikan polar binary and Alamouti multiple-input multiple-output (MIMO) non-binary matrices, which are obtained from BIJTs, they can be applied in areas such as 3GPP physical layer for ultra mobile broadband permutation matrices design, first-order q-ary Reed-Muller code design, diagonal channel design, diagonal subchannel decompose for interference alignment, and 4G MIMO long-term evolution Alamouti precoding design.

Software Technology for Adaptable, Reliable Systems (STARS) (User Manual). Ada Command Environment (ACE) Version 8.0 Sun OS Implementation

DTIC Science & Technology

1990-10-29

the equivalent type names in the basic X libary . 37. Intrinsics Contains the type declarations common to all Xt toolkit routines. 38. Widget-Package...Memory-Size constant Integer 1; MinInt constant I-reger Integer’First; MaxInt const-i’ integer Integer’Last; -- Max- Digits constant Integer 1; -- MaxMan...connection between some type names used by Xt routines and the equivalent type names in the basic X libary . .package RenamedXlibTypes is P;’ge 65 29

Cubic Equations and the Ideal Trisection of the Arbitrary Angle

ERIC Educational Resources Information Center

Farnsworth, Marion B.

2006-01-01

In the year 1837 mathematical proof was set forth authoritatively stating that it is impossible to trisect an arbitrary angle with a compass and an unmarked straightedge in the classical sense. The famous proof depends on an incompatible cubic equation having the cosine of an angle of 60 and the cube of the cosine of one-third of an angle of 60 as…

Counting Triangles to Sum Squares

ERIC Educational Resources Information Center

DeMaio, Joe

2012-01-01

Counting complete subgraphs of three vertices in complete graphs, yields combinatorial arguments for identities for sums of squares of integers, odd integers, even integers and sums of the triangular numbers.

Slip and Slide Method of Factoring Trinomials with Integer Coefficients over the Integers

ERIC Educational Resources Information Center

Donnell, William A.

2012-01-01

In intermediate and college algebra courses there are a number of methods for factoring quadratic trinomials with integer coefficients over the integers. Some of these methods have been given names, such as trial and error, reversing FOIL, AC method, middle term splitting method and slip and slide method. The purpose of this article is to discuss…

Solving Integer Programs from Dependence and Synchronization Problems

DTIC Science & Technology

1993-03-01

DEFF.NSNE Solving Integer Programs from Dependence and Synchronization Problems Jaspal Subhlok March 1993 CMU-CS-93-130 School of Computer ScienceT IC...method Is an exact and efficient way of solving integer programming problems arising in dependence and synchronization analysis of parallel programs...7/;- p Keywords: Exact dependence tesing, integer programming. parallelilzng compilers, parallel program analysis, synchronization analysis Solving

Obstacles and Affordances for Integer Reasoning: An Analysis of Children's Thinking and the History of Mathematics

ERIC Educational Resources Information Center

Bishop, Jessica Pierson; Lamb, Lisa L.; Philipp, Randolph A.; Whitacre, Ian; Schappelle, Bonnie P.; Lewis, Melinda L.

2014-01-01

We identify and document 3 cognitive obstacles, 3 cognitive affordances, and 1 type of integer understanding that can function as either an obstacle or affordance for learners while they extend their numeric domains from whole numbers to include negative integers. In particular, we highlight 2 key subsets of integer reasoning: understanding or…

Anisotropic fractal media by vector calculus in non-integer dimensional space

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

Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru

2014-08-15

A review of different approaches to describe anisotropic fractal media is proposed. In this paper, differentiation and integration non-integer dimensional and multi-fractional spaces are considered as tools to describe anisotropic fractal materials and media. We suggest a generalization of vector calculus for non-integer dimensional space by using a product measure method. The product of fractional and non-integer dimensional spaces allows us to take into account the anisotropy of the fractal media in the framework of continuum models. The integration over non-integer-dimensional spaces is considered. In this paper differential operators of first and second orders for fractional space and non-integer dimensionalmore » space are suggested. The differential operators are defined as inverse operations to integration in spaces with non-integer dimensions. Non-integer dimensional space that is product of spaces with different dimensions allows us to give continuum models for anisotropic type of the media. The Poisson's equation for fractal medium, the Euler-Bernoulli fractal beam, and the Timoshenko beam equations for fractal material are considered as examples of application of suggested generalization of vector calculus for anisotropic fractal materials and media.« less

Estimation of signal-dependent noise level function in transform domain via a sparse recovery model.

PubMed

Yang, Jingyu; Gan, Ziqiao; Wu, Zhaoyang; Hou, Chunping

2015-05-01

This paper proposes a novel algorithm to estimate the noise level function (NLF) of signal-dependent noise (SDN) from a single image based on the sparse representation of NLFs. Noise level samples are estimated from the high-frequency discrete cosine transform (DCT) coefficients of nonlocal-grouped low-variation image patches. Then, an NLF recovery model based on the sparse representation of NLFs under a trained basis is constructed to recover NLF from the incomplete noise level samples. Confidence levels of the NLF samples are incorporated into the proposed model to promote reliable samples and weaken unreliable ones. We investigate the behavior of the estimation performance with respect to the block size, sampling rate, and confidence weighting. Simulation results on synthetic noisy images show that our method outperforms existing state-of-the-art schemes. The proposed method is evaluated on real noisy images captured by three types of commodity imaging devices, and shows consistently excellent SDN estimation performance. The estimated NLFs are incorporated into two well-known denoising schemes, nonlocal means and BM3D, and show significant improvements in denoising SDN-polluted images.

An Efficient Method for Image and Audio Steganography using Least Significant Bit (LSB) Substitution

NASA Astrophysics Data System (ADS)

Chadha, Ankit; Satam, Neha; Sood, Rakshak; Bade, Dattatray

2013-09-01

In order to improve the data hiding in all types of multimedia data formats such as image and audio and to make hidden message imperceptible, a novel method for steganography is introduced in this paper. It is based on Least Significant Bit (LSB) manipulation and inclusion of redundant noise as secret key in the message. This method is applied to data hiding in images. For data hiding in audio, Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) both are used. All the results displayed prove to be time-efficient and effective. Also the algorithm is tested for various numbers of bits. For those values of bits, Mean Square Error (MSE) and Peak-Signal-to-Noise-Ratio (PSNR) are calculated and plotted. Experimental results show that the stego-image is visually indistinguishable from the original cover-image when n<=4, because of better PSNR which is achieved by this technique. The final results obtained after steganography process does not reveal presence of any hidden message, thus qualifying the criteria of imperceptible message.

Study of Fourier transform spectrometer based on Michelson interferometer wave-meter

NASA Astrophysics Data System (ADS)

Peng, Yuexiang; Wang, Liqiang; Lin, Li

2008-03-01

A wave-meter based on Michelson interferometer consists of a reference and a measurement channel. The voice-coiled motor using PID means can realize to move in stable motion. The wavelength of a measurement laser can be obtained by counting interference fringes of reference and measurement laser. Reference laser with frequency stabilization creates a cosine interferogram signal whose frequency is proportional to velocity of the moving motor. The interferogram of the reference laser is converted to pulse signal, and it is subdivided into 16 times. In order to get optical spectrum, the analog signal of measurement channel should be collected. The Analog-to-Digital Converter (ADC) for measurement channel is triggered by the 16-times pulse signal of reference laser. So the sampling rate is constant only depending on frequency of reference laser and irrelative to the motor velocity. This means the sampling rate of measurement channel signals is on a uniform time-scale. The optical spectrum of measurement channel can be processed with Fast Fourier Transform (FFT) method by DSP and displayed on LCD.

2.5D multi-view gait recognition based on point cloud registration.

PubMed

Tang, Jin; Luo, Jian; Tjahjadi, Tardi; Gao, Yan

2014-03-28

This paper presents a method for modeling a 2.5-dimensional (2.5D) human body and extracting the gait features for identifying the human subject. To achieve view-invariant gait recognition, a multi-view synthesizing method based on point cloud registration (MVSM) to generate multi-view training galleries is proposed. The concept of a density and curvature-based Color Gait Curvature Image is introduced to map 2.5D data onto a 2D space to enable data dimension reduction by discrete cosine transform and 2D principle component analysis. Gait recognition is achieved via a 2.5D view-invariant gait recognition method based on point cloud registration. Experimental results on the in-house database captured by a Microsoft Kinect camera show a significant performance gain when using MVSM.

Hardware Design and Implementation of Fixed-Width Standard and Truncated 4×4, 6×6, 8×8 and 12×12-BIT Multipliers Using Fpga

NASA Astrophysics Data System (ADS)

Rais, Muhammad H.

2010-06-01

This paper presents Field Programmable Gate Array (FPGA) implementation of standard and truncated multipliers using Very High Speed Integrated Circuit Hardware Description Language (VHDL). Truncated multiplier is a good candidate for digital signal processing (DSP) applications such as finite impulse response (FIR) and discrete cosine transform (DCT). Remarkable reduction in FPGA resources, delay, and power can be achieved using truncated multipliers instead of standard parallel multipliers when the full precision of the standard multiplier is not required. The truncated multipliers show significant improvement as compared to standard multipliers. Results show that the anomaly in Spartan-3 AN average connection and maximum pin delay have been efficiently reduced in Virtex-4 device.

Alternate forms of the associated Legendre functions for use in geomagnetic modeling.

USGS Publications Warehouse

Alldredge, L.R.; Benton, E.R.

1986-01-01

An inconvenience attending traditional use of associated Legendre functions in global modeling is that the functions are not separable with respect to the 2 indices (order and degree). In 1973 Merilees suggested a way to avoid the problem by showing that associated Legendre functions of order m and degree m+k can be expressed in terms of elementary functions. This note calls attention to some possible gains in time savings and accuracy in geomagnetic modeling based upon this form. For this purpose, expansions of associated Legendre polynomials in terms of sines and cosines of multiple angles are displayed up to degree and order 10. Examples are also given explaining how some surface spherical harmonics can be transformed into true Fourier series for selected polar great circle paths. -from Authors

Compression for radiological images

NASA Astrophysics Data System (ADS)

Wilson, Dennis L.

1992-07-01

The viewing of radiological images has peculiarities that must be taken into account in the design of a compression technique. The images may be manipulated on a workstation to change the contrast, to change the center of the brightness levels that are viewed, and even to invert the images. Because of the possible consequences of losing information in a medical application, bit preserving compression is used for the images used for diagnosis. However, for archiving the images may be compressed to 10 of their original size. A compression technique based on the Discrete Cosine Transform (DCT) takes the viewing factors into account by compressing the changes in the local brightness levels. The compression technique is a variation of the CCITT JPEG compression that suppresses the blocking of the DCT except in areas of very high contrast.

Subband directional vector quantization in radiological image compression

NASA Astrophysics Data System (ADS)

Akrout, Nabil M.; Diab, Chaouki; Prost, Remy; Goutte, Robert; Amiel, Michel

1992-05-01

The aim of this paper is to propose a new scheme for image compression. The method is very efficient for images which have directional edges such as the tree-like structure of the coronary vessels in digital angiograms. This method involves two steps. First, the original image is decomposed at different resolution levels using a pyramidal subband decomposition scheme. For decomposition/reconstruction of the image, free of aliasing and boundary errors, we use an ideal band-pass filter bank implemented in the Discrete Cosine Transform domain (DCT). Second, the high-frequency subbands are vector quantized using a multiresolution codebook with vertical and horizontal codewords which take into account the edge orientation of each subband. The proposed method reduces the blocking effect encountered at low bit rates in conventional vector quantization.

A robust H.264/AVC video watermarking scheme with drift compensation.

PubMed

Jiang, Xinghao; Sun, Tanfeng; Zhou, Yue; Wang, Wan; Shi, Yun-Qing

2014-01-01

A robust H.264/AVC video watermarking scheme for copyright protection with self-adaptive drift compensation is proposed. In our scheme, motion vector residuals of macroblocks with the smallest partition size are selected to hide copyright information in order to hold visual impact and distortion drift to a minimum. Drift compensation is also implemented to reduce the influence of watermark to the most extent. Besides, discrete cosine transform (DCT) with energy compact property is applied to the motion vector residual group, which can ensure robustness against intentional attacks. According to the experimental results, this scheme gains excellent imperceptibility and low bit-rate increase. Malicious attacks with different quantization parameters (QPs) or motion estimation algorithms can be resisted efficiently, with 80% accuracy on average after lossy compression.

A Robust H.264/AVC Video Watermarking Scheme with Drift Compensation

PubMed Central

Sun, Tanfeng; Zhou, Yue; Shi, Yun-Qing

2014-01-01

A robust H.264/AVC video watermarking scheme for copyright protection with self-adaptive drift compensation is proposed. In our scheme, motion vector residuals of macroblocks with the smallest partition size are selected to hide copyright information in order to hold visual impact and distortion drift to a minimum. Drift compensation is also implemented to reduce the influence of watermark to the most extent. Besides, discrete cosine transform (DCT) with energy compact property is applied to the motion vector residual group, which can ensure robustness against intentional attacks. According to the experimental results, this scheme gains excellent imperceptibility and low bit-rate increase. Malicious attacks with different quantization parameters (QPs) or motion estimation algorithms can be resisted efficiently, with 80% accuracy on average after lossy compression. PMID:24672376

Analytical inversions in remote sensing of particle size distributions. IV - Comparison of Fymat and Box-McKellar solutions in the anomalous diffraction approximation

NASA Technical Reports Server (NTRS)

Fymat, A. L.; Smith, C. B.

1979-01-01

It is shown that the inverse analytical solutions, provided separately by Fymat and Box-McKellar, for reconstructing particle size distributions from remote spectral transmission measurements under the anomalous diffraction approximation can be derived using a cosine and a sine transform, respectively. Sufficient conditions of validity of the two formulas are established. Their comparison shows that the former solution is preferable to the latter in that it requires less a priori information (knowledge of the particle number density is not needed) and has wider applicability. For gamma-type distributions, and either a real or a complex refractive index, explicit expressions are provided for retrieving the distribution parameters; such expressions are, interestingly, proportional to the geometric area of the polydispersion.

The influence of finite cavities on the sound insulation of double-plate structures.

PubMed

Brunskog, Jonas

2005-06-01

Lightweight walls are often designed as frameworks of studs with plates on each side--a double-plate structure. The studs constitute boundaries for the cavities, thereby both affecting the sound transmission directly by short-circuiting the plates, and indirectly by disturbing the sound field between the plates. The paper presents a deterministic prediction model for airborne sound insulation including both effects of the studs. A spatial transform technique is used, taking advantage of the periodicity. The acoustic field inside the cavities is expanded by means of cosine-series. The transmission coefficient (angle-dependent and diffuse) and transmission loss are studied. Numerical examples are presented and comparisons with measurement are performed. The result indicates that a reasonably good agreement between theory and measurement can be achieved.

Air Force Academy Aeronautics Digest, Spring/Summer 1980

DTIC Science & Technology

1980-10-01

transformation matrix developed under the direction cosine method now can be simplified to four 18 USAFA-TR-80-17 equations t (_W " - W " wq W r 2 2...0uE.CZ 25. 03 *.C .00 0.00 15.00 -(.1 ’.I-01 C.C’ 0 IILkiE1 r.C4 .C TH TAO ..700C7 0.7.1 H g-4-8:j � 41S 35.00 0 19 C55 NE -. 68 £-% ’C,- USAFA-TR...4?5. I-TiET4C = FLCAT(I -8) .1.415. 1 T( P, ) TAO SUM = 0.0 0 l~J ZI15 i r4 2 IHETA " FL (AT (J-) *5. TH 0UIi P1 /1 1 Pli = IHLT A-THET 40 A:v 0

Infrared face recognition based on LBP histogram and KW feature selection

NASA Astrophysics Data System (ADS)

Xie, Zhihua

2014-07-01

The conventional LBP-based feature as represented by the local binary pattern (LBP) histogram still has room for performance improvements. This paper focuses on the dimension reduction of LBP micro-patterns and proposes an improved infrared face recognition method based on LBP histogram representation. To extract the local robust features in infrared face images, LBP is chosen to get the composition of micro-patterns of sub-blocks. Based on statistical test theory, Kruskal-Wallis (KW) feature selection method is proposed to get the LBP patterns which are suitable for infrared face recognition. The experimental results show combination of LBP and KW features selection improves the performance of infrared face recognition, the proposed method outperforms the traditional methods based on LBP histogram, discrete cosine transform(DCT) or principal component analysis(PCA).

Simultaneous storage of medical images in the spatial and frequency domain: A comparative study

PubMed Central

Nayak, Jagadish; Bhat, P Subbanna; Acharya U, Rajendra; UC, Niranjan

2004-01-01

Background Digital watermarking is a technique of hiding specific identification data for copyright authentication. This technique is adapted here for interleaving patient information with medical images, to reduce storage and transmission overheads. Methods The patient information is encrypted before interleaving with images to ensure greater security. The bio-signals are compressed and subsequently interleaved with the image. This interleaving is carried out in the spatial domain and Frequency domain. The performance of interleaving in the spatial, Discrete Fourier Transform (DFT), Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) coefficients is studied. Differential pulse code modulation (DPCM) is employed for data compression as well as encryption and results are tabulated for a specific example. Results It can be seen from results, the process does not affect the picture quality. This is attributed to the fact that the change in LSB of a pixel changes its brightness by 1 part in 256. Spatial and DFT domain interleaving gave very less %NRMSE as compared to DCT and DWT domain. Conclusion The Results show that spatial domain the interleaving, the %NRMSE was less than 0.25% for 8-bit encoded pixel intensity. Among the frequency domain interleaving methods, DFT was found to be very efficient. PMID:15180899

Birkhoff Normal Form for Some Nonlinear PDEs

NASA Astrophysics Data System (ADS)

Bambusi, Dario

We consider the problem of extending to PDEs Birkhoff normal form theorem on Hamiltonian systems close to nonresonant elliptic equilibria. As a model problem we take the nonlinear wave equation with Dirichlet boundary conditions on [0,π] g is an analytic skewsymmetric function which vanishes for u=0 and is periodic with period 2π in the x variable. We prove, under a nonresonance condition which is fulfilled for most g's, that for any integer M there exists a canonical transformation that puts the Hamiltonian in Birkhoff normal form up to a reminder of order M. The canonical transformation is well defined in a neighbourhood of the origin of a Sobolev type phase space of sufficiently high order. Some dynamical consequences are obtained. The technique of proof is applicable to quite general semilinear equations in one space dimension.

Software For Integer Programming

NASA Technical Reports Server (NTRS)

Fogle, F. R.

1992-01-01

Improved Exploratory Search Technique for Pure Integer Linear Programming Problems (IESIP) program optimizes objective function of variables subject to confining functions or constraints, using discrete optimization or integer programming. Enables rapid solution of problems up to 10 variables in size. Integer programming required for accuracy in modeling systems containing small number of components, distribution of goods, scheduling operations on machine tools, and scheduling production in general. Written in Borland's TURBO Pascal.

IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS

NASA Technical Reports Server (NTRS)

Fogle, F. R.

1994-01-01

IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.

Sums of Consecutive Integers

ERIC Educational Resources Information Center

Pong, Wai Yan

2007-01-01

We begin by answering the question, "Which natural numbers are sums of consecutive integers?" We then go on to explore the set of lengths (numbers of summands) in the decompositions of an integer as such sums.

A Transform-Based Feature Extraction Approach for Motor Imagery Tasks Classification

PubMed Central

Khorshidtalab, Aida; Mesbah, Mostefa; Salami, Momoh J. E.

2015-01-01

In this paper, we present a new motor imagery classification method in the context of electroencephalography (EEG)-based brain–computer interface (BCI). This method uses a signal-dependent orthogonal transform, referred to as linear prediction singular value decomposition (LP-SVD), for feature extraction. The transform defines the mapping as the left singular vectors of the LP coefficient filter impulse response matrix. Using a logistic tree-based model classifier; the extracted features are classified into one of four motor imagery movements. The proposed approach was first benchmarked against two related state-of-the-art feature extraction approaches, namely, discrete cosine transform (DCT) and adaptive autoregressive (AAR)-based methods. By achieving an accuracy of 67.35%, the LP-SVD approach outperformed the other approaches by large margins (25% compared with DCT and 6 % compared with AAR-based methods). To further improve the discriminatory capability of the extracted features and reduce the computational complexity, we enlarged the extracted feature subset by incorporating two extra features, namely, Q- and the Hotelling’s \\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{upgreek} \\usepackage{mathrsfs} \\setlength{\\oddsidemargin}{-69pt} \\begin{document} }{}$T^{2}$ \\end{document} statistics of the transformed EEG and introduced a new EEG channel selection method. The performance of the EEG classification based on the expanded feature set and channel selection method was compared with that of a number of the state-of-the-art classification methods previously reported with the BCI IIIa competition data set. Our method came second with an average accuracy of 81.38%. PMID:27170898

Genetics algorithm optimization of DWT-DCT based image Watermarking

NASA Astrophysics Data System (ADS)

Budiman, Gelar; Novamizanti, Ledya; Iwut, Iwan

2017-01-01

Data hiding in an image content is mandatory for setting the ownership of the image. Two dimensions discrete wavelet transform (DWT) and discrete cosine transform (DCT) are proposed as transform method in this paper. First, the host image in RGB color space is converted to selected color space. We also can select the layer where the watermark is embedded. Next, 2D-DWT transforms the selected layer obtaining 4 subband. We select only one subband. And then block-based 2D-DCT transforms the selected subband. Binary-based watermark is embedded on the AC coefficients of each block after zigzag movement and range based pixel selection. Delta parameter replacing pixels in each range represents embedded bit. +Delta represents bit “1” and -delta represents bit “0”. Several parameters to be optimized by Genetics Algorithm (GA) are selected color space, layer, selected subband of DWT decomposition, block size, embedding range, and delta. The result of simulation performs that GA is able to determine the exact parameters obtaining optimum imperceptibility and robustness, in any watermarked image condition, either it is not attacked or attacked. DWT process in DCT based image watermarking optimized by GA has improved the performance of image watermarking. By five attacks: JPEG 50%, resize 50%, histogram equalization, salt-pepper and additive noise with variance 0.01, robustness in the proposed method has reached perfect watermark quality with BER=0. And the watermarked image quality by PSNR parameter is also increased about 5 dB than the watermarked image quality from previous method.

The Optimization dispatching of Micro Grid Considering Load Control

NASA Astrophysics Data System (ADS)

Zhang, Pengfei; Xie, Jiqiang; Yang, Xiu; He, Hongli

2018-01-01

This paper proposes an optimization control of micro-grid system economy operation model. It coordinates the new energy and storage operation with diesel generator output, so as to achieve the economic operation purpose of micro-grid. In this paper, the micro-grid network economic operation model is transformed into mixed integer programming problem, which is solved by the mature commercial software, and the new model is proved to be economical, and the load control strategy can reduce the charge and discharge times of energy storage devices, and extend the service life of the energy storage device to a certain extent.

An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models

NASA Astrophysics Data System (ADS)

Dukkipati, Ambedkar; Manathara, Joel George

In this paper we study representation of KL-divergence minimization, in the cases where integer sufficient statistics exists, using tools from polynomial algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. In particular, we also study the case of Kullback-Csisźar iteration scheme. We present implicit descriptions of these models and show that implicitization preserves specialization of prior distribution. This result leads us to a Gröbner bases method to compute an implicit representation of minimum KL-divergence models.

Analysis misconception of integers in microteaching activities

NASA Astrophysics Data System (ADS)

Setyawati, R. D.; Indiati, I.

2018-05-01

This study view to analyse student misconceptions on integers in microteaching activities. This research used qualitative research design. An integers test contained questions from eight main areas of integers. The Integers material test includes (a) converting the image into fractions, (b) examples of positive numbers including rational numbers, (c) operations in fractions, (d) sorting fractions from the largest to the smallest, and vice versa; e) equate denominator, (f) concept of ratio mark, (g) definition of fraction, and (h) difference between fractions and parts. The results indicated an integers concepts: (1) the students have not been able to define concepts well based on the classification of facts in organized part; (2) The correlational concept: students have not been able to combine interrelated events in the form of general principles; and (3) theoretical concepts: students have not been able to use concepts that facilitate in learning the facts or events in an organized system.

Thermal wave propagation in blood perfused tissues under hyperthermia treatment for unique oscillatory heat flux at skin surface and appropriate initial condition

NASA Astrophysics Data System (ADS)

Dutta, Jaideep; Kundu, Balaram

2018-05-01

This paper aims to develop an analytical study of heat propagation in biological tissues for constant and variable heat flux at the skin surface correlated with Hyperthermia treatment. In the present research work we have attempted to impose two unique kind of oscillating boundary condition relevant to practical aspect of the biomedical engineering while the initial condition is constructed as spatially dependent according to a real life situation. We have implemented Laplace's Transform method (LTM) and Green Function (GFs) method to solve single phase lag (SPL) thermal wave model of bioheat equation (TWMBHE). This research work strongly focuses upon the non-invasive therapy by employing oscillating heat flux. The heat flux at the skin surface is considered as constant, sinusoidal, and cosine forms. A comparative study of the impact of different kinds of heat flux on the temperature field in living tissue explored that sinusoidal heat flux will be more effective if the time of therapeutic heating is high. Cosine heating is also applicable in Hyperthermia treatment due to its precision in thermal waveform. The result also emphasizes that accurate observation must be required for the selection of phase angle and frequency of oscillating heat flux. By possible comparison with the published experimental research work and published mathematical study we have experienced a difference in temperature distribution as 5.33% and 4.73%, respectively. A parametric analysis has been devoted to suggest an appropriate procedure of the selection of important design variables in viewpoint of an effective heating in hyperthermia treatment.

B-spline goal-oriented error estimators for geometrically nonlinear rods

DTIC Science & Technology

2011-04-01

respectively, for the output functionals q2–q4 (linear and nonlinear with the trigonometric functions sine and cosine) in all the tests considered...of the errors resulting from the linear, quadratic and nonlinear (with trigonometric functions sine and cosine) outputs and for p = 1, 2. If the... Portugal . References [1] A.T. Adams. Sobolev Spaces. Academic Press, Boston, 1975. [2] M. Ainsworth and J.T. Oden. A posteriori error estimation in

Muon detector for the COSINE-100 experiment

NASA Astrophysics Data System (ADS)

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.

Optimization of Darrieus turbines with an upwind and downwind momentum model

NASA Astrophysics Data System (ADS)

Loth, J. L.; McCoy, H.

1983-08-01

This paper presents a theoretical aerodynamic performance optimization for two dimensional vertical axis wind turbines. A momentum type wake model is introduced with separate cosine type interference coefficients for the up and downwind half of the rotor. The cosine type loading permits the rotor blades to become unloaded near the junction of the upwind and downwind rotor halves. Both the optimum and the off design magnitude of the interference coefficients are obtained by equating the drag on each of the rotor halves to that on each of two cosine loaded actuator discs in series. The values for the optimum rotor efficiency, solidity and corresponding interference coefficients have been obtained in a closed form analytic solution by maximizing the power extracted from the downwind rotor half as well as from the entire rotor. A numerical solution was required when viscous effects were incorporated in the rotor optimization.

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

Phillion, D.

This code enables one to display, take line-outs on, and perform various transformations on an image created by an array of integer*2 data. Uncompressed eight-bit TIFF files created on either the Macintosh or the IBM PC may also be read in and converted to a 16 bit signed integer image. This code is designed to handle all the formats used for PDS (photo-densitometer) files at the Lawrence Livermore National Laboratory. These formats are all explained by the application code. The image may be zoomed infinitely and the gray scale mapping can be easily changed. Line-outs may be horizontal or verticalmore » with arbitrary width, angled with arbitrary end points, or taken along any path. This code is usually used to examine spectrograph data. Spectral lines may be identified and a polynomial fit from position to wavelength may be found. The image array can be remapped so that the pixels all have the same change of lambda width. It is not necessary to do this, however. Lineouts may be printed, saved as Cricket tab-delimited files, or saved as PICT2 files. The plots may be linear, semilog, or logarithmic with nice values and proper scientific notation. Typically, spectral lines are curved.« less

Design of distributed PID-type dynamic matrix controller for fractional-order systems

NASA Astrophysics Data System (ADS)

Wang, Dawei; Zhang, Ridong

2018-01-01

With the continuous requirements for product quality and safety operation in industrial production, it is difficult to describe the complex large-scale processes with integer-order differential equations. However, the fractional differential equations may precisely represent the intrinsic characteristics of such systems. In this paper, a distributed PID-type dynamic matrix control method based on fractional-order systems is proposed. First, the high-order approximate model of integer order is obtained by utilising the Oustaloup method. Then, the step response model vectors of the plant is obtained on the basis of the high-order model, and the online optimisation for multivariable processes is transformed into the optimisation of each small-scale subsystem that is regarded as a sub-plant controlled in the distributed framework. Furthermore, the PID operator is introduced into the performance index of each subsystem and the fractional-order PID-type dynamic matrix controller is designed based on Nash optimisation strategy. The information exchange among the subsystems is realised through the distributed control structure so as to complete the optimisation task of the whole large-scale system. Finally, the control performance of the designed controller in this paper is verified by an example.

Extension of the method of moments for population balances involving fractional moments and application to a typical agglomeration problem.

PubMed

Alexiadis, Alessio; Vanni, Marco; Gardin, Pascal

2004-08-01

The method of moment (MOM) is a powerful tool for solving population balance. Nevertheless it cannot be used in every circumstance. Sometimes, in fact, it is not possible to write the governing equations in closed form. Higher moments, for instance, could appear in the evolution of the lower ones. This obstacle has often been resolved by prescribing some functional form for the particle size distribution. Another example is the occurrence of fractional moment, usually connected with the presence of fractal aggregates. For this case we propose a procedure that does not need any assumption on the form of the distribution but it is based on the "moments generating function" (that is the Laplace transform of the distribution). An important result of probability theory is that the kth derivative of the moments generating function represents the kth moment of the original distribution. This result concerns integer moments but, taking in account the Weyl fractional derivative, could be extended to fractional orders. Approximating fractional derivative makes it possible to express the fractional moments in terms of the integer ones and so to use regularly the method of moments.

MIP models for connected facility location: A theoretical and computational study☆

PubMed Central

Gollowitzer, Stefan; Ljubić, Ivana

2011-01-01

This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines facility location and Steiner trees: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Steiner tree, facility opening costs and the assignment costs need to be minimized. We model ConFL using seven compact and three mixed integer programming formulations of exponential size. We also show how to transform ConFL into the Steiner arborescence problem. A full hierarchy between the models is provided. For two exponential size models we develop a branch-and-cut algorithm. An extensive computational study is based on two benchmark sets of randomly generated instances with up to 1300 nodes and 115,000 edges. We empirically compare the presented models with respect to the quality of obtained bounds and the corresponding running time. We report optimal values for all but 16 instances for which the obtained gaps are below 0.6%. PMID:25009366

Fractal electrodynamics via non-integer dimensional space approach

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2015-09-01

Using the recently suggested vector calculus for non-integer dimensional space, we consider electrodynamics problems in isotropic case. This calculus allows us to describe fractal media in the framework of continuum models with non-integer dimensional space. We consider electric and magnetic fields of fractal media with charges and currents in the framework of continuum models with non-integer dimensional spaces. An application of the fractal Gauss's law, the fractal Ampere's circuital law, the fractal Poisson equation for electric potential, and equation for fractal stream of charges are suggested. Lorentz invariance and speed of light in fractal electrodynamics are discussed. An expression for effective refractive index of non-integer dimensional space is suggested.

Increases to Biogenic Secondary Organic Aerosols from SO2 and NOx in the Southeastern US

NASA Astrophysics Data System (ADS)

Russell, L. M.; Liu, J.; Ruggeri, G.; Takahama, S.; Claflin, M. S.; Ziemann, P. J.; Lee, A.; Murphy, B.; Pye, H. O. T.; Ng, N. L.; McKinney, K. A.; Surratt, J. D.

2017-12-01

During the 2013 Southern Oxidant and Aerosol Study, Fourier Transform Infrared Spectroscopy (FTIR) and Aerosol Mass Spectrometer (AMS) measurements of submicron mass were collected at Look Rock, Tennessee, and Centreville, Alabama. The low NOx, low wind, little rain, and increased daytime isoprene emissions led to multi-day stagnation events at Look Rock that provided clear evidence of particle-phase sulfate enhancing biogenic secondary organic aerosol (bSOA) by selective uptake. Organic mass (OM) sources were apportioned as 42% "vehicle-related" and 54% bSOA, with the latter including "sulfate-related bSOA" that correlated to sulfate (r=0.72) and "nitrate-related bSOA" that correlated to nitrate (r=0.65). Single-particle mass spectra showed three composition types that corresponded to the mass-based factors with spectra cosine similarity of 0.93 and time series correlations of r>0.4. The vehicle-related OM with m/z 44 was correlated to black carbon, "sulfate-related bSOA" was on particles with high sulfate, and "nitrate-related bSOA" was on all particles. The similarity of the m/z spectra (cosine similarity=0.97) and the time series correlation (r=0.80) of the "sulfate-related bSOA" to the sulfate-containing single-particle type provide evidence for particle composition contributing to selective uptake of isoprene oxidation products onto particles that contain sulfate from power plants. Since Look Rock had much less NOx than Centreville, comparing the bSOA at the two sites provides an evaluation of the role of NOx for bSOA. CO and submicron sulfate and OM concentrations were 15-60 % higher at Centreville than at Look Rock but their time series had moderate correlations of r= 0.51, 0.54, and 0.47, respectively. However, NOx had no correlation (r=0.08) between the two sites. OM correlated with the higher NOx levels at Centreville but with O3 at Look Rock. OM sources identified by Positive Matrix Factorization had three very similar factors at both sites from FTIR, one of which was Biological Organic Aerosols. The FTIR spectrum for this factor is similar (cosine similarity > 0.6) to that of lab-generated particle mass from both isoprene and monoterpene with high NOx conditions from chamber experiments, providing verification of the reactions relevant to atmospheric conditions.

Personalized Medicine in Veterans with Traumatic Brain Injuries

DTIC Science & Technology

2012-05-01

UPGMA ) based on cosine correlation of row mean centered log2 signal values; this was the top 50%-tile, 3) In the DA top 50%-tile, selected probe sets...GeneMaths XT following row mean centering of log2 trans- formed MAS5.0 signal values; probe set cluster- ing was performed by the UPGMA method using...hierarchical clustering analysis using the UPGMA algorithm with cosine correlation as the similarity metric. Results are presented as a heat map (left

Average Cosine Meter and High Spectral Resolution Measurements at the Marine Light Mixed Layer Site.

DTIC Science & Technology

1994-09-30

G. A. Knauer, D. M. Karl , and Atlantic Ocean determined by inverse methods , W. W. Broenkow, VERTEX: Carbon cycling in the Ph.D. thesis, pp. 1-287...electromechanical release, this novel and inexpensive method eliminated shadowing from the ship. The ACM measured irradiance at 490nm using cosine and 411...three times more accurately than using traditional methods . A mathematical simulation of the absorption coefficient of phytoplankton derived from

A novel equivalent definition of Caputo fractional derivative without singular kernel and superconvergent analysis

NASA Astrophysics Data System (ADS)

Liu, Zhengguang; Li, Xiaoli

2018-05-01

In this article, we present a new second-order finite difference discrete scheme for a fractal mobile/immobile transport model based on equivalent transformative Caputo formulation. The new transformative formulation takes the singular kernel away to make the integral calculation more efficient. Furthermore, this definition is also effective where α is a positive integer. Besides, the T-Caputo derivative also helps us to increase the convergence rate of the discretization of the α-order(0 < α < 1) Caputo derivative from O(τ2-α) to O(τ3-α), where τ is the time step. For numerical analysis, a Crank-Nicolson finite difference scheme to solve the fractal mobile/immobile transport model is introduced and analyzed. The unconditional stability and a priori estimates of the scheme are given rigorously. Moreover, the applicability and accuracy of the scheme are demonstrated by numerical experiments to support our theoretical analysis.

A method for predicting DCT-based denoising efficiency for grayscale images corrupted by AWGN and additive spatially correlated noise

NASA Astrophysics Data System (ADS)

Rubel, Aleksey S.; Lukin, Vladimir V.; Egiazarian, Karen O.

2015-03-01

Results of denoising based on discrete cosine transform for a wide class of images corrupted by additive noise are obtained. Three types of noise are analyzed: additive white Gaussian noise and additive spatially correlated Gaussian noise with middle and high correlation levels. TID2013 image database and some additional images are taken as test images. Conventional DCT filter and BM3D are used as denoising techniques. Denoising efficiency is described by PSNR and PSNR-HVS-M metrics. Within hard-thresholding denoising mechanism, DCT-spectrum coefficient statistics are used to characterize images and, subsequently, denoising efficiency for them. Results of denoising efficiency are fitted for such statistics and efficient approximations are obtained. It is shown that the obtained approximations provide high accuracy of prediction of denoising efficiency.

2.5D Multi-View Gait Recognition Based on Point Cloud Registration

PubMed Central

Tang, Jin; Luo, Jian; Tjahjadi, Tardi; Gao, Yan

2014-01-01

This paper presents a method for modeling a 2.5-dimensional (2.5D) human body and extracting the gait features for identifying the human subject. To achieve view-invariant gait recognition, a multi-view synthesizing method based on point cloud registration (MVSM) to generate multi-view training galleries is proposed. The concept of a density and curvature-based Color Gait Curvature Image is introduced to map 2.5D data onto a 2D space to enable data dimension reduction by discrete cosine transform and 2D principle component analysis. Gait recognition is achieved via a 2.5D view-invariant gait recognition method based on point cloud registration. Experimental results on the in-house database captured by a Microsoft Kinect camera show a significant performance gain when using MVSM. PMID:24686727

Optimization of self-acting step thrust bearings for load capacity and stiffness.

NASA Technical Reports Server (NTRS)

Hamrock, B. J.

1972-01-01

Linearized analysis of a finite-width rectangular step thrust bearing. Dimensionless load capacity and stiffness are expressed in terms of a Fourier cosine series. The dimensionless load capacity and stiffness were found to be a function of the dimensionless bearing number, the pad length-to-width ratio, the film thickness ratio, the step location parameter, and the feed groove parameter. The equations obtained in the analysis were verified. The assumptions imposed were substantiated by comparing the results with an existing exact solution for the infinite width bearing. A digital computer program was developed which determines optimal bearing configuration for maximum load capacity or stiffness. Simple design curves are presented. Results are shown for both compressible and incompressible lubrication. Through a parameter transformation the results are directly usable in designing optimal step sector thrust bearings.

Wide band stepped frequency ground penetrating radar

DOEpatents

Bashforth, M.B.; Gardner, D.; Patrick, D.; Lewallen, T.A.; Nammath, S.R.; Painter, K.D.; Vadnais, K.G.

1996-03-12

A wide band ground penetrating radar system is described embodying a method wherein a series of radio frequency signals is produced by a single radio frequency source and provided to a transmit antenna for transmission to a target and reflection therefrom to a receive antenna. A phase modulator modulates those portions of the radio frequency signals to be transmitted and the reflected modulated signal is combined in a mixer with the original radio frequency signal to produce a resultant signal which is demodulated to produce a series of direct current voltage signals, the envelope of which forms a cosine wave shaped plot which is processed by a Fast Fourier Transform Unit 44 into frequency domain data wherein the position of a preponderant frequency is indicative of distance to the target and magnitude is indicative of the signature of the target. 6 figs.

A face and palmprint recognition approach based on discriminant DCT feature extraction.

PubMed

Jing, Xiao-Yuan; Zhang, David

2004-12-01

In the field of image processing and recognition, discrete cosine transform (DCT) and linear discrimination are two widely used techniques. Based on them, we present a new face and palmprint recognition approach in this paper. It first uses a two-dimensional separability judgment to select the DCT frequency bands with favorable linear separability. Then from the selected bands, it extracts the linear discriminative features by an improved Fisherface method and performs the classification by the nearest neighbor classifier. We detailedly analyze theoretical advantages of our approach in feature extraction. The experiments on face databases and palmprint database demonstrate that compared to the state-of-the-art linear discrimination methods, our approach obtains better classification performance. It can significantly improve the recognition rates for face and palmprint data and effectively reduce the dimension of feature space.

Application of Fourier Transform Infrared Spectra (FTIR) Fingerprint in the Quality Control of Mineral Chinese Medicine Limonitum.

PubMed

Liu, Sheng-jin; Yang, Huan; Wu, De-kang; Xu, Chun-xiang; Lin, Rui-chao; Tian, Jin-gai; Fang, Fang

2015-04-01

In the present paper, the fingerprint of Limonitum (a mineral Chinese medicine) by FTIR was established, and the spectrograms among crude samples, processed one and the adulterant sample were compared. Eighteen batches of Limonitum samples from different production areas were analyzed and the angle cosine value of transmittance (%) of common peaks was calculated to get the similarity of the FTIR fingerprints. The result showed that the similarities and the coefficients of the samples were all more than 0.90. The processed samples revealed significant differences compared with the crude one. This study analyzed the composition characteristics of Limonitum in FTIR fingerprint, and it was simple and fast to distinguish the crude, processed and the counterfeit samples. The FTIR fingerprints provide a new method for evaluating the quality of Limonitum.

Oilfield flooding polymer

DOEpatents

Martin, Fred D.; Hatch, Melvin J.; Shepitka, Joel S.; Donaruma, Lorraine G.

1986-01-01

A monomer, polymers containing the monomer, and the use of the polymer in oilfield flooding is disclosed. The subject monomer is represented by the general formula: ##STR1## wherein: n is an integer from 0 to about 4; m is an integer from 0 to about 6; a is an integer equal to at least 1 except where m is equal to 0, a must equal 0 and where m is equal to 1, a must equal 0 or 1; p is an integer from 2 to about 10; b is an integer equal to at least 1 and is of sufficient magnitude that the ratio b/p is at least 0.2; and q is an integer from 0 to 2. The number of hydroxy groups in the monomer is believed to be critical, and therefore the sum of (a+b) divided by the sum (m+p) should be at least 0.2. The moieties linked to the acrylic nitrogen can be joined to provide a ringed structure.

High-Aperture-Efficiency Horn Antenna

NASA Technical Reports Server (NTRS)

Pickens, Wesley; Hoppe, Daniel; Epp, Larry; Kahn, Abdur

2005-01-01

A horn antenna (see Figure 1) has been developed to satisfy requirements specific to its use as an essential component of a high-efficiency Ka-band amplifier: The combination of the horn antenna and an associated microstrip-patch antenna array is required to function as a spatial power divider that feeds 25 monolithic microwave integrated-circuit (MMIC) power amplifiers. The foregoing requirement translates to, among other things, a further requirement that the horn produce a uniform, vertically polarized electromagnetic field in its patches identically so that the MMICs can operate at maximum efficiency. The horn is fed from a square waveguide of 5.9436-mm-square cross section via a transition piece. The horn features cosine-tapered, dielectric-filled longitudinal corrugations in its vertical walls to create a hard boundary condition: This aspect of the horn design causes the field in the horn aperture to be substantially vertically polarized and to be nearly uniform in amplitude and phase. As used here, cosine-tapered signifies that the depth of the corrugations is a cosine function of distance along the horn. Preliminary results of finite-element simulations of performance have shown that by virtue of the cosine taper the impedance response of this horn can be expected to be better than has been achieved previously in a similar horn having linearly tapered dielectric- filled longitudinal corrugations. It is possible to create a hard boundary condition by use of a single dielectric-filled corrugation in each affected wall, but better results can be obtained with more corrugations. Simulations were performed for a one- and a three-corrugation cosine-taper design. For comparison, a simulation was also performed for a linear- taper design (see Figure 2). The three-corrugation design was chosen to minimize the cost of fabrication while still affording acceptably high performance. Future designs using more corrugations per wavelength are expected to provide better field responses and, hence, greater aperture efficiencies.

A Paper-and-Pencil gcd Algorithm for Gaussian Integers

ERIC Educational Resources Information Center

Szabo, Sandor

2005-01-01

As with natural numbers, a greatest common divisor of two Gaussian (complex) integers "a" and "b" is a Gaussian integer "d" that is a common divisor of both "a" and "b". This article explores an algorithm for such gcds that is easy to do by hand.

Sines and Cosines. Part 2 of 3

NASA Technical Reports Server (NTRS)

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.

Convolutional coding combined with continuous phase modulation

NASA Technical Reports Server (NTRS)

Pizzi, S. V.; Wilson, S. G.

1985-01-01

Background theory and specific coding designs for combined coding/modulation schemes utilizing convolutional codes and continuous-phase modulation (CPM) are presented. In this paper the case of r = 1/2 coding onto a 4-ary CPM is emphasized, with short-constraint length codes presented for continuous-phase FSK, double-raised-cosine, and triple-raised-cosine modulation. Coding buys several decibels of coding gain over the Gaussian channel, with an attendant increase of bandwidth. Performance comparisons in the power-bandwidth tradeoff with other approaches are made.

Wigner distribution function of Hermite-cosine-Gaussian beams through an apertured optical system.

PubMed

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.

Star tracker error analysis: Roll-to-pitch nonorthogonality

NASA Technical Reports Server (NTRS)

Corson, R. W.

1979-01-01

An error analysis is described on an anomaly isolated in the star tracker software line of sight (LOS) rate test. The LOS rate cosine was found to be greater than one in certain cases which implied that either one or both of the star tracker measured end point unit vectors used to compute the LOS rate cosine had lengths greater than unity. The roll/pitch nonorthogonality matrix in the TNB CL module of the IMU software is examined as the source of error.

Sines and Cosines. Part 3 of 3

NASA Technical Reports Server (NTRS)

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.

Application of DFT Filter Banks and Cosine Modulated Filter Banks in Filtering

NASA Technical Reports Server (NTRS)

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.

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

NASA Technical Reports Server (NTRS)

Truong, T. K.; Hsu, I. S.; Chang, J. J.; Shyu, H. C.; Reed, I. S.

1986-01-01

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-pw technology.

A new VLSI complex integer multiplier which uses a quadratic-polynomial residue system with Fermat numbers

NASA Technical Reports Server (NTRS)

Shyu, H. C.; Reed, I. S.; Truong, T. K.; Hsu, I. S.; Chang, J. J.

1987-01-01

A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-Pw technology.

Elasticity of fractal materials using the continuum model with non-integer dimensional space

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2015-01-01

Using a generalization of vector calculus for space with non-integer dimension, we consider elastic properties of fractal materials. Fractal materials are described by continuum models with non-integer dimensional space. A generalization of elasticity equations for non-integer dimensional space, and its solutions for the equilibrium case of fractal materials are suggested. Elasticity problems for fractal hollow ball and cylindrical fractal elastic pipe with inside and outside pressures, for rotating cylindrical fractal pipe, for gradient elasticity and thermoelasticity of fractal materials are solved.

Collaborative Wideband Compressed Signal Detection in Interplanetary Internet

NASA Astrophysics Data System (ADS)

Wang, Yulin; Zhang, Gengxin; Bian, Dongming; Gou, Liang; Zhang, Wei

2014-07-01

As the development of autonomous radio in deep space network, it is possible to actualize communication between explorers, aircrafts, rovers and satellites, e.g. from different countries, adopting different signal modes. The first mission to enforce the autonomous radio is to detect signals of the explorer autonomously without disturbing the original communication. This paper develops a collaborative wideband compressed signal detection approach for InterPlaNetary (IPN) Internet where there exist sparse active signals in the deep space environment. Compressed sensing (CS) can be utilized by exploiting the sparsity of IPN Internet communication signal, whose useful frequency support occupies only a small portion of an entirely wide spectrum. An estimate of the signal spectrum can be obtained by using reconstruction algorithms. Against deep space shadowing and channel fading, multiple satellites collaboratively sense and make a final decision according to certain fusion rule to gain spatial diversity. A couple of novel discrete cosine transform (DCT) and walsh-hadamard transform (WHT) based compressed spectrum detection methods are proposed which significantly improve the performance of spectrum recovery and signal detection. Finally, extensive simulation results are presented to show the effectiveness of our proposed collaborative scheme for signal detection in IPN Internet. Compared with the conventional discrete fourier transform (DFT) based method, our DCT and WHT based methods reduce computational complexity, decrease processing time, save energy and enhance probability of detection.

A novel method of the image processing on irregular triangular meshes

NASA Astrophysics Data System (ADS)

Vishnyakov, Sergey; Pekhterev, Vitaliy; Sokolova, Elizaveta

2018-04-01

The paper describes a novel method of the image processing based on irregular triangular meshes implementation. The triangular mesh is adaptive to the image content, least mean square linear approximation is proposed for the basic interpolation within the triangle. It is proposed to use triangular numbers to simplify using of the local (barycentric) coordinates for the further analysis - triangular element of the initial irregular mesh is to be represented through the set of the four equilateral triangles. This allows to use fast and simple pixels indexing in local coordinates, e.g. "for" or "while" loops for access to the pixels. Moreover, representation proposed allows to use discrete cosine transform of the simple "rectangular" symmetric form without additional pixels reordering (as it is used for shape-adaptive DCT forms). Furthermore, this approach leads to the simple form of the wavelet transform on triangular mesh. The results of the method application are presented. It is shown that advantage of the method proposed is a combination of the flexibility of the image-adaptive irregular meshes with the simple form of the pixel indexing in local triangular coordinates and the using of the common forms of the discrete transforms for triangular meshes. Method described is proposed for the image compression, pattern recognition, image quality improvement, image search and indexing. It also may be used as a part of video coding (intra-frame or inter-frame coding, motion detection).

Canonic FFT flow graphs for real-valued even/odd symmetric inputs

NASA Astrophysics Data System (ADS)

Lao, Yingjie; Parhi, Keshab K.

2017-12-01

Canonic real-valued fast Fourier transform (RFFT) has been proposed to reduce the arithmetic complexity by eliminating redundancies. In a canonic N-point RFFT, the number of signal values at each stage is canonic with respect to the number of signal values, i.e., N. The major advantage of the canonic RFFTs is that these require the least number of butterfly operations and only real datapaths when mapped to architectures. In this paper, we consider the FFT computation whose inputs are not only real but also even/odd symmetric, which indeed lead to the well-known discrete cosine and sine transforms (DCTs and DSTs). Novel algorithms for generating the flow graphs of canonic RFFTs with even/odd symmetric inputs are proposed. It is shown that the proposed algorithms lead to canonic structures with N/2 +1 signal values at each stage for an N-point real even symmetric FFT (REFFT) or N/2 -1 signal values at each stage for an N-point RFFT real odd symmetric FFT (ROFFT). In order to remove butterfly operations, several twiddle factor transformations are proposed in this paper. We also discuss the design of canonic REFFT for any composite length. Performances of the canonic REFFT/ROFFT are also discussed. It is shown that the flow graph of canonic REFFT/ROFFT has less number of interconnections, less butterfly operations, and less twiddle factor operations, compared to prior works.

An integral transform approach for a mixed boundary problem involving a flowing partially penetrating well with infinitesimal well skin

NASA Astrophysics Data System (ADS)

Chang, Chien-Chieh; Chen, Chia-Shyun

2002-06-01

A flowing partially penetrating well with infinitesimal well skin is a mixed boundary because a Cauchy condition is prescribed along the screen length and a Neumann condition of no flux is stipulated over the remaining unscreened part. An analytical approach based on the integral transform technique is developed to determine the Laplace domain solution for such a mixed boundary problem in a confined aquifer of finite thickness. First, the mixed boundary is changed into a homogeneous Neumann boundary by substituting the Cauchy condition with a Neumann condition in terms of well bore flux that varies along the screen length and is time dependent. Despite the well bore flux being unknown a priori, the modified model containing this homogeneous Neumann boundary can be solved with the Laplace and the finite Fourier cosine transforms. To determine well bore flux, screen length is discretized into a finite number of segments, to which the Cauchy condition is reinstated. This reinstatement also restores the relation between the original model and the solutions obtained. For a given time, the numerical inversion of the Laplace domain solution yields the drawdown distributions, well bore flux, and the well discharge. This analytical approach provides an alternative for dealing with the mixed boundary problems, especially when aquifer thickness is assumed to be finite.

Random Matrix Theory in molecular dynamics analysis.

PubMed

Palese, Luigi Leonardo

2015-01-01

It is well known that, in some situations, principal component analysis (PCA) carried out on molecular dynamics data results in the appearance of cosine-shaped low index projections. Because this is reminiscent of the results obtained by performing PCA on a multidimensional Brownian dynamics, it has been suggested that short-time protein dynamics is essentially nothing more than a noisy signal. Here we use Random Matrix Theory to analyze a series of short-time molecular dynamics experiments which are specifically designed to be simulations with high cosine content. We use as a model system the protein apoCox17, a mitochondrial copper chaperone. Spectral analysis on correlation matrices allows to easily differentiate random correlations, simply deriving from the finite length of the process, from non-random signals reflecting the intrinsic system properties. Our results clearly show that protein dynamics is not really Brownian also in presence of the cosine-shaped low index projections on principal axes. Copyright © 2014 Elsevier B.V. All rights reserved.

Simulation and Evaluation of Small Scale Solar Power Tower Performance under Malaysia Weather Conditions

NASA Astrophysics Data System (ADS)

Gamil, A. M.; Gilani, S. I.; Al-Kayiem, H. H.

2013-06-01

Solar energy is the most available, clean, and inexpensive source of energy among the other renewable sources of energy. Malaysia is an encouraging location for the development of solar energy systems due to abundant sunshine (10 hours daily with average solar energy received between 1400 and 1900 kWh/m2). In this paper the design of heliostat field of 3 dual-axis heliostat units located in Ipoh, Malaysia is introduced. A mathematical model was developed to estimate the sun position and calculate the cosine losses in the field. The study includes calculating the incident solar power to a fixed target on the tower by analysing the tower height and ground distance between the heliostat and the tower base. The cosine efficiency was found for each heliostat according to the sun movement. TRNSYS software was used to simulate the cosine efficiencies and field hourly incident solar power input to the fixed target. The results show the heliostat field parameters and the total incident solar input to the receiver.

Ontology-based structured cosine similarity in document summarization: with applications to mobile audio-based knowledge management.

PubMed

Yuan, Soe-Tsyr; Sun, Jerry

2005-10-01

Development of algorithms for automated text categorization in massive text document sets is an important research area of data mining and knowledge discovery. Most of the text-clustering methods were grounded in the term-based measurement of distance or similarity, ignoring the structure of the documents. In this paper, we present a novel method named structured cosine similarity (SCS) that furnishes document clustering with a new way of modeling on document summarization, considering the structure of the documents so as to improve the performance of document clustering in terms of quality, stability, and efficiency. This study was motivated by the problem of clustering speech documents (of no rich document features) attained from the wireless experience oral sharing conducted by mobile workforce of enterprises, fulfilling audio-based knowledge management. In other words, this problem aims to facilitate knowledge acquisition and sharing by speech. The evaluations also show fairly promising results on our method of structured cosine similarity.

A scientific report on heat transfer analysis in mixed convection flow of Maxwell fluid over an oscillating vertical plate.

PubMed

Khan, Ilyas; Shah, Nehad Ali; Dennis, L C C

2017-03-15

This scientific report investigates the heat transfer analysis in mixed convection flow of Maxwell fluid over an oscillating vertical plate with constant wall temperature. The problem is modelled in terms of coupled partial differential equations with initial and boundary conditions. Some suitable non-dimensional variables are introduced in order to transform the governing problem into dimensionless form. The resulting problem is solved via Laplace transform method and exact solutions for velocity, shear stress and temperature are obtained. These solutions are greatly influenced with the variation of embedded parameters which include the Prandtl number and Grashof number for various times. In the absence of free convection, the corresponding solutions representing the mechanical part of velocity reduced to the well known solutions in the literature. The total velocity is presented as a sum of both cosine and sine velocities. The unsteady velocity in each case is arranged in the form of transient and post transient parts. It is found that the post transient parts are independent of time. The solutions corresponding to Newtonian fluids are recovered as a special case and comparison between Newtonian fluid and Maxwell fluid is shown graphically.

A new DWT/MC/DPCM video compression framework based on EBCOT

NASA Astrophysics Data System (ADS)

Mei, L. M.; Wu, H. R.; Tan, D. M.

2005-07-01

A novel Discrete Wavelet Transform (DWT)/Motion Compensation (MC)/Differential Pulse Code Modulation (DPCM) video compression framework is proposed in this paper. Although the Discrete Cosine Transform (DCT)/MC/DPCM is the mainstream framework for video coders in industry and international standards, the idea of DWT/MC/DPCM has existed for more than one decade in the literature and the investigation is still undergoing. The contribution of this work is twofold. Firstly, the Embedded Block Coding with Optimal Truncation (EBCOT) is used here as the compression engine for both intra- and inter-frame coding, which provides good compression ratio and embedded rate-distortion (R-D) optimization mechanism. This is an extension of the EBCOT application from still images to videos. Secondly, this framework offers a good interface for the Perceptual Distortion Measure (PDM) based on the Human Visual System (HVS) where the Mean Squared Error (MSE) can be easily replaced with the PDM in the R-D optimization. Some of the preliminary results are reported here. They are also compared with benchmarks such as MPEG-2 and MPEG-4 version 2. The results demonstrate that under specified condition the proposed coder outperforms the benchmarks in terms of rate vs. distortion.

Dynamic Forms. Part 1: Functions

NASA Technical Reports Server (NTRS)

Meyer, George; Smith, G. Allan

1993-01-01

The formalism of dynamic forms is developed as a means for organizing and systematizing the design control systems. The formalism allows the designer to easily compute derivatives to various orders of large composite functions that occur in flight-control design. Such functions involve many function-of-a-function calls that may be nested to many levels. The component functions may be multiaxis, nonlinear, and they may include rotation transformations. A dynamic form is defined as a variable together with its time derivatives up to some fixed but arbitrary order. The variable may be a scalar, a vector, a matrix, a direction cosine matrix, Euler angles, or Euler parameters. Algorithms for standard elementary functions and operations of scalar dynamic forms are developed first. Then vector and matrix operations and transformations between parameterization of rotations are developed in the next level in the hierarchy. Commonly occurring algorithms in control-system design, including inversion of pure feedback systems, are developed in the third level. A large-angle, three-axis attitude servo and other examples are included to illustrate the effectiveness of the developed formalism. All algorithms were implemented in FORTRAN code. Practical experience shows that the proposed formalism may significantly improve the productivity of the design and coding process.

The comparison between SVD-DCT and SVD-DWT digital image watermarking

NASA Astrophysics Data System (ADS)

Wira Handito, Kurniawan; Fauzi, Zulfikar; Aminy Ma’ruf, Firda; Widyaningrum, Tanti; Muslim Lhaksmana, Kemas

2018-03-01

With internet, anyone can publish their creation into digital data simply, inexpensively, and absolutely easy to be accessed by everyone. However, the problem appears when anyone else claims that the creation is their property or modifies some part of that creation. It causes necessary protection of copyrights; one of the examples is with watermarking method in digital image. The application of watermarking technique on digital data, especially on image, enables total invisibility if inserted in carrier image. Carrier image will not undergo any decrease of quality and also the inserted image will not be affected by attack. In this paper, watermarking will be implemented on digital image using Singular Value Decomposition based on Discrete Wavelet Transform (DWT) and Discrete Cosine Transform (DCT) by expectation in good performance of watermarking result. In this case, trade-off happen between invisibility and robustness of image watermarking. In embedding process, image watermarking has a good quality for scaling factor < 0.1. The quality of image watermarking in decomposition level 3 is better than level 2 and level 1. Embedding watermark in low-frequency is robust to Gaussian blur attack, rescale, and JPEG compression, but in high-frequency is robust to Gaussian noise.

A scientific report on heat transfer analysis in mixed convection flow of Maxwell fluid over an oscillating vertical plate

NASA Astrophysics Data System (ADS)

Khan, Ilyas; Shah, Nehad Ali; Dennis, L. C. C.

2017-03-01

This scientific report investigates the heat transfer analysis in mixed convection flow of Maxwell fluid over an oscillating vertical plate with constant wall temperature. The problem is modelled in terms of coupled partial differential equations with initial and boundary conditions. Some suitable non-dimensional variables are introduced in order to transform the governing problem into dimensionless form. The resulting problem is solved via Laplace transform method and exact solutions for velocity, shear stress and temperature are obtained. These solutions are greatly influenced with the variation of embedded parameters which include the Prandtl number and Grashof number for various times. In the absence of free convection, the corresponding solutions representing the mechanical part of velocity reduced to the well known solutions in the literature. The total velocity is presented as a sum of both cosine and sine velocities. The unsteady velocity in each case is arranged in the form of transient and post transient parts. It is found that the post transient parts are independent of time. The solutions corresponding to Newtonian fluids are recovered as a special case and comparison between Newtonian fluid and Maxwell fluid is shown graphically.

A scientific report on heat transfer analysis in mixed convection flow of Maxwell fluid over an oscillating vertical plate

PubMed Central

Khan, Ilyas; Shah, Nehad Ali; Dennis, L. C. C.

2017-01-01

This scientific report investigates the heat transfer analysis in mixed convection flow of Maxwell fluid over an oscillating vertical plate with constant wall temperature. The problem is modelled in terms of coupled partial differential equations with initial and boundary conditions. Some suitable non-dimensional variables are introduced in order to transform the governing problem into dimensionless form. The resulting problem is solved via Laplace transform method and exact solutions for velocity, shear stress and temperature are obtained. These solutions are greatly influenced with the variation of embedded parameters which include the Prandtl number and Grashof number for various times. In the absence of free convection, the corresponding solutions representing the mechanical part of velocity reduced to the well known solutions in the literature. The total velocity is presented as a sum of both cosine and sine velocities. The unsteady velocity in each case is arranged in the form of transient and post transient parts. It is found that the post transient parts are independent of time. The solutions corresponding to Newtonian fluids are recovered as a special case and comparison between Newtonian fluid and Maxwell fluid is shown graphically. PMID:28294186

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

Zhang, Xiaohu; Shi, Di; Wang, Zhiwei

Shunt FACTS devices, such as, a Static Var Compensator (SVC), are capable of providing local reactive power compensation. They are widely used in the network to reduce the real power loss and improve the voltage profile. This paper proposes a planning model based on mixed integer conic programming (MICP) to optimally allocate SVCs in the transmission network considering load uncertainty. The load uncertainties are represented by a number of scenarios. Reformulation and linearization techniques are utilized to transform the original non-convex model into a convex second order cone programming (SOCP) model. Numerical case studies based on the IEEE 30-bus systemmore » demonstrate the effectiveness of the proposed planning model.« less

Sum-Difference Numbers

ERIC Educational Resources Information Center

Shi, Yixun

2010-01-01

Starting with an interesting number game sometimes used by school teachers to demonstrate the factorization of integers, "sum-difference numbers" are defined. A positive integer n is a "sum-difference number" if there exist positive integers "x, y, w, z" such that n = xy = wz and x ? y = w + z. This paper characterizes all sum-difference numbers…

Order and Value: Transitioning to Integers

ERIC Educational Resources Information Center

Bofferding, Laura

2014-01-01

As students progress from working with whole numbers to working with integers, they must wrestle with the big ideas of number values and order. Using objects to show positive quantities is easy, but no physical negative quantities exist. Therefore, when talking about integers, the author refers to number values instead of number quantities. The…

A time series model: First-order integer-valued autoregressive (INAR(1))

NASA Astrophysics Data System (ADS)

Simarmata, D. M.; Novkaniza, F.; Widyaningsih, Y.

2017-07-01

Nonnegative integer-valued time series arises in many applications. A time series model: first-order Integer-valued AutoRegressive (INAR(1)) is constructed by binomial thinning operator to model nonnegative integer-valued time series. INAR (1) depends on one period from the process before. The parameter of the model can be estimated by Conditional Least Squares (CLS). Specification of INAR(1) is following the specification of (AR(1)). Forecasting in INAR(1) uses median or Bayesian forecasting methodology. Median forecasting methodology obtains integer s, which is cumulative density function (CDF) until s, is more than or equal to 0.5. Bayesian forecasting methodology forecasts h-step-ahead of generating the parameter of the model and parameter of innovation term using Adaptive Rejection Metropolis Sampling within Gibbs sampling (ARMS), then finding the least integer s, where CDF until s is more than or equal to u . u is a value taken from the Uniform(0,1) distribution. INAR(1) is applied on pneumonia case in Penjaringan, Jakarta Utara, January 2008 until April 2016 monthly.

A method for optimizing the cosine response of solar UV diffusers

NASA Astrophysics Data System (ADS)

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.

How the laser-induced ionization of transparent solids can be suppressed

NASA Astrophysics Data System (ADS)

Gruzdev, Vitaly

2013-12-01

A capability to suppress laser-induced ionization of dielectric crystals in controlled and predictable way can potentially result in substantial improvement of laser damage threshold of optical materials. The traditional models that employ the Keldysh formula do not predict any suppression of the ionization because of the oversimplified description of electronic energy bands underlying the Keldysh formula. To fix this gap, we performed numerical simulations of time evolution of conduction-band electron density for a realistic cosine model of electronic bands characteristic of wide-band-gap cubic crystals. The simulations include contributions from the photo-ionization (evaluated by the Keldysh formula and by the formula for the cosine band of volume-centered cubic crystals) and from the avalanche ionization (evaluated by the Drude model). Maximum conduction-band electron density is evaluated from a single rate equation as a function of peak intensity of femtosecond laser pulses for alkali halide crystals. Results obtained for high-intensity femtosecond laser pulses demonstrate that the ionization can be suppressed by proper choice of laser parameters. In case of the Keldysh formula, the peak electron density exhibits saturation followed by gradual increase. For the cosine band, the electron density increases with irradiance within the low-intensity multiphoton regime and switches to decrease with intensity approaching threshold of the strong singularity of the ionization rate characteristic of the cosine band. Those trends are explained with specific modifications of band structure by electric field of laser pulses.

Vector calculus in non-integer dimensional space and its applications to fractal media

NASA Astrophysics Data System (ADS)

Tarasov, Vasily E.

2015-02-01

We suggest a generalization of vector calculus for the case of non-integer dimensional space. The first and second orders operations such as gradient, divergence, the scalar and vector Laplace operators for non-integer dimensional space are defined. For simplification we consider scalar and vector fields that are independent of angles. We formulate a generalization of vector calculus for rotationally covariant scalar and vector functions. This generalization allows us to describe fractal media and materials in the framework of continuum models with non-integer dimensional space. As examples of application of the suggested calculus, we consider elasticity of fractal materials (fractal hollow ball and fractal cylindrical pipe with pressure inside and outside), steady distribution of heat in fractal media, electric field of fractal charged cylinder. We solve the correspondent equations for non-integer dimensional space models.

Trace of totally positive algebraic integers and integer transfinite diameter

NASA Astrophysics Data System (ADS)

Flammang, V.

2009-06-01

Explicit auxiliary functions can be used in the ``Schur-Siegel- Smyth trace problem''. In the previous works, these functions were constructed only with polynomials having all their roots positive. Here, we use several polynomials with complex roots, which are found with Wu's algorithm, and we improve the known lower bounds for the absolute trace of totally positive algebraic integers. This improvement has a consequence for the search of Salem numbers that have a negative trace. The same method also gives a small improvement of the upper bound for the integer transfinite diameter of [0,1].

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

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

Jeff Linderoth

2011-11-06

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

Item Pool Construction Using Mixed Integer Quadratic Programming (MIQP). GMAC® Research Report RR-14-01

ERIC Educational Resources Information Center

Han, Kyung T.; Rudner, Lawrence M.

2014-01-01

This study uses mixed integer quadratic programming (MIQP) to construct multiple highly equivalent item pools simultaneously, and compares the results from mixed integer programming (MIP). Three different MIP/MIQP models were implemented and evaluated using real CAT item pool data with 23 different content areas and a goal of equal information…

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

Phillion, D.

This code enables one to display, take line-outs on, and perform various transformations on an image created by an array of integer*2 data. Uncompressed eight-bit TIFF files created on either the Macintosh or the IBM PC may also be read in and converted to a 16 bit signed integer image. This code is designed to handle all the formates used for PDS (photo-densitometer) files at the Lawrence Livermore National Laboratory. These formats are all explained by the application code. The image may be zoomed infinitely and the gray scale mapping can be easily changed. Line-outs may be horizontal or verticalmore » with arbitrary width, angled with arbitrary end points, or taken along any path. This code is usually used to examine spectrograph data. Spectral lines may be identified and a polynomial fit from position to wavelength may be found. The image array can be remapped so that the pixels all have the same change of lambda width. It is not necessary to do this, however. Lineouts may be printed, saved as Cricket tab-delimited files, or saved as PICT2 files. The plots may be linear, semilog, or logarithmic with nice values and proper scientific notation. Typically, spectral lines are curved. By identifying points on these lines and fitting their shapes by polyn.« less

Elliptic Curve Integral Points on y2 = x3 + 3x ‑ 14

NASA Astrophysics Data System (ADS)

Zhao, Jianhong

2018-03-01

The positive integer points and integral points of elliptic curves are very important in the theory of number and arithmetic algebra, it has a wide range of applications in cryptography and other fields. There are some results of positive integer points of elliptic curve y 2 = x 3 + ax + b, a, b ∈ Z In 1987, D. Zagier submit the question of the integer points on y 2 = x 3 ‑ 27x + 62, it count a great deal to the study of the arithmetic properties of elliptic curves. In 2009, Zhu H L and Chen J H solved the problem of the integer points on y 2 = x 3 ‑ 27x + 62 by using algebraic number theory and P-adic analysis method. In 2010, By using the elementary method, Wu H M obtain all the integral points of elliptic curves y 2 = x 3 ‑ 27x ‑ 62. In 2015, Li Y Z and Cui B J solved the problem of the integer points on y 2 = x 3 ‑ 21x ‑ 90 By using the elementary method. In 2016, Guo J solved the problem of the integer points on y 2 = x 3 + 27x + 62 by using the elementary method. In 2017, Guo J proved that y 2 = x 3 ‑ 21x + 90 has no integer points by using the elementary method. Up to now, there is no relevant conclusions on the integral points of elliptic curves y 2 = x 3 + 3x ‑ 14, which is the subject of this paper. By using congruence and Legendre Symbol, it can be proved that elliptic curve y 2 = x 3 + 3x ‑ 14 has only one integer point: (x, y) = (2, 0).

Similarities between principal components of protein dynamics and random diffusion

NASA Astrophysics Data System (ADS)

Hess, Berk

2000-12-01

Principal component analysis, also called essential dynamics, is a powerful tool for finding global, correlated motions in atomic simulations of macromolecules. It has become an established technique for analyzing molecular dynamics simulations of proteins. The first few principal components of simulations of large proteins often resemble cosines. We derive the principal components for high-dimensional random diffusion, which are almost perfect cosines. This resemblance between protein simulations and noise implies that for many proteins the time scales of current simulations are too short to obtain convergence of collective motions.

Cosine-Gaussian Schell-model sources.

PubMed

Mei, Zhangrong; Korotkova, Olga

2013-07-15

We introduce a new class of partially coherent sources of Schell type with cosine-Gaussian spectral degree of coherence and confirm that such sources are physically genuine. Further, we derive the expression for the cross-spectral density function of a beam generated by the novel source propagating in free space and analyze the evolution of the spectral density and the spectral degree of coherence. It is shown that at sufficiently large distances from the source the degree of coherence of the propagating beam assumes Gaussian shape while the spectral density takes on the dark-hollow profile.

Magnetic field generator

DOEpatents

Krienin, Frank

1990-01-01

A magnetic field generating device provides a useful magnetic field within a specific retgion, while keeping nearby surrounding regions virtually field free. By placing an appropriate current density along a flux line of the source, the stray field effects of the generator may be contained. One current carrying structure may support a truncated cosine distribution, and it may be surrounded by a current structure which follows a flux line that would occur in a full coaxial double cosine distribution. Strong magnetic fields may be generated and contained using superconducting cables to approximate required current surfaces.

Interaction phenomenon to dimensionally reduced p-gBKP equation

NASA Astrophysics Data System (ADS)

Zhang, Runfa; Bilige, Sudao; Bai, Yuexing; Lü, Jianqing; Gao, Xiaoqing

2018-02-01

Based on searching the combining of quadratic function and exponential (or hyperbolic cosine) function from the Hirota bilinear form of the dimensionally reduced p-gBKP equation, eight class of interaction solutions are derived via symbolic computation with Mathematica. The submergence phenomenon, presented to illustrate the dynamical features concerning these obtained solutions, is observed by three-dimensional plots and density plots with particular choices of the involved parameters between the exponential (or hyperbolic cosine) function and the quadratic function. It is proved that the interference between the two solitary waves is inelastic.

Use Correlation Coefficients in Gaussian Process to Train Stable ELM Models

DTIC Science & Technology

2015-05-22

confidence interval of prediction y′. There are two parameters that need to be determined in BELM: σ2N and α > 0. BELM effectively controls the over...similarly between h (u) and h (v) with vectorial angle cosine rather than distance between them. The increase of vector dimen- sion will not cause the... vectorial angle cosine approaches 0. Then, we can know that Q I with the increase of L. This reduces the chance of over-fitting. 414 Y. He et al. T a b

Angular measurement system

NASA Technical Reports Server (NTRS)

Currie, J. R.; Kissel, R. R.

1986-01-01

A system for the measurement of shaft angles is disclosed wherein a synchro resolver is sequentially pulsed, and alternately, a sine and then a cosine representative voltage output of it are sampled. Two like type, sine or cosine, succeeding outputs (V sub S1, V sub S2) are averaged and algebraically related to the opposite type output pulse (V sub c) occurring between the averaged pulses to provide a precise indication of the angle of a shaft coupled to the resolver at the instant of the occurrence of the intermediately occurring pulse (V sub c).

Integer aperture ambiguity resolution based on difference test

NASA Astrophysics Data System (ADS)

Zhang, Jingyu; Wu, Meiping; Li, Tao; Zhang, Kaidong

2015-07-01

Carrier-phase integer ambiguity resolution (IAR) is the key to highly precise, fast positioning and attitude determination with Global Navigation Satellite System (GNSS). It can be seen as the process of estimating the unknown cycle ambiguities of the carrier-phase observations as integers. Once the ambiguities are fixed, carrier phase data will act as the very precise range data. Integer aperture (IA) ambiguity resolution is the combination of acceptance testing and integer ambiguity resolution, which can realize better quality control of IAR. Difference test (DT) is one of the most popular acceptance tests. This contribution will give a detailed analysis about the following properties of IA ambiguity resolution based on DT: 1. The sharpest and loose upper bounds of DT are derived from the perspective of geometry. These bounds are very simple and easy to be computed, which give the range for the critical values of DT.

A VLSI implementation of DCT using pass transistor technology

NASA Technical Reports Server (NTRS)

Kamath, S.; Lynn, Douglas; Whitaker, Sterling

1992-01-01

A VLSI design for performing the Discrete Cosine Transform (DCT) operation on image blocks of size 16 x 16 in a real time fashion operating at 34 MHz (worst case) is presented. The process used was Hewlett-Packard's CMOS26--A 3 metal CMOS process with a minimum feature size of 0.75 micron. The design is based on Multiply-Accumulate (MAC) cells which make use of a modified Booth recoding algorithm for performing multiplication. The design of these cells is straight forward, and the layouts are regular with no complex routing. Two versions of these MAC cells were designed and their layouts completed. Both versions were simulated using SPICE to estimate their performance. One version is slightly faster at the cost of larger silicon area and higher power consumption. An improvement in speed of almost 20 percent is achieved after several iterations of simulation and re-sizing.

Vibration Power Flow In A Constrained Layer Damping Cylindrical Shell

NASA Astrophysics Data System (ADS)

Wang, Yun; Zheng, Gangtie

2012-07-01

In this paper, the vibration power flow in a constrained layer damping (CLD) cylindrical shell using wave propagation approach is investigated. The dynamic equations of the shell are derived with the Hamilton principle in conjunction with the Donnell shell assumption. With these equations, the dynamic responses of the system under a line circumferential cosine harmonic exciting force is obtained by employing the Fourier transform and the residue theorem. The vibration power flows inputted to the system and transmitted along the shell axial direction are both studied. The results show that input power flow varies with driving frequency and circumferential mode order, and the constrained damping layer can obviously restrict the exciting force from inputting power flow into the base shell especially for a thicker viscoelastic layer, a thicker or stiffer constraining layer (CL), and a higher circumferential mode order, can rapidly attenuate the vibration power flow transmitted along the base shell axial direction.

Non-Rigid Structure Estimation in Trajectory Space from Monocular Vision

PubMed Central

Wang, Yaming; Tong, Lingling; Jiang, Mingfeng; Zheng, Junbao

2015-01-01

In this paper, the problem of non-rigid structure estimation in trajectory space from monocular vision is investigated. Similar to the Point Trajectory Approach (PTA), based on characteristic points’ trajectories described by a predefined Discrete Cosine Transform (DCT) basis, the structure matrix was also calculated by using a factorization method. To further optimize the non-rigid structure estimation from monocular vision, the rank minimization problem about structure matrix is proposed to implement the non-rigid structure estimation by introducing the basic low-rank condition. Moreover, the Accelerated Proximal Gradient (APG) algorithm is proposed to solve the rank minimization problem, and the initial structure matrix calculated by the PTA method is optimized. The APG algorithm can converge to efficient solutions quickly and lessen the reconstruction error obviously. The reconstruction results of real image sequences indicate that the proposed approach runs reliably, and effectively improves the accuracy of non-rigid structure estimation from monocular vision. PMID:26473863

Image segmentation-based robust feature extraction for color image watermarking

NASA Astrophysics Data System (ADS)

Li, Mianjie; Deng, Zeyu; Yuan, Xiaochen

2018-04-01

This paper proposes a local digital image watermarking method based on Robust Feature Extraction. The segmentation is achieved by Simple Linear Iterative Clustering (SLIC) based on which an Image Segmentation-based Robust Feature Extraction (ISRFE) method is proposed for feature extraction. Our method can adaptively extract feature regions from the blocks segmented by SLIC. This novel method can extract the most robust feature region in every segmented image. Each feature region is decomposed into low-frequency domain and high-frequency domain by Discrete Cosine Transform (DCT). Watermark images are then embedded into the coefficients in the low-frequency domain. The Distortion-Compensated Dither Modulation (DC-DM) algorithm is chosen as the quantization method for embedding. The experimental results indicate that the method has good performance under various attacks. Furthermore, the proposed method can obtain a trade-off between high robustness and good image quality.

Artificial intelligence systems based on texture descriptors for vaccine development.

PubMed

Nanni, Loris; Brahnam, Sheryl; Lumini, Alessandra

2011-02-01

The aim of this work is to analyze and compare several feature extraction methods for peptide classification that are based on the calculation of texture descriptors starting from a matrix representation of the peptide. This texture-based representation of the peptide is then used to train a support vector machine classifier. In our experiments, the best results are obtained using local binary patterns variants and the discrete cosine transform with selected coefficients. These results are better than those previously reported that employed texture descriptors for peptide representation. In addition, we perform experiments that combine standard approaches based on amino acid sequence. The experimental section reports several tests performed on a vaccine dataset for the prediction of peptides that bind human leukocyte antigens and on a human immunodeficiency virus (HIV-1). Experimental results confirm the usefulness of our novel descriptors. The matlab implementation of our approaches is available at http://bias.csr.unibo.it/nanni/TexturePeptide.zip.

Method of detecting system function by measuring frequency response

NASA Technical Reports Server (NTRS)

Morrison, John L. (Inventor); Morrison, William H. (Inventor); Christophersen, Jon P. (Inventor)

2012-01-01

Real-time battery impedance spectrum is acquired using a one-time record. Fast Summation Transformation (FST) is a parallel method of acquiring a real-time battery impedance spectrum using a one-time record that enables battery diagnostics. An excitation current to a battery is a sum of equal amplitude sine waves of frequencies that are octave harmonics spread over a range of interest. A sample frequency is also octave and harmonically related to all frequencies in the sum. The time profile of this signal has a duration that is a few periods of the lowest frequency. The voltage response of the battery, average deleted, is the impedance of the battery in the time domain. Since the excitation frequencies are known and octave and harmonically related, a simple algorithm, FST, processes the time record by rectifying relative to the sine and cosine of each frequency. Another algorithm yields real and imaginary components for each frequency.

Resolution enhancement of low-quality videos using a high-resolution frame

NASA Astrophysics Data System (ADS)

Pham, Tuan Q.; van Vliet, Lucas J.; Schutte, Klamer

2006-01-01

This paper proposes an example-based Super-Resolution (SR) algorithm of compressed videos in the Discrete Cosine Transform (DCT) domain. Input to the system is a Low-Resolution (LR) compressed video together with a High-Resolution (HR) still image of similar content. Using a training set of corresponding LR-HR pairs of image patches from the HR still image, high-frequency details are transferred from the HR source to the LR video. The DCT-domain algorithm is much faster than example-based SR in spatial domain 6 because of a reduction in search dimensionality, which is a direct result of the compact and uncorrelated DCT representation. Fast searching techniques like tree-structure vector quantization 16 and coherence search1 are also key to the improved efficiency. Preliminary results on MJPEG sequence show promising result of the DCT-domain SR synthesis approach.

Wide band stepped frequency ground penetrating radar

DOEpatents

Bashforth, Michael B.; Gardner, Duane; Patrick, Douglas; Lewallen, Tricia A.; Nammath, Sharyn R.; Painter, Kelly D.; Vadnais, Kenneth G.

1996-01-01

A wide band ground penetrating radar system (10) embodying a method wherein a series of radio frequency signals (60) is produced by a single radio frequency source (16) and provided to a transmit antenna (26) for transmission to a target (54) and reflection therefrom to a receive antenna (28). A phase modulator (18) modulates those portion of the radio frequency signals (62) to be transmitted and the reflected modulated signal (62) is combined in a mixer (34) with the original radio frequency signal (60) to produce a resultant signal (53) which is demodulated to produce a series of direct current voltage signals (66) the envelope of which forms a cosine wave shaped plot (68) which is processed by a Fast Fourier Transform unit 44 into frequency domain data (70) wherein the position of a preponderant frequency is indicative of distance to the target (54) and magnitude is indicative of the signature of the target (54).

Detecting double compression of audio signal

NASA Astrophysics Data System (ADS)

Yang, Rui; Shi, Yun Q.; Huang, Jiwu

2010-01-01

MP3 is the most popular audio format nowadays in our daily life, for example music downloaded from the Internet and file saved in the digital recorder are often in MP3 format. However, low bitrate MP3s are often transcoded to high bitrate since high bitrate ones are of high commercial value. Also audio recording in digital recorder can be doctored easily by pervasive audio editing software. This paper presents two methods for the detection of double MP3 compression. The methods are essential for finding out fake-quality MP3 and audio forensics. The proposed methods use support vector machine classifiers with feature vectors formed by the distributions of the first digits of the quantized MDCT (modified discrete cosine transform) coefficients. Extensive experiments demonstrate the effectiveness of the proposed methods. To the best of our knowledge, this piece of work is the first one to detect double compression of audio signal.

Method of detecting system function by measuring frequency response

DOEpatents

Morrison, John L [Butte, MT; Morrison, William H [Manchester, CT; Christophersen, Jon P [Idaho Falls, ID

2012-04-03

Real-time battery impedance spectrum is acquired using a one-time record. Fast Summation Transformation (FST) is a parallel method of acquiring a real-time battery impedance spectrum using a one-time record that enables battery diagnostics. An excitation current to a battery is a sum of equal amplitude sine waves of frequencies that are octave harmonics spread over a range of interest. A sample frequency is also octave and harmonically related to all frequencies in the sum. The time profile of this signal has a duration that is a few periods of the lowest frequency. The voltage response of the battery, average deleted, is the impedance of the battery in the time domain. Since the excitation frequencies are known and octave and harmonically related, a simple algorithm, FST, processes the time record by rectifying relative to the sine and cosine of each frequency. Another algorithm yields real and imaginary components for each frequency.

Modeling of video traffic in packet networks, low rate video compression, and the development of a lossy+lossless image compression algorithm

NASA Technical Reports Server (NTRS)

Sayood, K.; Chen, Y. C.; Wang, X.

1992-01-01

During this reporting period we have worked on three somewhat different problems. These are modeling of video traffic in packet networks, low rate video compression, and the development of a lossy + lossless image compression algorithm, which might have some application in browsing algorithms. The lossy + lossless scheme is an extension of work previously done under this grant. It provides a simple technique for incorporating browsing capability. The low rate coding scheme is also a simple variation on the standard discrete cosine transform (DCT) coding approach. In spite of its simplicity, the approach provides surprisingly high quality reconstructions. The modeling approach is borrowed from the speech recognition literature, and seems to be promising in that it provides a simple way of obtaining an idea about the second order behavior of a particular coding scheme. Details about these are presented.

Detection of shifted double JPEG compression by an adaptive DCT coefficient model

NASA Astrophysics Data System (ADS)

Wang, Shi-Lin; Liew, Alan Wee-Chung; Li, Sheng-Hong; Zhang, Yu-Jin; Li, Jian-Hua

2014-12-01

In many JPEG image splicing forgeries, the tampered image patch has been JPEG-compressed twice with different block alignments. Such phenomenon in JPEG image forgeries is called the shifted double JPEG (SDJPEG) compression effect. Detection of SDJPEG-compressed patches could help in detecting and locating the tampered region. However, the current SDJPEG detection methods do not provide satisfactory results especially when the tampered region is small. In this paper, we propose a new SDJPEG detection method based on an adaptive discrete cosine transform (DCT) coefficient model. DCT coefficient distributions for SDJPEG and non-SDJPEG patches have been analyzed and a discriminative feature has been proposed to perform the two-class classification. An adaptive approach is employed to select the most discriminative DCT modes for SDJPEG detection. The experimental results show that the proposed approach can achieve much better results compared with some existing approaches in SDJPEG patch detection especially when the patch size is small.

Quantum communication through an unmodulated spin chain.

PubMed

Bose, Sougato

2003-11-14

We propose a scheme for using an unmodulated and unmeasured spin chain as a channel for short distance quantum communications. The state to be transmitted is placed on one spin of the chain and received later on a distant spin with some fidelity. We first obtain simple expressions for the fidelity of quantum state transfer and the amount of entanglement sharable between any two sites of an arbitrary Heisenberg ferromagnet using our scheme. We then apply this to the realizable case of an open ended chain with nearest neighbor interactions. The fidelity of quantum state transfer is obtained as an inverse discrete cosine transform and as a Bessel function series. We find that in a reasonable time, a qubit can be directly transmitted with better than classical fidelity across the full length of chains of up to 80 spins. Moreover, our channel allows distillable entanglement to be shared over arbitrary distances.

A review on "A Novel Technique for Image Steganography Based on Block-DCT and Huffman Encoding"

NASA Astrophysics Data System (ADS)

Das, Rig; Tuithung, Themrichon

2013-03-01

This paper reviews the embedding and extraction algorithm proposed by "A. Nag, S. Biswas, D. Sarkar and P. P. Sarkar" on "A Novel Technique for Image Steganography based on Block-DCT and Huffman Encoding" in "International Journal of Computer Science and Information Technology, Volume 2, Number 3, June 2010" [3] and shows that the Extraction of Secret Image is Not Possible for the algorithm proposed in [3]. 8 bit Cover Image of size is divided into non joint blocks and a two dimensional Discrete Cosine Transformation (2-D DCT) is performed on each of the blocks. Huffman Encoding is performed on an 8 bit Secret Image of size and each bit of the Huffman Encoded Bit Stream is embedded in the frequency domain by altering the LSB of the DCT coefficients of Cover Image blocks. The Huffman Encoded Bit Stream and Huffman Table

Some fundamentals regarding kinematics and generalized forces for multibody dynamics

NASA Technical Reports Server (NTRS)

Hodges, Dewey H.

1990-01-01

In order to illustrate the various forms in which generalized forces can arise from diverse subsystem analyses in multibody dynamics, intrinsic dynamical equations for the rotational dynamics of a rigid body are derived from Hamilton's principle. Two types of generalized forces are derived: (1) those associated with the virtual rotation vector in some orthogonal basis, and (2) those associated with varying generalized coordinates. As one physical or kinematical result (such as a frequency or a specific direction cosine) cannot rely on this selection, a 'blind' coupling of two models in which generalized forces are calculated in different ways would be wrong. Both types should use the same rotational coordinates and should denote the virtual rotation on a similar basis according to method 1, or in terms of common rotational coordinates and their diversifications as in method 2. Alternatively, the generalized forces and coordinates of one model may be transformed to those of the other.

A Converse of a Result about the Floor Function by Hermite

ERIC Educational Resources Information Center

Mortici, Cristinel

2012-01-01

The floor function maps a real number to the largest previous integer. More precisely, floor(x)=[x] is the largest integer not greater than x. The square bracket notation [x] for the floor function was introduced by Gauss in his third proof of quadratic reciprocity in 1808. The floor function is also called the greatest integer or entier (French…

Using Integer Clocks to Verify the Timing-Sync Sensor Network Protocol

NASA Technical Reports Server (NTRS)

Huang, Xiaowan; Singh, Anu; Smolka, Scott A.

2010-01-01

We use the UPPAAL model checker for Timed Automata to verify the Timing-Sync time-synchronization protocol for sensor networks (TPSN). The TPSN protocol seeks to provide network-wide synchronization of the distributed clocks in a sensor network. Clock-synchronization algorithms for sensor networks such as TPSN must be able to perform arithmetic on clock values to calculate clock drift and network propagation delays. They must be able to read the value of a local clock and assign it to another local clock. Such operations are not directly supported by the theory of Timed Automata. To overcome this formal-modeling obstacle, we augment the UPPAAL specification language with the integer clock derived type. Integer clocks, which are essentially integer variables that are periodically incremented by a global pulse generator, greatly facilitate the encoding of the operations required to synchronize clocks as in the TPSN protocol. With this integer-clock-based model of TPSN in hand, we use UPPAAL to verify that the protocol achieves network-wide time synchronization and is devoid of deadlock. We also use the UPPAAL Tracer tool to illustrate how integer clocks can be used to capture clock drift and resynchronization during protocol execution

System and method for generating attitude determinations using GPS

NASA Technical Reports Server (NTRS)

Cohen, Clark E. (Inventor)

1996-01-01

A GPS attitude receiver for determining the attitude of a moving vehicle in conjunction with a first, a second, a third, and a fourth antenna mounted to the moving vehicle. Each of the antennas receives a plurality of GPS signals that each include a carrier component. For each of the carrier components of the received GPS signals there is an integer ambiguity associated with the first and fourth antennas, an integer ambiguity associated with second and fourth antennas, and an integer ambiguity associated with the third and fourth antennas. The GPS attitude receiver measures phase values for the carrier components of the GPS signals received from each of the antennas at a plurality of measurement epochs during an initialization period and at a measurement epoch after the initialization period. In response to the phase values measured at the measurement epochs during the initialization period, the GPS attitude receiver computes integer ambiguity resolution values representing resolution of the integer ambiguities. Then, in response to the computed integer ambiguity resolution values and the phase value measured at the measurement epoch after the initialization period, it computes values defining the attitude of the moving vehicle at the measurement epoch after the initialization period.

Impact of conditions at start-up on thermovibrational convective flow.

PubMed

Melnikov, D E; Shevtsova, V M; Legros, J C

2008-11-01

The development of thermovibrational convection in a cubic cell filled with high Prandtl number liquid (isopropanol) is studied. Direct nonlinear simulations are performed by solving three-dimensional Navier-Stokes equations in the Boussinesq approximation. The cell is subjected to high frequency periodic oscillations perpendicular to the applied temperature gradient under zero gravity. Two types of vibrations are imposed: either as a sine or cosine function of time. It is shown that the initial vibrational phase plays a significant role in the transient behavior of thermovibrational convective flow. Such knowledge is important to interpret correctly short-duration experimental results performed in microgravity, among which the most accessible are drop towers ( approximately 5s) and parabolic flights ( approximately 20s) . It is obtained that under sine vibrations, the flow reaches steady state within less than one thermal time. Under cosine acceleration, this time is 2 times longer. For cosine excitations, the Nusselt number is approximately 10 times smaller in comparison with the sine case. Besides, in the case of cosine, the Nusselt number oscillates with double frequency. However, at the steady state, time-averaged and oscillatory characteristics of the flow are independent of the vibrational start-up. The only feature that always differs the two cases is the phase difference between the velocity, temperature, and accelerations. We have found that due to nonlinear response of the system to the imposed vibrations, the phase shift between velocity and temperature is never equal exactly to pi2 , at least in weightlessness. Thus, heat transport always exists from the beginning of vibrations, although it might be weak.

Enhancing micro-seismic P-phase arrival picking: EMD-cosine function-based denoising with an application to the AIC picker

NASA Astrophysics Data System (ADS)

Shang, Xueyi; Li, Xibing; Morales-Esteban, A.; Dong, Longjun

2018-03-01

Micro-seismic P-phase arrival picking is an elementary step into seismic event location, source mechanism analysis, and seismic tomography. However, a micro-seismic signal is often mixed with high frequency noises and power frequency noises (50 Hz), which could considerably reduce P-phase picking accuracy. To solve this problem, an Empirical Mode Decomposition (EMD)-cosine function denoising-based Akaike Information Criterion (AIC) picker (ECD-AIC picker) is proposed for picking the P-phase arrival time. Unlike traditional low pass filters which are ineffective when seismic data and noise bandwidths overlap, the EMD adaptively separates the seismic data and the noise into different Intrinsic Mode Functions (IMFs). Furthermore, the EMD-cosine function-based denoising retains the P-phase arrival amplitude and phase spectrum more reliably than any traditional low pass filter. The ECD-AIC picker was tested on 1938 sets of micro-seismic waveforms randomly selected from the Institute of Mine Seismology (IMS) database of the Chinese Yongshaba mine. The results have shown that the EMD-cosine function denoising can effectively estimate high frequency and power frequency noises and can be easily adapted to perform on signals with different shapes and forms. Qualitative and quantitative comparisons show that the combined ECD-AIC picker provides better picking results than both the ED-AIC picker and the AIC picker, and the comparisons also show more reliable source localization results when the ECD-AIC picker is applied, thus showing the potential of this combined P-phase picking technique.

Nocturnal heart rate variability in 1-year-old infants analyzed by using the Least Square Cosine Spectrum Method.

PubMed

Kochiya, Yuko; Hirabayashi, Akari; Ichimaru, Yuhei

2017-09-16

To evaluate the dynamic nature of nocturnal heart rate variability, RR intervals recorded with a wearable heart rate sensor were analyzed using the Least Square Cosine Spectrum Method. Six 1-year-old infants participated in the study. A wearable heart rate sensor was placed on their chest to measure RR intervals and 3-axis acceleration. Heartbeat time series were analyzed for every 30 s using the Least Square Cosine Spectrum Method, and an original parameter to quantify the regularity of respiratory-related heart rate rhythm was extracted and referred to as "RA (RA-COSPEC: Respiratory Area obtained by COSPEC)." The RA value is higher when a cosine curve is fitted to the original data series. The time sequential changes of RA showed cyclic changes with significant rhythm during the night. The mean cycle length of RA was 70 ± 15 min, which is shorter than young adult's cycle in our previous study. At the threshold level of RA greater than 3, the HR was significantly decreased compared with the RA value less than 3. The regularity of heart rate rhythm showed dynamic changes during the night in 1-year-old infants. Significant decrease of HR at the time of higher RA suggests the increase of parasympathetic activity. We suspect that the higher RA reflects the regular respiratory pattern during the night. This analysis system may be useful for quantitative assessment of regularity and dynamic changes of nocturnal heart rate variability in infants.

Empirical comparison of local structural similarity indices for collaborative-filtering-based recommender systems

NASA Astrophysics Data System (ADS)

Zhang, Qian-Ming; Shang, Ming-Sheng; Zeng, Wei; Chen, Yong; Lü, Linyuan

2010-08-01

Collaborative filtering is one of the most successful recommendation techniques, which can effectively predict the possible future likes of users based on their past preferences. The key problem of this method is how to define the similarity between users. A standard approach is using the correlation between the ratings that two users give to a set of objects, such as Cosine index and Pearson correlation coefficient. However, the costs of computing this kind of indices are relatively high, and thus it is impossible to be applied in the huge-size systems. To solve this problem, in this paper, we introduce six local-structure-based similarity indices and compare their performances with the above two benchmark indices. Experimental results on two data sets demonstrate that the structure-based similarity indices overall outperform the Pearson correlation coefficient. When the data is dense, the structure-based indices can perform competitively good as Cosine index, while with lower computational complexity. Furthermore, when the data is sparse, the structure-based indices give even better results than Cosine index.

Low frequency AC waveform generator

DOEpatents

Bilharz, Oscar W.

1986-01-01

Low frequency sine, cosine, triangle and square waves are synthesized in circuitry which allows variation in the waveform amplitude and frequency while exhibiting good stability and without requiring significant stabilization time. A triangle waveform is formed by a ramped integration process controlled by a saturation amplifier circuit which produces the necessary hysteresis for the triangle waveform. The output of the saturation circuit is tapped to produce the square waveform. The sine waveform is synthesized by taking the absolute value of the triangular waveform, raising this absolute value to a predetermined power, multiplying the raised absolute value of the triangle wave with the triangle wave itself and properly scaling the resultant waveform and subtracting it from the triangular waveform itself. The cosine is synthesized by squaring the triangular waveform, raising the triangular waveform to a predetermined power and adding the squared waveform raised to the predetermined power with a DC reference and subtracting the squared waveform therefrom, with all waveforms properly scaled. The resultant waveform is then multiplied with a square wave in order to correct the polarity and produce the resultant cosine waveform.

Selecting a proper design period for heliostat field layout optimization using Campo code

NASA Astrophysics Data System (ADS)

Saghafifar, Mohammad; Gadalla, Mohamed

2016-09-01

In this paper, different approaches are considered to calculate the cosine factor which is utilized in Campo code to expand the heliostat field layout and maximize its annual thermal output. Furthermore, three heliostat fields containing different number of mirrors are taken into consideration. Cosine factor is determined by considering instantaneous and time-average approaches. For instantaneous method, different design days and design hours are selected. For the time average method, daily time average, monthly time average, seasonally time average, and yearly time averaged cosine factor determinations are considered. Results indicate that instantaneous methods are more appropriate for small scale heliostat field optimization. Consequently, it is proposed to consider the design period as the second design variable to ensure the best outcome. For medium and large scale heliostat fields, selecting an appropriate design period is more important. Therefore, it is more reliable to select one of the recommended time average methods to optimize the field layout. Optimum annual weighted efficiency for heliostat fields (small, medium, and large) containing 350, 1460, and 3450 mirrors are 66.14%, 60.87%, and 54.04%, respectively.

An Integer Programming Model for Multi-Echelon Supply Chain Decision Problem Considering Inventories

NASA Astrophysics Data System (ADS)

Harahap, Amin; Mawengkang, Herman; Siswadi; Effendi, Syahril

2018-01-01

In this paper we address a problem that is of significance to the industry, namely the optimal decision of a multi-echelon supply chain and the associated inventory systems. By using the guaranteed service approach to model the multi-echelon inventory system, we develop a mixed integer; programming model to simultaneously optimize the transportation, inventory and network structure of a multi-echelon supply chain. To solve the model we develop a direct search approach using a strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points.

High-Dimensional Single-Photon Quantum Gates: Concepts and Experiments.

PubMed

Babazadeh, Amin; Erhard, Manuel; Wang, Feiran; Malik, Mehul; Nouroozi, Rahman; Krenn, Mario; Zeilinger, Anton

2017-11-03

Transformations on quantum states form a basic building block of every quantum information system. From photonic polarization to two-level atoms, complete sets of quantum gates for a variety of qubit systems are well known. For multilevel quantum systems beyond qubits, the situation is more challenging. The orbital angular momentum modes of photons comprise one such high-dimensional system for which generation and measurement techniques are well studied. However, arbitrary transformations for such quantum states are not known. Here we experimentally demonstrate a four-dimensional generalization of the Pauli X gate and all of its integer powers on single photons carrying orbital angular momentum. Together with the well-known Z gate, this forms the first complete set of high-dimensional quantum gates implemented experimentally. The concept of the X gate is based on independent access to quantum states with different parities and can thus be generalized to other photonic degrees of freedom and potentially also to other quantum systems.

On the lunar node resonance of the orbital plane evolution of the Earth's satellite orbits

NASA Astrophysics Data System (ADS)

Zhu, Ting-Lei

2018-06-01

This paper aims to investigate the effects of lunar node resonance on the circular medium Earth orbits (MEO). The dynamical model is established in classical Hamiltonian systems with the application of Lie transform to remove the non-resonant terms. Resonant condition, stability and phase structures are studied. The lunar node resonance occurs when the secular changing rates of the orbital node (with respect to the equator) and the lunar node (with respect to the ecliptic) form a simple integer ratio. The resonant conditions are satisfied for both inclined and equatorial orbits. The orbital plane would have long period (with typical timescales of several centuries) fluctuation due to the resonance.

Separating OR, SUM, and XOR Circuits.

PubMed

Find, Magnus; Göös, Mika; Järvisalo, Matti; Kaski, Petteri; Koivisto, Mikko; Korhonen, Janne H

2016-08-01

Given a boolean n × n matrix A we consider arithmetic circuits for computing the transformation x ↦ Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative integers), and non-monotone XOR-circuits (addition modulo 2). Our focus is on separating OR-circuits from the two other models in terms of circuit complexity: We show how to obtain matrices that admit OR-circuits of size O ( n ), but require SUM-circuits of size Ω( n 3/2 /log 2 n ).We consider the task of rewriting a given OR-circuit as a XOR-circuit and prove that any subquadratic-time algorithm for this task violates the strong exponential time hypothesis.

A class of traveling wave solutions for space-time fractional biological population model in mathematical physics

NASA Astrophysics Data System (ADS)

Akram, Ghazala; Batool, Fiza

2017-10-01

The (G'/G)-expansion method is utilized for a reliable treatment of space-time fractional biological population model. The method has been applied in the sense of the Jumarie's modified Riemann-Liouville derivative. Three classes of exact traveling wave solutions, hyperbolic, trigonometric and rational solutions of the associated equation are characterized with some free parameters. A generalized fractional complex transform is applied to convert the fractional equations to ordinary differential equations which subsequently resulted in number of exact solutions. It should be mentioned that the (G'/G)-expansion method is very effective and convenient for solving nonlinear partial differential equations of fractional order whose balancing number is a negative integer.

Ideal photon number amplifier and duplicator

NASA Technical Reports Server (NTRS)

Dariano, G. M.

1992-01-01

The photon number-amplification and number-duplication mechanism are analyzed in the ideal case. The search for unitary evolutions leads to consider also a number-deamplification mechanism, the symmetry between amplification and deamplification being broken by the integer-value nature of the number operator. Both transformations, amplification and duplication, need an auxiliary field which, in the case of amplification, turns out to be amplified in the inverse way. Input-output energy conservation is accounted for using a classical pump or through frequency-conversion of the fields. Ignoring one of the fields is equivalent to considering the amplifier as an open system involving entropy production. The Hamiltonians of the ideal devices are given and compared with those of realistic systems.

Joint image encryption and compression scheme based on IWT and SPIHT

NASA Astrophysics Data System (ADS)

Zhang, Miao; Tong, Xiaojun

2017-03-01

A joint lossless image encryption and compression scheme based on integer wavelet transform (IWT) and set partitioning in hierarchical trees (SPIHT) is proposed to achieve lossless image encryption and compression simultaneously. Making use of the properties of IWT and SPIHT, encryption and compression are combined. Moreover, the proposed secure set partitioning in hierarchical trees (SSPIHT) via the addition of encryption in the SPIHT coding process has no effect on compression performance. A hyper-chaotic system, nonlinear inverse operation, Secure Hash Algorithm-256(SHA-256), and plaintext-based keystream are all used to enhance the security. The test results indicate that the proposed methods have high security and good lossless compression performance.

Quantum Hall effect in ac driven graphene: From the half-integer to the integer case

NASA Astrophysics Data System (ADS)

Ding, Kai-He; Lim, Lih-King; Su, Gang; Weng, Zheng-Yu

2018-01-01

We theoretically study the quantum Hall effect (QHE) in graphene with an ac electric field. Based on the tight-binding model, the structure of the half-integer Hall plateaus at σxy=±(n +1 /2 ) 4 e2/h (n is an integer) gets qualitatively changed with the addition of new integer Hall plateaus at σxy=±n (4 e2/h ) starting from the edges of the band center regime towards the band center with an increasing ac field. Beyond a critical field strength, a Hall plateau with σxy=0 can be realized at the band center, hence fully restoring a conventional integer QHE with particle-hole symmetry. Within a low-energy Hamiltonian for Dirac cones merging, we show a very good agreement with the tight-binding calculations for the Hall plateau transitions. We also obtain the band structure for driven graphene ribbons to provide a further understanding on the appearance of the new Hall plateaus, showing a trivial insulator behavior for the σxy=0 state. In the presence of disorder, we numerically study the disorder-induced destruction of the quantum Hall states in a finite driven sample and find that qualitative features known in the undriven disordered case are maintained.

A Polynomial Time, Numerically Stable Integer Relation Algorithm

NASA Technical Reports Server (NTRS)

Ferguson, Helaman R. P.; Bailey, Daivd H.; Kutler, Paul (Technical Monitor)

1998-01-01

Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there exist integers a(sub i) not all zero such that a1x1 + a2x2 + ... a(sub n)Xn = 0. Beginning in 1977 several algorithms (with proofs) have been discovered to recover the a(sub i) given x. The most efficient of these existing integer relation algorithms (in terms of run time and the precision required of the input) has the drawback of being very unstable numerically. It often requires a numeric precision level in the thousands of digits to reliably recover relations in modest-sized test problems. We present here a new algorithm for finding integer relations, which we have named the "PSLQ" algorithm. It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it. Because this algorithm employs a numerically stable matrix reduction procedure, it is free from the numerical difficulties, that plague other integer relation algorithms. Furthermore, its stability admits an efficient implementation with lower run times oil average than other algorithms currently in Use. Finally, this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.

Cosine problem in EPRL/FK spinfoam model

NASA Astrophysics Data System (ADS)

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.

Similarity analysis between chromosomes of Homo sapiens and monkeys with correlation coefficient, rank correlation coefficient and cosine similarity measures

PubMed Central

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 between the H. sapiens and monkey. This similarity will be helpful at theft identification, maternity identification, disease identification, etc. PMID:26981409

Similarity analysis between chromosomes of Homo sapiens and monkeys with correlation coefficient, rank correlation coefficient and cosine similarity measures.

PubMed

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.

Modelling of a Solar Thermal Power Plant for Benchmarking Blackbox Optimization Solvers

NASA Astrophysics Data System (ADS)

Lemyre Garneau, Mathieu

A new family of problems is provided to serve as a benchmark for blackbox optimization solvers. The problems are single or bi-objective and vary in complexity in terms of the number of variables used (from 5 to 29), the type of variables (integer, real, category), the number of constraints (from 5 to 17) and their types (binary or continuous). In order to provide problems exhibiting dynamics that reflect real engineering challenges, they are extracted from an original numerical model of a concentrated solar power (CSP) power plant with molten salt thermal storage. The model simulates the performance of the power plant by using a high level modeling of each of its main components, namely, an heliostats field, a central cavity receiver, a molten salt heat storage, a steam generator and an idealized powerblock. The heliostats field layout is determined through a simple automatic strategy that finds the best individual positions on the field by considering their respective cosine efficiency, atmospheric scattering and spillage losses as a function of the design parameters. A Monte-Carlo integral method is used to evaluate the heliostats field's optical performance throughout the day so that shadowing effects between heliostats are considered, and the results of this evaluation provide the inputs to simulate the levels and temperatures of the thermal storage. The molten salt storage inventory is used to transfer thermal energy to the powerblock, which simulates a simple Rankine cycle with a single steam turbine. Auxiliary models are used to provide additional optimization constraints on the investment cost, parasitic losses or components failure. The results of preliminary optimizations performed with the NOMAD software using default settings are provided to show the validity of the problems.

Optimal Diet Planning for Eczema Patient Using Integer Programming

NASA Astrophysics Data System (ADS)

Zhen Sheng, Low; Sufahani, Suliadi

2018-04-01

Human diet planning is conducted by choosing appropriate food items that fulfill the nutritional requirements into the diet formulation. This paper discusses the application of integer programming to build the mathematical model of diet planning for eczema patients. The model developed is used to solve the diet problem of eczema patients from young age group. The integer programming is a scientific approach to select suitable food items, which seeks to minimize the costs, under conditions of meeting desired nutrient quantities, avoiding food allergens and getting certain foods into the diet that brings relief to the eczema conditions. This paper illustrates that the integer programming approach able to produce the optimal and feasible solution to deal with the diet problem of eczema patient.

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

NASA Astrophysics Data System (ADS)

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

2016-07-01

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

Season of Sampling and Season of Birth Influence Serotonin Metabolite Levels in Human Cerebrospinal Fluid

PubMed Central

Luykx, Jurjen J.; Bakker, Steven C.; Lentjes, Eef; Boks, Marco P. M.; van Geloven, Nan; Eijkemans, Marinus J. C.; Janson, Esther; Strengman, Eric; de Lepper, Anne M.; Westenberg, Herman; Klopper, Kai E.; Hoorn, Hendrik J.; Gelissen, Harry P. M. M.; Jordan, Julian; Tolenaar, Noortje M.; van Dongen, Eric P. A.; Michel, Bregt; Abramovic, Lucija; Horvath, Steve; Kappen, Teus; Bruins, Peter; Keijzers, Peter; Borgdorff, Paul; Ophoff, Roel A.; Kahn, René S.

2012-01-01

Background Animal studies have revealed seasonal patterns in cerebrospinal fluid (CSF) monoamine (MA) turnover. In humans, no study had systematically assessed seasonal patterns in CSF MA turnover in a large set of healthy adults. Methodology/Principal Findings Standardized amounts of CSF were prospectively collected from 223 healthy individuals undergoing spinal anesthesia for minor surgical procedures. The metabolites of serotonin (5-hydroxyindoleacetic acid, 5-HIAA), dopamine (homovanillic acid, HVA) and norepinephrine (3-methoxy-4-hydroxyphenylglycol, MPHG) were measured using high performance liquid chromatography (HPLC). Concentration measurements by sampling and birth dates were modeled using a non-linear quantile cosine function and locally weighted scatterplot smoothing (LOESS, span = 0.75). The cosine model showed a unimodal season of sampling 5-HIAA zenith in April and a nadir in October (p-value of the amplitude of the cosine = 0.00050), with predicted maximum (PCmax) and minimum (PCmin) concentrations of 173 and 108 nmol/L, respectively, implying a 60% increase from trough to peak. Season of birth showed a unimodal 5-HIAA zenith in May and a nadir in November (p = 0.00339; PCmax = 172 and PCmin = 126). The non-parametric LOESS showed a similar pattern to the cosine in both season of sampling and season of birth models, validating the cosine model. A final model including both sampling and birth months demonstrated that both sampling and birth seasons were independent predictors of 5-HIAA concentrations. Conclusion In subjects without mental illness, 5-HT turnover shows circannual variation by season of sampling as well as season of birth, with peaks in spring and troughs in fall. PMID:22312427

Pose Invariant Face Recognition Based on Hybrid Dominant Frequency Features

NASA Astrophysics Data System (ADS)

Wijaya, I. Gede Pasek Suta; Uchimura, Keiichi; Hu, Zhencheng

Face recognition is one of the most active research areas in pattern recognition, not only because the face is a human biometric characteristics of human being but also because there are many potential applications of the face recognition which range from human-computer interactions to authentication, security, and surveillance. This paper presents an approach to pose invariant human face image recognition. The proposed scheme is based on the analysis of discrete cosine transforms (DCT) and discrete wavelet transforms (DWT) of face images. From both the DCT and DWT domain coefficients, which describe the facial information, we build compact and meaningful features vector, using simple statistical measures and quantization. This feature vector is called as the hybrid dominant frequency features. Then, we apply a combination of the L2 and Lq metric to classify the hybrid dominant frequency features to a person's class. The aim of the proposed system is to overcome the high memory space requirement, the high computational load, and the retraining problems of previous methods. The proposed system is tested using several face databases and the experimental results are compared to a well-known Eigenface method. The proposed method shows good performance, robustness, stability, and accuracy without requiring geometrical normalization. Furthermore, the purposed method has low computational cost, requires little memory space, and can overcome retraining problem.

Diffractive centrosymmetric 3D-transmission phase gratings positioned at the image plane of optical systems transform lightlike 4D-WORLD as tunable resonators into spectral metrics...

NASA Astrophysics Data System (ADS)

Lauinger, Norbert

1999-08-01

Diffractive 3D phase gratings of spherical scatterers dense in hexagonal packing geometry represent adaptively tunable 4D-spatiotemporal filters with trichromatic resonance in visible spectrum. They are described in the (lambda) - chromatic and the reciprocal (nu) -aspects by reciprocal geometric translations of the lightlike Pythagoras theorem, and by the direction cosine for double cones. The most elementary resonance condition in the lightlike Pythagoras theorem is given by the transformation of the grating constants gx, gy, gz of the hexagonal 3D grating to (lambda) h1h2h3 equals (lambda) 111 with cos (alpha) equals 0.5. Through normalization of the chromaticity in the von Laue-interferences to (lambda) 111, the (nu) (lambda) equals (lambda) h1h2h3/(lambda) 111-factor of phase velocity becomes the crucial resonance factor, the 'regulating device' of the spatiotemporal interaction between 3D grating and light, space and time. In the reciprocal space equal/unequal weights and times in spectral metrics result at positions of interference maxima defined by hyperbolas and circles. A database becomes built up by optical interference for trichromatic image preprocessing, motion detection in vector space, multiple range data analysis, patchwide multiple correlations in the spatial frequency spectrum, etc.

Low-complex energy-aware image communication in visual sensor networks

NASA Astrophysics Data System (ADS)

Phamila, Yesudhas Asnath Victy; Amutha, Ramachandran

2013-10-01

A low-complex, low bit rate, energy-efficient image compression algorithm explicitly designed for resource-constrained visual sensor networks applied for surveillance, battle field, habitat monitoring, etc. is presented, where voluminous amount of image data has to be communicated over a bandwidth-limited wireless medium. The proposed method overcomes the energy limitation of individual nodes and is investigated in terms of image quality, entropy, processing time, overall energy consumption, and system lifetime. This algorithm is highly energy efficient and extremely fast since it applies energy-aware zonal binary discrete cosine transform (DCT) that computes only the few required significant coefficients and codes them using enhanced complementary Golomb Rice code without using any floating point operations. Experiments are performed using the Atmel Atmega128 and MSP430 processors to measure the resultant energy savings. Simulation results show that the proposed energy-aware fast zonal transform consumes only 0.3% of energy needed by conventional DCT. This algorithm consumes only 6% of energy needed by Independent JPEG Group (fast) version, and it suits for embedded systems requiring low power consumption. The proposed scheme is unique since it significantly enhances the lifetime of the camera sensor node and the network without any need for distributed processing as was traditionally required in existing algorithms.

Broadband W-band Rapid Frequency Sweep Considerations for Fourier Transform EPR.

PubMed

Strangeway, Robert A; Hyde, James S; Camenisch, Theodore G; Sidabras, Jason W; Mett, Richard R; Anderson, James R; Ratke, Joseph J; Subczynski, Witold K

2017-12-01

A multi-arm W-band (94 GHz) electron paramagnetic resonance spectrometer that incorporates a loop-gap resonator with high bandwidth is described. A goal of the instrumental development is detection of free induction decay following rapid sweep of the microwave frequency across the spectrum of a nitroxide radical at physiological temperature, which is expected to lead to a capability for Fourier transform electron paramagnetic resonance. Progress toward this goal is a theme of the paper. Because of the low Q-value of the loop-gap resonator, it was found necessary to develop a new type of automatic frequency control, which is described in an appendix. Path-length equalization, which is accomplished at the intermediate frequency of 59 GHz, is analyzed. A directional coupler is favored for separation of incident and reflected power between the bridge and the loop-gap resonator. Microwave leakage of this coupler is analyzed. An oversize waveguide with hyperbolic-cosine tapers couples the bridge to the loop-gap resonator, which results in reduced microwave power and signal loss. Benchmark sensitivity data are provided. The most extensive application of the instrument to date has been the measurement of T 1 values using pulse saturation recovery. An overview of that work is provided.

Non-integer expansion embedding techniques for reversible image watermarking

NASA Astrophysics Data System (ADS)

Xiang, Shijun; Wang, Yi

2015-12-01

This work aims at reducing the embedding distortion of prediction-error expansion (PE)-based reversible watermarking. In the classical PE embedding method proposed by Thodi and Rodriguez, the predicted value is rounded to integer number for integer prediction-error expansion (IPE) embedding. The rounding operation makes a constraint on a predictor's performance. In this paper, we propose a non-integer PE (NIPE) embedding approach, which can proceed non-integer prediction errors for embedding data into an audio or image file by only expanding integer element of a prediction error while keeping its fractional element unchanged. The advantage of the NIPE embedding technique is that the NIPE technique can really bring a predictor into full play by estimating a sample/pixel in a noncausal way in a single pass since there is no rounding operation. A new noncausal image prediction method to estimate a pixel with four immediate pixels in a single pass is included in the proposed scheme. The proposed noncausal image predictor can provide better performance than Sachnev et al.'s noncausal double-set prediction method (where data prediction in two passes brings a distortion problem due to the fact that half of the pixels were predicted with the watermarked pixels). In comparison with existing several state-of-the-art works, experimental results have shown that the NIPE technique with the new noncausal prediction strategy can reduce the embedding distortion for the same embedding payload.

Journal of Computational Electronics: Proceedings of the International Workshop on Computational Electronics (8th) (IWCE-8), Beckman Institute, University of Illinois, 15-18 October 2001. Volume 1, Issue 1-2

DTIC Science & Technology

2002-01-01

the fully coupled electrical and optical sys- of carrier is assumed and the minority carriers are not tems in VCSELs (Oyafuso et al. 2000). separated...evolution times the cosine function in Mn 𔃺 5 ++.(1) weakly depends on the phase space variables. With the increase of the time, the cosine term...can also be applied in phase - coherent devices. Our approach is useful to To obtain S(0) we just have to integrate A Q2 over the study noise in a wide

Lump solutions and interaction phenomenon to the third-order nonlinear evolution equation

NASA Astrophysics Data System (ADS)

Kofane, T. C.; Fokou, M.; Mohamadou, A.; Yomba, E.

2017-11-01

In this work, the lump solution and the kink solitary wave solution from the (2 + 1) -dimensional third-order evolution equation, using the Hirota bilinear method are obtained through symbolic computation with Maple. We have assumed that the lump solution is centered at the origin, when t = 0 . By considering a mixing positive quadratic function with exponential function, as well as a mixing positive quadratic function with hyperbolic cosine function, interaction solutions like lump-exponential and lump-hyperbolic cosine are presented. A completely non-elastic interaction between a lump and kink soliton is observed, showing that a lump solution can be swallowed by a kink soliton.

Geometric optimisation of an accurate cosine correcting optic fibre coupler for solar spectral measurement.

PubMed

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°.

Coronagraphic Observations of the Lunar Sodium Exosphere Near the Lunar Surface

NASA Technical Reports Server (NTRS)

Potter, A. E.; Morgan, T. H.

1998-01-01

The sodium exosphere of the Moon was observed using a solar coronagraph to occult the illuminated surface of the Moon. Exceptionally dust-free atmospheric conditions were required to allow the faint emission from sunlight scattered by lunar sodium atoms to be distinguished from moonlight scattered from atmospheric dust. At 0300 UT on April 22, 1994, ideal conditions prevailed for a few hours, and one excellent image of the sodium exosphere was measured, with the Moon at a phase angle of 51 deg, 81 % illuminated. Analysis of the image data showed that the weighted mean temperature of the exosphere was 1280 K and that the sodium column density varied approximately as cosine-cubed of the latitude. A cosine-cubed variation is an unexpected result, since the flux per unit area of solar photons and solar particles varies as the cosine of latitude. It is suggested that this can be explained by a temperature dependence for the sputtering of sodium atoms from the surface. This is a characteristic feature of chemical sputtering, which has been previously proposed to explain the sodium exosphere of Mercury. A possible interaction between chemical sputtering and solar photons is suggested.

Structural-electromagnetic bidirectional coupling analysis of space large film reflector antennas

NASA Astrophysics Data System (ADS)

Zhang, Xinghua; Zhang, Shuxin; Cheng, ZhengAi; Duan, Baoyan; Yang, Chen; Li, Meng; Hou, Xinbin; Li, Xun

2017-10-01

As used for energy transmission, a space large film reflector antenna (SLFRA) is characterized by large size and enduring high power density. The structural flexibility and the microwave radiation pressure (MRP) will lead to the phenomenon of structural-electromagnetic bidirectional coupling (SEBC). In this paper, the SEBC model of SLFRA is presented, then the deformation induced by the MRP and the corresponding far field pattern deterioration are simulated. Results show that, the direction of the MRP is identical to the normal of the reflector surface, and the magnitude is proportional to the power density and the square of cosine incident angle. For a typical cosine function distributed electric field, the MRP is a square of cosine distributed across the diameter. The maximum deflections of SLFRA linearly increase with the increasing microwave power densities and the square of the reflector diameters, and vary inversely with the film thicknesses. When the reflector diameter becomes 100 m large and the microwave power density exceeds 102 W/cm2, the gain loss of the 6.3 μm-thick reflector goes beyond 0.75 dB. When the MRP-induced deflection degrades the reflector performance, the SEBC should be taken into account.

Multichannel loudness compensation method based on segmented sound pressure level for digital hearing aids

NASA Astrophysics Data System (ADS)

Liang, Ruiyu; Xi, Ji; Bao, Yongqiang

2017-07-01

To improve the performance of gain compensation based on three-segment sound pressure level (SPL) in hearing aids, an improved multichannel loudness compensation method based on eight-segment SPL was proposed. Firstly, the uniform cosine modulated filter bank was designed. Then, the adjacent channels which have low or gradual slopes were adaptively merged to obtain the corresponding non-uniform cosine modulated filter according to the audiogram of hearing impaired persons. Secondly, the input speech was decomposed into sub-band signals and the SPL of every sub-band signal was computed. Meanwhile, the audible SPL range from 0 dB SPL to 120 dB SPL was equally divided into eight segments. Based on these segments, a different prescription formula was designed to compute more detailed gain to compensate according to the audiogram and the computed SPL. Finally, the enhanced signal was synthesized. Objective experiments showed the decomposed signals after cosine modulated filter bank have little distortion. Objective experiments showed that the hearing aids speech perception index (HASPI) and hearing aids speech quality index (HASQI) increased 0.083 and 0.082 on average, respectively. Subjective experiments showed the proposed algorithm can effectively improve the speech recognition of six hearing impaired persons.

An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems

NASA Astrophysics Data System (ADS)

Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri

2018-01-01

The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.

A Structural Weight Estimation Program (SWEEP) for Aircraft. Volume 11 - Flexible Airloads Stand-Alone Program

DTIC Science & Technology

1974-06-01

stiffness, lb-in. I Integer used to designate wing strip number 2 I Airplanw pitching moment of inertia, slug ft 2 I Airplane yawing moment of inertia...slug ft J Integer used to designated wing-loading distribution, i.e., J-l, loading due to angle of attack J=2> loading due to flap deflection J-3...moment at intersection of load reference line and body interface station (for vertical tail), in.-lb Integer used to designate type of wing airload

Example Level 1 Ada/SQL (Structured Query Language) System Software

DTIC Science & Technology

1987-09-01

PUTLINE ("EMPNAME JOB SALARY COMMISSION"); loop FETCH ( CURSOR ); INTO ( VEMP NAME , STR LAST ); T LEN INTEGER (STR LAST - V EMP NAME’FIRST + 1); for I in 1...begin PUT_LINE ("EMPNAME JOB SALARY DEPT"); loop FETCH (CURSOR); INTO ( VEMP NAME , STRLAST ); T_LEN := INTEGER (STRLAST - V_EMPNAME’FIRST + 1); for I in...NUMBERS OPEN ( CURSOR ); begin PUT_LINE ("EMP_NAME SALARY JOB"); loop FETCH ( CURSOR ); INTO ( VEMP NAME , STRLAST ); T_LEN := INTEGER (STR_LAST

Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.

PubMed

Zörnig, Peter

2015-08-01

We present integer programming models for some variants of the farthest string problem. The number of variables and constraints is substantially less than that of the integer linear programming models known in the literature. Moreover, the solution of the linear programming-relaxation contains only a small proportion of noninteger values, which considerably simplifies the rounding process. Numerical tests have shown excellent results, especially when a small set of long sequences is given.

Fuzzy Energy and Reserve Co-optimization With High Penetration of Renewable Energy

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

Liu, Cong; Botterud, Audun; Zhou, Zhi

In this study, we propose a fuzzy-based energy and reserve co-optimization model with consideration of high penetration of renewable energy. Under the assumption of a fixed uncertainty set of renewables, a two-stage robust model is proposed for clearing energy and reserves in the first stage and checking the feasibility and robustness of re-dispatches in the second stage. Fuzzy sets and their membership functions are introduced into the optimization model to represent the satisfaction degree of the variable uncertainty sets. The lower bound of the uncertainty set is expressed as fuzzy membership functions. The solutions are obtained by transforming the fuzzymore » mathematical programming formulation into traditional mixed integer linear programming problems.« less

Fuzzy Energy and Reserve Co-optimization With High Penetration of Renewable Energy

DOE PAGES

Liu, Cong; Botterud, Audun; Zhou, Zhi; ...

2016-10-21

In this study, we propose a fuzzy-based energy and reserve co-optimization model with consideration of high penetration of renewable energy. Under the assumption of a fixed uncertainty set of renewables, a two-stage robust model is proposed for clearing energy and reserves in the first stage and checking the feasibility and robustness of re-dispatches in the second stage. Fuzzy sets and their membership functions are introduced into the optimization model to represent the satisfaction degree of the variable uncertainty sets. The lower bound of the uncertainty set is expressed as fuzzy membership functions. The solutions are obtained by transforming the fuzzymore » mathematical programming formulation into traditional mixed integer linear programming problems.« less

Separating OR, SUM, and XOR Circuits☆

PubMed Central

Find, Magnus; Göös, Mika; Järvisalo, Matti; Kaski, Petteri; Koivisto, Mikko; Korhonen, Janne H.

2017-01-01

Given a boolean n × n matrix A we consider arithmetic circuits for computing the transformation x ↦ Ax over different semirings. Namely, we study three circuit models: monotone OR-circuits, monotone SUM-circuits (addition of non-negative integers), and non-monotone XOR-circuits (addition modulo 2). Our focus is on separating OR-circuits from the two other models in terms of circuit complexity: We show how to obtain matrices that admit OR-circuits of size O(n), but require SUM-circuits of size Ω(n3/2/log2n).We consider the task of rewriting a given OR-circuit as a XOR-circuit and prove that any subquadratic-time algorithm for this task violates the strong exponential time hypothesis. PMID:28529379

Magnetic impurity effect on charge and magnetic order in doped La1.5Ca0.5CoO4

NASA Astrophysics Data System (ADS)

Horigane, K.; Hiraka, H.; Tomiyasu, K.; Ohoyama, K.; Louca, D.; Yamada, K.

2012-02-01

Neutron scattering experiments were performed on single crystals of magnetic impurity doped cobalt oxides La1.5Ca0.5CoO4 to characterize the charge and spin orders. We newly found contrasting impurity effects. Two types of magnetic peaks are observed at q = (0.5,0,L) with L = half-integer and integer in La1.5Ca0.5CoO4, while magnetic peak at L = half-integer (integer) was only observed in Mn (Fe)-substituted sample. Although Mn and Fe impurities degrade charge and magnetic order, Cr impurity stabilizes the ordering at x = 0.5. Based on the crystal structural analysis of Cr doped sample, we found that the excess oxygen and change of octahedron around Co3+ were realized in Cr doped sample.

Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers.

PubMed

Chang, Weng-Long

2012-03-01

Assume that n is a positive integer. If there is an integer such that M (2) ≡ C (mod n), i.e., the congruence has a solution, then C is said to be a quadratic congruence (mod n). If the congruence does not have a solution, then C is said to be a quadratic noncongruence (mod n). The task of solving the problem is central to many important applications, the most obvious being cryptography. In this article, we describe a DNA-based algorithm for solving quadratic congruence and factoring integers. In additional to this novel contribution, we also show the utility of our encoding scheme, and of the algorithm's submodules. We demonstrate how a variety of arithmetic, shifted and comparative operations, namely bitwise and full addition, subtraction, left shifter and comparison perhaps are performed using strands of DNA.

A method for the measurement and the statistical analysis of atmospheric turbulence

NASA Technical Reports Server (NTRS)

Tieleman, H. W.; Tavoularis, S. C.

1974-01-01

The instantaneous values of output voltages representing the wind velocity vector and the temperature at different elevations of the 250-foot meteorological tower located at NASA Wallops Flight Center are provided with the three dimensional split-film TSI Model 1080 anemometer system. The output voltages are sampled at a rate of one every 5 milliseconds, digitized and stored on digital magnetic tapes for a time period of approximately 40 minutes, with the use of a specially designed data acqusition system. A new calibration procedure permits the conversion of the digital voltages to the respective values of the temperature and the velocity components in a Cartesian coordinate system connected with the TSI probe with considerable accuracy. Power, cross, coincidence and quadrature spectra of the wind components and the temperature are obtained with the use of the fast Fourier transform. The cosine taper data window and ensemble and frequency smoothing techniques are used to provide smooth estimates of the spectral functions.

First results from the spectral DCT trigger implemented in the Cyclone V Front-End Board used for a detection of very inclined showers in the Pierre Auger surface detector Engineering Array

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

Szadkowski, Zbigniew

2015-07-01

The paper presents the first results from the trigger based on the Discrete Cosine Transform (DCT) operating in the new Front-End Boards with Cyclone V FPGA deployed in 8 test surface detectors in the Pierre Auger Engineering Array. The patterns of the ADC traces generated by very inclined showers were obtained from the Auger database and from the CORSIKA simulation package supported next by Offline reconstruction Auger platform which gives a predicted digitized signal profiles. Simulations for many variants of the initial angle of shower, initialization depth in the atmosphere, type of particle and its initial energy gave a boundarymore » of the DCT coefficients used next for the on-line pattern recognition in the FPGA. Preliminary results have proven a right approach. We registered several showers triggered by the DCT for 120 MSps and 160 MSps. (authors)« less

Blind technique using blocking artifacts and entropy of histograms for image tampering detection

NASA Astrophysics Data System (ADS)

Manu, V. T.; Mehtre, B. M.

2017-06-01

The tremendous technological advancements in recent times has enabled people to create, edit and circulate images easily than ever before. As a result of this, ensuring the integrity and authenticity of the images has become challenging. Malicious editing of images to deceive the viewer is referred to as image tampering. A widely used image tampering technique is image splicing or compositing, in which regions from different images are copied and pasted. In this paper, we propose a tamper detection method utilizing the blocking and blur artifacts which are the footprints of splicing. The classification of images as tampered or not, is done based on the standard deviations of the entropy histograms and block discrete cosine transformations. We can detect the exact boundaries of the tampered area in the image, if the image is classified as tampered. Experimental results on publicly available image tampering datasets show that the proposed method outperforms the existing methods in terms of accuracy.

A two layer chaotic encryption scheme of secure image transmission for DCT precoded OFDM-VLC transmission

NASA Astrophysics Data System (ADS)

Wang, Zhongpeng; Chen, Fangni; Qiu, Weiwei; Chen, Shoufa; Ren, Dongxiao

2018-03-01

In this paper, a two-layer image encryption scheme for a discrete cosine transform (DCT) precoded orthogonal frequency division multiplexing (OFDM) visible light communication (VLC) system is proposed. Firstly, in the proposed scheme the transmitted image is first encrypted by a chaos scrambling sequence,which is generated from the hybrid 4-D hyper- and Arnold map in the upper-layer. After that, the encrypted image is converted into digital QAM modulation signal, which is re-encrypted by chaos scrambling sequence based on Arnold map in physical layer to further enhance the security of the transmitted image. Moreover, DCT precoding is employed to improve BER performance of the proposed system and reduce the PAPR of OFDM signal. The BER and PAPR performances of the proposed system are evaluated by simulation experiments. The experiment results show that the proposed two-layer chaos scrambling schemes achieve image secure transmission for image-based OFDM VLC. Furthermore, DCT precoding can reduce the PAPR and improve the BER performance of OFDM-based VLC.

The importance of robust error control in data compression applications

NASA Technical Reports Server (NTRS)

Woolley, S. I.

1993-01-01

Data compression has become an increasingly popular option as advances in information technology have placed further demands on data storage capabilities. With compression ratios as high as 100:1 the benefits are clear; however, the inherent intolerance of many compression formats to error events should be given careful consideration. If we consider that efficiently compressed data will ideally contain no redundancy, then the introduction of a channel error must result in a change of understanding from that of the original source. While the prefix property of codes such as Huffman enables resynchronisation, this is not sufficient to arrest propagating errors in an adaptive environment. Arithmetic, Lempel-Ziv, discrete cosine transform (DCT) and fractal methods are similarly prone to error propagating behaviors. It is, therefore, essential that compression implementations provide sufficient combatant error control in order to maintain data integrity. Ideally, this control should be derived from a full understanding of the prevailing error mechanisms and their interaction with both the system configuration and the compression schemes in use.

Method, system and computer-readable media for measuring impedance of an energy storage device

DOEpatents

Morrison, John L.; Morrison, William H.; Christophersen, Jon P.; Motloch, Chester G.

2016-01-26

Real-time battery impedance spectrum is acquired using a one-time record. Fast Summation Transformation (FST) is a parallel method of acquiring a real-time battery impedance spectrum using a one-time record that enables battery diagnostics. An excitation current to a battery is a sum of equal amplitude sine waves of frequencies that are octave harmonics spread over a range of interest. A sample frequency is also octave and harmonically related to all frequencies in the sum. A time profile of this sampled signal has a duration that is a few periods of the lowest frequency. A voltage response of the battery, average deleted, is an impedance of the battery in a time domain. Since the excitation frequencies are known and octave and harmonically related, a simple algorithm, FST, processes the time profile by rectifying relative to sine and cosine of each frequency. Another algorithm yields real and imaginary components for each frequency.

Generalized spherical and simplicial coordinates

NASA Astrophysics Data System (ADS)

Richter, Wolf-Dieter

2007-12-01

Elementary trigonometric quantities are defined in l2,p analogously to that in l2,2, the sine and cosine functions are generalized for each p>0 as functions sinp and cosp such that they satisfy the basic equation cosp([phi])p+sinp([phi])p=1. The p-generalized radius coordinate of a point [xi][set membership, variant]Rn is defined for each p>0 as . On combining these quantities, ln,p-spherical coordinates are defined. It is shown that these coordinates are nearly related to ln,p-simplicial coordinates. The Jacobians of these generalized coordinate transformations are derived. Applications and interpretations from analysis deal especially with the definition of a generalized surface content on ln,p-spheres which is nearly related to a modified co-area formula and an extension of Cavalieri's and Torricelli's indivisibeln method, and with differential equations. Applications from probability theory deal especially with a geometric interpretation of the uniform probability distribution on the ln,p-sphere and with the derivation of certain generalized statistical distributions.

Securing image information using double random phase encoding and parallel compressive sensing with updated sampling processes

NASA Astrophysics Data System (ADS)

Hu, Guiqiang; Xiao, Di; Wang, Yong; Xiang, Tao; Zhou, Qing

2017-11-01

Recently, a new kind of image encryption approach using compressive sensing (CS) and double random phase encoding has received much attention due to the advantages such as compressibility and robustness. However, this approach is found to be vulnerable to chosen plaintext attack (CPA) if the CS measurement matrix is re-used. Therefore, designing an efficient measurement matrix updating mechanism that ensures resistance to CPA is of practical significance. In this paper, we provide a novel solution to update the CS measurement matrix by altering the secret sparse basis with the help of counter mode operation. Particularly, the secret sparse basis is implemented by a reality-preserving fractional cosine transform matrix. Compared with the conventional CS-based cryptosystem that totally generates all the random entries of measurement matrix, our scheme owns efficiency superiority while guaranteeing resistance to CPA. Experimental and analysis results show that the proposed scheme has a good security performance and has robustness against noise and occlusion.

A Fast and Robust Beamspace Adaptive Beamformer for Medical Ultrasound Imaging.

PubMed

Mohades Deylami, Ali; Mohammadzadeh Asl, Babak

2017-06-01

Minimum variance beamformer (MVB) increases the resolution and contrast of medical ultrasound imaging compared with nonadaptive beamformers. These advantages come at the expense of high computational complexity that prevents this adaptive beamformer to be applied in a real-time imaging system. A new beamspace (BS) based on discrete cosine transform is proposed in which the medical ultrasound signals can be represented with less dimensions compared with the standard BS. This is because of symmetric beampattern of the beams in the proposed BS compared with the asymmetric ones in the standard BS. This lets us decrease the dimensions of data to two, so a high complex algorithm, such as the MVB, can be applied faster in this BS. The results indicated that by keeping only two beams, the MVB in the proposed BS provides very similar resolution and also better contrast compared with the standard MVB (SMVB) with only 0.44% of needed flops. Also, this beamformer is more robust against sound speed estimation errors than the SMVB.

Normal compression wave scattering by a permeable crack in a fluid-saturated poroelastic solid

NASA Astrophysics Data System (ADS)

Song, Yongjia; Hu, Hengshan; Rudnicki, John W.

2017-04-01

A mathematical formulation is presented for the dynamic stress intensity factor (mode I) of a finite permeable crack subjected to a time-harmonic propagating longitudinal wave in an infinite poroelastic solid. In particular, the effect of the wave-induced fluid flow due to the presence of a liquid-saturated crack on the dynamic stress intensity factor is analyzed. Fourier sine and cosine integral transforms in conjunction with Helmholtz potential theory are used to formulate the mixed boundary-value problem as dual integral equations in the frequency domain. The dual integral equations are reduced to a Fredholm integral equation of the second kind. It is found that the stress intensity factor monotonically decreases with increasing frequency, decreasing the fastest when the crack width and the slow wave wavelength are of the same order. The characteristic frequency at which the stress intensity factor decays the fastest shifts to higher frequency values when the crack width decreases.

DCT-based iris recognition.

PubMed

Monro, Donald M; Rakshit, Soumyadip; Zhang, Dexin

2007-04-01

This paper presents a novel iris coding method based on differences of discrete cosine transform (DCT) coefficients of overlapped angular patches from normalized iris images. The feature extraction capabilities of the DCT are optimized on the two largest publicly available iris image data sets, 2,156 images of 308 eyes from the CASIA database and 2,955 images of 150 eyes from the Bath database. On this data, we achieve 100 percent Correct Recognition Rate (CRR) and perfect Receiver-Operating Characteristic (ROC) Curves with no registered false accepts or rejects. Individual feature bit and patch position parameters are optimized for matching through a product-of-sum approach to Hamming distance calculation. For verification, a variable threshold is applied to the distance metric and the False Acceptance Rate (FAR) and False Rejection Rate (FRR) are recorded. A new worst-case metric is proposed for predicting practical system performance in the absence of matching failures, and the worst case theoretical Equal Error Rate (EER) is predicted to be as low as 2.59 x 10(-4) on the available data sets.

Adaptive compressed sensing of remote-sensing imaging based on the sparsity prediction

NASA Astrophysics Data System (ADS)

Yang, Senlin; Li, Xilong; Chong, Xin

2017-10-01

The conventional compressive sensing works based on the non-adaptive linear projections, and the parameter of its measurement times is usually set empirically. As a result, the quality of image reconstruction is always affected. Firstly, the block-based compressed sensing (BCS) with conventional selection for compressive measurements was given. Then an estimation method for the sparsity of image was proposed based on the two dimensional discrete cosine transform (2D DCT). With an energy threshold given beforehand, the DCT coefficients were processed with both energy normalization and sorting in descending order, and the sparsity of the image can be achieved by the proportion of dominant coefficients. And finally, the simulation result shows that, the method can estimate the sparsity of image effectively, and provides an active basis for the selection of compressive observation times. The result also shows that, since the selection of observation times is based on the sparse degree estimated with the energy threshold provided, the proposed method can ensure the quality of image reconstruction.

DCT Trigger in a High-Resolution Test Platform for the Detection of Very Inclined Showers in Pierre Auger Surface Detectors

NASA Astrophysics Data System (ADS)

Szadkowski, Zbigniew; Wiedeński, Michał

2017-06-01

We present first results from a trigger based on the discrete cosine transform (DCT) operating in new front-end boards with a Cyclone V E field-programmable gate array (FPGA) deployed in seven test surface detectors in the Pierre Auger Test Array. The patterns of the ADC traces generated by very inclined showers (arriving at 70° to 90° from the vertical) were obtained from the Auger database and from the CORSIKA simulation package supported by the Auger OffLine event reconstruction platform that gives predicted digitized signal profiles. Simulations for many values of the initial cosmic ray angle of arrival, the shower initialization depth in the atmosphere, the type of particle, and its initial energy gave a boundary on the DCT coefficients used for the online pattern recognition in the FPGA. Preliminary results validated the approach used. We recorded several showers triggered by the DCT for 120 Msamples/s and 160 Msamples/s.

Combinational logic for generating gate drive signals for phase control rectifiers

NASA Technical Reports Server (NTRS)

Dolland, C. R.; Trimble, D. W. (Inventor)

1982-01-01

Control signals for phase-delay rectifiers, which require a variable firing angle that ranges from 0 deg to 180 deg, are derived from line-to-line 3-phase signals and both positive and negative firing angle control signals which are generated by comparing current command and actual current. Line-to-line phases are transformed into line-to-neutral phases and integrated to produce 90 deg phase delayed signals that are inverted to produce three cosine signals, such that for each its maximum occurs at the intersection of positive half cycles of the other two phases which are inputs to other inverters. At the same time, both positive and negative (inverted) phase sync signals are generated for each phase by comparing each with the next and producing a square wave when it is greater. Ramp, sync and firing angle controls signals are than used in combinational logic to generate the gate firing control signals SCR gate drives which fire SCR devices in a bridge circuit.

Mixed integer simulation optimization for optimal hydraulic fracturing and production of shale gas fields

NASA Astrophysics Data System (ADS)

Li, J. C.; Gong, B.; Wang, H. G.

2016-08-01

Optimal development of shale gas fields involves designing a most productive fracturing network for hydraulic stimulation processes and operating wells appropriately throughout the production time. A hydraulic fracturing network design-determining well placement, number of fracturing stages, and fracture lengths-is defined by specifying a set of integer ordered blocks to drill wells and create fractures in a discrete shale gas reservoir model. The well control variables such as bottom hole pressures or production rates for well operations are real valued. Shale gas development problems, therefore, can be mathematically formulated with mixed-integer optimization models. A shale gas reservoir simulator is used to evaluate the production performance for a hydraulic fracturing and well control plan. To find the optimal fracturing design and well operation is challenging because the problem is a mixed integer optimization problem and entails computationally expensive reservoir simulation. A dynamic simplex interpolation-based alternate subspace (DSIAS) search method is applied for mixed integer optimization problems associated with shale gas development projects. The optimization performance is demonstrated with the example case of the development of the Barnett Shale field. The optimization results of DSIAS are compared with those of a pattern search algorithm.

Interplay of Hofstadter and quantum Hall states in bilayer graphene

NASA Astrophysics Data System (ADS)

Spanton, Eric M.; Zibrov, Alexander A.; Zhou, Haoxin; Taniguchi, Takashi; Watanabe, Kenji; Young, Andrea

Electron interactions in ultraclean systems such as graphene lead to the fractional quantum Hall effect in an applied magnetic field. Long wavelength periodic potentials from a moiré pattern in aligned boron nitride-graphene heterostructures may compete with such interactions and favor spatially ordered states (e.g. Wigner crystals orcharge density waves). To investigate this competition, we studied the bulk phase diagram of asymmetrically moiré-coupled bilayer graphene via multi-terminal magnetocapacitance measurements at ultra-high magnetic fields. Two quantum numbers characterize energy gaps in this regime: t, which indexes the Bloch bands, and s, which indexes the Landau level. Similar to past experiments, we observe the conventional integer and fractional quantum Hall gaps (t = 0), integer Hofstadter gaps (integer s and integer t ≠ 0), and fractional Bloch states associated with an expanded superlattice unit cell (fractional s and integer t). Additionally, we find states with fractional values for both s and t. Measurement of the capacitance matrix shows that these states occur on the layer exposed to the strong periodic potential. We discuss the results in terms of possible fractional quantum hall states unique to periodically modulated systems.

A High-Performance Lossless Compression Scheme for EEG Signals Using Wavelet Transform and Neural Network Predictors

PubMed Central

Sriraam, N.

2012-01-01

Developments of new classes of efficient compression algorithms, software systems, and hardware for data intensive applications in today's digital health care systems provide timely and meaningful solutions in response to exponentially growing patient information data complexity and associated analysis requirements. Of the different 1D medical signals, electroencephalography (EEG) data is of great importance to the neurologist for detecting brain-related disorders. The volume of digitized EEG data generated and preserved for future reference exceeds the capacity of recent developments in digital storage and communication media and hence there is a need for an efficient compression system. This paper presents a new and efficient high performance lossless EEG compression using wavelet transform and neural network predictors. The coefficients generated from the EEG signal by integer wavelet transform are used to train the neural network predictors. The error residues are further encoded using a combinational entropy encoder, Lempel-Ziv-arithmetic encoder. Also a new context-based error modeling is also investigated to improve the compression efficiency. A compression ratio of 2.99 (with compression efficiency of 67%) is achieved with the proposed scheme with less encoding time thereby providing diagnostic reliability for lossless transmission as well as recovery of EEG signals for telemedicine applications. PMID:22489238

A high-performance lossless compression scheme for EEG signals using wavelet transform and neural network predictors.

PubMed

Sriraam, N

2012-01-01

Developments of new classes of efficient compression algorithms, software systems, and hardware for data intensive applications in today's digital health care systems provide timely and meaningful solutions in response to exponentially growing patient information data complexity and associated analysis requirements. Of the different 1D medical signals, electroencephalography (EEG) data is of great importance to the neurologist for detecting brain-related disorders. The volume of digitized EEG data generated and preserved for future reference exceeds the capacity of recent developments in digital storage and communication media and hence there is a need for an efficient compression system. This paper presents a new and efficient high performance lossless EEG compression using wavelet transform and neural network predictors. The coefficients generated from the EEG signal by integer wavelet transform are used to train the neural network predictors. The error residues are further encoded using a combinational entropy encoder, Lempel-Ziv-arithmetic encoder. Also a new context-based error modeling is also investigated to improve the compression efficiency. A compression ratio of 2.99 (with compression efficiency of 67%) is achieved with the proposed scheme with less encoding time thereby providing diagnostic reliability for lossless transmission as well as recovery of EEG signals for telemedicine applications.

Wavelet library for constrained devices

NASA Astrophysics Data System (ADS)

Ehlers, Johan Hendrik; Jassim, Sabah A.

2007-04-01

The wavelet transform is a powerful tool for image and video processing, useful in a range of applications. This paper is concerned with the efficiency of a certain fast-wavelet-transform (FWT) implementation and several wavelet filters, more suitable for constrained devices. Such constraints are typically found on mobile (cell) phones or personal digital assistants (PDA). These constraints can be a combination of; limited memory, slow floating point operations (compared to integer operations, most often as a result of no hardware support) and limited local storage. Yet these devices are burdened with demanding tasks such as processing a live video or audio signal through on-board capturing sensors. In this paper we present a new wavelet software library, HeatWave, that can be used efficiently for image/video processing/analysis tasks on mobile phones and PDA's. We will demonstrate that HeatWave is suitable for realtime applications with fine control and range to suit transform demands. We shall present experimental results to substantiate these claims. Finally this library is intended to be of real use and applied, hence we considered several well known and common embedded operating system platform differences; such as a lack of common routines or functions, stack limitations, etc. This makes HeatWave suitable for a range of applications and research projects.

Interpolation by fast Wigner transform for rapid calculations of magnetic resonance spectra from powders.

PubMed

Stevensson, Baltzar; Edén, Mattias

2011-03-28

We introduce a novel interpolation strategy, based on nonequispaced fast transforms involving spherical harmonics or Wigner functions, for efficient calculations of powder spectra in (nuclear) magnetic resonance spectroscopy. The fast Wigner transform (FWT) interpolation operates by minimizing the time-consuming calculation stages, by sampling over a small number of Gaussian spherical quadrature (GSQ) orientations that are exploited to determine the spectral frequencies and amplitudes from a 10-70 times larger GSQ set. This results in almost the same orientational averaging accuracy as if the expanded grid was utilized explicitly in an order of magnitude slower computation. FWT interpolation is applicable to spectral simulations involving any time-independent or time-dependent and noncommuting spin Hamiltonian. We further show that the merging of FWT interpolation with the well-established ASG procedure of Alderman, Solum and Grant [J. Chem. Phys. 134, 3717 (1986)] speeds up simulations by 2-7 times relative to using ASG alone (besides greatly extending its scope of application), and between 1-2 orders of magnitude compared to direct orientational averaging in the absence of interpolation. Demonstrations of efficient spectral simulations are given for several magic-angle spinning scenarios in NMR, encompassing half-integer quadrupolar spins and homonuclear dipolar-coupled (13)C systems.

Map-invariant spectral analysis for the identification of DNA periodicities

PubMed Central

2012-01-01

Many signal processing based methods for finding hidden periodicities in DNA sequences have primarily focused on assigning numerical values to the symbolic DNA sequence and then applying spectral analysis tools such as the short-time discrete Fourier transform (ST-DFT) to locate these repeats. The key results pertaining to this approach are however obtained using a very specific symbolic to numerical map, namely the so-called Voss representation. An important research problem is to therefore quantify the sensitivity of these results to the choice of the symbolic to numerical map. In this article, a novel algebraic approach to the periodicity detection problem is presented and provides a natural framework for studying the role of the symbolic to numerical map in finding these repeats. More specifically, we derive a new matrix-based expression of the DNA spectrum that comprises most of the widely used mappings in the literature as special cases, shows that the DNA spectrum is in fact invariable under all these mappings, and generates a necessary and sufficient condition for the invariance of the DNA spectrum to the symbolic to numerical map. Furthermore, the new algebraic framework decomposes the periodicity detection problem into several fundamental building blocks that are totally independent of each other. Sophisticated digital filters and/or alternate fast data transforms such as the discrete cosine and sine transforms can therefore be always incorporated in the periodicity detection scheme regardless of the choice of the symbolic to numerical map. Although the newly proposed framework is matrix based, identification of these periodicities can be achieved at a low computational cost. PMID:23067324

Army Illumination Model v2 User’s Manual

DTIC Science & Technology

2011-09-01

Fraction of city luminosity escaping above the horizontal from lamp fixtures 10–15% suggested month4 integer Month of year 2 digits day4 integer Day...of month 2 digits yr4 integer Year 4 digits utc4 real UTC time of observer Equivalent to Zulu or GMT 4 Table 1. AIM input values, their...from 0.10 to 0.15. 2.1.4 Record 4 2.1.4.1 Date and Time The month (1–12), day (1–31), 4- digit year and coordinated universal time (UTC) for the

Modelling with Integer Variables.

DTIC Science & Technology

1984-01-01

Computational Comparison of * ’Equivalent’ Mixed Integer Formulations," Naval Research Logistics Quarterly 28 (1981), pp. 115- 131 . 39. R. R, Meyer and...jE(i) 3 K ".- .e I " Z A . .,.. x jCI (i) IJ ~s ;:. ... i=I 1 1X. integer A- k . . . . . . . . . . . ... . ... . . . . . . . . . o...be such that Z X.. = 1 andIfxCi’e k jcI (i) 11 13 kx m). *x + E okv . Then by putting Xil and X.=O for j* i, j£I(i) kE (2.3.4) holds. Hence S’ Pi" As

Aerospace Applications of Integer and Combinatorial Optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem, for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Aerospace applications on integer and combinatorial optimization

NASA Technical Reports Server (NTRS)

Padula, S. L.; Kincaid, R. K.

1995-01-01

Research supported by NASA Langley Research Center includes many applications of aerospace design optimization and is conducted by teams of applied mathematicians and aerospace engineers. This paper investigates the benefits from this combined expertise in formulating and solving integer and combinatorial optimization problems. Applications range from the design of large space antennas to interior noise control. A typical problem. for example, seeks the optimal locations for vibration-damping devices on an orbiting platform and is expressed as a mixed/integer linear programming problem with more than 1500 design variables.

Radial Instabilities of a Pulsating Air Bubble in Water

DTIC Science & Technology

1990-01-30

ERASEDISPLAY GOTO 100 ELSE C CALL ERASEDISPLAY CALL EXIr ENDIF END I 1 257 3 PRCA PM SHAPE VIRTUAL DRIVE(16384) WAVE1 (16384) , WAVE2 (16L8 4 ’ ,DC(16384)3...INTEGER DRIVE, WAVE1, WAVE2 , DC INTEGER ROW, COL, NCHAR, I, OSCADR, GENADR, INFO (50) , MAXVAL, MAXV INTEGER KOUNT REAL GEN, ATEMP, WTEMP, WATT, FREQ...IREC=1 26D CALL GETWAV (1, DC, OSCADR, I REC) CALL GETWAV (2, DRIVE, OSCADR, IREC) CALL GETWAV (3, WAVE1, OSCADR, IREC) CALL GETWAV (4, WAVE2 ,OSCADR

Singularity-free extraction of a quaternion from a direction-cosine matrix. [for spacecraft control and guidance

NASA Technical Reports Server (NTRS)

Klumpp, A. R.

1976-01-01

A computer algorithm for extracting a quaternion from a direction-cosine matrix (DCM) is described. The quaternion provides a four-parameter representation of rotation, as against the nine-parameter representation afforded by a DCM. Commanded attitude in space shuttle steering is conveniently computed by DCM, while actual attitude is computed most compactly as a quaternion, as is attitude error. The unit length of the rotation quaternion, and interchangeable of a quaternion and its negative, are used to advantage in the extraction algorithm. Protection of the algorithm against square root failure and division overflow are considered. Necessary and sufficient conditions for handling the rotation vector element of largest magnitude are discussed

Site selection and directional models of deserts used for ERBE validation targets

NASA Technical Reports Server (NTRS)

Staylor, W. F.

1986-01-01

Broadband shortwave and longwave radiance measurements obtained from the Nimbus 7 Earth Radiation Budget scanner were used to develop reflectance and emittance models for the Sahara, Gibson, and Saudi Deserts. These deserts will serve as in-flight validation targets for the Earth Radiation Budget Experiment being flown on the Earth Radiation Budget Satellite and two National Oceanic and Atmospheric Administration polar satellites. The directional reflectance model derived for the deserts was a function of the sum and product of the cosines of the solar and viewing zenith angles, and thus reciprocity existed between these zenith angles. The emittance model was related by a power law of the cosine of the viewing zenith angle.

Scaling behaviour of Fisher and Shannon entropies for the exponential-cosine screened coulomb potential

NASA Astrophysics Data System (ADS)

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.

Anisotropy model for modern grain oriented electrical steel based on orientation distribution function

NASA Astrophysics Data System (ADS)

Jiang, Fan; Rossi, Mathieu; Parent, Guillaume

2018-05-01

Accurately modeling the anisotropic behavior of electrical steel is mandatory in order to perform good end simulations. Several approaches can be found in the literature for that purpose but the more often those methods are not able to deal with grain oriented electrical steel. In this paper, a method based on orientation distribution function is applied to modern grain oriented laminations. In particular, two solutions are proposed in order to increase the results accuracy. The first one consists in increasing the decomposition number of the cosine series on which the method is based. The second one consists in modifying the determination method of the terms belonging to this cosine series.

Statistical analysis of the limitation of half integer resonances on the available momentum acceptance of the High Energy Photon Source

NASA Astrophysics Data System (ADS)

Jiao, Yi; Duan, Zhe

2017-01-01

In a diffraction-limited storage ring, half integer resonances can have strong effects on the beam dynamics, associated with the large detuning terms from the strong focusing and strong sextupoles as required for an ultralow emittance. In this study, the limitation of half integer resonances on the available momentum acceptance (MA) was statistically analyzed based on one design of the High Energy Photon Source (HEPS). It was found that the probability of MA reduction due to crossing of half integer resonances is closely correlated with the level of beta beats at the nominal tunes, but independent of the error sources. The analysis indicated that for the presented HEPS lattice design, the rms amplitude of beta beats should be kept below 1.5% horizontally and 2.5% vertically to reach a small MA reduction probability of about 1%.

Fabry-Perot Interferometry in the Integer and Fractional Quantum Hall Regimes

NASA Astrophysics Data System (ADS)

McClure, Douglas; Chang, Willy; Kou, Angela; Marcus, Charles; Pfeiffer, Loren; West, Ken

2011-03-01

We present measurements of electronic Fabry-Perot interferometers in the integer and fractional quantum Hall regimes. Two classes of resistance oscillations may be seen as a function of magnetic field and gate voltage, as we have previously reported. In small interferometers in the integer regime, oscillations of the type associated with Coulomb interaction are ubiquitous, while those consistent with single-particle Aharonov-Bohm interference are seen to co-exist in some configurations. The amplitude scaling of both types with temperature and device size is consistent with a theoretical model. Oscillations are further observed in the fractional quantum Hall regime. Here the dependence of the period on the filling factors in the constrictions and bulk of the interferometer can shed light on the effective charge of the interfering quasiparticles, but care is needed to distinguish these oscillations from those associated with integer quantum Hall states. We acknowledge funding from Microsoft Project Q and IBM.

Numerical bias in bounded and unbounded number line tasks.

PubMed

Cohen, Dale J; Blanc-Goldhammer, Daryn

2011-04-01

The number line task is often used to assess children's and adults' underlying representations of integers. Traditional bounded number line tasks, however, have limitations that can lead to misinterpretation. Here we present a new task, an unbounded number line task, that overcomes these limitations. In Experiment 1, we show that adults use a biased proportion estimation strategy to complete the traditional bounded number line task. In Experiment 2, we show that adults use a dead-reckoning integer estimation strategy in our unbounded number line task. Participants revealed a positively accelerating numerical bias in both tasks, but showed scalar variance only in the unbounded number line task. We conclude that the unbounded number line task is a more pure measure of integer representation than the bounded number line task, and using these results, we present a preliminary description of adults' underlying representation of integers.

Engineering calculations for communications satellite systems planning

NASA Technical Reports Server (NTRS)

Reilly, C. H.; Levis, C. A.; Mount-Campbell, C.; Gonsalvez, D. J.; Wang, C. W.; Yamamura, Y.

1985-01-01

Computer-based techniques for optimizing communications-satellite orbit and frequency assignments are discussed. A gradient-search code was tested against a BSS scenario derived from the RARC-83 data. Improvement was obtained, but each iteration requires about 50 minutes of IBM-3081 CPU time. Gradient-search experiments on a small FSS test problem, consisting of a single service area served by 8 satellites, showed quickest convergence when the satellites were all initially placed near the center of the available orbital arc with moderate spacing. A transformation technique is proposed for investigating the surface topography of the objective function used in the gradient-search method. A new synthesis approach is based on transforming single-entry interference constraints into corresponding constraints on satellite spacings. These constraints are used with linear objective functions to formulate the co-channel orbital assignment task as a linear-programming (LP) problem or mixed integer programming (MIP) problem. Globally optimal solutions are always found with the MIP problems, but not necessarily with the LP problems. The MIP solutions can be used to evaluate the quality of the LP solutions. The initial results are very encouraging.

A symmetrical image encryption scheme in wavelet and time domain

NASA Astrophysics Data System (ADS)

Luo, Yuling; Du, Minghui; Liu, Junxiu

2015-02-01

There has been an increasing concern for effective storages and secure transactions of multimedia information over the Internet. Then a great variety of encryption schemes have been proposed to ensure the information security while transmitting, but most of current approaches are designed to diffuse the data only in spatial domain which result in reducing storage efficiency. A lightweight image encryption strategy based on chaos is proposed in this paper. The encryption process is designed in transform domain. The original image is decomposed into approximation and detail components using integer wavelet transform (IWT); then as the more important component of the image, the approximation coefficients are diffused by secret keys generated from a spatiotemporal chaotic system followed by inverse IWT to construct the diffused image; finally a plain permutation is performed for diffusion image by the Logistic mapping in order to reduce the correlation between adjacent pixels further. Experimental results and performance analysis demonstrate the proposed scheme is an efficient, secure and robust encryption mechanism and it realizes effective coding compression to satisfy desirable storage.

A Graph Theory Practice on Transformed Image: A Random Image Steganography

PubMed Central

Thanikaiselvan, V.; Arulmozhivarman, P.; Subashanthini, S.; Amirtharajan, Rengarajan

2013-01-01

Modern day information age is enriched with the advanced network communication expertise but unfortunately at the same time encounters infinite security issues when dealing with secret and/or private information. The storage and transmission of the secret information become highly essential and have led to a deluge of research in this field. In this paper, an optimistic effort has been taken to combine graceful graph along with integer wavelet transform (IWT) to implement random image steganography for secure communication. The implementation part begins with the conversion of cover image into wavelet coefficients through IWT and is followed by embedding secret image in the randomly selected coefficients through graph theory. Finally stegoimage is obtained by applying inverse IWT. This method provides a maximum of 44 dB peak signal to noise ratio (PSNR) for 266646 bits. Thus, the proposed method gives high imperceptibility through high PSNR value and high embedding capacity in the cover image due to adaptive embedding scheme and high robustness against blind attack through graph theoretic random selection of coefficients. PMID:24453857

Two-body potential model based on cosine series expansion for ionic materials

DOE PAGES

Oda, Takuji; Weber, William J.; Tanigawa, Hisashi

2015-09-23

There is a method to construct a two-body potential model for ionic materials with a Fourier series basis and we examine it. For this method, the coefficients of cosine basis functions are uniquely determined by solving simultaneous linear equations to minimize the sum of weighted mean square errors in energy, force and stress, where first-principles calculation results are used as the reference data. As a validation test of the method, potential models for magnesium oxide are constructed. The mean square errors appropriately converge with respect to the truncation of the cosine series. This result mathematically indicates that the constructed potentialmore » model is sufficiently close to the one that is achieved with the non-truncated Fourier series and demonstrates that this potential virtually provides minimum error from the reference data within the two-body representation. The constructed potential models work appropriately in both molecular statics and dynamics simulations, especially if a two-step correction to revise errors expected in the reference data is performed, and the models clearly outperform two existing Buckingham potential models that were tested. Moreover, the good agreement over a broad range of energies and forces with first-principles calculations should enable the prediction of materials behavior away from equilibrium conditions, such as a system under irradiation.« less

Summing up the Euler [phi] Function

ERIC Educational Resources Information Center

Loomis, Paul; Plytage, Michael; Polhill, John

2008-01-01

The Euler [phi] function counts the number of positive integers less than and relatively prime to a positive integer n. Here we look at perfect totient numbers, number for which [phi](n) + [phi]([phi](n)) + [phi]([phi]([phi](n))) + ... + 1 = n.

Computer Corner: Spreadsheets, Power Series, Generating Functions, and Integers.

ERIC Educational Resources Information Center

Snow, Donald R.

1989-01-01

Implements a table algorithm on a spreadsheet program and obtains functions for several number sequences such as the Fibonacci and Catalan numbers. Considers other applications of the table algorithm to integers represented in various number bases. (YP)

Finding local genome rearrangements.

PubMed

Simonaitis, Pijus; Swenson, Krister M

2018-01-01

The double cut and join (DCJ) model of genome rearrangement is well studied due to its mathematical simplicity and power to account for the many events that transform gene order. These studies have mostly been devoted to the understanding of minimum length scenarios transforming one genome into another. In this paper we search instead for rearrangement scenarios that minimize the number of rearrangements whose breakpoints are unlikely due to some biological criteria. One such criterion has recently become accessible due to the advent of the Hi-C experiment, facilitating the study of 3D spacial distance between breakpoint regions. We establish a link between the minimum number of unlikely rearrangements required by a scenario and the problem of finding a maximum edge-disjoint cycle packing on a certain transformed version of the adjacency graph. This link leads to a 3/2-approximation as well as an exact integer linear programming formulation for our problem, which we prove to be NP-complete. We also present experimental results on fruit flies, showing that Hi-C data is informative when used as a criterion for rearrangements. A new variant of the weighted DCJ distance problem is addressed that ignores scenario length in its objective function. A solution to this problem provides a lower bound on the number of unlikely moves necessary when transforming one gene order into another. This lower bound aids in the study of rearrangement scenarios with respect to chromatin structure, and could eventually be used in the design of a fixed parameter algorithm with a more general objective function.

Connecting complexity with spectral entropy using the Laplace transformed solution to the fractional diffusion equation

NASA Astrophysics Data System (ADS)

Liang, Yingjie; Chen, Wen; Magin, Richard L.

2016-07-01

Analytical solutions to the fractional diffusion equation are often obtained by using Laplace and Fourier transforms, which conveniently encode the order of the time and the space derivatives (α and β) as non-integer powers of the conjugate transform variables (s, and k) for the spectral and the spatial frequencies, respectively. This study presents a new solution to the fractional diffusion equation obtained using the Laplace transform and expressed as a Fox's H-function. This result clearly illustrates the kinetics of the underlying stochastic process in terms of the Laplace spectral frequency and entropy. The spectral entropy is numerically calculated by using the direct integration method and the adaptive Gauss-Kronrod quadrature algorithm. Here, the properties of spectral entropy are investigated for the cases of sub-diffusion and super-diffusion. We find that the overall spectral entropy decreases with the increasing α and β, and that the normal or Gaussian case with α = 1 and β = 2, has the lowest spectral entropy (i.e., less information is needed to describe the state of a Gaussian process). In addition, as the neighborhood over which the entropy is calculated increases, the spectral entropy decreases, which implies a spatial averaging or coarse graining of the material properties. Consequently, the spectral entropy is shown to provide a new way to characterize the temporal correlation of anomalous diffusion. Future studies should be designed to examine changes of spectral entropy in physical, chemical and biological systems undergoing phase changes, chemical reactions and tissue regeneration.

A Robust Wrap Reduction Algorithm for Fringe Projection Profilometry and Applications in Magnetic Resonance Imaging.

PubMed

Arevalillo-Herraez, Miguel; Cobos, Maximo; Garcia-Pineda, Miguel

2017-03-01

In this paper, we present an effective algorithm to reduce the number of wraps in a 2D phase signal provided as input. The technique is based on an accurate estimate of the fundamental frequency of a 2D complex signal with the phase given by the input, and the removal of a dependent additive term from the phase map. Unlike existing methods based on the discrete Fourier transform (DFT), the frequency is computed by using noise-robust estimates that are not restricted to integer values. Then, to deal with the problem of a non-integer shift in the frequency domain, an equivalent operation is carried out on the original phase signal. This consists of the subtraction of a tilted plane whose slope is computed from the frequency, followed by a re-wrapping operation. The technique has been exhaustively tested on fringe projection profilometry (FPP) and magnetic resonance imaging (MRI) signals. In addition, the performance of several frequency estimation methods has been compared. The proposed methodology is particularly effective on FPP signals, showing a higher performance than the state-of-the-art wrap reduction approaches. In this context, it contributes to canceling the carrier effect at the same time as it eliminates any potential slope that affects the entire signal. Its effectiveness on other carrier-free phase signals, e.g., MRI, is limited to the case that inherent slopes are present in the phase data.

On the estimability of parameters in undifferenced, uncombined GNSS network and PPP-RTK user models by means of $mathcal {S}$ S -system theory

NASA Astrophysics Data System (ADS)

Odijk, Dennis; Zhang, Baocheng; Khodabandeh, Amir; Odolinski, Robert; Teunissen, Peter J. G.

2016-01-01

The concept of integer ambiguity resolution-enabled Precise Point Positioning (PPP-RTK) relies on appropriate network information for the parameters that are common between the single-receiver user that applies and the network that provides this information. Most of the current methods for PPP-RTK are based on forming the ionosphere-free combination using dual-frequency Global Navigation Satellite System (GNSS) observations. These methods are therefore restrictive in the light of the development of new multi-frequency GNSS constellations, as well as from the point of view that the PPP-RTK user requires ionospheric corrections to obtain integer ambiguity resolution results based on short observation time spans. The method for PPP-RTK that is presented in this article does not have above limitations as it is based on the undifferenced, uncombined GNSS observation equations, thereby keeping all parameters in the model. Working with the undifferenced observation equations implies that the models are rank-deficient; not all parameters are unbiasedly estimable, but only combinations of them. By application of S-system theory the model is made of full rank by constraining a minimum set of parameters, or S-basis. The choice of this S-basis determines the estimability and the interpretation of the parameters that are transmitted to the PPP-RTK users. As this choice is not unique, one has to be very careful when comparing network solutions in different S-systems; in that case the S-transformation, which is provided by the S-system method, should be used to make the comparison. Knowing the estimability and interpretation of the parameters estimated by the network is shown to be crucial for a correct interpretation of the estimable PPP-RTK user parameters, among others the essential ambiguity parameters, which have the integer property which is clearly following from the interpretation of satellite phase biases from the network. The flexibility of the S-system method is furthermore demonstrated by the fact that all models in this article are derived in multi-epoch mode, allowing to incorporate dynamic model constraints on all or subsets of parameters.

Unimodular lattices in dimensions 14 and 15 over the Eisenstein integers

NASA Astrophysics Data System (ADS)

Abdukhalikov, Kanat; Scharlau, Rudolf

2009-03-01

All indecomposable unimodular hermitian lattices in dimensions 14 and 15 over the ring of integers in mathbb{Q}(sqrt{-3}) are determined. Precisely one lattice in dimension 14 and two lattices in dimension 15 have minimal norm 3.

Sylow p-groups of polynomial permutations on the integers mod pn☆

PubMed Central

Frisch, Sophie; Krenn, Daniel

2013-01-01

We enumerate and describe the Sylow p-groups of the groups of polynomial permutations of the integers mod pn for n⩾1 and of the pro-finite group which is the projective limit of these groups. PMID:26869732

Inductance Calculations of Variable Pitch Helical Inductors

DTIC Science & Technology

2015-08-01

8217 ’ Integral solution using Simpson’s Rule ’ Dim i As Integer Dim Pi As Double, uo As Double, kc As Double Dim a As Double, amax As Double, da As...Double Dim steps As Integer Dim func1a As Double, func1b As Double ’ On Error GoTo err_TorisV1 steps = 1000 Pi = 3.14159 uo = 4 * Pi * 0.0000001...As Double ’ ’ Integral solution using Simpson’s Rule ’ Dim i As Integer Dim Pi As Double, uo As Double, kc As Double Dim a As Double, amax As

Effects of Unsaturated Zones on Baseflow Recession: Analytical Solution and Application

NASA Astrophysics Data System (ADS)

Zhan, H.; Liang, X.; Zhang, Y. K.

2017-12-01

Unsaturated flow is an important process in baseflow recessions and its effect is rarely investigated. A mathematical model for a coupled unsaturated-saturated flow in a horizontally unconfined aquifer with time-dependent infiltrations is presented. Semi-analytical solutions for hydraulic heads and discharges are derived using Laplace transform and Cosine transform. The solutions are compared with solutions of the linearized Boussinesq equation (LB solution) and the linearized Laplace equation (LL solution), respectively. The result indicates that a larger dimensionless constitutive exponent κD of the unsaturated zone leads to a smaller discharge during the infiltration period and a larger discharge after the infiltration. The lateral discharge of the unsaturated zone is significant when κD≤1, and becomes negligible when κD≥100. For late times, the power index b of the recession curve-dQ/dt aQb, is 1 and independent of κD, where Q is the baseflow and a is a constant lumped aquifer parameter. For early times, b is approximately equal to 3 but it approaches infinity when t→1. The present solution is applied to synthetic and field cases. The present solution matched the synthetic data better than both the LL and LB solutions, with a minimum relative error of 16% for estimate of hydraulic conductivity. The present solution was applied to the observed streamflow discharge in Iowa, and the estimated values of the aquifer parameters were reasonable.

Enhancement of Satellite Image Compression Using a Hybrid (DWT-DCT) Algorithm

NASA Astrophysics Data System (ADS)

Shihab, Halah Saadoon; Shafie, Suhaidi; Ramli, Abdul Rahman; Ahmad, Fauzan

2017-12-01

Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) image compression techniques have been utilized in most of the earth observation satellites launched during the last few decades. However, these techniques have some issues that should be addressed. The DWT method has proven to be more efficient than DCT for several reasons. Nevertheless, the DCT can be exploited to improve the high-resolution satellite image compression when combined with the DWT technique. Hence, a proposed hybrid (DWT-DCT) method was developed and implemented in the current work, simulating an image compression system on-board on a small remote sensing satellite, with the aim of achieving a higher compression ratio to decrease the onboard data storage and the downlink bandwidth, while avoiding further complex levels of DWT. This method also succeeded in maintaining the reconstructed satellite image quality through replacing the standard forward DWT thresholding and quantization processes with an alternative process that employed the zero-padding technique, which also helped to reduce the processing time of DWT compression. The DCT, DWT and the proposed hybrid methods were implemented individually, for comparison, on three LANDSAT 8 images, using the MATLAB software package. A comparison was also made between the proposed method and three other previously published hybrid methods. The evaluation of all the objective and subjective results indicated the feasibility of using the proposed hybrid (DWT-DCT) method to enhance the image compression process on-board satellites.

Multispectral code excited linear prediction coding and its application in magnetic resonance images.

PubMed

Hu, J H; Wang, Y; Cahill, P T

1997-01-01

This paper reports a multispectral code excited linear prediction (MCELP) method for the compression of multispectral images. Different linear prediction models and adaptation schemes have been compared. The method that uses a forward adaptive autoregressive (AR) model has been proven to achieve a good compromise between performance, complexity, and robustness. This approach is referred to as the MFCELP method. Given a set of multispectral images, the linear predictive coefficients are updated over nonoverlapping three-dimensional (3-D) macroblocks. Each macroblock is further divided into several 3-D micro-blocks, and the best excitation signal for each microblock is determined through an analysis-by-synthesis procedure. The MFCELP method has been applied to multispectral magnetic resonance (MR) images. To satisfy the high quality requirement for medical images, the error between the original image set and the synthesized one is further specified using a vector quantizer. This method has been applied to images from 26 clinical MR neuro studies (20 slices/study, three spectral bands/slice, 256x256 pixels/band, 12 b/pixel). The MFCELP method provides a significant visual improvement over the discrete cosine transform (DCT) based Joint Photographers Expert Group (JPEG) method, the wavelet transform based embedded zero-tree wavelet (EZW) coding method, and the vector tree (VT) coding method, as well as the multispectral segmented autoregressive moving average (MSARMA) method we developed previously.

Generalized Fractional Derivative Anisotropic Viscoelastic Characterization.

PubMed

Hilton, Harry H

2012-01-18

Isotropic linear and nonlinear fractional derivative constitutive relations are formulated and examined in terms of many parameter generalized Kelvin models and are analytically extended to cover general anisotropic homogeneous or non-homogeneous as well as functionally graded viscoelastic material behavior. Equivalent integral constitutive relations, which are computationally more powerful, are derived from fractional differential ones and the associated anisotropic temperature-moisture-degree-of-cure shift functions and reduced times are established. Approximate Fourier transform inversions for fractional derivative relations are formulated and their accuracy is evaluated. The efficacy of integer and fractional derivative constitutive relations is compared and the preferential use of either characterization in analyzing isotropic and anisotropic real materials must be examined on a case-by-case basis. Approximate protocols for curve fitting analytical fractional derivative results to experimental data are formulated and evaluated.

Exact traveling wave solutions of fractional order Boussinesq-like equations by applying Exp-function method

NASA Astrophysics Data System (ADS)

Rahmatullah; Ellahi, Rahmat; Mohyud-Din, Syed Tauseef; Khan, Umar

2018-03-01

We have computed new exact traveling wave solutions, including complex solutions of fractional order Boussinesq-Like equations, occurring in physical sciences and engineering, by applying Exp-function method. The method is blended with fractional complex transformation and modified Riemann-Liouville fractional order operator. Our obtained solutions are verified by substituting back into their corresponding equations. To the best of our knowledge, no other technique has been reported to cope with the said fractional order nonlinear problems combined with variety of exact solutions. Graphically, fractional order solution curves are shown to be strongly related to each other and most importantly, tend to fixate on their integer order solution curve. Our solutions comprise high frequencies and very small amplitude of the wave responses.

Fermat's Last Theorem for Factional and Irrational Exponents

ERIC Educational Resources Information Center

Morgan, Frank

2010-01-01

Fermat's Last Theorem says that for integers n greater than 2, there are no solutions to x[superscript n] + y[superscript n] = z[superscript n] among positive integers. What about rational exponents? Irrational n? Negative n? See what an undergraduate senior seminar discovered.

A compact spin-exchange optical pumping system for 3He polarization based on a solenoid coil, a VBG laser diode, and a cosine theta RF coil

NASA Astrophysics Data System (ADS)

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.

On the Symmetry of Molecular Flows Through the Pipe of an Arbitrary Shape (I) Diffusive Reflection

NASA Astrophysics Data System (ADS)

Kusumoto, Yoshiro

Molecular gas flows through the pipe of an arbitrary shape is mathematically considered based on a diffusive reflection model. To avoid a perpetual motion, the magnitude of the molecular flow rate must remain invariant under the exchange of inlet and outlet pressures. For this flow symmetry, the cosine law reflection at the pipe wall was found to be sufficient and necessary, on the assumption that the molecular flux is conserved in a collision with the wall. It was also shown that a spontaneous flow occurs in a hemispherical apparatus, if the reflection obeys the n-th power of cosine law with n other than unity. This apparatus could work as a molecular pump with no moving parts.

Resonant circuit which provides dual frequency excitation for rapid cycling of an electromagnet

DOEpatents

Praeg, Walter F.

1984-01-01

Disclosed is a ring magnet control circuit that permits synchrotron repetition rates much higher than the frequency of the cosinusoidal guide field of the ring magnet during particle acceleration. the control circuit generates cosinusoidal excitation currents of different frequencies in the half waves. During radio frequency acceleration of the particles in the synchrotron, the control circuit operates with a lower frequency cosine wave and thereafter the electromagnets are reset with a higher frequency half cosine wave. Flat-bottom and flat-top wave shaping circuits maintain the magnetic guide field in a relatively time-invariant mode during times when the particles are being injected into the ring magnets and when the particles are being ejected from the ring magnets.

Array-based satellite phase bias sensing: theory and GPS/BeiDou/QZSS results

NASA Astrophysics Data System (ADS)

Khodabandeh, A.; Teunissen, P. J. G.

2014-09-01

Single-receiver integer ambiguity resolution (IAR) is a measurement concept that makes use of network-derived non-integer satellite phase biases (SPBs), among other corrections, to recover and resolve the integer ambiguities of the carrier-phase data of a single GNSS receiver. If it is realized, the very precise integer ambiguity-resolved carrier-phase data would then contribute to the estimation of the receiver’s position, thus making (near) real-time precise point positioning feasible. Proper definition and determination of the SPBs take a leading part in developing the idea of single-receiver IAR. In this contribution, the concept of array-based between-satellite single-differenced (SD) SPB determination is introduced, which is aimed to reduce the code-dominated precision of the SD-SPB corrections. The underlying model is realized by giving the role of the local reference network to an array of antennas, mounted on rigid platforms, that are separated by short distances so that the same ionospheric delay is assumed to be experienced by all the antennas. To that end, a closed-form expression of the array-aided SD-SPB corrections is presented, thereby proposing a simple strategy to compute the SD-SPBs. After resolving double-differenced ambiguities of the array’s data, the variance of the SD-SPB corrections is shown to be reduced by a factor equal to the number of antennas. This improvement in precision is also affirmed by numerical results of the three GNSSs GPS, BeiDou and QZSS. Experimental results demonstrate that the integer-recovered ambiguities converge to integers faster, upon increasing the number of antennas aiding the SD-SPB corrections.

How to Differentiate an Integer Modulo n

ERIC Educational Resources Information Center

Emmons, Caleb; Krebs, Mike; Shaheen, Anthony

2009-01-01

A number derivative is a numerical mapping that satisfies the product rule. In this paper, we determine all number derivatives on the set of integers modulo n. We also give a list of undergraduate research projects to pursue using these maps as a starting point.

Transition metal carbides, nitrides and borides, and their oxygen containing analogs useful as water gas shift catalysts

DOEpatents

Thompson, Levi T.; Patt, Jeremy; Moon, Dong Ju; Phillips, Cory

2003-09-23

Mono- and bimetallic transition metal carbides, nitrides and borides, and their oxygen containing analogs (e.g. oxycarbides) for use as water gas shift catalysts are described. In a preferred embodiment, the catalysts have the general formula of M1.sub.A M2.sub.B Z.sub.C O.sub.D, wherein M1 is selected from the group consisting of Mo, W, and combinations thereof; M2 is selected from the group consisting of Fe, Ni, Cu, Co, and combinations thereof; Z is selected from the group consisting of carbon, nitrogen, boron, and combinations thereof; A is an integer; B is 0 or an integer greater than 0; C is an integer; O is oxygen; and D is 0 or an integer greater than 0. The catalysts exhibit good reactivity, stability, and sulfur tolerance, as compared to conventional water shift gas catalysts. These catalysts hold promise for use in conjunction with proton exchange membrane fuel cell powered systems.

A new fractional nonlocal model and its application in free vibration of Timoshenko and Euler-Bernoulli beams

NASA Astrophysics Data System (ADS)

Rahimi, Zaher; Sumelka, Wojciech; Yang, Xiao-Jun

2017-11-01

The application of fractional calculus in fractional models (FMs) makes them more flexible than integer models inasmuch they can conclude all of integer and non-integer operators. In other words FMs let us use more potential of mathematics to modeling physical phenomena due to the use of both integer and fractional operators to present a better modeling of problems, which makes them more flexible and powerful. In the present work, a new fractional nonlocal model has been proposed, which has a simple form and can be used in different problems due to the simple form of numerical solutions. Then the model has been used to govern equations of the motion of the Timoshenko beam theory (TBT) and Euler-Bernoulli beam theory (EBT). Next, free vibration of the Timoshenko and Euler-Bernoulli simply-supported (S-S) beam has been investigated. The Galerkin weighted residual method has been used to solve the non-linear governing equations.

A tale of two fractals: The Hofstadter butterfly and the integral Apollonian gaskets

NASA Astrophysics Data System (ADS)

Satija, Indubala I.

2016-11-01

This paper unveils a mapping between a quantum fractal that describes a physical phenomena, and an abstract geometrical fractal. The quantum fractal is the Hofstadter butterfly discovered in 1976 in an iconic condensed matter problem of electrons moving in a two-dimensional lattice in a transverse magnetic field. The geometric fractal is the integer Apollonian gasket characterized in terms of a 300 BC problem of mutually tangent circles. Both of these fractals are made up of integers. In the Hofstadter butterfly, these integers encode the topological quantum numbers of quantum Hall conductivity. In the Apollonian gaskets an infinite number of mutually tangent circles are nested inside each other, where each circle has integer curvature. The mapping between these two fractals reveals a hidden D3 symmetry embedded in the kaleidoscopic images that describe the asymptotic scaling properties of the butterfly. This paper also serves as a mini review of these fractals, emphasizing their hierarchical aspects in terms of Farey fractions.

New optimal asymmetric quantum codes constructed from constacyclic codes

NASA Astrophysics Data System (ADS)

Xu, Gen; Li, Ruihu; Guo, Luobin; Lü, Liangdong

2017-02-01

In this paper, we propose the construction of asymmetric quantum codes from two families of constacyclic codes over finite field 𝔽q2 of code length n, where for the first family, q is an odd prime power with the form 4t + 1 (t ≥ 1 is integer) or 4t - 1 (t ≥ 2 is integer) and n1 = q2+1 2; for the second family, q is an odd prime power with the form 10t + 3 or 10t + 7 (t ≥ 0 is integer) and n2 = q2+1 5. As a result, families of new asymmetric quantum codes [[n,k,dz/dx

Integer sequence discovery from small graphs

PubMed Central

Hoppe, Travis; Petrone, Anna

2015-01-01

We have exhaustively enumerated all simple, connected graphs of a finite order and have computed a selection of invariants over this set. Integer sequences were constructed from these invariants and checked against the Online Encyclopedia of Integer Sequences (OEIS). 141 new sequences were added and six sequences were extended. From the graph database, we were able to programmatically suggest relationships among the invariants. It will be shown that we can readily visualize any sequence of graphs with a given criteria. The code has been released as an open-source framework for further analysis and the database was constructed to be extensible to invariants not considered in this work. PMID:27034526

Selecting Tools to Model Integer and Binomial Multiplication

ERIC Educational Resources Information Center

Pratt, Sarah Smitherman; Eddy, Colleen M.

2017-01-01

Mathematics teachers frequently provide concrete manipulatives to students during instruction; however, the rationale for using certain manipulatives in conjunction with concepts may not be explored. This article focuses on area models that are currently used in classrooms to provide concrete examples of integer and binomial multiplication. The…

Integer Operations Using a Whiteboard

ERIC Educational Resources Information Center

Andrews, Delise R.

2011-01-01

Interactive whiteboards are somewhat unimpressive at first and look like the whiteboards that already hang on the walls of many classrooms. However, integrating interactive whiteboard technology in a unit on adding and subtracting integers enhances student engagement and understanding. In this article, the author describes how she used an…

Integer ratios of S{sub n}/E{sub n} in {sup 40}Ca+n resonances suggesting two-oscillator excitations in the target nucleus

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

Ohkubo, Makio

2009-08-15

In s-wave neutron resonances of {sup 40}Ca at E{sub n}{<=}2.5 MeV, S{sub n}/E{sub n} for many levels is found to be of the form 17(n/m) where n, m are small integers. Statistical tests show small probabilities for the observed dispositions of many levels at E{sub n}=(j/k)(1/70)G (j, k; small integers). To meet the requirement of time periodicity of the compound nucleus at resonance, a breathing model is developed, where the excitation energies E{sub x} are written as a sum of inverse integers; E{sub x}=S{sub n}+E{sub n}=G{sigma}(1/k) (k: integer). In {sup 40}Ca+n, the separation energy S{sub n}=8362 keV is written asmore » S{sub n}=(17/70)G=(1/7+1/10)G, where G=34.4 MeV. G is almost equal to the Fermi energy of the nucleus. It is suggested that two oscillators of energy (1/7)G and (1/10)G are excited in {sup 40}Ca by neutron incidence, in which the recurrence energy (1/70)G is resonant with neutrons of energies at (j/k)(1/70)G, forming a simple compound nucleus.« less

Time-Frequency-Wavenumber Analysis of Surface Waves Using the Continuous Wavelet Transform

NASA Astrophysics Data System (ADS)

Poggi, V.; Fäh, D.; Giardini, D.

2013-03-01

A modified approach to surface wave dispersion analysis using active sources is proposed. The method is based on continuous recordings, and uses the continuous wavelet transform to analyze the phase velocity dispersion of surface waves. This gives the possibility to accurately localize the phase information in time, and to isolate the most significant contribution of the surface waves. To extract the dispersion information, then, a hybrid technique is applied to the narrowband filtered seismic recordings. The technique combines the flexibility of the slant stack method in identifying waves that propagate in space and time, with the resolution of f- k approaches. This is particularly beneficial for higher mode identification in cases of high noise levels. To process the continuous wavelet transform, a new mother wavelet is presented and compared to the classical and widely used Morlet type. The proposed wavelet is obtained from a raised-cosine envelope function (Hanning type). The proposed approach is particularly suitable when using continuous recordings (e.g., from seismological-like equipment) since it does not require any hardware-based source triggering. This can be subsequently done with the proposed method. Estimation of the surface wave phase delay is performed in the frequency domain by means of a covariance matrix averaging procedure over successive wave field excitations. Thus, no record stacking is necessary in the time domain and a large number of consecutive shots can be used. This leads to a certain simplification of the field procedures. To demonstrate the effectiveness of the method, we tested it on synthetics as well on real field data. For the real case we also combine dispersion curves from ambient vibrations and active measurements.

A Semi-Analytical Solution to Time Dependent Groundwater Flow Equation Incorporating Stream-Wetland-Aquifer Interactions

NASA Astrophysics Data System (ADS)

Boyraz, Uǧur; Melek Kazezyılmaz-Alhan, Cevza

2017-04-01

Groundwater is a vital element of hydrologic cycle and the analytical & numerical solutions of different forms of groundwater flow equations play an important role in understanding the hydrological behavior of subsurface water. The interaction between groundwater and surface water bodies can be determined using these solutions. In this study, new hypothetical approaches are implemented to groundwater flow system in order to contribute to the studies on surface water/groundwater interactions. A time dependent problem is considered in a 2-dimensional stream-wetland-aquifer system. The sloped stream boundary is used to represent the interaction between stream and aquifer. The rest of the aquifer boundaries are assumed as no-flux boundary. In addition, a wetland is considered as a surface water body which lies over the whole aquifer. The effect of the interaction between the wetland and the aquifer is taken into account with a source/sink term in the groundwater flow equation and the interaction flow is calculated by using Darcy's approach. A semi-analytical solution is developed for the 2-dimensional groundwater flow equation in 5 steps. First, Laplace and Fourier cosine transforms are employed to obtain the general solution in Fourier and Laplace domain. Then, the initial and boundary conditions are applied to obtain the particular solution. Finally, inverse Fourier transform is carried out analytically and inverse Laplace transform is carried out numerically to obtain the final solution in space and time domain, respectively. In order to verify the semi-analytical solution, an explicit finite difference algorithm is developed and analytical and numerical solutions are compared for synthetic examples. The comparison of the analytical and numerical solutions shows that the analytical solution gives accurate results.

An Algebraic Approach to the Evolution of Emittances upon Crossing the Linear Coupling Difference Resonance

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

Gardner,C.

One of the hallmarks of linear coupling is the resonant exchange of oscillation amplitude between the horizontal and vertical planes when the difference between the unperturbed tunes is close to an integer. The standard derivation of this phenomenon (known as the difference resonance) can be found, for example, in the classic papers of Guignard [1, 2]. One starts with an uncoupled lattice and adds a linear perturbation that couples the two planes. The equations of motion are expressed in hamiltonian form. As the difference between the unperturbed tunes approaches an integer, one finds that the perturbing terms in the hamiltonianmore » can be divided into terms that oscillate slowly and ones that oscillate rapidly. The rapidly oscillating terms are discarded or transformed to higher order with an appropriate canonical transformation. The resulting approximate hamiltonian gives equations of motion that clearly exhibit the exchange of oscillation amplitude between the two planes. If, instead of the hamiltonian, one is given the four-by-four matrix for one turn around a synchrotron, then one has the complete solution for the turn-by-turn (TBT) motion. However, the conditions for the phenomenon of amplitude exchange are not obvious from a casual inspection of the matrix. These conditions and those that give rise to the related sum resonance are identified in this report. The identification is made using the well known formalism of Edwards and Teng [3, 4, 5] and, in particular, the normalized coupling matrix of Sagan and Rubin [6]. The formulae obtained are general in that no particular hamiltonian or coupling elements are assumed. The only assumptions are that the one-turn matrix is symplectic and that it has distinct eigenvalues on the unit circle in the complex plane. Having identified the conditions of the one-turn matrix that give rise to the resonances, we focus on the difference resonance and apply the formulae to the evolution of the horizontal and vertical emittances of a beam distribution upon passing through the resonance. Exact and approximate expressions for the TBT evolution of the emittances are derived and applied to a number of examples.« less

A Novel 2D Image Compression Algorithm Based on Two Levels DWT and DCT Transforms with Enhanced Minimize-Matrix-Size Algorithm for High Resolution Structured Light 3D Surface Reconstruction

NASA Astrophysics Data System (ADS)

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.

Exploring the Sums of Powers of Consecutive q-Integers

ERIC Educational Resources Information Center

Kim, T.; Ryoo, C. S.; Jang, L. C.; Rim, S. H.

2005-01-01

The Bernoulli numbers are among the most interesting and important number sequences in mathematics. They first appeared in the posthumous work "Ars Conjectandi" (1713) by Jacob Bernoulli (1654-1705) in connection with sums of powers of consecutive integers (Bernoulli, 1713; or Smith, 1959). Bernoulli numbers are particularly important in number…

Leveraging Structure: Logical Necessity in the Context of Integer Arithmetic

ERIC Educational Resources Information Center

Bishop, Jessica Pierson; Lamb, Lisa L.; Philipp, Randolph A.; Whitacre, Ian; Schappelle, Bonnie P.

2016-01-01

Looking for, recognizing, and using underlying mathematical structure is an important aspect of mathematical reasoning. We explore the use of mathematical structure in children's integer strategies by developing and exemplifying the construct of logical necessity. Students in our study used logical necessity to approach and use numbers in a…

Generating "Random" Integers

ERIC Educational Resources Information Center

Griffiths, Martin

2011-01-01

One of the author's undergraduate students recently asked him whether it was possible to generate a random positive integer. After some thought, the author realised that there were plenty of interesting mathematical ideas inherent in her question. So much so in fact, that the author decided to organise a workshop, open both to undergraduates and…

Negative Integer Understanding: Characterizing First Graders' Mental Models

ERIC Educational Resources Information Center

Bofferding, Laura

2014-01-01

This article presents results of a research study. Sixty-one first graders' responses to interview questions about negative integer values and order and directed magnitudes were examined to characterize the students' mental models. The models reveal that initially, students overrelied on various combinations of whole-number principles as…

Reflection and emission models for deserts derived from Nimbus-7 ERB scanner measurements

NASA Technical Reports Server (NTRS)

Staylor, W. F.; Suttles, J. T.

1986-01-01

Broadband shortwave and longwave radiance measurements obtained from the Nimbus-7 Earth Radiation Budget scanner were used to develop reflectance and emittance models for the Sahara-Arabian, Gibson, and Saudi Deserts. The models were established by fitting the satellite measurements to analytic functions. For the shortwave, the model function is based on an approximate solution to the radiative transfer equation. The bidirectional-reflectance function was obtained from a single-scattering approximation with a Rayleigh-like phase function. The directional-reflectance model followed from integration of the bidirectional model and is a function of the sum and product of cosine solar and viewing zenith angles, thus satisfying reciprocity between these angles. The emittance model was based on a simple power-law of cosine viewing zenith angle.

The Implementation of Cosine Similarity to Calculate Text Relevance between Two Documents

NASA Astrophysics Data System (ADS)

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.

Phase relations of natural 65 year SST variations, ocean sea level variations over 260 years, and Arctic sea-ice retreat of the satellite era - issues of cause and effect.

NASA Astrophysics Data System (ADS)

Asten, Michael

2017-04-01

We study sea level variations over the past 300yr in order to quantify what fraction of variations may be considered cyclic, and what phase relations exist with respect to those cycles. The 64yr cycle detected by Chambers et al (2012) is found in the 1960-2000 data set which Hamlington et al (2013) interpreted as an expression of the PDO; we show that fitting a 64yr cycle is a better fit, accounting for 92% of variance. In a 300yr GMSL tide guage record Jeverejeva et al (2008) identified a 60-65yr cycle superimposed on an upward trend from 1800CE. Using break-points and removal of centennial trends identified by Kemp et al (2015), we produce a detrended GMSL record for 1700-2000CE which emphasizes the 60-65yr oscillations. A least-square fit using a 64yr period cosine yields an amplitude 12mm and origin at year 1958.6, which accounts for 30% of the variance. A plot of the cosine against the entire length of the 300yr detrended GMSL record shows a clear phase lock for the interval 1740 to 2000CE, denoting either a very consistent timing of an internally generated natural variation, or adding to evidence for an external forcing of astronomical origin (Scafetta 2012, 2013). Barcikowska et al (2016) have identified a 65yr cyclic variation in sea surface temperature in the first multidecadal component of Multi- Channel Singular Spectrum Analysis (MSSA) on the Hadley SST data set (RC60). A plot of RC60 versus our fitted cosine shows the phase shift to be 16 yr, close to a 90 degree phase lag of GMSL relative to RC60. This is the relation to be expected for a simple low-pass or integrating filter, which suggests that cyclic natural variations in sea-surface temperature drive similar variations in GMSL. We compare the extent of Arctic sea-ice using the time interval of 1979- 2016 (window of satellite imagery). The decrease in summer ice cover has been subject of many predictions as to when summer ice will reach zero. The plot of measured ice area can be fitted with many speculative curves, and we show three such best fit curves, a parabola (zero ice cover by 2028), a linear fit (zero by 2060) and a 64yr period cosine, where the cosine is a shape chosen as a hypothesis, given the relation we observe between SST natural variations and 260 years of detrended sea level data. The cosine best fit shows a maximum ice coverage in 1985.6 and predicted minimum in 2017.6, which compares with the detrended sea level cyclic component minimum at 1990.6 and predicted maximum at 2023.6CE. Thus the sea-ice retreat lags RC60 by about 10 yr or 60deg in phase. The consistent phase of sea-level change over 260yr, and the phase lags of sea-ice retreat and sea-level change relative to the natural 65yr cyclic component of SST, have implications in the debate over internal versus external drivers of the cyclic components of change, and in hypotheses on cause and effect of the non-anthropogenic components of change.

Multi-input and binary reproducible, high bandwidth floating point adder in a collective network

DOEpatents

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip; Steinmacher-Burow, Burkhard

2016-11-15

To add floating point numbers in a parallel computing system, a collective logic device receives the floating point numbers from computing nodes. The collective logic devices converts the floating point numbers to integer numbers. The collective logic device adds the integer numbers and generating a summation of the integer numbers. The collective logic device converts the summation to a floating point number. The collective logic device performs the receiving, the converting the floating point numbers, the adding, the generating and the converting the summation in one pass. One pass indicates that the computing nodes send inputs only once to the collective logic device and receive outputs only once from the collective logic device.

Significant Figure Rules for General Arithmetic Functions.

ERIC Educational Resources Information Center

Graham, D. M.

1989-01-01

Provides some significant figure rules used in chemistry including the general theoretical basis; logarithms and antilogarithms; exponentiation (with exactly known exponents); sines and cosines; and the extreme value rule. (YP)

On the Goldbach Conjecture

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

Friedland, G.

2018-01-08

This note confirms Goldbach’s Conjecture from 1742. This is, every even integer greater than two is the sum of two prime numbers. An analysis of the nature of multiplication as description length reduction for addition precedes a contraposition that it is impossible to subtract any prime from a given even integer without the result ever being prime.

Optimal Facility Location Tool for Logistics Battle Command (LBC)

DTIC Science & Technology

2015-08-01

64 Appendix B. VBA Code . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 Appendix C. Story...should city planners have located emergency service facilities so that all households (the demand) had equal access to coverage?” The critical...programming language called Visual Basic for Applications ( VBA ). CPLEX is a commercial solver for linear, integer, and mixed integer linear programming problems

A Description of a Family of Heron Quadrilaterals

ERIC Educational Resources Information Center

Sastry, K. R. S.

2005-01-01

Mathematical historians place Heron in the first century. Right-angled triangles with integer sides and area had been determined before Heron, but he discovered such a "non" right-angled triangle, viz 13, 14, 15; 84. In view of this, triangles with integer sides and area are named "Heron triangles." The Indian mathematician Brahmagupta, born in…

Design Study: Integer Subtraction Operation Teaching Learning Using Multimedia in Primary School

ERIC Educational Resources Information Center

Aris, Rendi Muhammad; Putri, Ratu Ilma Indra

2017-01-01

This study aims to develop a learning trajectory to help students understand concept of subtraction of integers using multimedia in the fourth grade. This study is thematic integrative learning in Curriculum 2013 PMRI based. The method used is design research consists of three stages; preparing for the experiment, design experiment, retrospective…

Problems with Primes

ERIC Educational Resources Information Center

Melrose, Tim; Scott, Paul

2005-01-01

This article discusses prime numbers, defined as integers greater than 1 that are divisible only by only themselves and the number 1. A positive integer greater than 1 that is not a prime is called composite. The number 1 itself is considered neither prime nor composite. As the name suggests, prime numbers are one of the most basic but important…

Solving the Water Jugs Problem by an Integer Sequence Approach

ERIC Educational Resources Information Center

Man, Yiu-Kwong

2012-01-01

In this article, we present an integer sequence approach to solve the classic water jugs problem. The solution steps can be obtained easily by additions and subtractions only, which is suitable for manual calculation or programming by computer. This approach can be introduced to secondary and undergraduate students, and also to teachers and…

Why the Faulhaber Polynomials Are Sums of Even or Odd Powers of (n + 1/2)

ERIC Educational Resources Information Center

Hersh, Reuben

2012-01-01

By extending Faulhaber's polynomial to negative values of n, the sum of the p'th powers of the first n integers is seen to be an even or odd polynomial in (n + 1/2) and therefore expressible in terms of the sum of the first n integers.

A Treatment of Computational Precision, Number Representation, and Large Integers in an Introductory Fortran Course

ERIC Educational Resources Information Center

Richardson, William H., Jr.

2006-01-01

Computational precision is sometimes given short shrift in a first programming course. Treating this topic requires discussing integer and floating-point number representations and inaccuracies that may result from their use. An example of a moderately simple programming problem from elementary statistics was examined. It forced students to…

An Integer Programming Approach to School District Financial Management.

ERIC Educational Resources Information Center

Dembowski, Frederick L.

Because of the nature of school district cash flows, there are opportunities for investing surplus cash and the necessity to borrow cash in deficit periods. The term structure of interest rates makes the manual determination of the optimal financial package impossible. In this research, an integer programming model of this cash management process…

Dollars & Sense: Students' Integer Perspectives

ERIC Educational Resources Information Center

Whitacre, Ian; Bishop, Jessica Pierson; Philipp, Randolph A.; Lamb, Lisa L.; Schappelle, Bonnie P.

2014-01-01

A story problem about borrowing money, presented in this article, may be represented with positive or negative numbers and thought about in different ways. The authors describe ideas related to integers (both positive and negative) and how students used them in relation to a story problem, and how they related these ideas to equations.