Search

Angiosperms, http://name.umdl.umich.edu/IC-HERB00IC-X-1557446%5DMICH-V-1557446, https://quod.lib.umich.edu/cgi/i/image/api/thumb/herb00ic/1557446/MICH-V-1557446/!250,250, The University of Michigan Library provides access to these materials for educational and research purposes. Some materials may be protected by copyright. If you decide to use any of these materials, you are responsible for making your own legal assessment and securing any necessary permission. If you have questions about the collection, please contact the Herbarium professional staff: herb-dlps-help@umich.edu. If you have concerns about the inclusion of an item in this collection, please contact Library Information Technology: libraryit-info@umich.edu., https://www.lib.umich.edu/about-us/policies/copyright-policy

Angiosperms, http://name.umdl.umich.edu/IC-HERB00IC-X-1543873%5DMICH-V-1543873, https://quod.lib.umich.edu/cgi/i/image/api/thumb/herb00ic/1543873/MICH-V-1543873/!250,250, The University of Michigan Library provides access to these materials for educational and research purposes. Some materials may be protected by copyright. If you decide to use any of these materials, you are responsible for making your own legal assessment and securing any necessary permission. If you have questions about the collection, please contact the Herbarium professional staff: herb-dlps-help@umich.edu. If you have concerns about the inclusion of an item in this collection, please contact Library Information Technology: libraryit-info@umich.edu., https://www.lib.umich.edu/about-us/policies/copyright-policy

This paper assesses the performance of mobile messaging and VoIP connections. We investigate the CPU usage of WhatsApp and IMO under different scenarios. This analysis also enabled a comparison of the performance of these applications on two Android operating system (OS) versions: KitKat or Lollipop. Two models of smartphones were considered, viz. Galaxy Note 4 and Galaxy S4. The applications behavior was statistically investigated for both sending and receiving VoIP calls. Connections have been examined over 3G and WiFi. The handset model plays a decisive role in CPU usage of the application. t-tests showed that IMO has a better performance that WhatsApp whatever be the Android at a significance level 1%, on Galaxy Note 4. In contrast, WhatsApp requires less CPU than IMO on Galaxy S4 whatever be the OS and access (3G/WiFi). Galaxy Note 4 using WiFi always outperformed S4 in terms of processing efficiency., Comment: 8 pages, Number of floats/tables/figures: 5

Given an arbitrary continuous probability density function, it is introduced a conjugated probability density, which is defined through the Shannon information associated with its cumulative distribution function. These new densities are computed from a number of standard distributions, including uniform, normal, exponential, Pareto, logistic, Kumaraswamy, Rayleigh, Cauchy, Weibull, and Maxwell-Boltzmann. The case of joint information-weighted probability distribution is assessed. An additive property is derived in the case of independent variables. One-sided and two-sided information-weighting are considered. The asymptotic behavior of the tail of the new distributions is examined. It is proved that all probability densities proposed here define heavy-tailed distributions. It is shown that the weighting of distributions regularly varying with extreme-value index $\alpha > 0$ still results in a regular variation distribution with the same index. This approach can be particularly valuable in applications where the tails of the distribution play a major role., Comment: 21 pages, 7 figures

We present a model of two-kinks resulting from an explicit composition of two standards kinks of the $\phi^4$ model based on the procedure of Ref. \cite{uchiyama}. The two-kinks have an additional parameter accounting for the separation of the standard kinks of $\phi^4$ model. We have shown that the two-kinks have two discrete internal modes besides the zeroth mode and the continuous spectrum. This new feature signalizes that the head-on collision a two-kinks/two-antikinks pair exhibits a rich and complex behavior due to the additional channel from which the energy of the system can be stored. We have exhibited the fractal structure associated with the main configurations after the collision. We have inferred the fractality as the imprint of the nonlinear exchange of energy into the two discrete internal modes., Comment: 12 pages, 6 figures

We have investigated the head-on collision of a two-kink and a two-antikink pair that arises as a generalization of the $\phi^4$ model. We have evolved numerically the Klein-Gordon equation with a new spectral algorithm whose accuracy and convergence were attested by the numerical tests. As a general result, the two-kink pair is annihilated radiating away most of the scalar field. It is possible the production of oscillons-like configurations after the collision that bounce and coalesce to form a small amplitude oscillon at the origin. The new feature is the formation of a sequence of quasi-stationary structures that we have identified as lump-like solutions of non-topological nature. The amount of time these structures survives depends on the fine-tuning of the impact velocity., Comment: 14 pages, 9 figures

A new Efficient-bandwidth code-division-multiple-access (CDMA) for band-limited channels is introduced which is based on finite field transforms. A multilevel code division multiplex exploits orthogonality properties of nonbinary sequences defined over a complex finite field. Galois-Fourier transforms contain some redundancy and just cyclotomic coefficients are needed to be transmitted yielding compact spectrum requirements. The primary advantage of such schemes regarding classical multiplex is their better spectral efficiency. This paper estimates the \textit{bandwidth compactness factor} relatively to Time Division Multiple Access TDMA showing that it strongly depends on the alphabet extension. These multiplex schemes termed Galois Division Multiplex (GDM) are based on transforms for which there exists fast algorithms. They are also convenient from the implementation viewpoint since they can be implemented by a Digital Signal Processor., Comment: 6 pages, 5 figures, in: Workshop on Coding and Cryptography, INRIA, 1999, Paris. pp.235-241. arXiv admin note: text overlap with arXiv:1502.05881

Arithmetic complexity has a main role in the performance of algorithms for spectrum evaluation. Arithmetic transform theory offers a method for computing trigonometrical transforms with minimal number of multiplications. In this paper, the proposed algorithms for the arithmetic Fourier transform are surveyed. A new arithmetic transform for computing the discrete Hartley transform is introduced: the Arithmetic Hartley transform. The interpolation process is shown to be the key element of the arithmetic transform theory., Comment: 12 pages, 5 figures

New elliptic cylindrical wavelets are introduced, which exploit the relationship between analysing filters and Floquet's solution of Mathieu differential equations. It is shown that the transfer function of both multiresolution filters is related to the solution of a Mathieu equation of odd characteristic exponent. The number of notches of these analysing filters can be easily designed. Wavelets derived by this method have potential application in the fields of optics, microwaves and electromagnetism., Comment: 5 pages, 4 figures. in: 2002 WSEAS International Conference on Wavelet Analysis and Multirate Systems, Vouliagmeni, Greece. arXiv admin note: substantial text overlap with arXiv:1501.07255

There has been lately a number of catastrophic events of landslides and mudslides in the mountainous region of Rio de Janeiro, Brazil. Those were caused by intense rain in localities where there was unplanned occupation of slopes of hills and mountains. Thus, it became imperative creating an inventory of landslide risk areas in densely populated cities. This work presents a way of demarcating risk areas by using the bidimensional Continuous Wavelet Transform (2D-CWT) applied to high resolution topographic images of the mountainous region of Rio de Janeiro., Comment: 8 pages, 8 figures; Lecture Notes in Computer Science LNCS 7950, pp.380-388, 2013 Springer-Verlag, Heidelberg ISBN: 978-3-642-39093-7

This paper presents the preliminary of a novel scheme of steganography, and introduces the idea of combining two secret keys in the operation. The first secret key encrypts the text using a standard cryptographic scheme (e.g. IDEA, SAFER+, etc.) prior to the wavelet audio decomposition. The way in which the cipher text is embedded in the file requires another key, namely a stego-key, which is associated with features of the audio wavelet analysis., Comment: 2 pages, 1 figure, conference: 8th Brazilian Symposium on Information and Computer System Security, 2008, Gramado, RS, Brazil

This paper examines finite field trigonometry as a tool to construct trigonometric digital transforms. In particular, by using properties of the k-cosine function over GF(p), the Finite Field Discrete Cosine Transform (FFDCT) is introduced. The FFDCT pair in GF(p) is defined, having blocklengths that are divisors of (p+1)/2. A special case is the Mersenne FFDCT, defined when p is a Mersenne prime. In this instance blocklengths that are powers of two are possible and radix-2 fast algorithms can be used to compute the transform., Comment: 5 pages, 1 table, Lecture Notes in Computer Science, LNCS 3124, Heidelberg: Springer Verlag, 2004, vol.1, pp.482-487, 2004

The quantum error correction theory is as a rule formulated in a rather convoluted way, in comparison to classical algebraic theory. This work revisits the error correction in a noisy quantum channel so as to make it intelligible to engineers. An illustrative example is presented of a naive perfect quantum code (Hamming-like code) with five-qubits for transmitting a single qubit of information. Also the (9,1)-Shor codes is addressed., Comment: 5 pages, 8 figures, 7 tables

A new family of error-correcting codes, called Fourier codes, is introduced. The code parity-check matrix, dimension and an upper bound on its minimum distance are obtained from the eigenstructure of the Fourier number theoretic transform. A decoding technique for such codes is proposed., Comment: 6 pages, 2 tables. In: 10th International Symposium on Communication Theory and Applications 2009, Ambleside, Lake District, UK

This paper introduces new tools for genomic signal processing, which can assist for genomic attribute extracting or describing biologically meaningful features embedded in a DNA. The codongrams and a2grams are offered as an alternative to spectrograms and scalograms. Twenty different a^2grams are defined for a genome, one for each amino acid (valgram is an a^2gram for valine; alagram is an a^2gram for alanine and so on). They provide information about the distribution and occurrence of the investigated amino acid. In particular, the metgram can be used to find out potential start position of genes within a genome. This approach can help implementing a new diagnosis test for genetic diseases by providing a type of DNA-medical imaging., Comment: 7 pages, 3 figures

How to represent the genetic code? Despite the fact that it is extensively known, the DNA mapping into proteins remains as one of the relevant discoveries of genetics. However, modern genomic signal processing usually requires converting symbolic-DNA strings into complex-valued signals in order to take full advantage of a broad variety of digital processing techniques. The genetic code is revisited in this paper, addressing alternative representations for it, which can be worthy for genomic signal processing. Three original representations are discussed. The inner-to-outer map builds on the unbalanced role of nucleotides of a 'codon' and it seems to be suitable for handling information-theory-based matter. The two-dimensional-Gray map representation is offered as a mathematically structured map that can help interpreting spectrograms or scalograms. Finally, the world-map representation for the genetic code is investigated, which can particularly be valuable for educational purposes -besides furnishing plenty of room for application of distance-based algorithms., Comment: 6 pages, 5 figures

A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast DHT algorithms and a multiplication-free fast algorithm for the Hadamard Transform., Comment: 5 pages, 4 figures: Anais do I Congresso de Inform\'atica da Amaz\^onia, 2001. v.1.pp.285-292

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general, than the well known Goertzel Algorithm., Comment: 4 pages, 3 figures, 1 table. In: 10th International Symposium on Communication Theory and Applications, Ambleside, UK

This paper exploits the multiresolution analysis in the fault analysis on transmission lines. Faults were simulated using the ATP (Alternative Transient Program), considering signals at 128/cycle. A nonorthogonal multiresolution analysis was provided by Gegenbauer scaling and wavelet filters. In the cases where the signal reconstruction is not required, orthogonality may be immaterial. Gegenbauer filter banks are thereby offered in this paper as a tool for analyzing fault signals on transmission lines. Results are compared to those ones derived from a 4-coefficient Daubechies filter. The main advantages in favor of Gegenbauer filters are their smaller computational effort and their constant group delay, as they are symmetric filters., Comment: 6 pages, 12 figures. In: Transmission and Distribution IEEE/PES/T&D Latin America, Sao Paulo, Brazil, 2004